{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"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":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"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":"Cryptographic Hygiene","shortDescription":{"text":"Cryptographic Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_cells (cyclomatic 555): LayoutEngine::layout_partial_table_cells has cyclomatic complexity 555 (threshold 15). Of this number, 551 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"a594866ed9295d3099398e5c354acde552c0228245bae159a3cd2c4d39d90a76"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::cell_units_uncached (cyclomatic 542): LayoutEngine::cell_units_uncached has cyclomatic complexity 542 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14973}}}],"partialFingerprints":{"codehealthFindingId/v1":"150b80668307a7005de861595b3c3823f9733bacf87bac47bc5975aec8e68d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::build_single_column (cyclomatic 468): LayoutEngine::build_single_column has cyclomatic complexity 468 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":7866}}}],"partialFingerprints":{"codehealthFindingId/v1":"06557b9e8a70dec30c3f709d389d53e998640d949a94e1ec226bf92ffdf4d46e"}},{"ruleId":"D1","level":"warning","message":{"text":"HeightCursor::vpos_adjust (cyclomatic 335): HeightCursor::vpos_adjust has cyclomatic complexity 335 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7961a00ae6f2abbccdf56e0226024b1799d986fb0bed4abf736df5fc6244f367"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_composed_paragraph_in_frame (cyclomatic 335): LayoutEngine::layout_composed_paragraph_in_frame has cyclomatic complexity 335 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cac937fe833ea377512f798ebd6b4cc0111073b893375cb12270d98682eea8"}},{"ruleId":"D1","level":"warning","message":{"text":"HeightMeasurer::measure_table_impl_with_storage (cyclomatic 310): HeightMeasurer::measure_table_impl_with_storage has cyclomatic complexity 310 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9e803d69a784fd66934a2a82e7db92e8786f579c83e617b3d93b4884e38548"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_resolved (cyclomatic 302): LayoutEngine::layout_partial_table_resolved has cyclomatic complexity 302 (threshold 15). Of this number, 295 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":6003}}}],"partialFingerprints":{"codehealthFindingId/v1":"447c95e2781f1a92a7ad98f237c4e6edd6fcd89fd7136c1752b4c8bc7339bd7a"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_horizontal_cell_paragraphs (cyclomatic 297): LayoutEngine::layout_horizontal_cell_paragraphs has cyclomatic complexity 297 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7341}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e566b4e21ef774e588e3ef1afef9fb7b43db45463bda66071c66f9b7b0fea7"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.onKeyDown (cyclomatic 289): input-handler-keyboard.onKeyDown has cyclomatic complexity 289 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"691572c505ecf13734801685e5ef09934293c9dd78184fd48afeb8b90c74c627"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::emit_table_fragment (cyclomatic 288): TypesetEngine::emit_table_fragment has cyclomatic complexity 288 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/emit.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9160f3df20d5ed113ce8502226c9f7779e1776e1f7fce8245a4d0bd98f90c4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prepare_block_table_entry (cyclomatic 284): TypesetEngine::prepare_block_table_entry has cyclomatic complexity 284 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"071f8036a697e976762f42cd7c1a64763ffc34d4886282d7f270ec91d2842890"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::scan_ordinary_row_step (cyclomatic 258): TypesetEngine::scan_ordinary_row_step has cyclomatic complexity 258 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"75090f3a966669e344cca309076e95f10b1d4d3920134784b14b6b6993405d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-mouse.onClick (cyclomatic 240): input-handler-mouse.onClick has cyclomatic complexity 240 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f5f4ab025ca11aa908c032ab5260c01c25c3858c4c3039f13bf035d5302bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_table_control_block (cyclomatic 237): LayoutEngine::layout_table_control_block has cyclomatic complexity 237 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2aaf0ed8285496e5e5ea695dfed0ef018e197756640cb125d3b18b15e965b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prepare_table_fragment_budget (cyclomatic 203): TypesetEngine::prepare_table_fragment_budget has cyclomatic complexity 203 (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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f420c4ef2b230ea1d8e92124bc615e1ccad1dda71690c590da402922fb9430"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::typeset_endnote_paragraphs (cyclomatic 199): TypesetEngine::typeset_endnote_paragraphs has cyclomatic complexity 199 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"273cf9757a10d7c354887fe1976ba6e8968035ad054b70accfee8d3c80212a00"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prepare_block_table_continuation (cyclomatic 186): TypesetEngine::prepare_block_table_continuation has cyclomatic complexity 186 (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":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25a986e41d46820c4c34aca9b3ebf3bb2ccd07eb4ff0dce9ce48f147120ef4e"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_table_item (cyclomatic 183): LayoutEngine::layout_table_item has cyclomatic complexity 183 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":14945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8282f6daec9f82a8b26b94397d75e31310fdf39258f7f626582dec7debccfa7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::handle_start (cyclomatic 182): rhwp_ooxml_chart::parser::handle_start has cyclomatic complexity 182 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4d09ca9beb39b98066c1c15b610a74302d793718d02ffab9f736e0eb29b58"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::emit_line_runs (cyclomatic 171): LayoutEngine::emit_line_runs has cyclomatic complexity 171 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":8880}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d27b9b02cc95d5e25797d641bd86288a331a2217cdc337228cbd79fefd7512"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::place_table_with_text (cyclomatic 169): TypesetEngine::place_table_with_text has cyclomatic complexity 169 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d810a17b2904062e6f44708fb6d7efd7905d92c54e0a77e4b212977079f3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SkiaLayerRenderer::render_node (cyclomatic 157): SkiaLayerRenderer::render_node has cyclomatic complexity 157 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/renderer.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0ccf7809b5a2b387bf5e25feb8dee155ed37274285bce5343cf78f5cb6dc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::partition (cyclomatic 156): rhwp::parser::pdf::table_paint::partition has cyclomatic complexity 156 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33dc4fdcb172f1ef0088848317bb8e623b059327468e919a42c7dbf02cc482d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_paragraph_list_inner (cyclomatic 155): rhwp::parser::hwp3::parse_paragraph_list_inner has cyclomatic complexity 155 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7307fb773effc1039cb0e1636aa2e9d4a1e03a70b42238f5e4f357b468ccaa"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::paginate_with_measured_context_with_storage (cyclomatic 144): Paginator::paginate_with_measured_context_with_storage has cyclomatic complexity 144 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a6a29ff05a4479b3e922b34ec05223f743a9c23e54bcc0b9b9b530ffbd727"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_picture (cyclomatic 139): rhwp::parser::hwpx::section::parse_picture has cyclomatic complexity 139 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff249bdf6a9a1945a92641cfb9ed321a762ce47903fb34e4347fe0644baf4118"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_hwp3_object_dispatch (cyclomatic 132): rhwp::parser::hwp3::parse_hwp3_object_dispatch has cyclomatic complexity 132 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"426841a34e38f75e7f8fffb4cbe769f509341d12f1cd7fa3c56f01c16f805dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_char_shape (cyclomatic 132): rhwp::parser::hwpx::header::parse_char_shape has cyclomatic complexity 132 (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":"src/parser/hwpx/header.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb602cf777cbdd5ac88c78dab1ee61da2ad65d950a59cab78ebc236bb649ef"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_shape_object_with_group_origin (cyclomatic 123): LayoutEngine::layout_shape_object_with_group_origin has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"234854bd53297b9ee90ce1befa01924c6d9bc53b7d1705ee5376f4f85655d4f5"}},{"ruleId":"D1","level":"warning","message":{"text":"SkiaTextReplay::draw_text (cyclomatic 123): SkiaTextReplay::draw_text has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e17881127338e3b775e4723ce80e4e471adf4bd609df5a69d9d4b884459bda"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderEquationBox (cyclomatic 123): CanvasKitLayerRenderer.renderEquationBox has cyclomatic complexity 123 (threshold 15). Of this number, 118 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf949114825a61bedce5b4de75bd0fdff69afdcbacfa3924783e4fe41b59b7"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_table_cells (cyclomatic 122): LayoutEngine::layout_table_cells has cyclomatic complexity 122 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":10492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5d0a99b1955fbd253a635866d1abe20f90adc5f82cb047c3bf2be2b718e86b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_textbox_content (cyclomatic 121): LayoutEngine::layout_textbox_content has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebc122c237d410bdad19aae9afdf02d5dce25fde0acf0250ab8d93eb95bcede"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_table_with_wrapper_margin (cyclomatic 121): LayoutEngine::layout_table_with_wrapper_margin has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59406342fc5b81a02cf7380389d18687d40498c1fa1e353bae49c9c33600224"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::reflow_zero_height_paragraphs (cyclomatic 118): DocumentCore::reflow_zero_height_paragraphs has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe08fed90e4452cf5c06f633b7581e683e0e836e312d50f296c7c224d611ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_column_item (cyclomatic 114): LayoutEngine::layout_column_item has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":11586}}}],"partialFingerprints":{"codehealthFindingId/v1":"934cd4bf1b1137c380938f176bc1ee488c40918f3781a585fcf4a5177eaf95ec"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::main (cyclomatic 114): rhwp::main has cyclomatic complexity 114 (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":"src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d49f31a9d8d7154909bf2fe36fccb1c2c2745912de87e26789c7f2eaef91b01"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking (cyclomatic 114): rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"302c3bd1cb4a6e94c2e457a74b0be3f793f4b00ee371dc8778d0bb9497a451bc"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextRun (cyclomatic 114): CanvasKitLayerRenderer.renderTextRun has cyclomatic complexity 114 (threshold 15). To reduce it, separate the cases: extract each independent 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 (CanvasKitLayerRenderer.renderTextRun::drawPass) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"486cba29638e747b1ddc0615f2aaf063537db22ee6047ace2928b03b847d4c19"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::render_node (cyclomatic 112): SvgRenderer::render_node has cyclomatic complexity 112 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf5aa1797800ac88453d571da538af6dac516e4e33d8441d3cbcd0924e11d45"}},{"ruleId":"D1","level":"warning","message":{"text":"PicturePropsDialog.populateFromProps (cyclomatic 111): PicturePropsDialog.populateFromProps has cyclomatic complexity 111 (threshold 15). Of this number, 107 points are the body\u0027s own statements and 4 belong 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30aee084afa89c791f4797adfd4428ace0f16e918f7d74692166eb8b4788fcd"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::scan_table_fragment (cyclomatic 109): TypesetEngine::scan_table_fragment has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"50953cdfce51f4f713da8f552e8e24edb72752bc55469e2ff8cfb865682348d5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_form_object (cyclomatic 109): rhwp::parser::hwpx::section::parse_form_object has cyclomatic complexity 109 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":7070}}}],"partialFingerprints":{"codehealthFindingId/v1":"4757e3eb051709e90a73cadc7fa663a3970367e0922a4e0fc3cfc36672d50300"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::image_conv::draw_image_bytes (cyclomatic 107): rhwp::renderer::skia::image_conv::draw_image_bytes has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_conv.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a92789dd5ddd1b8b4be1f4ce3cf61a2714c45983c1a27f292494cb2913e15e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::paginate_pass_with_storage (cyclomatic 103): DocumentCore::paginate_pass_with_storage 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d66834128d0269312c758d9ca072f09bacbe5d60a4639f788c40efe6f736c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_paragraph_body (cyclomatic 102): rhwp::parser::hwpx::section::parse_paragraph_body 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":"src/parser/hwpx/section.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6956023c8ef8ee310c7ecd256a226f5b7f5b2fac24fd651dd52792c4b392c800"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_table (cyclomatic 97): rhwp::parser::hwpx::section::parse_table has cyclomatic complexity 97 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cca94f427459fac6b20c3fbe970468e99218849b47aea90108caa24a1da7617"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitGlyphRunFontCache.replayStatus (cyclomatic 97): CanvasKitGlyphRunFontCache.replayStatus has cyclomatic complexity 97 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bcb80eb49f0ed5a2056ea0d3e075288d1e1b817bda241932ea6642d3e8f4e1"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_table_properties_native (cyclomatic 96): DocumentCore::set_table_properties_native has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"079a53f7b6268c54221948a838532fc76b8d25d2f1ba7f09f24fe14c702915dd"}},{"ruleId":"D1","level":"warning","message":{"text":"PaintOp::write_json (cyclomatic 96): PaintOp::write_json has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d16f4dbbe89f38bdd868f0ddd4d741320d0ee41f1f370ae24bc465b1232d761"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::op (cyclomatic 95): Interp::op has cyclomatic complexity 95 (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":"src/eps.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c68378dd8c1c69706329ac24b19531177d4b62ec4d6e938072678294601d4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::hit_test_native (cyclomatic 94): DocumentCore::hit_test_native has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent 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 (DocumentCore::hit_test_native::collect_runs) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5329794e6d934a0127719cf7bb8abe22da0661483aa213f8d214684451b4dbe2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::advance_row_cut_inner (cyclomatic 93): LayoutEngine::advance_row_cut_inner has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13238ea415d6b8560bfc44fe4d65ae931781707c5296ba4100bdbf7fc285b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-mouse.onMouseMove (cyclomatic 91): input-handler-mouse.onMouseMove has cyclomatic complexity 91 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 14 belong to 7 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ce474b9c4335aa49aa340e1a4b983b9eaa822d5a979cdc8d2131a6060725bd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_border_fill (cyclomatic 90): rhwp::parser::hwpx::header::parse_border_fill has cyclomatic complexity 90 (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":"src/parser/hwpx/header.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eea1e203f6f1776b3e138900457ef3a5cac13d8418482a9e93e828060377063"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::nested_table_mixed_fragment_heights (cyclomatic 88): LayoutEngine::nested_table_mixed_fragment_heights has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb631fd437af4cde8a6ed82a9b36b073aae4cead36b4abf1e30ed5d127e958"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::place_paragraph_controls_with_storage (cyclomatic 87): TypesetEngine::place_paragraph_controls_with_storage has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db033b196987967e5e96a99f8f4f081e5f144a77f756563107eec3d5db807ad"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_inline_table_paragraph (cyclomatic 86): LayoutEngine::layout_inline_table_paragraph 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e975d7b15410452edea224763867da8e1f81354cf00ec97f4745a8f20118c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_item (cyclomatic 85): LayoutEngine::layout_partial_table_item has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":16344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd63a4379b4e0cdee94998edfb34f7040ec0835eda107a38fe83652bdd929348"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_picture_props_inner (cyclomatic 84): DocumentCore::apply_picture_props_inner has cyclomatic complexity 84 (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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dc764e4d384f7e4bdbb92daf8ded2b0fd320ae3bd07c5ccc9eca5926fb3225"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::mixed_nested_split_from_cut (cyclomatic 83): LayoutEngine::mixed_nested_split_from_cut has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25962}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc726484bab16cf05bd0f201c8dd0dfc6ed150e22a045b83e77155868125b49e"}},{"ruleId":"D1","level":"warning","message":{"text":"CharShapeDialog.collectMods (cyclomatic 82): CharShapeDialog.collectMods has cyclomatic complexity 82 (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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a453d93df40d9d22c06d03fcafe0e376290e10f41d719633f4a4daaeb16a1e0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_shape_item (cyclomatic 81): LayoutEngine::layout_shape_item has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_item.inc.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d20a2f2c4f51a56943cd1058c14af0e5cbe060200d256658ee385b91dd31b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::split_table_rows_with_storage (cyclomatic 81): Paginator::split_table_rows_with_storage has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":2677}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe53fe0c2730d985daca4e83ff50846a1702c005779dbd89753122aa6e6f90"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_reflow_line_segs_impl (cyclomatic 81): rhwp::renderer::composer::line_breaking::try_reflow_line_segs_impl has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5899}}}],"partialFingerprints":{"codehealthFindingId/v1":"70994d06fe61c99d7f0fb7f4659d34a98561ec001cf2e47714279b89570dcf25"}},{"ruleId":"D1","level":"warning","message":{"text":"Run (cyclomatic 80): Run has cyclomatic complexity 80 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 4 belong to 2 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f30dc7514a0d1f8f74971871a3493ae1a23b23528ab320461e3b61ae06e10ba"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::draw_text_positioned (cyclomatic 79): SvgRenderer::draw_text_positioned has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"03586349c8872182ee09d7978aa318547c68ad5f10c543c037efad534f4bf408"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_shape_object (cyclomatic 79): rhwp::parser::hwpx::section::parse_shape_object has cyclomatic complexity 79 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2a2b848f506fd5982b872f8d06b24c9b110c88672bd516e61d86b8722d945d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::data::scan_chart_values (cyclomatic 78): rhwp_ooxml_chart::data::scan_chart_values has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/rhwp-ooxml-chart/src/data.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86544063d8ca7c05cf23e631d17a979a40fded555331e5665f2c5334acae2fe"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_table_cell (cyclomatic 78): rhwp::parser::hwpx::section::parse_table_cell has cyclomatic complexity 78 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7471068f6f0551f82fe14562c1a3045b8d6b46adcd852b56426208449a6e03a9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::equation::canvas_render::render_box (cyclomatic 78): rhwp::renderer::equation::canvas_render::render_box has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9336cc899fdd7d26bd28db6570fd0183f4fc0512051f2e03204cd881554452a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::body (cyclomatic 77): Reader::body has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"29363b0c780c1f32f3ee488940597dd994f010aeb4dc1974ff567fd70049e726"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::typeset_tac_table (cyclomatic 77): TypesetEngine::typeset_tac_table has cyclomatic complexity 77 (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":"src/renderer/typeset.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce522efd179e4a088108e5b814a9c097f4c4483abc47db3ee5d8d4e41dd13b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_layout_paragraph_in_frame_impl (cyclomatic 77): rhwp::renderer::composer::line_breaking::try_layout_paragraph_in_frame_impl has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddc77360ffbddd8e8651877a8751aef545531334133dc90be1e1907d9e32df2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::resolve_row_heights_with_common_fit (cyclomatic 76): LayoutEngine::resolve_row_heights_with_common_fit has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"983471c54dac5ada48ef088c7db06245a74d3c2051775f377f2eb46a66749fb0"}},{"ruleId":"D1","level":"warning","message":{"text":"WMFConverter::run (cyclomatic 74): WMFConverter::run has cyclomatic complexity 74 (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":"src/wmf/converter/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a2d8c6ec1b5d5c16030f27dc4ee072e8588a18d37524d45700ba101233954c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage (cyclomatic 74): rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"378ba1b097a38917bcb96f39599db96b47973b427f95994a1478ed8697f4918b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::parse_table_html (cyclomatic 72): DocumentCore::parse_table_html has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fdc98f060d003867351ebc84890cf14a3d4e43227ad6503d10aa49419ce21f"}},{"ruleId":"D1","level":"warning","message":{"text":"glyph-outline-payload-status.hasSupportedColrv1GraphContract::visit (cyclomatic 72): glyph-outline-payload-status.hasSupportedColrv1GraphContract::visit has cyclomatic complexity 72 (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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2d46aeae7b6cf34a641d7227fc05080d4d800333eace1980881235098ac824"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::equation_conv::render_box (cyclomatic 71): rhwp::renderer::skia::equation_conv::render_box has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ca1b9e670662f1359335e089dfdaa88d5cd8eb847e93c596d4a1190a44bf5f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::native_borders::plan (cyclomatic 70): rhwp::parser::pdf::structured_lowering::native_borders::plan 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":"src/parser/pdf/structured_lowering/native_borders.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec38270ec7b139607b6469ad06059c6d3248f92500603a54452bcc3feeaa598c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::equation::svg_render::render_box (cyclomatic 70): rhwp::renderer::equation::svg_render::render_box 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":"src/renderer/equation/svg_render.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"35250aceb504cc0a903e7b4f43e93282b96f2fef34d523ed7e56801b727ea99e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::native_webfonts::prepare (cyclomatic 70): rhwp::renderer::native_webfonts::prepare 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":"src/renderer/native_webfonts.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f97d0af95c408c4a49a3129b3bef9c753f89c1475c05f6765b61fd177cf12c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prepare_endnote_emit (cyclomatic 69): TypesetEngine::prepare_endnote_emit 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":"src/renderer/typeset/notes/endnotes/prepare.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"539dfcccca6e26795a9a7ccb87705caee84f9647ae590641333289d998f92d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_object_layout_child (cyclomatic 68): rhwp::parser::hwpx::section::parse_object_layout_child has cyclomatic complexity 68 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1d377449682d40462bce3cbceabb1b8ab2bd992d746e2f64501b50835d64d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ParaShapeDialog.collectMods (cyclomatic 68): ParaShapeDialog.collectMods has cyclomatic complexity 68 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 1 belongs 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"881f621a4b298ef8ddf873a472397ecec263dfc52cf2832961480281bc2b9ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare (cyclomatic 67): rhwp::renderer::typeset::controls::stored_tac::prepare has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86619b6fe7fd9d1244bc69dd143a43559b0d6701d93ed3d6c4d23df12d3a388"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::query_tail_fit (cyclomatic 66): TypesetEngine::query_tail_fit has cyclomatic complexity 66 (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":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"341d22c046159cdc8edf0429d897ce2aa685fde70ba8d100336689f9639dd3c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape_switch (cyclomatic 66): rhwp::parser::hwpx::header::parse_para_shape_switch has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8882773327ae9004802c7866478b772bafeb401d645318636d87eadfe57e8af"}},{"ruleId":"D1","level":"warning","message":{"text":"css-color.parseSupportedCssColor (cyclomatic 66): css-color.parseSupportedCssColor has cyclomatic complexity 66 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bac90939d3ab75c89ee6c98412251679040300a6a8ee65a8d735daf451ca59"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerBuilder::build_node (cyclomatic 65): LayerBuilder::build_node 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":"src/paint/builder.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f8403689bf50ddf1874c62ed111225f53812c6ed8441f409ca1bdd31ca5612"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorPaintGraphPayload::has_colrv1_supported_graph_contract (cyclomatic 65): ColorPaintGraphPayload::has_colrv1_supported_graph_contract has cyclomatic complexity 65 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_op.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"50539c36f33fa7c0de9b1e32a1021a8fe41063a64205c66e4b4451bc5cf1770f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::detect_ruled_tables (cyclomatic 65): rhwp::parser::pdf::table_detection::detect_ruled_tables 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"c023e45ca46cc02b2bb9f1f251c8f08d5c272f13d51f06adb384960ae8775406"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_tokenize_paragraph_with_regenerated_space_metric (cyclomatic 65): rhwp::renderer::composer::line_breaking::try_tokenize_paragraph_with_regenerated_space_metric 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69dc9a24df232e8ee09b9c372af8ac83f0f964c1a88155893b5ea2591cef224"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::body_text::try_serialize_para_text_with_slots (cyclomatic 65): rhwp::serializer::body_text::try_serialize_para_text_with_slots 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":"src/serializer/body_text.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba35cc00914ec19591b6d79d0d6d244ee3fb1799f2a3c1c5e6f62acfc93ca02"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_text_positioned (cyclomatic 64): WebCanvasRenderer::draw_text_positioned 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453d7b7e7b0f67bb031932384b5a33643316ec04575b3cfd7c8b203239a3eec"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::editable::reflow (cyclomatic 64): rhwp::parser::pdf::editable::reflow 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":"src/parser/pdf/editable.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ef4d839caba5dc2d75809e69c5851053e5e4e29c061320f3f66901296ed623"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::inline_flow::plan_with_storage (cyclomatic 64): rhwp::renderer::inline_flow::plan_with_storage 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":"src/renderer/inline_flow.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed975a5fb0816b1b50d466dc526dc7fd534d05f13c95f7faa3c9034f120a555"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan (cyclomatic 64): rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b074b6a49a8d6560938175bb75b2f7d6ea94ad4b80248e512f043ac785965677"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_reconcile::measure (cyclomatic 64): rhwp::renderer::typeset::controls::tac_reconcile::measure 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":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"933bf00a62eb20698ed92cdc1a25af149df7340c89b373da8492cdf556024481"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_vertical_cell_text (cyclomatic 63): LayoutEngine::layout_vertical_cell_text 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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4c481e6f58cfc542b547ffac178d801c7ddab36352b17d2e9827f1dc2ce991"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::map_pua_bullet_char (cyclomatic 63): rhwp::renderer::layout::paragraph_layout::map_pua_bullet_char has cyclomatic complexity 63 (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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":12931}}}],"partialFingerprints":{"codehealthFindingId/v1":"409eb436a0ed4b82bacec04276559448651ee9916a8564fe0b76effbfa16f120"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.fillSnapshotFromWasm (cyclomatic 63): diff-engine.fillSnapshotFromWasm has cyclomatic complexity 63 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8ff23c46f4fed2a2387708b0a2beee5d1f22400fb7754310e9fad5732f44d1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::query_initial_fit (cyclomatic 62): TypesetEngine::query_initial_fit has cyclomatic complexity 62 (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":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14a64b31edd3ab679bf510747d5e2293699a4c8e5df64f8307d94aee7284e51"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::apply_stored_paragraph_boundary_with_storage (cyclomatic 62): TypesetEngine::apply_stored_paragraph_boundary_with_storage has cyclomatic complexity 62 (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":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14091da33953254a7b659ca393729aba87324be6381f0942b499a5775db2d10"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_hwp3_inner (cyclomatic 62): rhwp::parser::hwp3::parse_hwp3_inner 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"14260cd6968af2a8cc3ee6694dc7a966ba134a3ca0a4ff59f97bb2f13d1b5aef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::fill_one_interval (cyclomatic 62): rhwp::renderer::composer::line_breaking::fill_one_interval 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"249cc8955bc23e65fe8d89076963be681063137c372cfcf894ffc7b1a79db1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::static_svg::normalize_static_svg (cyclomatic 62): rhwp::renderer::static_svg::normalize_static_svg has cyclomatic complexity 62 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/static_svg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07b4f93b72d356cd46ece475449056ef02b7de848d65866bf182a0fbba4261b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::empty_float::prepare (cyclomatic 62): rhwp::renderer::typeset::controls::empty_float::prepare has cyclomatic complexity 62 (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":"src/renderer/typeset/controls/empty_float.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d788897575ec23758ee6659008a5f4412662f4553bb604a5c8c7b35414a8c952"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::place_paragraph_flow_with_storage (cyclomatic 61): TypesetEngine::place_paragraph_flow_with_storage has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/flow.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aa492daa6cdd189934df9b9b443160824b1e5e9b39395715a2b3bb2802bba8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_note_pr_children (cyclomatic 61): rhwp::parser::hwpx::section::parse_note_pr_children has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a0538d152679db4f3aabbc372ea7febc4301e83012dc541b1416918c6b40ce"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::recognition::recognize_page (cyclomatic 61): rhwp::parser::pdf::recognition::recognize_page has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3a8cca5dea35025913a5f185d21808e342a580d0fece40002e22578f342a0"}},{"ruleId":"D1","level":"warning","message":{"text":"sfnt-face.normalizeFontFaceData (cyclomatic 61): sfnt-face.normalizeFontFaceData has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba5921158e5201dda93c897443a65ef5edda81dcf4d7d206a9ecb43732589c"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.findPictureAtClick (cyclomatic 61): input-handler-picture.findPictureAtClick has cyclomatic complexity 61 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 12 belong to 4 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a470a6045437737ced6ce2492c9b0389a30884bf512944dcfc308697a265fbcf"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::native_saved_reset_cut_trailing_trim (cyclomatic 60): LayoutEngine::native_saved_reset_cut_trailing_trim has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19783}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe434fb795ea86b1ced757f8421f06a4232da3b99e333434697d58a0d0115c3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_edit::plan (cyclomatic 60): rhwp::document_core::commands::border_paint_edit::plan has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aa901886595acbed705827596d22959c5e84f161d1e65abf6b5e55279d13d4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::navigate_next_editable (cyclomatic 59): DocumentCore::navigate_next_editable has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa67a9903f7aa03027f33109ac96f5334dbd0dfc426e4e8e045268ca345d7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::validate_structure (cyclomatic 59): rhwp::document_core::commands::object_ops::chart::validate_structure has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"45527485fe31f0a4b7ee61a96ae85816680c4c6d5d1e57cc0919ce580df47bc8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_common_shape_children (cyclomatic 59): rhwp::parser::hwpx::section::parse_common_shape_children has cyclomatic complexity 59 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":7779}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bf4955688cedd829eb246613f4c120ec63636f4de58806a854fe6f7439553f"}},{"ruleId":"D1","level":"warning","message":{"text":"static-svg-path-layers.parseStaticSvgFragmentLayers (cyclomatic 59): static-svg-path-layers.parseStaticSvgFragmentLayers has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7489770c8b52e6abfb6fe4f841759c019048bb7ee408f221b93d0c25cfa5c48f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::path_paint::lower (cyclomatic 58): rhwp::parser::pdf::path_paint::lower 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":"src/parser/pdf/path_paint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d6f8acf07642d285405d87c1dacff0f0773ed8d361e19a92f7c497490684b6"}},{"ruleId":"D1","level":"warning","message":{"text":"main.initialize (cyclomatic 58): main.initialize has cyclomatic complexity 58 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 34 belong to 16 function items 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":"rhwp-studio/src/main.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b345cf1de541b02995e4298bf6440fd9fdde74deb9a82f040636ee5bd3f38d8"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::create_shape_control_native (cyclomatic 57): DocumentCore::create_shape_control_native has cyclomatic complexity 57 (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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"d370c3352610d21119b7439f71b890b2ed56957b4a4d0bba447e220ec0392b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"Player::exec (cyclomatic 57): Player::exec has cyclomatic complexity 57 (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":"src/emf/converter/player.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72d1c1a852e1a0355c0ba3ac1f2e26dac4942e6a0926a9aca6d5594d8957ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prepare_paragraph_boundary_with_storage (cyclomatic 57): TypesetEngine::prepare_paragraph_boundary_with_storage has cyclomatic complexity 57 (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":"src/renderer/typeset/section/entry.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e398e8acee706e97ec6d604234da8eb7549b8c364b9ad928a443c074d5441d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::writeback_reflowed_table_frames_with_storage (cyclomatic 56): DocumentCore::writeback_reflowed_table_frames_with_storage 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":"src/document_core/commands/document.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d21792702bbad1c7857d85d0f68cd9e8c017a49e7bbcb21c4fa7147135cebfb"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::compute_render_normalized_with_storage (cyclomatic 56): DocumentCore::compute_render_normalized_with_storage 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"224eeaacc30d3a83d1c9036ca45150ddb409340f2c675e7bbd81a4fc6ea126f7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::batch::run (cyclomatic 56): rhwp::cli::batch::run 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":"src/cli/batch/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c3ae36893f7d8a489fd87b46da198bd8ffa658d8f101c3b3e7952914546fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object (cyclomatic 56): rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object 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":"src/parser/hwp3/drawing/shape_mapping.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f809c9c3b096162263ed15efc8c973f3b6187c1d07aa93576b0cf0fab5a7d2a0"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.imageForOp (cyclomatic 56): CanvasKitLayerRenderer.imageForOp has cyclomatic complexity 56 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 11 belong 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5901}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c706cf25d4ea91e61a56b50239d347b95aac0c970223ad17d9464002a2a77c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell (cyclomatic 55): rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell has cyclomatic complexity 55 (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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8279e5286242c9127f345afc40e4c3dfa74184441607c4966699d5b3383a52de"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::parse_hwpx_with_reservation (cyclomatic 55): rhwp::parser::hwpx::parse_hwpx_with_reservation 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":"src/parser/hwpx/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a77d7a4e6b1a42879a8f3007c3199d0f79e9ee541d373928e443aa03a75c8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::renderer::prepare_native_glyph_run (cyclomatic 55): rhwp::renderer::skia::renderer::prepare_native_glyph_run 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":"src/renderer/skia/renderer.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"455a94764222d5b1e97136c582f2b2578352df0be91f81430abe236be7bc8ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_by_path_with_hint (cyclomatic 54): DocumentCore::get_cursor_rect_by_path_with_hint has cyclomatic complexity 54 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 38 belong to 8 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9428ac75697f1736add7fafeb6e8a789b9a9ae950529dd13272ceecf596e2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_page_control_layout_native::collect_controls (cyclomatic 54): DocumentCore::get_page_control_layout_native::collect_controls has cyclomatic complexity 54 (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":"src/document_core/queries/rendering.rs"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4339b5f3071a4da8c6135511587a145ac5c614fe9093a0e51b94e7766e8d3cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::insert_text_at_caret (cyclomatic 54): Paragraph::insert_text_at_caret has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b755d9d6248c166c956ecd696dfd2e999a8bd492c4f51243dd6336e6470595"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::pdf::parse_export_pdf_args (cyclomatic 54): rhwp::cli::outputs::pdf::parse_export_pdf_args has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e40957e2397596e76f63cdc5726d0c69a3920dac6a13f61feeef538477c357a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape_child (cyclomatic 54): rhwp::parser::hwpx::header::parse_para_shape_child has cyclomatic complexity 54 (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":"src/parser/hwpx/header.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb06274678c0b7f9d544f5da2ef385e68ec282c6f7653c5b3fb5f1f2f563470"}},{"ruleId":"D1","level":"warning","message":{"text":"MovePos (cyclomatic 54): MovePos has cyclomatic complexity 54 (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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ce986a6bf8d288e9b91c1f0a6b0da63446f35a1e3cb294e6f0cf179cc86db7"}},{"ruleId":"D1","level":"warning","message":{"text":"TableBuilder::build_inner (cyclomatic 53): TableBuilder::build_inner 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0884d6f73c33064ac7a0613971717c5b6d1f65eb916b39c07db296f35faebefa"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_click_here_and_bookmark_markers (cyclomatic 53): LayoutEngine::layout_click_here_and_bookmark_markers 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":10668}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b553ed95eda51ca44fea7fd6cae563541729c05d02011ff97a5c7602310cea"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_shape_fill_brush (cyclomatic 53): rhwp::parser::hwpx::section::parse_shape_fill_brush has cyclomatic complexity 53 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b64b22d3e7554d82e11bfb58efd49cfb55c0f861d0597dbea9ed07bb8c8f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::pdf::direct_pdf_validation::validate_op (cyclomatic 53): rhwp::renderer::pdf::direct_pdf_validation::validate_op 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":"src/renderer/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d2128edea669393c39629cdd56ce2de7dc7c60ba98ed8e02603ecfee92b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeTextureController._pump (cyclomatic 53): NativeTextureController._pump 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a5517c064dd590971f708cd7aecaa97e1f8c70e993f1450d6d181c85203d64"}},{"ruleId":"D1","level":"warning","message":{"text":"static-svg-path-layers.isStaticSvgAttributeSupported (cyclomatic 53): static-svg-path-layers.isStaticSvgAttributeSupported has cyclomatic complexity 53 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4900b499cc0b323a8e015e811b227b0b1768b2f831d7be9b59d62272f7ec99"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::render_para_border_groups (cyclomatic 52): LayoutEngine::render_para_border_groups 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":"src/renderer/layout.rs"},"region":{"startLine":7461}}}],"partialFingerprints":{"codehealthFindingId/v1":"773898d95907691de0f3dfd2c6bc6ce50a4e2d59fc9527495d6cf17c2d4f75e0"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::render_image_node_with_sampling (cyclomatic 52): SvgRenderer::render_image_node_with_sampling 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":"src/renderer/svg.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e5ecba49a9aa526e36cf4e0485aa82f2724e092e62ddab9150ae4998465a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::mini_cfb::build_cfb_with_storage (cyclomatic 52): rhwp::serializer::mini_cfb::build_cfb_with_storage 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":"src/serializer/mini_cfb.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e29e962940a8f9b04c72f0f8f81053ddc062d625d2c418df58f1d36fa1115"}},{"ruleId":"D1","level":"warning","message":{"text":"text-variant-selection.selectLayerTextVariantsForLeaf (cyclomatic 52): text-variant-selection.selectLayerTextVariantsForLeaf has cyclomatic complexity 52 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 7 belong to 3 function items 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":"rhwp-studio/src/view/canvaskit/text-variant-selection.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec653cfbd555a374a48a50af74e5f2f21a592a6b3c984d20f9fac2ea66d79d"}},{"ruleId":"D1","level":"warning","message":{"text":"rpc-router.routeEmbedRequest (cyclomatic 52): rpc-router.routeEmbedRequest 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":"rhwp-studio/src/embed/rpc-router.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3138041d6aeec80c0034cb2fe73238efeb48d5947ae0ea733d0ea0d3ad6669e4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_shape_properties_native (cyclomatic 51): DocumentCore::set_shape_properties_native 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d386e00f54f839a2616bbdcd893027badde94b3e1b5640ad6ff23314138af09"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_embedded_table (cyclomatic 51): LayoutEngine::layout_embedded_table 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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd37540d29517e82fbb656fb58346652aaa2261faca78d458d67da98d166baa"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::build_columns (cyclomatic 51): LayoutEngine::build_columns 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":"src/renderer/layout.rs"},"region":{"startLine":6724}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c3f94438173a81bf4b84ce0a8b03e1d586e23f849a79c3b5083401abdfb5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_structure::prepare (cyclomatic 51): rhwp::document_core::commands::border_paint_structure::prepare 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9382305d65b49f790b8dd102576b6adfe2b5c737cfeef4813a5acb16455efc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_object_control_char (cyclomatic 51): rhwp::parser::hwp3::parse_object_control_char 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed20291bae7b62858aab123e249ddef46b52e6dd6a332f05046abc4f5229e909"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDocument._complete (cyclomatic 51): NativeDocument._complete 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da3e4de3ed29fc803cafad769d2ef048ad8f1b304196ca80070e87546d83e83"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageOp::drawImage (cyclomatic 51): CanvasKitLayerRenderer.drawImageOp::drawImage has cyclomatic complexity 51 (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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.drawImageOp) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9008964714f636c5bd8c67b985dedefec303efbb241dc2dd6f135dd68ed3888"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::grep_with_context (cyclomatic 50): DocumentCore::grep_with_context has cyclomatic complexity 50 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba85f48c9efdb1e93b89e8ff6cde4e60a87b1eba330bdc88607250e941f2fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::split_cell_into (cyclomatic 50): Table::split_cell_into has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a212d3280318baac163cec0742bcc628fbff7100950c6eccda5a51b5165ceb0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::absorb_section_tail_with_storage (cyclomatic 50): TypesetEngine::absorb_section_tail_with_storage has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/tail.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16787b8051b08331220b864c476ea7b2981d93a0bad8321c875a9ca3705838c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_line_shape_attr (cyclomatic 50): rhwp::parser::hwpx::section::parse_line_shape_attr has cyclomatic complexity 50 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4246}}}],"partialFingerprints":{"codehealthFindingId/v1":"30da34a6110590354ff190d8e8309550f88d989678b8f632b11eca08734ae913"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage (cyclomatic 50): rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_word_tail.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"427b7c7ac745f70c7e33d184cd098dc04ed9e7fca5429b906e737a9fb02533f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::prepare_glyph_outline (cyclomatic 50): rhwp::renderer::skia::glyph_replay::prepare_glyph_outline has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdf00da05fb54708da86243778333acf5dcd73d38ff27ddc8d3a114649aec12"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage (cyclomatic 50): rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba48f421d2b0ea22f818d5bf2c66ef9a567f088e1c2c12ec9d522e1d06ead6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::handle_end (cyclomatic 49): rhwp_ooxml_chart::parser::handle_end has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5968ec568c982548c65276aa9c74a1ab3ce1c5e9389f7d1c19020b1df9eb2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_shape_props_inner (cyclomatic 49): DocumentCore::apply_shape_props_inner has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"686cd8ad486d3d20eee6ead37e7a0816cec8ef0074a250ba7ceba68144d81e47"}},{"ruleId":"D1","level":"warning","message":{"text":"release_gate.validate_verdict (cyclomatic 49): release_gate.validate_verdict has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_gate.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"418cfff4091db0ddf2bc6ef4e9f5021178171a8d49b7993cd73c5eb40cdc9a40"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStaticControlText (cyclomatic 49): CanvasKitLayerRenderer.drawStaticControlText has cyclomatic complexity 49 (threshold 15). Of this number, 48 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd03b223b932e391f25884a72f34e0bf184af48df728049ef6dc600ae627598"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.handleCtrlKey (cyclomatic 49): input-handler-keyboard.handleCtrlKey has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d0ade95ad35fa6479df136dd9077d21cb0a9a76b5aaa4ebaea4babb97b5b9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native (cyclomatic 48): DocumentCore::get_selection_rects_for_target_native 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3bc26b70a5071cb9bb0821f9dbf47a494d03ec68b11dcb2958d1147908c4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_command_inner (cyclomatic 48): EqParser::parse_command_inner has cyclomatic complexity 48 (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":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c2431b51aa5f9a3df2eb22cb5d50596f2e73787584e53d2443ec756530e77"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_extents (cyclomatic 48): rhwp::cli::queries::diagnostics::dump_extents has cyclomatic complexity 48 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ffc81a3ea9d9a7f966fca10bcb59e97eaf1f8f75c332ba88d1ef54fe01414e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::native_host::runtime::worker::execute (cyclomatic 48): rhwp::native_host::runtime::worker::execute has cyclomatic complexity 48 (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":"src/native_host/runtime/worker.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe6ec8ea0fd094e5bf406017d511fc9e229e99c16c2d22e3181b64a2f4358cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_simple_control_char (cyclomatic 48): rhwp::parser::hwp3::parse_simple_control_char 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd651a9275fa0b24a1f4c275314aac3067f541895b3f5f2d5f962dc194748d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage (cyclomatic 48): rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage has cyclomatic complexity 48 (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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd504771dabd6c2b4855fab4fff89d2901143a63d0932a3bc0317bbda0082e"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.exception_kind (cyclomatic 48): audit.exception_kind 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":"gym/tools/audit.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e0d6d957195f9ea3f8a04dcc2c91430fc7a69b83eb33048f863713d49d1600"}},{"ruleId":"D1","level":"warning","message":{"text":"NativePuaFontSession.prepare (cyclomatic 48): NativePuaFontSession.prepare has cyclomatic complexity 48 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 3 belong to 3 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"28efefdad40712bc9fe2fe124e5ed079aa8fb1f638565873784a7bb954e239a8"}},{"ruleId":"D1","level":"warning","message":{"text":"main.setupEventListeners (cyclomatic 48): main.setupEventListeners has cyclomatic complexity 48 (threshold 15). Most of this is not in the body itself: 2 of the 48 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 1406, a function literal at line 1311, a function literal at line 1334, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/main.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0827f247294547ebcacaa3a9c389398dd0fb9ad42db31c5edafb96fa30cce68f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_common_obj_attr_from_json (cyclomatic 47): DocumentCore::apply_common_obj_attr_from_json has cyclomatic complexity 47 (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":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa78b04c6d20bd6120f44644d970e61985b86b152871dae714339d1fb5dacc"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_cell_properties_native (cyclomatic 47): DocumentCore::set_cell_properties_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1760d11e836619ecd7b67f1ff3616b48832ceea3ca65f95ff77280a9c94a0c18"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::compute_cell_line_ranges (cyclomatic 47): LayoutEngine::compute_cell_line_ranges 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12025}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa104a25508fd386e67ffd250076cf1b0816bee24b1a43acaf9e752a4521c782"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::json::write_text_export_metadata (cyclomatic 47): rhwp::paint::json::write_text_export_metadata has cyclomatic complexity 47 (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":"src/paint/json.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d5c87b5f28dcf5415b51ee5c6f3b29149e02fa828b59e7745d8e35c5b0548b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::json::write_equation_layout_kind (cyclomatic 47): rhwp::paint::json::write_equation_layout_kind 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":"src/paint/json.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e73a083165e97ab6123aed03040ddb4cb8b834c4fdd33cf2ff28848b1a9c09"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::lowering::lower (cyclomatic 47): rhwp::parser::pdf::lowering::lower 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":"src/parser/pdf/lowering.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"014318bac895ddeeacac5ff0e229fc4204a6d10d508f04833f12979d512c6029"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::equation::logical_font_frame::frame_with_style (cyclomatic 47): rhwp::renderer::equation::logical_font_frame::frame_with_style 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":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97fa11848ff4d61633552db7dc351c0b4ef7838d0e93b9fb5fbf16d392822fb"}},{"ruleId":"D1","level":"warning","message":{"text":"main.wire (cyclomatic 47): main.wire has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 3 of the 47 points are its own statements and the rest belongs to 17 function literals inside it that branch (lines 885, 911, 958, \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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a2b66c747d8f1777aa32bd5769f628afdd7845515a35dddfb11710e864e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"text-v2-normalizer.normalizeTextV2Tree::expand (cyclomatic 47): text-v2-normalizer.normalizeTextV2Tree::expand has cyclomatic complexity 47 (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":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e102b9adf5c79d439b51396a0a7a9368400a30574e5a8221b4c11dd21e6a1"}},{"ruleId":"D1","level":"warning","message":{"text":"static-svg-path-layers.isStaticSvgStyleSupported (cyclomatic 47): static-svg-path-layers.isStaticSvgStyleSupported 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"d058ef0c250a1f5b1ed890bcd5e989fc586e913550a6685243c78ec7d04a9e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.onInput (cyclomatic 47): input-handler-text.onInput 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1571df97d2fb0bbaba769c82c3fa648387d7a4e531d5c2abd75d764241fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::extract_page_markdown_with_images_native (cyclomatic 46): DocumentCore::extract_page_markdown_with_images_native has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 8 of the 46 points are its own statements and the rest belongs to 6 function items inside it that branch (collect_line_text, collect_markdown_items, table_cell_text, \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":8816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a097097a12537a2eede5b582fb0ee6113a516f2d4cf7aaf1ca31b4cd1ba300"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::advance_row_block_cut (cyclomatic 46): LayoutEngine::advance_row_block_cut 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23843}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750e1edb9434904cc9bb102ebd781bf1d846492c81c9028304ffb016b30045f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::replay_endnote_column (cyclomatic 46): TypesetEngine::replay_endnote_column 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":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb3ed44875e0ab17b8ff16c67aa83ad9e3efafebf514db87dbcc7f8d5749b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width (cyclomatic 46): rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width 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":"src/renderer/composer/cell_line_breaking.inc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"29da826d49b262a659e626089861e6f5ae04b2e2d9f27c9fee5a03d4bea0aebb"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitGlyphRunFontCache.registerResources (cyclomatic 46): CanvasKitGlyphRunFontCache.registerResources 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117bb21ad51f6dd7a45a75f050fbd0cd929a4b1f6a73f8097f49bfd5ffc6f09"}},{"ruleId":"D1","level":"warning","message":{"text":"showHoverCard (cyclomatic 46): showHoverCard has cyclomatic complexity 46 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 13 belong to 6 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":"rhwp-firefox/content-script.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"481a8ca4804d09a4c040b2d18ee3da09c614da696ede6608d57744e716e5a281"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::walk (cyclomatic 45): Walk::walk 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":"src/document_core/commands/paragraph_block/owned.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eb05dd320f7e4ba2701a70443ea90cb5265b31286deed86f9580597cf4784f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::insert_footnote_native (cyclomatic 45): DocumentCore::insert_footnote_native has cyclomatic complexity 45 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/note.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"66345697a831125699e1f962a74e9f61538cfa363bbc536e57c7b7d491ddc872"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::cursor_rect_in_cell_fast_on_page (cyclomatic 45): DocumentCore::cursor_rect_in_cell_fast_on_page 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"01689be131301079173ee08a0260b609ebb8393d658f063ec21a3f544a3c68df"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitReplayPlanBuilder::item_for_op (cyclomatic 45): CanvasKitReplayPlanBuilder::item_for_op 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7c4145bfe4543ee570b3baa55b9e630f0d7353a66b832e32776b6a2d6c0e22"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_shape (cyclomatic 45): LayoutEngine::layout_shape has cyclomatic complexity 45 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e6ba7cf08c94685d3cf07a643d32660f7491a9dd6e2c3cd97e2f9af2e1e7d4"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_tac_picture_item (cyclomatic 45): LayoutEngine::layout_tac_picture_item 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":"src/renderer/layout/tac_picture_item.inc.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e37ba2310e4a94a3fd516ec0a110586ab6ab6691a90760d392334bbcddd4a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_set_cell (cyclomatic 45): rhwp::cli::commands::edit::cells::edit_set_cell 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16610c5e82c395e2acc7f3078a65adbb5db2ecee6c40cc9cf83e74ad2444bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::vector::parse_export_svg_args (cyclomatic 45): rhwp::cli::outputs::vector::parse_export_svg_args 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":"src/cli/outputs/vector.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11dca1a51c9f714948989109ce1595b3d9c04801f187ebe14114bc3b2c49b05"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_field_parameters (cyclomatic 45): rhwp::parser::hwpx::section::parse_field_parameters 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff32b448987536a8ffbfc0e8e513ab625d43a8db17082f5740f9e4daf864907"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow (cyclomatic 45): rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow has cyclomatic complexity 45 (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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13eab9a9e2be7fb510b3f72e7d38f730fd3488a41d2157890368d403527441b"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzz_corpus.deterministic_mutants (cyclomatic 45): fuzz_corpus.deterministic_mutants 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b576007c9366ad9a5dc6204ba373ff121facd07c8a361792ee1acf3001656"}},{"ruleId":"D1","level":"warning","message":{"text":"robustness.deterministic_mutants (cyclomatic 45): robustness.deterministic_mutants 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":"gym/tools/robustness.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbabedf7899a509ca7176097b62fc254a7f89f5505be7144f61c5362a8cf1e96"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderCharOverlap (cyclomatic 45): CanvasKitLayerRenderer.renderCharOverlap 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1300e403df6ab7afc21ee30b1f7d6ed0de1b983c62582787191068a135d4156"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextDecoration::draw (cyclomatic 45): CanvasKitLayerRenderer.renderTextDecoration::draw 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa469adcf42a288139050839beb1606c859b4f0a5a71237eeddbbc6b3c3aa40"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::estimate_line_run_widths (cyclomatic 44): LayoutEngine::estimate_line_run_widths has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22ef0830c5d76ea31caf651bf011f92a12be40d9cb3e6c487c67cdeac3d200"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::register_body_footnote (cyclomatic 44): TypesetEngine::register_body_footnote has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/footnotes/body.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ecd04ce67cc08a040d2f4db8d7b62abcc87d1000fea50e00758355f2259927"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_insert_picture (cyclomatic 44): rhwp::cli::commands::edit::media::edit_insert_picture has cyclomatic complexity 44 (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":"src/cli/commands/edit/media.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaeac63fbee3011f5694c97332359c014be82ccb3da406a96161c5bad16ea89"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::extract::extract (cyclomatic 44): rhwp::parser::pdf::extract::extract has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/extract.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a448b1b380e3c3b58b79c78287a524b44e7344e9f5ceef551021a7a314502e0"}},{"ruleId":"D1","level":"warning","message":{"text":"form-replay.formDrawingReplayRejection (cyclomatic 44): form-replay.formDrawingReplayRejection has cyclomatic complexity 44 (threshold 15). Of this number, 43 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":"rhwp-studio/src/view/canvaskit/form-replay.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ec7a37f7dcba23e97b34c914f01ab58a4e0f83d201694331f4385340c3620"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 44): (anonymous) has cyclomatic complexity 44 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 19 belong to 40 function items 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":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ea77a44dc7eb4f7be93b28d0f5222fb5ebed7e1433794419fea5307a65672"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::verify::run (cyclomatic 43): rhwp::bin::rhwp-agent::verify::run 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":"src/bin/rhwp-agent/verify.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c2e71b8d1ad9b1cf63f23cf9625a69ac4047f960a4fc4dc2f4cea29b3139fa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_header::svg::parse_header (cyclomatic 43): rhwp::renderer::image_header::svg::parse_header has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_header/svg.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc6a38aad97d7c5987f743db7dde3b9821f1a824d0432a99942dd6a71e874fc"}},{"ruleId":"D1","level":"warning","message":{"text":"action-runtime.evaluateFormAction.expression (cyclomatic 43): action-runtime.evaluateFormAction.expression has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0af778e2d6535439f554759c9ea9db6eb0df65e0d19f17366bba532cc11896"}},{"ruleId":"D1","level":"warning","message":{"text":"HostCanvasFontSession.prepare (cyclomatic 43): HostCanvasFontSession.prepare has cyclomatic complexity 43 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 20 belong to 5 function items 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e1e07789d42890f592a1a911abd3a6d79c153c3182ace648286c6a42580040"}},{"ruleId":"D1","level":"warning","message":{"text":"TableCellPropsDialog.onConfirm (cyclomatic 43): TableCellPropsDialog.onConfirm has cyclomatic complexity 43 (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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"78673b9c2470901655164768949a0ed763d24f6064b907dbd5dd3c380cf7de61"}},{"ruleId":"D1","level":"warning","message":{"text":"onmessage (cyclomatic 43): onmessage has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 14, 45). 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":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b1853f84bdf83d5660135dafa342cbec463d7ebf2b755fca575e2c1e35e7c2"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::build_canvas_page_layer_tree_shared_with_profile (cyclomatic 42): DocumentCore::build_canvas_page_layer_tree_shared_with_profile 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83399c0b70f8a541a3e45101c644fdbcbfc1cb4e4ab04410e726caaff589e70"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::next_token (cyclomatic 42): Tokenizer::next_token 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":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95405eb75b8ccf0e2c951f8093dff942185e1f2fc7b5bcf4e609f5a721a5e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_header_footer_paragraphs (cyclomatic 42): LayoutEngine::layout_header_footer_paragraphs 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":"src/renderer/layout/header_footer_layout.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2705bcd3da75516c408e97c60c46c5623b1055109a58261debc7dda21e218e"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::compute_table_y_position (cyclomatic 42): LayoutEngine::compute_table_y_position 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed0f007df19943f26af6e2d72621cefe396af8f3cbcff0f187832548fd154bd"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::finish_paragraph_anchor_state (cyclomatic 42): TypesetEngine::finish_paragraph_anchor_state 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":"src/renderer/typeset/section/post_flow.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7726c741770253c87c88bb77dd4f54c9bb309c33dd5b5b9537bd60c19c44d98"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_conformance (cyclomatic 42): rhwp::cli::protocol::trust::governance::cmd_conformance has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb7b6925a394fe3ead45e16edd925b5cde2199e8b5a57ff06535cc73349c30f"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzz_corpus.validate_report (cyclomatic 42): fuzz_corpus.validate_report 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e17a691f92537bbf47afc4d78e87ada6a46ceedcf40df03b82e6926ac1ce3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"schema-validate.validateToolInput (cyclomatic 42): schema-validate.validateToolInput has cyclomatic complexity 42 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/ai/tools/schema-validate.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54b9e4c547f16fd633311673de71d84327c498efc930e6f2c3280979ab08c1"}},{"ruleId":"D1","level":"warning","message":{"text":"svg-image-header.parseSvgImageHeader (cyclomatic 42): svg-image-header.parseSvgImageHeader 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"088954f1d24476af5ab3566fc3cd2e2c3d9e2b6704f949f1039c3a379da42a76"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::mixed_nested_flow_extra_for_height (cyclomatic 41): LayoutEngine::mixed_nested_flow_extra_for_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089b4067857f51b643f75c1b42152091f126b3f95bc6051a11c0aec955f02a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::paginate_text_lines_with_storage (cyclomatic 41): Paginator::paginate_text_lines_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c323e4cee3181270e2920df883f502651baf285eeb2d6690beb0862fffd20"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::insert::edit_insert_table (cyclomatic 41): rhwp::cli::commands::edit::tables::insert::edit_insert_table has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/insert.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac645bb0ff6ebc15eb6368eb3964594d6ad71d4c136d65ce4e7c68261bc6c88"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::replay::cmd_replay (cyclomatic 41): rhwp::cli::protocol::capsule::replay::cmd_replay has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/replay.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"639932a2e02f128880674fa1ec5215b0a4d106d02ce2469607a000d42e24db0b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::table_calc::tokenizer::tokenize (cyclomatic 41): rhwp::document_core::table_calc::tokenizer::tokenize 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":"src/document_core/table_calc/tokenizer.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ed07c519cc108c3f56320df236a8f920d2568c0ac151c97276642097cc9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_control_slot_with_storage (cyclomatic 41): rhwp::serializer::hwpx::section::render_control_slot_with_storage has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94bb2636783e092956a87754538a892519b5f08161293101de297d4f8715edf"}},{"ruleId":"D1","level":"warning","message":{"text":"content-script.showHoverCard (cyclomatic 41): content-script.showHoverCard has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 belong to 2 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":"rhwp-chrome/content-script.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe8a07c5e51cbe07ae623d66e3412acb6d795cb6a18d4540dad139606d378b8"}},{"ruleId":"D1","level":"warning","message":{"text":"HostCanvasFontSession.resolve (cyclomatic 41): HostCanvasFontSession.resolve has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 5 belong to 4 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4bb3f50df269f132618cd13bba14109e9a880cc237d7d161febd84f153e71d"}},{"ruleId":"D1","level":"warning","message":{"text":"raster-stroke.rasterLineGeometry (cyclomatic 41): raster-stroke.rasterLineGeometry has cyclomatic complexity 41 (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":"rhwp-studio/src/view/canvaskit/raster-stroke.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"71495e9a1e1a2d77786fff7c9dbf1f301e5b692c59e8a5e980382d2c8601c9de"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlRenderer::render_node (cyclomatic 40): HtmlRenderer::render_node 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":"src/renderer/html.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4216d1ad7acd18370056f5c585b9249cf6029094b1dc665f96e5ffa2ad03e5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::calc_visible_content_height_from_ranges_with_offset (cyclomatic 40): LayoutEngine::calc_visible_content_height_from_ranges_with_offset 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb28502584f6f455fbc1f8713a20ed455156b35654c456968d02c882526fccc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::run_plan_engine (cyclomatic 40): rhwp::cli::protocol::plan::execution::run_plan_engine 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3382f9a58e1d04af0ee479f88b672089ad08995934e6fe5fa2e844063cacbb39"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::border_paint::decode (cyclomatic 40): rhwp::model::border_paint::decode 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":"src/model/border_paint.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111fe35f2a16ff3d9b5a3cdb59d2bc62e546c3556b9d6894a4059e1d8bc8bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::compound::plan (cyclomatic 40): rhwp::parser::pdf::table_paint::compound::plan 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":"src/parser/pdf/table_paint/compound.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcfb2cb63e089dd01430a595ed49f469f323513e71aea59b1b29dcaef6db078"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported::visit (cyclomatic 40): rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported::visit has cyclomatic complexity 40 (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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c554482c68751bd7ca6486bda717171cf22227864eb9c1ebec40b56f4de6769a"}},{"ruleId":"D1","level":"warning","message":{"text":"import-session.snapshotOptions (cyclomatic 40): import-session.snapshotOptions has cyclomatic complexity 40 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 15 belong to 2 function items 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7464e51e2f8536b2289779d26235300cfdd03c1ebf5a46823f91201a62e1cd4e"}},{"ruleId":"D1","level":"warning","message":{"text":"nominal-text-replay.textRequiresComplexShaping (cyclomatic 40): nominal-text-replay.textRequiresComplexShaping has cyclomatic complexity 40 (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":"rhwp-studio/src/view/canvaskit/nominal-text-replay.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc879431acf4463f3d01efc33e0a51357899e4cc6046a5d7c96f112150038a2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_bars (cyclomatic 39): rhwp_ooxml_chart::renderer::render_bars 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d51ce2f29982af3193ad2eb592a95359128afc4536437a9c7d22af73cdb213"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::equalize_cell_block (cyclomatic 39): Table::equalize_cell_block 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":"src/model/table_equal_size.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd4f86ab68e1274d01cd12762f9b50cb517264655bc3e5ae64b55909ee251c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::paginate_table_control_with_storage (cyclomatic 39): Paginator::paginate_table_control_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43ad92d4b227bed4e7f56064b7b105d9933829edcb3745491191905661707ee"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::query_whole_table_fit (cyclomatic 39): TypesetEngine::query_whole_table_fit has cyclomatic complexity 39 (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":"src/renderer/typeset/table/block/whole_fit.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4fd9a002513fd94a4c7eab22c4c5a0769ca124891899bd53f0cca0c7982538"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::collect_exact_font_slots_from_paragraphs_selected (cyclomatic 39): rhwp::document_core::queries::rendering::collect_exact_font_slots_from_paragraphs_selected 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"270b1e7c6cb6881379797ca01df4ff745c3105c4b500f9946c5bdcdbd2f29df3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::auto_numbers::assign_auto_numbers_in_controls (cyclomatic 39): rhwp::parser::auto_numbers::assign_auto_numbers_in_controls has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"src/parser/auto_numbers.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6922ed1d42ba85f4b1fc3cbc459868dde0369d3efd36973fa0777809132b4a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::equation_line_metrics::try_refresh_rows (cyclomatic 39): rhwp::renderer::composer::equation_line_metrics::try_refresh_rows 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":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8deb18d9107d16d672f768e9cc9699f4e00d96ac9c64b48d9d390ecc83089"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.pack_issue_line (cyclomatic 39): audit.pack_issue_line has cyclomatic complexity 39 (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":"gym/tools/audit.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d689eb7e50eebcbe9105b46234fc9e64ea2ead94609989249359439d5842a183"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::drawing_style::resolve (cyclomatic 38): rhwp_ooxml_chart::drawing_style::resolve 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/rhwp-ooxml-chart/src/drawing_style.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3130de54c273ad84c4a15e1828e7d69643a98040588e442dd34c798fe897a864"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::split_at (cyclomatic 38): Paragraph::split_at 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":"src/model/paragraph.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd950f6572e7d68e2162d0911b9dcabacaeeac4b9973f3706cdfb85247d18ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::read_command (cyclomatic 38): Tokenizer::read_command 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":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f9af33c11baf347145c0b155905c912c97b580da0d8bf1dda6b2a35e8a47b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_column_shapes_pass (cyclomatic 38): LayoutEngine::layout_column_shapes_pass 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":"src/renderer/layout.rs"},"region":{"startLine":17003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce78ef486799080b7d8b64f0a37f24d37c188e6bd4b773107c52ac5d5e2207a7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::record_stored_fragment_rows (cyclomatic 38): TypesetEngine::record_stored_fragment_rows 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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"df12932f6c7f5e52c07b4fb39aed630eeb82a2cd51e675736e089212739d0664"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_raw_records (cyclomatic 38): rhwp::cli::queries::diagnostics::dump_raw_records 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b1a83e08b0b9be95947319c2e70920ec19ca0c1ff04c6d99c388fa31fc74dc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::validation::references::validate (cyclomatic 38): rhwp::document_core::commands::paragraph_block::validation::references::validate 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":"src/document_core/commands/paragraph_block/validation/references.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"514afa6a8cd45261021be145a3f251705e188caf32a764fa76b6252db33e3bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::table_calc::evaluator::eval_function (cyclomatic 38): rhwp::document_core::table_calc::evaluator::eval_function 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":"src/document_core/table_calc/evaluator.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b96ff674728267e0c4868752eb87f0baa8b24af0e503e3c2cc1790664dd29f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_container_children (cyclomatic 38): rhwp::parser::control::shape::parse_container_children 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":"src/parser/control/shape.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ad142e4997ca05526c960e1947c186006da6b6f5255657ae778afd6e1577aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_hwpx_header_with_plain_margin_units (cyclomatic 38): rhwp::parser::hwpx::header::parse_hwpx_header_with_plain_margin_units 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":"src/parser/hwpx/header.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be8b7e042ddd9c01bd8b957e6f2e4a14059bbac5c5fe3a8345b069ba8193e54"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::lower (cyclomatic 38): rhwp::parser::pdf::structured_lowering::lower 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed39bb16811b943bc420e22fcf08cd8de7a3ac19bb0d30dd6a82a6136248a839"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive (cyclomatic 38): rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive 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":"src/parser/pdf/table_detection/cell_regions/local_axes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c88299ff8d9d21002a3ec47f5cce0a142bec8c41c8129972e156ac02f5527b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_nested_row_frames_with_storage (cyclomatic 38): rhwp::renderer::float_placement::stored_nested_row_frames_with_storage 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":"src/renderer/float_placement.rs"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"351028fc08db0e9544d7e952603922bac9e621e9b3478e03c70e3d5620af6c28"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::style_resolver::resolve_styles_with_environment (cyclomatic 38): rhwp::renderer::style_resolver::resolve_styles_with_environment 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":"src/renderer/style_resolver.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ca8dad726b715dc83a1413943cda93299f10d818568277d2d40122b1502a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix (cyclomatic 38): rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix has cyclomatic complexity 38 (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":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5777feb724be07fa0251d6d1bdb15df3c2a1b59dfc1b8670af14bd119e2f7f53"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::control::serialize_control (cyclomatic 38): rhwp::serializer::control::serialize_control 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":"src/serializer/control.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f31fe602f89246882d1cbe52bf6e8ab1fb5b57b1b34a4540cb9a1baaba09f46"}},{"ruleId":"D1","level":"warning","message":{"text":"declared-font-environment.prepareDeclaredFontPrograms (cyclomatic 38): declared-font-environment.prepareDeclaredFontPrograms 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fe3c0ff5dc964444578ac41a5731e10edf268685d753c94441d4575e2fee55"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.updateVisiblePages (cyclomatic 38): CanvasView.updateVisiblePages has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad1deeea5b9df5f66d8a3a474cd7b4f1bd74765a797b6852db884d6c7a8ed01"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.onPaste (cyclomatic 38): input-handler-keyboard.onPaste has cyclomatic complexity 38 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 8 belong to 3 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6003894b21532a640d64616fcd3de2476a1a5df3166a9d97a0143e2bdcd978ea"}},{"ruleId":"D1","level":"warning","message":{"text":"CharShapeMods::apply_to (cyclomatic 37): CharShapeMods::apply_to 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":"src/model/style.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"5004572425a0a9f44b75feead64b3129ca55f0dd02e78c7ca6ad0f1780a0f9f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Accounting::operation (cyclomatic 37): Accounting::operation 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":"src/native_host/render_snapshot.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"97715d5ca52363ecc31bacc9672d0904b2c6094761fa5a2c36740b274d9f4ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_vertical_textbox_text_with_paras (cyclomatic 37): LayoutEngine::layout_vertical_textbox_text_with_paras 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4714}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc1428d415bcce35a6202221078be34f8b59866448311616e2c79458afdd8a9"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderNode::write_json (cyclomatic 37): RenderNode::write_json has cyclomatic complexity 37 (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":"src/renderer/render_tree.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e85273850c1d37630230376669a78014887335198b08e6e7a369d30251543"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::query_new_note_fit (cyclomatic 37): TypesetEngine::query_new_note_fit has cyclomatic complexity 37 (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":"src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c8bfcf2d975951542debc3af06460e877d1c3a9270a30a39b552563c1b320e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::agent::dsel::lex::lex (cyclomatic 37): rhwp::agent::dsel::lex::lex has cyclomatic complexity 37 (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":"src/agent/dsel/lex.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"25538951fdcd72d1eba0c9d58024a562796789f7020b5ff4e5342c0b02179434"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::scan::run (cyclomatic 37): rhwp::bin::rhwp-agent::scan::run 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":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1ab29b3936110de97b30cf6edad8285ce0234261b0f9c262d5b04cd83be032"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_text (cyclomatic 37): rhwp::cli::commands::edit::document_text::edit_insert_text 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d8148560c0dd1e9cd714d02b69da26022af6702554a7f8b00d01a8ba09fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::raster::parse_export_png_args (cyclomatic 37): rhwp::cli::outputs::raster::parse_export_png_args 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":"src/cli/outputs/raster.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"948098e89b261d7e9d3be1fc092f101cbf1af831701510e419002e4e917346d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_para_shape_mods (cyclomatic 37): rhwp::document_core::helpers::parse_para_shape_mods 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":"src/document_core/helpers.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6759036e24b23dd8730f4b217ab96b5360f2b2fff70f188506ca80b5005d60"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_gso_control (cyclomatic 37): rhwp::parser::control::shape::parse_gso_control 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":"src/parser/control/shape.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9872bb738b62eb06295bd610eb5536215d56795a9440eaad6840ae7567aa2ffd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame (cyclomatic 37): rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"712b7a3c8b7b0bc8a3f2c0a8894db0c3135028cadb8e53bafa78e612edda25cf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::flow::place_with_storage (cyclomatic 37): rhwp::renderer::typeset::paragraph::flow::place_with_storage 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":"src/renderer/typeset/paragraph/flow.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b245f03f1066d78e58f71cd4cfda7fd0ca2351635edf56a6b8cd30c15060be72"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.scan_check_contract (cyclomatic 37): pack_health.scan_check_contract 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":"gym/tools/pack_health.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3ae5ab28bbfa3d682c17dab61081e1de8da9e8a471e0455ff322e1dbac830"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.annotateDiffSectionPages (cyclomatic 37): diff-engine.annotateDiffSectionPages 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"82574318709913266910cf8951ceb439fe62eb2952196b83c13e4c6132a99f76"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.create (cyclomatic 37): CanvasKitLayerRenderer.create has cyclomatic complexity 37 (threshold 15). Of this number, 36 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eefe12fe66fe7023815e36e1a4d13efb05456c31e9b960fd4da5d6c42b5eedf"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.fontDecisionEvidence (cyclomatic 37): CanvasKitLayerRenderer.fontDecisionEvidence has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 belong to 3 function items 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd52c8a8a47c14645340de06a310a1e6025a6fbcd2eac09ed3dca8fcf68c2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"page-scroll-probe.installPageScrollProbe::observe (cyclomatic 37): page-scroll-probe.installPageScrollProbe::observe 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. This shape REPEATS in the file: one other method here (page-scroll-probe.installPageScrollProbe::inspectMilestones) 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd1735527de4f183fa224193e1aff9672b86568c204243b315ede3714e866a"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::parse_html_to_paragraphs_at_depth (cyclomatic 36): DocumentCore::parse_html_to_paragraphs_at_depth 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f87c5ac70b82b28196100489b12797a58cbd3a6631825d75bfd10aad48d213"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes (cyclomatic 36): DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes 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. This shape REPEATS in the file: 4 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, DocumentCore::get_cursor_rect_native::find_cursor_in_node, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a44e2a0051a7788ae97d40f0be41c0fa6b2cfc72321c16e69269c79bbd42747"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::find_cursor_in_node (cyclomatic 36): DocumentCore::get_cursor_rect_native::find_cursor_in_node 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. This shape REPEATS in the file: 4 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a86cf020a793dd8c19b4cd51f8da64039384732867ff06e8c685ca344ec1c99"}},{"ruleId":"D1","level":"warning","message":{"text":"HeightMeasurer::measure_paragraph_with_storage (cyclomatic 36): HeightMeasurer::measure_paragraph_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494610729308c8267fbc445ac78f39c86579baeca59b1a1198a976bf4c9a3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::reflow_recursive_run_extra (cyclomatic 36): LayoutEngine::reflow_recursive_run_extra 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26991}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb38df559307635582bc4a4c0adccc0b83c208bd23023be9e16bdcd07bf16d40"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::stored_fragment_row_plan (cyclomatic 36): TypesetEngine::stored_fragment_row_plan 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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcfe06f86ddcd5b0a55102f0553991e552b3b02a4f9641ad12206246ab97140"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::edit_sanitize (cyclomatic 36): rhwp::cli::commands::edit::privacy::edit_sanitize 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af9a1c42eb9b59676730b2ea57b7993cf22df82f710dc3d90cab787c13fcc59"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::tabular_import::csv_to_chart (cyclomatic 36): rhwp::cli::commands::tabular_import::csv_to_chart 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe014ccb4e817130c17dc9ad75c67dbf1cf954b00d08326df2f596bd671cc913"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::digest::digest_document (cyclomatic 36): rhwp::cli::queries::digest::digest_document has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/digest.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9356a23a3d813615b07f55284f9a63016bb3169789ef72fd2ca73509fd22126"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::rows_geometry::inspect (cyclomatic 36): rhwp::document_core::commands::paragraph_block::rows_geometry::inspect 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":"src/document_core/commands/paragraph_block/rows_geometry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762e5ad3761d7b0731139f9e52aced93ef39e30ed2c13e4466e626f7ff1b93d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::renumber_memos (cyclomatic 36): rhwp::document_core::queries::memo_query::renumber_memos has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 4 function items inside it that branch (update_ends, walk, walk_shape, \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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee36191e591f7ed910b723b3fe7404e2dc62f91cb45f35e4c14342fcaa241fb7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main (cyclomatic 36): rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main 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":"mydocs/tech/investigations/issue-595/probes/inspect_595.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f97120cf853f0ee3d69c58763b23f5cc7109cb45dcc704242b753d2c2b7ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_bullet_hwpx (cyclomatic 36): rhwp::parser::hwpx::header::parse_bullet_hwpx 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":"src/parser/hwpx/header.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb130b8ee1bca60a3acc4773ca601417eb688f21e39c862a64d3cdfbd10398d3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::ole_container::parse_ole_container (cyclomatic 36): rhwp::parser::ole_container::parse_ole_container 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":"src/parser/ole_container.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7aaad91f0fffe3df7ac886064919d27d466e843b648f791436f1620f312e1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_run_reject_reasons (cyclomatic 36): rhwp::renderer::layer_renderer::collect_glyph_run_reject_reasons has cyclomatic complexity 36 (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: VariantRejectReason::as_str (cyclomatic 47) 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":"src/renderer/layer_renderer.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"349819e32fb6d07f38bbb8de2673e7ff4e5f5aec79ec77f3f07d4f93eedca4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes (cyclomatic 36): rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ab3a256ec95b010c3a3ad97dc4548abc0cbf29023e88cf96d04525a6d0a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.renderCanvas (cyclomatic 36): CanvasView.renderCanvas has cyclomatic complexity 36 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecc363427d67517a20de39842cbfae2a46afffd111c731a51d3dd85113a7b1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 36): (anonymous) has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 261, 239, 352, \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":"rhwp-safari/src/background.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4007bcb553902ff0ba70fd7aca3cd5275afb20be327b8f3a73c27868f2c70ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::delete_text_at (cyclomatic 35): Paragraph::delete_text_at 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":"src/model/paragraph.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8e320cd46adf52a99804c9f421d0d8f36487ccd93f30a4c246fe6378a87c37"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::replace_text_keeping_slots (cyclomatic 35): Paragraph::replace_text_keeping_slots 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":"src/model/paragraph.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc4a8d5ef29d1a1923c7c4410909bcbaa62dee1809deb15ffd4f18ec22ecfa"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_mixed_opening_frame (cyclomatic 35): LayoutEngine::stored_mixed_opening_frame has cyclomatic complexity 35 (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":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693799b414138abded82c2d2701303b6dcefde258cc1adee8a00730f7ce5b77"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::native_multirow_saved_reset_frame_cut (cyclomatic 35): LayoutEngine::native_multirow_saved_reset_frame_cut has cyclomatic complexity 35 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddddcb45295601f1cabbd09ca497d2a39291418ddac96b660fd71b433ad6182"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::ordinary_rowbreak_fragment_heights (cyclomatic 35): LayoutEngine::ordinary_rowbreak_fragment_heights 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64611f60b214c7218e9e8d0405c1474bfb26d46dfda4b43e5254ee3d3e412cd"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::vpos_snap_current_height_with_storage (cyclomatic 35): TypesetEngine::vpos_snap_current_height_with_storage has cyclomatic complexity 35 (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":"src/renderer/typeset/section/vpos.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba8adfc26c40a47a4278f4c899d53580d2761623729c729fb856143da6185c5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::tabular_import::csv_to_table (cyclomatic 35): rhwp::cli::commands::tabular_import::csv_to_table 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c7c51b2236d28056e74895c337d780011e73885fad315ada4fc5948ec5d9df"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify (cyclomatic 35): rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify 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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4e7924a1cef5e37c51dd72f28521265f6e74fe04f60c121c8c9d7125e7620c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::validate_plan_steps (cyclomatic 35): rhwp::cli::protocol::plan::execution::validate_plan_steps 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16c1a842f0bae168689b89b01546363229759c6db49de69e9702ce5c66a826b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mcp_serve::run (cyclomatic 35): rhwp::mcp_serve::run 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":"src/mcp_serve.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfe47062f2ff4d332a30f730cfc010d8f67faa3a24e82b3a69d07056a84201a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::tracked_viewtext::project_paragraph (cyclomatic 35): rhwp::parser::tracked_viewtext::project_paragraph 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":"src/parser/tracked_viewtext.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b17a907fbde02406ef134a70f9658ff924091af21b6ca544a6bb6cba42bf3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines (cyclomatic 35): rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e638a9151cb26824b445730c146b453f9b2afb18069ca285dda042bfe21e49"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::table::host_spacing::resolve (cyclomatic 35): rhwp::renderer::typeset::table::host_spacing::resolve has cyclomatic complexity 35 (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":"src/renderer/typeset/table/host_spacing.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d35c38242638cf5e7a66b260d2b9fec817d953023cf64b518764a21d7281f5"}},{"ruleId":"D1","level":"warning","message":{"text":"authority_ledger.classify_authority (cyclomatic 35): authority_ledger.classify_authority 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":"gym/tools/authority_ledger.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b106e82938f6bc0e48722c5551efb98d1acda4d0748ac7ae02deddeb0502a8cb"}},{"ruleId":"D1","level":"warning","message":{"text":"discriminate.validate_report (cyclomatic 35): discriminate.validate_report 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":"gym/tools/discriminate.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"812ae26605d99926892d12deda4c2c481cdc5ad4ce7257f3ec43903171cf5fcb"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence_report._role_statuses (cyclomatic 35): evidence_report._role_statuses has cyclomatic complexity 35 (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":"gym/tools/evidence_report.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"478758072b65a9d99c9559b55ecc184738a4e8aa9bf1165267022b3d39951d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-font-cmap.repairTerminalFontCmap (cyclomatic 35): browser-font-cmap.repairTerminalFontCmap has cyclomatic complexity 35 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 6 belong to 2 function items 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":"rhwp-studio/src/core/browser-font-cmap.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a68b855e2c46fe10c5e5a46694974aca7c9e18928ecdb29528787ce90bd262"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareBundledFonts (cyclomatic 35): CanvasKitLayerRenderer.prepareBundledFonts has cyclomatic complexity 35 (threshold 15). Of this number, 34 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23696aac8281186480e12e044ac0c94451e1591366290a7b42665cf27f54e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareLocalFonts (cyclomatic 35): CanvasKitLayerRenderer.prepareLocalFonts 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f30cb5fb0f95ff268a428d9016f8b66a444eeb856ee35db8cb0f8eb83c1b4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-mouse.onDblClick (cyclomatic 35): input-handler-mouse.onDblClick 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1d31e29297bfdc09b077224c6dbfb1b779b05706d0cf208761d041bc89c055"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::control (cyclomatic 34): Scan::control has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/validation/support.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d122faffbf6dd03f43fb0dc3476b9cdc8a90a0a1b4f002d64e9bffa9eb93ab"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::delete_range_internal (cyclomatic 34): DocumentCore::delete_range_internal 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17153c25e8a7b2f2c982a0821915a4b6a2b0274a75df64905f3e40b71c2a27"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::hit_test_in_header_footer_target_native (cyclomatic 34): DocumentCore::hit_test_in_header_footer_target_native has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 5 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"161a865fcbc4b58dfd3861e8c8b6a3a2ee62fb4e789fd499554072041203bb0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ledger::reconcile (cyclomatic 34): Ledger::reconcile 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d213e80925d57f36f1a843f25bf82afec62ce2eeb89a386d9266f7be847199b5"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::resolve_column_widths (cyclomatic 34): LayoutEngine::resolve_column_widths 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"55377a18f583d5d290a18478b472f91c01981546b6f59d3688ad87ff3750bb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_cell_reset_closes_body (cyclomatic 34): LayoutEngine::stored_cell_reset_closes_body has cyclomatic complexity 34 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14798}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa41168209ae8cad14870eead234923517a2b546eb2bbe75dfccb25f62193d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::native_intra_para_saved_reset_trailing_trim (cyclomatic 34): LayoutEngine::native_intra_para_saved_reset_trailing_trim has cyclomatic complexity 34 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53b52a30a3dffdba521904d937e625013c0d06103a57f4bcf7e708224d08d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::register_queued_table_footnotes (cyclomatic 34): TypesetEngine::register_queued_table_footnotes 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":"src/renderer/typeset/table/footnotes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e57c1e8214d93f95b348a4da0216d3dd194d8ab9d448718a1b349d66db6a95d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::kitty::export_kitty (cyclomatic 34): rhwp::cli::outputs::kitty::export_kitty has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/kitty.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e464abd90b5b222fca98e20240a311d1853a91376bf4eda2ad807c0b8091bce"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::sixel::export_sixel (cyclomatic 34): rhwp::cli::outputs::sixel::export_sixel has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/sixel.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4daefea9b6c2fb05614499175034875fed07e69187389079ec4a880e3ed0a60"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::vector::export_render_tree (cyclomatic 34): rhwp::cli::outputs::vector::export_render_tree 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":"src/cli/outputs/vector.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7253aef9c28925a8c5309e030de5c08e3258a6e6af069b43ae782671001db674"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::emf::emfplus::player::render (cyclomatic 34): rhwp::emf::emfplus::player::render has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/emfplus/player.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeee9b70320e4a31e668d7de38a5fd91a84dc7bdb530054020f5a0b21d2eda8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::identity::collect_ids (cyclomatic 34): rhwp::model::identity::collect_ids has cyclomatic complexity 34 (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":"src/model/identity.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccd62e7df8d471ccdc7e386aa48a28e0dfb4821a0cac98cc701de8cf76bda5d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::body_text::parse_para_text (cyclomatic 34): rhwp::parser::body_text::parse_para_text 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":"src/parser/body_text.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f242a7b047f011726290e5d4b16f406a315721128d9172729148fafffae457"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_common_obj_attr (cyclomatic 34): rhwp::parser::control::shape::parse_common_obj_attr has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a4ceb9a2f60e35bc15b3f920f4fc6c55b3304d865673c977c31de89a40a4b2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_ctrl (cyclomatic 34): rhwp::parser::hwpx::section::parse_ctrl has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5213}}}],"partialFingerprints":{"codehealthFindingId/v1":"082e93cd137a46ac9fc5be3d7399b9b6248d497ba4a20393285a152e623219cf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare_computed (cyclomatic 34): rhwp::renderer::typeset::controls::stored_tac::prepare_computed has cyclomatic complexity 34 (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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9be02584ed152e6eab961a90136faa5914b58fce1b121f3148af71aee0a29f1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage (cyclomatic 34): rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ee48feddb33fdf2ca63ab28f3ae16dad7327632936ab8865c5fe6eb59f96f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::serialize_hwpx_into (cyclomatic 34): rhwp::serializer::hwpx::serialize_hwpx_into has cyclomatic complexity 34 (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":"src/serializer/hwpx/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbacc540f051b61e2d1d0856a979b5c678c98c8ffdc7bc38d1c63c875765307"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistantView.proposal (cyclomatic 34): AssistantView.proposal has cyclomatic complexity 34 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 6 belong to 4 function items 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"878ee3c70196bccf39e82b911d5d4851ec665fc376a5b0122ac70a64293a631f"}},{"ruleId":"D1","level":"warning","message":{"text":"glyph-run-fonts.glyphRunPaintIsSupported (cyclomatic 34): glyph-run-fonts.glyphRunPaintIsSupported has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e65bb3eba6cfbbc931eae99a1c4123f9409e13a526c8ba35c072745465329a9"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.renderPictureObjectSelection (cyclomatic 34): input-handler-picture.renderPictureObjectSelection 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdac61475592f1cd0ac9acf72f45e3791d1e3ba68561bb5f3055cb58bd7f267a"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::onmessage (cyclomatic 34): constructor::onmessage 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"858c2110e2abe415f4035846f0193205f2830f787191d705d1185d52c1ce0f62"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::try_patch_cached_focused_cell_tail_line (cyclomatic 33): DocumentCore::try_patch_cached_focused_cell_tail_line has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":7951}}}],"partialFingerprints":{"codehealthFindingId/v1":"3070c82ded259438af4f7ae21020d74d13082aed733b2578a9a37085de9b8168"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_inline_flow_plan (cyclomatic 33): LayoutEngine::layout_inline_flow_plan 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7b3214dae3bc6da2ceacadde8a577e8713dad0d35c125dcdb36356db768890"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_picture_full (cyclomatic 33): LayoutEngine::layout_picture_full has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572a87a475af5e1a54f8a1f9e524104b2f644c617e0a616402a4ab926309476"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_cut_height (cyclomatic 33): LayoutEngine::row_cut_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27921}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74771975daa3373bcadbd36af2c4cfce6f127cb2382f344085acf77c8579dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::process_multicolumn_break (cyclomatic 33): TypesetEngine::process_multicolumn_break 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":"src/renderer/typeset/section/columns.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cab0738a9b1d6a5a7266bc89fb951c9252d5691ee4bbd60b463f2a51a9c437"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_image (cyclomatic 33): WebCanvasRenderer::draw_image 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b2f3449433d7050927c033a706dd4de3e85cdb4c32b5cb27a7cf89a10a15f1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text (cyclomatic 33): rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text has cyclomatic complexity 33 (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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0636c9eb7c85ecfaf1ee759a87089735395601ba93bf7abaaedb39cbec357ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_insert_image (cyclomatic 33): rhwp::cli::commands::edit::media::edit_insert_image has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eadc771ff229c95d0a587b68081172b7210236845feaabfd14d6ed9bb953c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_insert_shape (cyclomatic 33): rhwp::cli::commands::edit::shapes::edit_insert_shape has cyclomatic complexity 33 (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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb94f0200c8a9e48e953484d7f3c494e5d395cefaa95dae785b60e586ba65f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::raster::export_png (cyclomatic 33): rhwp::cli::outputs::raster::export_png 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":"src/cli/outputs/raster.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5364653a2932f98d99bcd73a8fcd0191f4a7ca9b2c0efdd540fd7c75d81f50"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::chart_to_csv (cyclomatic 33): rhwp::cli::outputs::tabular::chart_to_csv 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"529471ff3d4fbd55133541365642f166f8d4698733ea791e697fde7f012276f9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::trust::gate::cmd_gate (cyclomatic 33): rhwp::cli::protocol::trust::gate::cmd_gate 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":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafcdc9c2f50d7af3c12a92bcbe2e8d462d5dc05fcbe0b862dc3e6722970d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::raw_provenance::seal_raw_bearing_controls (cyclomatic 33): rhwp::model::raw_provenance::seal_raw_bearing_controls has cyclomatic complexity 33 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 13 belong to 2 function items 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":"src/model/raw_provenance.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bddcf6351cf04cf88f0fae14ec0de0facca90f457c744823d918ada9eefcd9c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::observed_line_text (cyclomatic 33): rhwp::parser::pdf::structured_lowering::observed_line_text 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d294a026644737d52a30bdcc77bc3cfe9e21fe0b4a79dedc6babfde2c0cb0746"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::edges (cyclomatic 33): rhwp::parser::pdf::table_detection::edges 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1497b911c443242e8c5fdf9c6ad31e28204d7f376648af6e4b6195eecd49765f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes (cyclomatic 33): rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes has cyclomatic complexity 33 (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":"src/renderer/image_resolver.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00ad38330223ceb8b01a1d93c26697792473385baa2c7669e3adfd1d89dc470"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage (cyclomatic 33): rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b4403cb1385c9e00a1cafc88c73773ad5fe5243654259666eed6949bc4fe82"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence_report._validate_positive (cyclomatic 33): evidence_report._validate_positive has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/evidence_report.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"143d8e3e6f5ccac6b7ad948bde532879d00b00e30095fd6a4ac92ff356c8186c"}},{"ruleId":"D1","level":"warning","message":{"text":"background.browser.runtime.onMessage.addListener() (cyclomatic 33): background.browser.runtime.onMessage.addListener() has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 9 of the 33 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 261, 239, 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":"rhwp-safari/src/background.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0550b7b070d8a5a32b8895082c6720946a3c80841f203c0f1b19b9881b757ca"}},{"ruleId":"D1","level":"warning","message":{"text":"action-runtime.evaluateFormAction.invoke (cyclomatic 33): action-runtime.evaluateFormAction.invoke has cyclomatic complexity 33 (threshold 15). Of this number, 32 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af4782a2370ce1013982d76a1c5c735e736567608d7d20bbce1d54970a4827c"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.handleF11 (cyclomatic 33): input-handler-keyboard.handleF11 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8912c368541dd01cec681e205ceb27636ee66737d7ca3868adb0171b7a897b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.deleteSelectedCellBlock (cyclomatic 33): InputHandler.deleteSelectedCellBlock has cyclomatic complexity 33 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 15 belong to 2 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5876}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c2ecd8ba29c05fd6efe37d18319a3fe2f63a2306bd662dd4f22254e79c9aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::parse_chart_xml (cyclomatic 32): rhwp_ooxml_chart::parser::parse_chart_xml 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f300045edf119f010790dd00f79fd4eee67a26a9611cb99176f274c518e1e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_cursor_hit_at_x_on_line (cyclomatic 32): DocumentCore::find_cursor_hit_at_x_on_line has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 13 of the 32 points are its own statements and the rest belongs to 3 function items inside it that branch (collect_image_candidates, collect_matching_runs, node_matches_context). 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1c3ce5652c1de2b3543e7cfb87b67e06586969557ecf454457b97f2d49e1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_in_header_footer_native (cyclomatic 32): DocumentCore::get_cursor_rect_in_header_footer_native has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 13 of the 32 points are its own statements and the rest belongs to 2 function items inside it that branch (find_cursor_in_hf_subtree, find_hf_para_line). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9d04e89959bfd4218c8355aece9b0349aa14aceab0173367950d04182563d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Hwp3SpecialChar::parse (cyclomatic 32): Hwp3SpecialChar::parse 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":"src/parser/hwp3/special_char.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"46549a368b56875daceece7b49a376085825e04203b34693942cd27833ae15ec"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_element_atom (cyclomatic 32): EqParser::parse_element_atom 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":"src/renderer/equation/parser_atoms.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88236a2b75a7c912babc1f8bb01f60c5ad66dc940c264a439705757ea336217"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::run_section_with_storage (cyclomatic 32): TypesetEngine::run_section_with_storage 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":"src/renderer/typeset/section.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbe532121d2b84768c2d11187504f2faca3e29bfbf8dab3e1d012f388bc6132"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::render_node (cyclomatic 32): WebCanvasRenderer::render_node 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":"src/renderer/web_canvas.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1854719b433599b1103538b8e0bdf1d7c724e088ff04e818fba42f88fd5868d8"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_image_with_fill_mode (cyclomatic 32): WebCanvasRenderer::draw_image_with_fill_mode has cyclomatic complexity 32 (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":"src/renderer/web_canvas.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ab4c04f1521a70231a373140ea5e11a7d0de7faaebaa5f835ea733263e4a42"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::text::edit_replace_text (cyclomatic 32): rhwp::cli::commands::edit::text::edit_replace_text 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":"src/cli/commands/edit/text.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abdc62d14a8ecd4ee0beca0ae3fcf12a2cdc2d4579fb6d5255882d24f297cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_text (cyclomatic 32): rhwp::cli::outputs::text::export_text 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":"src/cli/outputs/text.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda9b3140c711743c7d05cedc41e0b652517633605b5c84ebdc401a612168676"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::vector::export_svg (cyclomatic 32): rhwp::cli::outputs::vector::export_svg 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":"src/cli/outputs/vector.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d33efe12231679acaed9a2a5db60dfbd53d39b703a8a5d6c45fcf917483f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_char_shape_mods (cyclomatic 32): rhwp::document_core::helpers::parse_char_shape_mods has cyclomatic complexity 32 (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":"src/document_core/helpers.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbb033f79c2f09632a6f65e5c92dc36a563dbe4665bb0b22bd0a26f15648c13"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::doc_info::parse_fill (cyclomatic 32): rhwp::parser::doc_info::parse_fill 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":"src/parser/doc_info.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42aff2683fc17c906d1f009b67752c8c0099bc993ef64dafccea77057bfdf63"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_compose (cyclomatic 32): rhwp::parser::hwpx::section::parse_compose 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6668}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7c0768d12e4fd1b09f5405b8e3b4042c0e5f72587f3aa5e6375ffb209c3f65"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::select (cyclomatic 32): rhwp::parser::pdf::table_detection::cell_regions::select 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":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8ec2a912fbbf2184ac6506830ac5b673d23ed3e40d2bbc3fe43f407dc18d36"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::stored_tac_lines (cyclomatic 32): rhwp::renderer::composer::stored_tac_display::inc::stored_tac_lines has cyclomatic complexity 32 (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":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d3f040a48fe05e8f28579491f65f2bbd7bfde4efe83b3367f2cd290c9933b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::equation::hancom_glyphs::glyph (cyclomatic 32): rhwp::renderer::equation::hancom_glyphs::glyph 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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f36ddc56cf205d8c5f8c1cfe425db7aa9e8ec57eb02b2304636741dd99ddde"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_block_cell_flow_with_storage (cyclomatic 32): rhwp::renderer::float_placement::stored_block_cell_flow_with_storage 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":"src/renderer/float_placement.rs"},"region":{"startLine":7447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce2605e46424050addaf5b2c7c63ca7b1d6a9f5aa30820f411fc076dcf6ab33"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.audit_one_pack (cyclomatic 32): audit.audit_one_pack 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":"gym/tools/audit.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46866964aeab601d4c4775c9646e5b067a5a04699838c911bd3855bea45cb9d"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.refreshRenderSurfacePlan (cyclomatic 32): CanvasView.refreshRenderSurfacePlan has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530b7ea25308391ff88f590232adb3cdae625d5b17c73ba4c730dabb1cbb0af"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruler.drawHorizontal (cyclomatic 32): Ruler.drawHorizontal 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c910bed88ec1f14852e3fae4936523ffdea8e033660885b033a1aae9f65695"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.onCompositionEnd (cyclomatic 32): input-handler-text.onCompositionEnd 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f52d57d090f7856053afe64d269d0e6785a1a15eba5ee6171880c19420ab9d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_native_ffi::session::rhwp_native_host_request (cyclomatic 31): rhwp_native_ffi::session::rhwp_native_host_request has cyclomatic complexity 31 (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: rhwp_native_ffi::session::rhwp_session_request (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/session.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba8b218c2303e96b3db687a308bfdea30187cabd43707ea946ddd9c6b69bca"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native (cyclomatic 31): DocumentCore::get_cursor_rect_native 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. This shape REPEATS in the file: 4 other methods here (DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, DocumentCore::get_cursor_rect_native::find_cursor_in_node, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e79ac5e7f5caa014f9ea1825f6fe63160ced6f1f8d56608263a5826474c296"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_control_z_order_at (cyclomatic 31): DocumentCore::set_control_z_order_at 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15368a411c7ad29e4dc246e78d9d1e59246a01901cdb90e1e5b685ca8fc2027"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::dump_page_items (cyclomatic 31): DocumentCore::dump_page_items 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4691d81c52acf2b787f5a713ef6845ee471c3767fe77c1ad8932027ca9975a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::resolve_span_content_requirements (cyclomatic 31): LayoutEngine::resolve_span_content_requirements 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":"src/renderer/layout/table_layout/plain_cell_flow.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"75119e3a4942c92d9e2f09a356205d5dc12abe99e6a6719b7c0c3bb50cba01f2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_empty_prefix_row_closing_frame (cyclomatic 31): LayoutEngine::stored_empty_prefix_row_closing_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b528a82f8d67a6bd5aedda39c8a14841c64c1abaf783718fc6390f76f79c10ae"}},{"ruleId":"D1","level":"warning","message":{"text":"HwpDocument::update_style_shapes (cyclomatic 31): HwpDocument::update_style_shapes 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":"src/wasm_api.rs"},"region":{"startLine":8113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff32e737e583cc1932cc2d9443ae7433191a74a612651fdf93a116d045b46b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::fingerprint::run (cyclomatic 31): rhwp::bin::rhwp-agent::fingerprint::run 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":"src/bin/rhwp-agent/fingerprint.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"21568e517fc9bcda6675f860deeb065d8dc2b9c0e8b4e7317e34f617187ff19a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text (cyclomatic 31): rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text has cyclomatic complexity 31 (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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"728fb2d35b9d22e18b0f920b2e9eba11531ee11846b5456e410b4b92d42ee579"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text (cyclomatic 31): rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text has cyclomatic complexity 31 (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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bffa279d668bfc85844fab9fd77be39122ddad5e9ae3b3ed240a9aaa86a702"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf (cyclomatic 31): rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf has cyclomatic complexity 31 (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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba439cf30e080e95feeac3fd41d527b826a490f5b135eb3f9218b7ab4ba6322a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::bundle::cmd_bundle_export (cyclomatic 31): rhwp::cli::protocol::exchange::bundle::cmd_bundle_export has cyclomatic complexity 31 (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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"07674fe914c6f5f11bcddb7c22054fc4fad12920f8aa7bc81aeecc127d238ead"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::verification::run (cyclomatic 31): rhwp::cli::queries::verification::run has cyclomatic complexity 31 (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":"src/cli/queries/verification.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d6e90cb0968f97c403ff6e9e74dd8580e25722ee501a482f6353681ffaf07"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_structure::preserves_layer_order (cyclomatic 31): rhwp::document_core::commands::border_paint_structure::preserves_layer_order 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab80f709c5cb1f7e9ad30ef7b9d5972a389a478bdbeaf7b3310974b1f1069a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::pack_hwpx_common_obj_attr (cyclomatic 31): rhwp::parser::hwpx::section::pack_hwpx_common_obj_attr has cyclomatic complexity 31 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f812a743d1cf998f096e88fd4f6f3220d6280675145221fbd0a4b37e37363"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_field_begin_attrs (cyclomatic 31): rhwp::parser::hwpx::section::parse_field_begin_attrs has cyclomatic complexity 31 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":5598}}}],"partialFingerprints":{"codehealthFindingId/v1":"998ab8f0eb4b64c16ba84135816c502bfdb575b874f42a310a619e2be3442a32"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_equation (cyclomatic 31): rhwp::parser::hwpx::section::parse_equation has cyclomatic complexity 31 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":6896}}}],"partialFingerprints":{"codehealthFindingId/v1":"245ad33d665f565277facb3407a9ea6c1c5c75ea462cc03b81361c00a97a4ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hp_ole_element (cyclomatic 31): rhwp::parser::hwpx::section::parse_hp_ole_element has cyclomatic complexity 31 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"20737b2c313da8e9f0ea5ae9020bf15c9e4ec68013beb4cd66a1f9539518cad8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_future_paper_shape_frame (cyclomatic 31): rhwp::renderer::float_placement::stored_future_paper_shape_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"c665e144a4706c8a9a179b0804ca081e763a20a73785bb7a2a0c990c9c735cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::mixed_host_line::prepare (cyclomatic 31): rhwp::renderer::typeset::controls::mixed_host_line::prepare has cyclomatic complexity 31 (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":"src/renderer/typeset/controls/mixed_host_line.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3204f52b13f5ff9a235737d64d011d9a0f552ae894a3f25fd1874cb8491eca3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage (cyclomatic 31): rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage 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":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b08bd7f14f281d92ba1242f9132ba32eeb83dcad6fd0b861d2c71e2dc5a27"}},{"ruleId":"D1","level":"warning","message":{"text":"leaderboard.verify_entry (cyclomatic 31): leaderboard.verify_entry 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":"gym/tools/leaderboard.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dd62a5beec7c8953a68487d7cf0b1d72aaaadea75a04a51a1ddf3773113909"}},{"ruleId":"D1","level":"warning","message":{"text":"compatibility-glyph-view.compatibilityGlyphView (cyclomatic 31): compatibility-glyph-view.compatibilityGlyphView has cyclomatic complexity 31 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. 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":"rhwp-studio/src/view/canvaskit/compatibility-glyph-view.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d40c0c2130106f3568edd3123d8d266225056c04fed49ad7bf581267d12c147"}},{"ruleId":"D1","level":"warning","message":{"text":"showHoverCard (cyclomatic 31): showHoverCard has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 5 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":"rhwp-safari/src/content-script.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b4f760c267bcd066a858e61b0607db9626bec433fa13223fd43fa5371caea8"}},{"ruleId":"D1","level":"warning","message":{"text":"_decode (cyclomatic 31): _decode has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function items 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"138e2729260d909a6ceb1cf09aefb547bbd09c4a65ba86d7418e196aad927626"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::clone_series (cyclomatic 30): Planner::clone_series 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/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"8561c3248d1a6317d1b4c89ea0c20bb33ea6ebbaf754e947c225823944af86e5"}},{"ruleId":"D1","level":"warning","message":{"text":"CartesianLayout::new (cyclomatic 30): CartesianLayout::new 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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26b145b4f5c07b9a72f22c81a502b922993f3422713405a9f6330a9f17f1fa8"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::css_to_para_shape_id (cyclomatic 30): DocumentCore::css_to_para_shape_id 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42698918e70c06eaf33b48186e58482561dacd8ec4e1bc089e8e0cc8aa04307"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_next_editable_control_native (cyclomatic 30): DocumentCore::find_next_editable_control_native has cyclomatic complexity 30 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 12 belong to 2 function items 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec349b329d428de2ae37110b53176cfc234b2510c844125bc7b8e2be84922c2"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::exit_control (cyclomatic 30): DocumentCore::exit_control 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee839b9b867ba4d5dfde58a91cc255e6ae9f87d102ba8453b0cb0a2692b62547"}},{"ruleId":"D1","level":"warning","message":{"text":"ParaShapeMods::apply_to (cyclomatic 30): ParaShapeMods::apply_to has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/model/style.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"85daf47a1657fe250af46001b404a5d5447ae67648a2cee3fbebd9a12b768696"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::closing_row_frames_with_storage (cyclomatic 30): Table::closing_row_frames_with_storage 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":"src/model/table/row_frames.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f29f51b58213309d1e4291f0c2400254bc7fc229225cc3d848481e604a20eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ParagraphMachine::feed (cyclomatic 30): ParagraphMachine::feed 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c570dded6e08e270318a0fa1d5ecb5c52aacf1f117b881cfa7632ff87df581f"}},{"ruleId":"D1","level":"warning","message":{"text":"FontEnvironment::from_document_lookup (cyclomatic 30): FontEnvironment::from_document_lookup 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":"src/renderer/font_environment.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9720f7fd2fee8883a7549fcc25afa0866b3a78ff686b8cb122076ab5cf80a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::place_empty_line_inline_equations (cyclomatic 30): LayoutEngine::place_empty_line_inline_equations 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3622c9d868a44ed9469edf7d4e3317c103abaf83bb84be6893027f234422b4c8"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_empty_runs_line (cyclomatic 30): LayoutEngine::layout_empty_runs_line 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad60b8fa8c20e6b513371ae30f71a1aa7cdfd0ff7947b46cd26368884e4130a"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::render_page_background_image (cyclomatic 30): SvgRenderer::render_page_background_image 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::svg::known_font_filenames (cyclomatic 39) 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":"src/renderer/svg.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1fb0896e4b584f0d9580f8992ca843e61d0e322cb2f6000252d5f2120effea"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::compute_endnote_metrics (cyclomatic 30): TypesetEngine::compute_endnote_metrics 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":"src/renderer/typeset/notes/endnotes/metrics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d27ebb4119b064406c0da57b7ce2e34bb73f6aec4ecbfc822fd82da0433d2d9"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_text_with_effects (cyclomatic 30): WebCanvasRenderer::draw_text_with_effects 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3396084b2c23f8299330eeaa6165e87b12a0a8d9e0be838b8972db8934f724"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf (cyclomatic 30): rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38519ae8fe704f831e200008a4ca7b436db69524b2d81c31f1a4d01dca9773a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::execute_redact (cyclomatic 30): rhwp::cli::commands::edit::privacy::execute_redact 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d9ccf1259b15d4664cd1e987b6fa610dc4d049056b02f4a0677f2e39e8d525"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_split_cell_into (cyclomatic 30): rhwp::cli::commands::edit::tables::grid::edit_split_cell_into has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f42ec48303ab462092a7446e64e193cb52beda61ea0b1a82b847d8b52e695c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_markdown (cyclomatic 30): rhwp::cli::outputs::text::export_markdown 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":"src/cli/outputs/text.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9319cb103b8804c9c8c64f7ef9854e7384bd7f284ca01e347a1bcd6fedf61f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::harness::cmd_harness_status (cyclomatic 30): rhwp::cli::protocol::harness::cmd_harness_status 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":"src/cli/protocol/harness.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53b62f24de41dfc074e733d55ffdacc36373bb1a7fa2ece476225fc6adb25b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::execute_plan_steps (cyclomatic 30): rhwp::cli::protocol::plan::execution::execute_plan_steps 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2449d64731cb720c52836d5afa80f27cee5782c7ef662f3c0cb9664213457f6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::for_each_ole_mut (cyclomatic 30): rhwp::document_core::converters::hwpx_to_hwp::for_each_ole_mut has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 2 of the 30 points are its own statements and the rest belongs to 5 function items inside it that branch (walk_controls, walk_shape, walk_drawing, \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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f704a4195698de73a68589e86c3e7cd993db8a976d95b5940a32c629e557f5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::hwpctrl_sets::scan_paragraph (cyclomatic 30): rhwp::document_core::queries::hwpctrl_sets::scan_paragraph 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e0df942a522714857bc32ac1b431296ab1715f013621ac8b04b4e44c29fc1e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::text_security::scan_deception (cyclomatic 30): rhwp::document_core::text_security::scan_deception 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::text_security::confusable_to_latin (cyclomatic 64) 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":"src/document_core/text_security.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce6dc8abad1d719bc517933f847037d5f4167b2133839a86569b7009ce2783b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::ole_chart::legacy_column_renderer::render (cyclomatic 30): rhwp::ole_chart::legacy_column_renderer::render has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/legacy_column_renderer.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7730d2ea53d45c331f18d187f18cafd474c53e149e8401e1d4f3efc3cf1f8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::text_v2_export::envelope_node (cyclomatic 30): rhwp::paint::text_v2_export::envelope_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":"src/paint/text_v2_export.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef3a71f032f7c573450daa3e9af3d159111b6a2b32036388b372c5251895233"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_field_control_char (cyclomatic 30): rhwp::parser::hwp3::parse_field_control_char has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a75b060dd04811cc664a92e83b0421b42dce94daa4c9448baa33e008db05f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_object_element_attrs (cyclomatic 30): rhwp::parser::hwpx::section::parse_object_element_attrs has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e850c4b0193dac397a036f875d435dc1213b06b37ea3d0fcf4b2e2a3d319f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::paragraph (cyclomatic 30): rhwp::parser::pdf::structured_lowering::paragraph 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"04530044a0995f0a4b2bbe735824ff3b795f250f160c28ddfb28b407dd3cec02"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::recalculate_section_vpos (cyclomatic 30): rhwp::renderer::composer::line_breaking::recalculate_section_vpos 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":6674}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e1263b5824e12a20737d37cd1046205e12b02ef43d23162c422ae1a35f8012"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::web_canvas::detect_image_mime_type (cyclomatic 30): rhwp::renderer::web_canvas::detect_image_mime_type has cyclomatic complexity 30 (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":"src/renderer/web_canvas.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fadb10159db459d500ab4da53b2a5ca2d1ef79722c7a17f54324f6022ccf31"}},{"ruleId":"D1","level":"warning","message":{"text":"trajectory.validate_report (cyclomatic 30): trajectory.validate_report 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":"gym/tools/trajectory.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"59585245d3cd6c1027e26c4e51759265d1ff15b629ef421c9f238cf504610bdf"}},{"ruleId":"D1","level":"warning","message":{"text":"write-tools.prepareInsert (cyclomatic 30): write-tools.prepareInsert has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 6 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1023, 1000, 1031). 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: write-tools.prepareWrite (cyclomatic 33) 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b5238dbfc320b18817c95b868c48e13a9ed2c6bf39e99e8812547e588be94e"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.matchSegmentDp (cyclomatic 30): diff-engine.matchSegmentDp 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c7d02bf7705823aeee592694e4797c64bae4f6e3c4903b859c60dcf0928ad7"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderNodeContents (cyclomatic 30): CanvasKitLayerRenderer.renderNodeContents 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c793716eeed2525823b0a8e6e392b51cc564261739700dbdbac8e9fe10ca2da"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextRun::drawPass (cyclomatic 30): CanvasKitLayerRenderer.renderTextRun::drawPass 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderTextRun) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c298e7e9e2bc402178241e3d564c3bdf480de59d1db6b7944252fea0de14cff1"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-table.finishImagePlacement (cyclomatic 30): input-handler-table.finishImagePlacement has cyclomatic complexity 30 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 5 belong to 2 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4eae05ef0a8b7c619ba89b5056f0fe26a8f511935ba9592bb133420920b5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"PagePaintContext::publish_glyph_geometry (cyclomatic 29): PagePaintContext::publish_glyph_geometry has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (collect, publish, header_footer_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":"src/paint/paper_viewport.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c9c4bc26fedb922bf1b1efa388d7127863bddedff8af7664df15703caef9b"}},{"ruleId":"D1","level":"warning","message":{"text":"LenientCfbReader::open (cyclomatic 29): LenientCfbReader::open 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":"src/parser/cfb_reader.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6845a270baaa936fa3c86384c9f2928bcc3f6e5cc724bfef600771176aa4de1c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::advance_row_block_cut_with_row_offsets (cyclomatic 29): LayoutEngine::advance_row_block_cut_with_row_offsets 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":"src/renderer/layout/table_layout/row_block_cut.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b11bce3f95d15d982a5738ec30895c3c7a968e41b4818bdbf17349687ef50"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::compute_table_x_position (cyclomatic 29): LayoutEngine::compute_table_x_position 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5487341c0800cd7b585399c7e9abd1f78e06c7ee0ae23c96f9b5545728e2dd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::evidence::run (cyclomatic 29): rhwp::bin::rhwp-agent::evidence::run 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":"src/bin/rhwp-agent/evidence.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89ed7bca8c73619de018f35d4cb44f2a3da0798666ab796286013d8c0b6588f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::batch_fill::run (cyclomatic 29): rhwp::cli::commands::batch_fill::run 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":"src/cli/commands/batch_fill.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a7a7bb48b845e766e84ab70ff7bd86870ee37921103b471fed79666164a60"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_insert_text_in_cell (cyclomatic 29): rhwp::cli::commands::edit::cells::edit_insert_text_in_cell 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2902742bd1dc5777870010f3da58119fd618f3c17e686183f6ea2a7667e8e655"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_delete_text_in_cell (cyclomatic 29): rhwp::cli::commands::edit::cells::edit_delete_text_in_cell 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd78974d228e7f248f5e72019f7335d9ae2f2294ba15beafdebb572974ada1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell (cyclomatic 29): rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"132a055927871549554bb682863dbe414aaf6f3db1e63e5510730e3749754286"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::parse_redact_args (cyclomatic 29): rhwp::cli::commands::edit::privacy::parse_redact_args 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbed18507cbea262f9f26015391a4b52bab18819dc9896d1c7ecc800a7f5eb18"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_watermark (cyclomatic 29): rhwp::cli::queries::security_inspection::inspect_watermark has cyclomatic complexity 29 (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 shape REPEATS in the file: one other method here (rhwp::cli::queries::security_inspection::inspect_unicode) 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486549b1629879d91db7cd8bdaf40507cb31839184bfd38c41f32b05fcccdb0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_unicode (cyclomatic 29): rhwp::cli::queries::security_inspection::inspect_unicode has cyclomatic complexity 29 (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 shape REPEATS in the file: one other method here (rhwp::cli::queries::security_inspection::inspect_watermark) 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0dbb0ade5bb0787d337fc4754aeff7382fbf25685170ca7ab9a407cceb0091"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images (cyclomatic 29): rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images 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":"src/document_core/builders/exam_paper_images.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8349b786071d4862ed1e72691fe984b2109f04650269b64b64fe1e92116e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape (cyclomatic 29): rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_controls) 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7487f287370c22e2be8d8b3d203a47dcdc189dc79c0e664d1109c0b8900dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::materialize_object_attr_bit28 (cyclomatic 29): rhwp::document_core::converters::hwpx_to_hwp::materialize_object_attr_bit28 has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (walk_control, walk_shape, stamp, \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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cd7c19b1ab3c3ef6fab3d1c95aaebe49c8ac247593a32dbc3f66c537fb6779"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::shaping_paragraph::eligible_segments (cyclomatic 29): rhwp::renderer::shaping_paragraph::eligible_segments 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6158846aa69a7dc264f91fc3e09efb1588438a47874e7c82ee1f3298d59b4b24"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line (cyclomatic 29): rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line has cyclomatic complexity 29 (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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ef812a82300038ab11bc934c05fdbb85a57340b86aa746ae1863c5c6abfcc8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::table::fit_measured_for_host_with_storage (cyclomatic 29): rhwp::renderer::typeset::table::fit_measured_for_host_with_storage 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":"src/renderer/typeset/table.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba54805a21c3fb47900138cd20166622f9f125f31c68b52c6caae7f5163586"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.build_menu (cyclomatic 29): _gen_pack.build_menu 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":".claude/skills/rhwp-explore/references/_gen_pack.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70d067cb2009a20abe8186319a44342879fc6f4186d6bd3dc8410ddd30b4b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.parse_map (cyclomatic 29): _gen_pack.parse_map 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":".claude/skills/rhwp-knowledge-map/references/_gen_pack.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"df932e1f8de4a9fb768bcbcda7dcf558e9cd0d2aa50ac11abe19549f22cb9a69"}},{"ruleId":"D1","level":"warning","message":{"text":"differential.validate_report (cyclomatic 29): differential.validate_report 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":"gym/tools/differential.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5246036cd5488814ab4ad6ab0d2bde8a8172162481bc3beb37eace704eb48b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.statement (cyclomatic 29): Parser.statement 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f33b04e8ac79e9e103a3ac0f3a9735a1a26db37ac2213485ca13de7825fd00"}},{"ruleId":"D1","level":"warning","message":{"text":"ai-panel.formatSummary (cyclomatic 29): ai-panel.formatSummary 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d507f7adbba0df7a17a32279de50fe32845979bea7d19bb45e590c0a2b45a"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.cleanupParagraphAlignStepsToDiffItems (cyclomatic 29): diff-engine.cleanupParagraphAlignStepsToDiffItems 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce74d2513fee32edb1a1ee2ffe03d9f0b3586c0ce4a90b36e248ccf83ae78a93"}},{"ruleId":"D1","level":"warning","message":{"text":"MetafileFontSession.prepare (cyclomatic 29): MetafileFontSession.prepare 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fa12a6101077fb7a670f0b09194c9fe7ce2eddcf361222dba41a354aedd151"}},{"ruleId":"D1","level":"warning","message":{"text":"CursorState.comparePositions (cyclomatic 29): CursorState.comparePositions 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c925499f63444c28692d8e5dd13a23a606def58414602ca7855289f80fc749bf"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.replaceTextAtRaw (cyclomatic 29): input-handler-text.replaceTextAtRaw has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccce96e5b3af2d5e914a96751c9089ea723547f41dcc21c6cc2c7e9fb2e4e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"main.setupGlobalShortcuts (cyclomatic 29): main.setupGlobalShortcuts has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 989). 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":"rhwp-studio/src/main.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"38095c59c6a1e2fc8b71eac1cc42e6ebae6eb663818656cecdd25e22aaf1dd83"}},{"ruleId":"D1","level":"warning","message":{"text":"#runPageAction (cyclomatic 29): #runPageAction has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to 2 function items 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"026df742a1ea97a76a02bb1aa321869cfc31d7dfc504dd1deae38ea36e4d4e17"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartScales::new (cyclomatic 28): ChartScales::new 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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815bc082047343a8daee4b87979b1823a8daefbb8c1b008699f94bf0e1d5739"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof::add (cyclomatic 28): Proof::add 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed04ff9536e63927d7a4975212df18c691500604e1b8d56dd1d100fd39b5c99"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::create_table_with_options_native (cyclomatic 28): DocumentCore::create_table_with_options_native 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c383d8cbc8c4421ada04e87825cd6982bdb568e588f0945dff4cd7acdb95be7"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_table_properties_native (cyclomatic 28): DocumentCore::get_table_properties_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"570b379337bb47b25636f03c8a94838c769cfc30294cc4556a532e31b0a0ef7b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::scan_rowspan_block_step (cyclomatic 28): TypesetEngine::scan_rowspan_block_step 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":"src/renderer/typeset/table/scan/runner/block_step.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7995eaa2ced594b7dad7d636c5e01b9947fbbc260988b7334005f6304a85d48"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::scan_block_table_split_rows (cyclomatic 28): TypesetEngine::scan_block_table_split_rows 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":"src/renderer/typeset/table/scan/runner.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1abb6ba057cbff2178f2abb02e4b0560c2d1c870e59aa3213dac8963c188b5"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::render_image_with_sampling (cyclomatic 28): WebCanvasRenderer::render_image_with_sampling 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f816cc7a8e3a88682f374b4ec3b6e5d631b1c5f865c2c21b2250b5e54e1a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::fn_selection_rects::run (cyclomatic 28): rhwp::bin::rhwp-q::kit::fn_selection_rects::run 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":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb5b87e0c8654e2b9d127f6f8cdcd4316935c47db9f5412987b721d77a74155"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_char_format (cyclomatic 28): rhwp::cli::commands::edit::formatting::edit_apply_char_format 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0c855b12ea7d5d6561ea4b553ac420802db4eb5f3219e079526d0fcd8b35a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf (cyclomatic 28): rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3d83cc8e7a31a29f9717d018c99d91fc181beedfbe58c70794331ba41d22fd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::generation::build_from_ingest (cyclomatic 28): rhwp::cli::commands::generation::build_from_ingest 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":"src/cli/commands/generation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fc4a035627fb2d6de2600f8468bea4a6b14b8856a819858a28cc039cf60f16"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::table_to_csv (cyclomatic 28): rhwp::cli::outputs::tabular::table_to_csv 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a7cdea5f769d81df191631f6cf8b82ea69ed66cd033a6329306beccaa97a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::document::tac_cache_repair::physically_stale (cyclomatic 28): rhwp::document_core::commands::document::tac_cache_repair::physically_stale 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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aa6a2aa5024382e24ed0b8921ca21ea53816fd80799aee17d7503944a4b3ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::cursor_rect::find_cursor_in_cell_node (cyclomatic 28): rhwp::document_core::queries::cursor_rect::find_cursor_in_cell_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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9d0b239f52e1360a6987dcda21f759f75b19b7c7f55cbcf10e9ffc0dc9b30"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::collect_max_field_id (cyclomatic 28): rhwp::document_core::queries::field_query::collect_max_field_id has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a56bfa21b51fb23045b52a94f2c233cb64d1ca8125f1ba254f5c197b742d4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::structure::classify_clause (cyclomatic 28): rhwp::document_core::queries::structure::classify_clause 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":"src/document_core/queries/structure.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d289e9a6aecc8cf2458e2818c1d244fd4e1ae89a65c68db09a3e58250fbe4a9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::border_paint::encode_with_storage (cyclomatic 28): rhwp::model::border_paint::encode_with_storage 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":"src/model/border_paint.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c082810ba0dbace38b28e13ced138d75522dff7c0e3bb70b252598380adafd3a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::ole_chart::legacy_presentation::parse_inner (cyclomatic 28): rhwp::ole_chart::legacy_presentation::parse_inner has cyclomatic complexity 28 (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":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef16ffdd94e786cdd55895f1f58e0a2665aac082d4b168db64e3e4d13e9bc6e6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::resolve_stored_line_segs_in_frame_with_storage (cyclomatic 28): rhwp::renderer::composer::line_breaking::resolve_stored_line_segs_in_frame_with_storage 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5194}}}],"partialFingerprints":{"codehealthFindingId/v1":"011cd3370a446ed93c0b125d8ef9bfaf201c233450a5323d34bbfe6e59f35b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_next_page_placement (cyclomatic 28): rhwp::renderer::float_placement::stored_table_next_page_placement 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":"src/renderer/float_placement.rs"},"region":{"startLine":5724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c910849a598e4baf0c51add6965909fad212d285503434ccdc986e721269f5ce"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_outline_reject_reasons (cyclomatic 28): rhwp::renderer::layer_renderer::collect_glyph_outline_reject_reasons 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. This is NOT this file\u0027s highest cyclomatic complexity: VariantRejectReason::as_str (cyclomatic 47) 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":"src/renderer/layer_renderer.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b842b674a4e1cf06b5c2978f1789eedebf2211e2a03e8a5dc0c93a7de880db81"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::svg::generate_font_style (cyclomatic 28): rhwp::renderer::svg::generate_font_style 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::svg::known_font_filenames (cyclomatic 39) 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":"src/renderer/svg.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92d2a3966ffb735aeec43285ccbe4bf38369990b532766ce67edbb7df2f8656"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage (cyclomatic 28): rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage has cyclomatic complexity 28 (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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e5a850d112f19a313917f0e8957a0bf0cea78626c363b3206d1550d23d971"}},{"ruleId":"D1","level":"warning","message":{"text":"authority_ledger.build_ledger (cyclomatic 28): authority_ledger.build_ledger 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":"gym/tools/authority_ledger.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f253ae89a3eea223707654cca87f448992c1a9097f3adcf5293896b402232e0"}},{"ruleId":"D1","level":"warning","message":{"text":"competitive_bench.scorecard_emptiness_issues (cyclomatic 28): competitive_bench.scorecard_emptiness_issues 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":"gym/tools/competitive_bench.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57025216462b516d245cbcaba7b4ae69b6df6470950c3d8c1e90bfb681e54c6"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.buildGranularControlDiffs (cyclomatic 28): diff-engine.buildGranularControlDiffs has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"863b6744f0701e66c8c325348c4ff03ff75685181513aa13033c2d8fcfe8cf7d"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.makeSurface (cyclomatic 28): CanvasKitLayerRenderer.makeSurface 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe126672d4a04617b9af5bdcdbc89d20fc70198d44790e69a676648a7bf3dff9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentAgentController.revertTextCommand (cyclomatic 28): DocumentAgentController.revertTextCommand has cyclomatic complexity 28 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 11 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"349401fae91a7a4e1d03aab66e626004caacba37d4a628f9c686808ed7163601"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.finishPictureResizeDrag (cyclomatic 28): input-handler-picture.finishPictureResizeDrag 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56889aa2753a4ccd93d06847330f7e4922ca28ed2b538b010b7640a66d7f81c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_native_ffi::session::worker_output (cyclomatic 27): rhwp_native_ffi::session::worker_output 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp_native_ffi::session::rhwp_session_request (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/session.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e80d143eb4fa24b467ba5571283b9a55f739bdec26d0d5256aa08d12f166a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure (cyclomatic 27): rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c302d62dc6b8c5699115204a40d47b70f72bdedcd91076f790575f5eb4ab279"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::replace_text_in_cell_field_impl (cyclomatic 27): DocumentCore::replace_text_in_cell_field_impl 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9e5bb690f149a6c5ab02983f6b07715934deb0bebd67f3c18322c8de6fbb7e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::hit_test_in_footnote_native (cyclomatic 27): DocumentCore::hit_test_in_footnote_native has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to 3 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d74116f0e3ef3a4e67d15df3f387d95d33da5dc380526398c45829932b01f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_page_flow_image_ops_native (cyclomatic 27): DocumentCore::get_page_flow_image_ops_native has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d30e488a337de3c9b60834cade5ea78ba07442b63dd7eefb189238d653b36"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::row_children (cyclomatic 27): EqLayout::row_children 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":"src/renderer/equation/layout/symbol_spacing.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"37906e3fee89a8bee2928bf4ad166cd52db4283d5e8309e0cf29d99ad1f475f1"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::rowbreak_straddle_cut_units (cyclomatic 27): LayoutEngine::rowbreak_straddle_cut_units 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":"src/renderer/layout/table_layout/stored_span_content.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed3d4c4394a55b3823d095eb7ca31fff910d540a099eed42db6d8a18dfe13a5"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::saved_block_reset_opening_frame_height (cyclomatic 27): LayoutEngine::saved_block_reset_opening_frame_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21367}}}],"partialFingerprints":{"codehealthFindingId/v1":"895d52331c9256737488a8f5bdc9e5bee5e11d2ade90b8c737f0ecad87b5be86"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::paginate_with_forced_breaks_with_storage (cyclomatic 27): Paginator::paginate_with_forced_breaks_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"308c8770c73fa069e576ac3b268f473a31ae9c74e83614cbf7213987b33ae5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::piiscan::run (cyclomatic 27): rhwp::bin::rhwp-agent::piiscan::run 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":"src/bin/rhwp-agent/piiscan.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d5ce2e6025977132ef1cfd9fd72db2bcf11ca925461eaa6af96ea9c497e4dd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::conversion::convert_hwp (cyclomatic 27): rhwp::cli::commands::conversion::convert_hwp 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":"src/cli/commands/conversion.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc1c4ef1e38a56c02b3010e118b9bee66762ea4e7e834310121697c4503f238"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell (cyclomatic 27): rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell 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":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cedc61bd5443fc321a776caf5c5a351b0c89f64832c85ff0c9ee4cc8f156f25"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell (cyclomatic 27): rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b33ec3209e53cc7112bbf355edf53affd67ec3887449080c633d3e70179c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_cell_style (cyclomatic 27): rhwp::cli::commands::edit::formatting::edit_apply_cell_style 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"7947a0680c6bb2cd6273ed350caa62a89de4edc3a3e7fc956ed07349be66837d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template (cyclomatic 27): rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc2cd744e292821dd60791289eea830a813ba34fab85b9a81305aaebfe84a4f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_group_shapes (cyclomatic 27): rhwp::cli::commands::edit::shapes::edit_group_shapes 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"be54df6176e4b9678f639fa14909dba061d4b47c5094540eb1a44a02636afd05"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_verify (cyclomatic 27): rhwp::cli::protocol::exchange::settlement::cmd_settle_verify 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d241b988936218b6d3a1b61ab3fbe84d683190a91d2a3c0f9947fde9c0b52d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::harness::cmd_harness_wrap (cyclomatic 27): rhwp::cli::protocol::harness::cmd_harness_wrap 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":"src/cli/protocol/harness.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371b6bb3b21f02e28285c8190cb2b8f18cf8ce8f8314db879f7a0c1ccb99427"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::structured_objects::header_footer (cyclomatic 27): rhwp::cli::queries::structured_objects::header_footer 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":"src/cli/queries/structured_objects.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b51f9638cf3ffb57d9a81a076b96f2abcf2ca28522d2041674e01dc6adf5d23"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::doclang::adapter::geometry_pass::walk (cyclomatic 27): rhwp::doclang::adapter::geometry_pass::walk 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":"src/doclang/adapter/geometry_pass.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5875c6499e48eacea74a40e855ad88fa7c8e43c7b8d0e4596eeb4883e757ffdc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::plan_edits (cyclomatic 27): rhwp::document_core::commands::object_ops::chart::plan_edits 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a63303309d6a0124915c16450f1dc0a4ad09ba34ce059fce1bfc86906385c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mcp_serve::run_cli_tool (cyclomatic 27): rhwp::mcp_serve::run_cli_tool has cyclomatic complexity 27 (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":"src/mcp_serve.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedee26db52e95a4bb7bbc08bb68438bae2913df55f4456863b48180e68a5d53"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main (cyclomatic 27): rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main 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":"mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb663c1deb20bf8d7008ea9f0cfbb83cf48cf2f6fb998c48d146a92791ab44cd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::build_common_obj_attr (cyclomatic 27): rhwp::parser::hwp3::build_common_obj_attr 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc10377755a2e3fcbf07b00b167d8b4650037efe0bf82b6af181d32c59cd5781"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::content::parse_content_hpf (cyclomatic 27): rhwp::parser::hwpx::content::parse_content_hpf has cyclomatic complexity 27 (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":"src/parser/hwpx/content.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b09118d8a2b1c36fea37a7899d66ba63eb0cfff33f6ce1407938293ba506b03"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_tab_def (cyclomatic 27): rhwp::parser::hwpx::header::parse_tab_def 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":"src/parser/hwpx/header.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e56f1a45dbdeb3fdce2c6031c581d8f14e6675f99b09b7f8c84d45309b2434"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hp_chart_element (cyclomatic 27): rhwp::parser::hwpx::section::parse_hp_chart_element 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ba9c536e177c2b53ee502d6fb0468803d3f2cc02343d130d93ab211a4f55b1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::recognition::validate_table (cyclomatic 27): rhwp::parser::pdf::recognition::validate_table 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab09dce06889af50456a4b44cb8067399430e18bfab14d7caf8678e9dc30fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::order::for_paragraph_with_storage (cyclomatic 27): rhwp::renderer::typeset::controls::order::for_paragraph_with_storage 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":"src/renderer/typeset/controls/order.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acf59531f0a629e6d4703ea92ed3e993375390a1f4738286eac3baa47cc37c6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::doc_info::try_serialize_doc_info (cyclomatic 27): rhwp::serializer::doc_info::try_serialize_doc_info 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":"src/serializer/doc_info.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d223820513a2ae6d71623e319b4271885d742db8071ae6e4c4df793eacbba0"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.validate_session (cyclomatic 27): agent_session.validate_session 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":"gym/tools/agent_session.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18b41383efb52cbc3d00398740120031961040e87e46c05b90334b4f3600bac"}},{"ruleId":"D1","level":"warning","message":{"text":"leaderboard.render_markdown (cyclomatic 27): leaderboard.render_markdown 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":"gym/tools/leaderboard.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"611982217c011925b104e943eba7a6526121a0bfc294469651d49699489cc19c"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeOwnerTransport._poll (cyclomatic 27): NativeOwnerTransport._poll 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":"bindings/Flutter/lib/src/native_ffi.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf55b3276b4aa620ef7b7fee4e5fb3ee8ce70c99177f914c98839ed42e9da9d8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.imagePixelSize (cyclomatic 27): index.imagePixelSize 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b35f309c7d6778d23645ad9192e28e575efd346bc58022fe20f7ca4457b5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImageFromZipAsync (cyclomatic 27): thumbnail-extractor.extractPrvImageFromZipAsync 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"370851c482c920d930362c40b8a793a3413ae1534bee77875374aa85f908a0af"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImageFromZipAsync (cyclomatic 27): thumbnail-extractor.extractPrvImageFromZipAsync 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae51aae6fe69557810596a4a3a4308b008ffd2e2abb0e05a7956c1f6ab9bc93"}},{"ruleId":"D1","level":"warning","message":{"text":"background.extractPrvImageFromZip (cyclomatic 27): background.extractPrvImageFromZip 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":"rhwp-safari/src/background.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827b420588caf896d23adbf82263f2ec125731b59a0076dfd92cf7b6b246ead"}},{"ruleId":"D1","level":"warning","message":{"text":"host-font-requests.hancomEquationFamilies (cyclomatic 27): host-font-requests.hancomEquationFamilies 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e6e8ad15f26258272669b9fc3c0873d9c75cf6da1c68104480cc917e83d84"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmBridge.prepareDeclaredFontEnvironment (cyclomatic 27): WasmBridge.prepareDeclaredFontEnvironment has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab403c8b893f32e8f89d9c867c094643bfc74513c6ba1550e5c31280ee62d23f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp-dev.initRhwpDev (cyclomatic 27): rhwp-dev.initRhwpDev has cyclomatic complexity 27 (threshold 15). Of this number, 26 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"240ea5180564d621fb630339b7b5e8da5e7b37a228ed6eefdc7efc4ca2dbbe9f"}},{"ruleId":"D1","level":"warning","message":{"text":"static-svg-path-layers.parseStaticSvgTransform (cyclomatic 27): static-svg-path-layers.parseStaticSvgTransform 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"87270d7549153fa9d16f222fd00850907c725d21be774a3f04330334d843022d"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderColorPaintGraphNode (cyclomatic 27): CanvasKitLayerRenderer.renderColorPaintGraphNode 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26fce8d3d018199f2b8ed109c662f3007551ff2d61a8ef7d1e8e29c5a16b47c"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.refreshInvalidatedPage (cyclomatic 27): CanvasView.refreshInvalidatedPage has cyclomatic complexity 27 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8424788276bffa22e5675eb6487b74b0ba9f20ba7bf3c5d816652fec4cc8503"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-table.finishResizeDrag (cyclomatic 27): input-handler-table.finishResizeDrag has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8fcca4b212a11c213f669797849c9516fdae59ce465272e328fffc794776ab"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.overwrittenTextAt (cyclomatic 27): input-handler-text.overwrittenTextAt has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bafae8524d1af375e9b320abf5dc3c040c99d91e751f5cc2ee87c64ad4925c3"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.getParaFormatTargetsForRange (cyclomatic 27): InputHandler.getParaFormatTargetsForRange 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"120d56e97dcc4c3beae82b6c5517dd37136903ffc3090782fb8f04e8187275d4"}},{"ruleId":"D1","level":"warning","message":{"text":"#runTableAction (cyclomatic 27): #runTableAction has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to 5 function items 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b9921d97b6db845a9b25713cfaec4f0fa74b08e3d8ed6b1b8071feb3cb018"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::repair_reparsed_split_cell_cache (cyclomatic 26): DocumentCore::repair_reparsed_split_cell_cache 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":"src/document_core/commands/document/reparsed_split_cache.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7daf225e263b15eebbd6267963bc9d71cf65afae287c69dc6683528486b96"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::update_connectors_in_section (cyclomatic 26): DocumentCore::update_connectors_in_section 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":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb72f72de44b1dac3d492fc27fa1b92e7811c086abbfee3defd1e4d46188294"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::delete_text_in_cell_native_impl (cyclomatic 26): DocumentCore::delete_text_in_cell_native_impl 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b092e3cb914c0521afea0af6aa6c2029e5825933da42149fd16422dff8097"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_in_header_footer_native (cyclomatic 26): DocumentCore::get_selection_rects_in_header_footer_native has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 belong to 3 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b189f786d6bfc5ec48839edb62ba27dfaf79063b0b63eba26828a89f443e3d74"}},{"ruleId":"D1","level":"warning","message":{"text":"FontGlyphLowerer::lower_portable_glyph_run (cyclomatic 26): FontGlyphLowerer::lower_portable_glyph_run 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":"src/paint/font_glyph.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1b9498d9f7ae4ea94c233a7c21bd966f0f286b55edcd050d64daa716047b68"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlRenderer::draw_text_positioned (cyclomatic 26): HtmlRenderer::draw_text_positioned 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":"src/renderer/html.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3d0fc8473dbe8bcf935a641f1a9305c0fdd44471bbd690e1479ea319a9e783"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::add_footnote_superscripts (cyclomatic 26): LayoutEngine::add_footnote_superscripts 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232f0cab8a4b497f6cbc9858242a65c10882f5c29d457c88421368d514ae969"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_mixed_opening_cell_frame (cyclomatic 26): LayoutEngine::stored_mixed_opening_cell_frame 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":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fca83fd85532cb8a7277881ad658f82ad50288738202b4c2a6008c529dd9bc"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::should_defer_fresh_rowbreak_wrapper_prefix (cyclomatic 26): LayoutEngine::should_defer_fresh_rowbreak_wrapper_prefix 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28157}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c623ca9a294796cd2df7080ef9a13756c7819776844d5a636c9d3b25078718"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutFrame::try_carve (cyclomatic 26): LayoutFrame::try_carve 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":"src/renderer/layout_frame.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5504be04f3b6b638274839040a2811af5bbab9cf5baa457997b1944ca16d66e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::process_controls_with_storage (cyclomatic 26): Paginator::process_controls_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"68661a29ff0c14ded7cac63400041163f7196ebe2ef0f1cb10acdce54071fcb2"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::draw_char_overlap (cyclomatic 26): SvgRenderer::draw_char_overlap 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::svg::known_font_filenames (cyclomatic 39) 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":"src/renderer/svg.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1eb756950a900b6f1a21030cfe4549f13e5ae51da67a9f791f002b0108ccdd"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceFrameQuery::resolve (cyclomatic 26): SourceFrameQuery::resolve has cyclomatic complexity 26 (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":"src/renderer/typeset/table/scan/source_frame.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b14e1087e0176e8e3c126d070bf8346e1cd1d3e20ca13c31ff18bd10d85b6cf"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_char_overlap (cyclomatic 26): WebCanvasRenderer::draw_char_overlap 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1579bc725df6a801a1fec16623203fa6c337c353fff65aee13526f9c069d7db7"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGPlayer::ext_text_out (cyclomatic 26): SVGPlayer::ext_text_out 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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3456271986916e7c4de4ad2879c7417a43c34ead91c82a10cf7a4038afc7b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell (cyclomatic 26): rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell 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":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"27794d70778c872a92757bb04abbe78a303f0beab854e60fbef21f1f2558222c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_set_cell_props (cyclomatic 26): rhwp::cli::commands::edit::cells::edit_set_cell_props 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6609ddc73e3526a893c02d7102ebabb69cf975788265fcf5f58eb95122a3db"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_merge_paragraph_in_hf (cyclomatic 26): rhwp::cli::commands::edit::header_footer_content::edit_merge_paragraph_in_hf 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b25b0d2ab8810aac565e89c10b53bf0460a34deeaecd64a543b496bc02feb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_merge_cells (cyclomatic 26): rhwp::cli::commands::edit::tables::grid::edit_merge_cells 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"03575fd89e84036da4f23fc18df57c441431ac28fba38b8b6ae8b20e4ead7481"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_llm (cyclomatic 26): rhwp::cli::outputs::text::export_llm 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":"src/cli/outputs/text.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2003b50caf10ce10bc7d1936337c1cb0456db39ebaeaab78abc58f85986bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::lineage::trace_lineage (cyclomatic 26): rhwp::cli::protocol::capsule::lineage::trace_lineage 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":"src/cli/protocol/capsule/lineage.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e44bcefed423b730f852e5621e3895f44c5db344785a948bb5bfa619b204d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::document::initial_fields::process_para (cyclomatic 26): rhwp::document_core::commands::document::initial_fields::process_para has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document/initial_fields.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9606cbe9a3d973a8e376eb3626f078e1c22fb286c17a3c07996df422b9fbf0f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_topology::evidence (cyclomatic 26): rhwp::parser::pdf::table_topology::evidence has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d375c74175d7da0ec1426519a752aa7cd59d868c5fa51e7cd4cbd6bcb22054"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_empty_control_table_frame (cyclomatic 26): rhwp::renderer::float_placement::stored_empty_control_table_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f29be33116fc357aa44fe1a1cb9d7bd63acb6cedfd17cc09137f2b1141a19"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::build_fallback_row_col_x (cyclomatic 26): rhwp::renderer::layout::border_rendering::build_fallback_row_col_x 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cd086c90b6a5e710a5a00c4c181e5180e83410671b95980531d405c3ff05d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::reconstruct_nested_table_fragment_frame (cyclomatic 26): rhwp::renderer::layout::table_layout::reconstruct_nested_table_fragment_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"9882df7318daf94f603897dbe83904a3c11af70ccb79b0477f5cb012834a1a77"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::square_host_frame::stored_host_origin (cyclomatic 26): rhwp::renderer::typeset::controls::square_host_frame::stored_host_origin 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":"src/renderer/typeset/controls/square_host_frame.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6ad3fa93412fd4b8813d65ec655b020458caa92acb6b9b3cff480c4b693fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage (cyclomatic 26): rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1727e9d940264d6e558941b9073c2665a6e7452d99973265f17fd996e77ef3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::tools::font_metric_gen::parse_cmap (cyclomatic 26): rhwp::tools::font_metric_gen::parse_cmap 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":"src/tools/font_metric_gen.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"880c1b2e5ebde2eab814febe2e9f27d7355fedf61d7bf41b5d0f4fb9c0ba0d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"authority_ledger.classify_baseline (cyclomatic 26): authority_ledger.classify_baseline 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":"gym/tools/authority_ledger.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e042a405fd026c6a69900dee1c170bf9587f7940c51a43d49f62c334f4c4b44"}},{"ruleId":"D1","level":"warning","message":{"text":"background.extractPrvImageFromCFB (cyclomatic 26): background.extractPrvImageFromCFB 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":"rhwp-safari/src/background.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8253e800664b0e048c406ac456b54bc032591c811c3582df5d134846f30e4dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"action-runtime.tokens (cyclomatic 26): action-runtime.tokens 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bb1f2b233aef1c784c082abf55300e47012b5fdc76803845c479b3ae54b9ff"}},{"ruleId":"D1","level":"warning","message":{"text":"local-fonts.normalizeLocalFontRecords (cyclomatic 26): local-fonts.normalizeLocalFontRecords has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"420da71bbb234cea8e8a367773ec0800889aab87d59219454b5725d3123e7652"}},{"ruleId":"D1","level":"warning","message":{"text":"host-font-requests.collectHostFontRequests (cyclomatic 26): host-font-requests.collectHostFontRequests has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cd8e68fdb6a5b2417566ba1b391c03429cc5a42b679961477c6f56a53d76f8"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerResourceStore.hydrate (cyclomatic 26): LayerResourceStore.hydrate has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 29, resolve, a function literal at line 54). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/layer-resource-store.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72eed918c543e536e48c370ca301af72ae54d4511cb73454ec538412447f77c"}},{"ruleId":"D1","level":"warning","message":{"text":"anisotropic-image.drawAnisotropicPrintImage (cyclomatic 26): anisotropic-image.drawAnisotropicPrintImage has cyclomatic complexity 26 (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":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f171385b490e1b0e91a737ac1d5103451737ccda029dab9ad101c8c77d009826"}},{"ruleId":"D1","level":"warning","message":{"text":"image-header.parseJpegHeader (cyclomatic 26): image-header.parseJpegHeader 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"090a8f859afecdf3ca7d9dc456b9ce628ad2a9d9dc758ccb906cf647a7f80cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"page-renderer.collectLayerPlaneSummary (cyclomatic 26): page-renderer.collectLayerPlaneSummary 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"71339ff069ac64fc2c36028239749f4062f565687ab876cd035a3e12c5cfedae"}},{"ruleId":"D1","level":"warning","message":{"text":"DeleteSelectionCommand.constructor (cyclomatic 26): DeleteSelectionCommand.constructor has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8fe4e5757d9d3ed81e010ff8e8bd63607d4ed9602fcc5741a338e8f438f120"}},{"ruleId":"D1","level":"warning","message":{"text":"CompareResultWindow.highlightPreview (cyclomatic 26): CompareResultWindow.highlightPreview 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"058643ca0516f09e7bf52e780edb37c477fd9af38caec86a9cbed36f2cf5250f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 26): (anonymous) has cyclomatic complexity 26 (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":"rhwp-studio/public/theme-init.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"428110bae1d3175ca2c069e619fc3d09ca981186cfff326c082b931e99f874c2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_value_grid (cyclomatic 25): rhwp_ooxml_chart::renderer::render_value_grid 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9bf0b141dfb6b1d80d9d52ad048ac532551e4bb8ee040093c7c91ea8806c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::paragraphs (cyclomatic 25): Collector::paragraphs 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":"src/document_core/canvas_metric_requests.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd14792076a46c1b3b40bfdbce275e16e4e7e1c7543c1456c9ee220bcc0db15"}},{"ruleId":"D1","level":"warning","message":{"text":"Resources::prepare (cyclomatic 25): Resources::prepare 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":"src/document_core/commands/paragraph_block/import/resources.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf446fa044a0f5aefa2c3f5e45dd58e7852ee5f3fcc880deeef5934ba320ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_picture_properties_native (cyclomatic 25): DocumentCore::set_picture_properties_native 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad42c89f2c20ef186f616a15b75b0a88e32d0133a731672f237b429376fde0a9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::resize_table_cell_native (cyclomatic 25): DocumentCore::resize_table_cell_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"3306dec34cde35fc1471365f92dbfdeee2b2cbfca9918b85612e2942763f9cad"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit (cyclomatic 25): DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit 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. This shape REPEATS in the file: 4 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::find_cursor_in_node, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafea15fbd66f4acbc33ef6dd4f096bbfc5b242902c5a97e3add2f62ac0faf27"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_cut_plain_paragraph_contract (cyclomatic 25): LayoutEngine::row_cut_plain_paragraph_contract 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":"src/renderer/layout/table_paragraph_cut.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4fa5987ab04f3fdd0469f5579e93b7995612db45454aed5bae2ebc28cc1c2a"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializeContext::try_collect_from_document (cyclomatic 25): SerializeContext::try_collect_from_document 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":"src/serializer/hwpx/context.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b76e41ed7ca6f40cf60b467bd66b1bfe54b715e666ede483dc792eec3c260cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_insert_equation (cyclomatic 25): rhwp::cli::commands::edit::equations::edit_insert_equation 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"714eb27012914f050b058368e0d0f3331281fff58ef3656ca4d7fd1147dce51a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_column_def (cyclomatic 25): rhwp::cli::commands::edit::page::edit_set_column_def 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dd5c7417266f0afa9e20c91b6f7394f7d7f0fe33d7367242410d350c8fee0a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_resize_table (cyclomatic 25): rhwp::cli::commands::edit::tables::layout::edit_resize_table 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc10473aed49849a01738ad156659f2924738a2a69f593d63ab2aef4e201e5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::pdf::export_pdf (cyclomatic 25): rhwp::cli::outputs::pdf::export_pdf 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":"src/cli/outputs/pdf.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa3f133ce33205a884bee5c1650a205c10db65f06046132671e336f46be9f09"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::preview::extract_thumbnail (cyclomatic 25): rhwp::cli::outputs::preview::extract_thumbnail 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":"src/cli/outputs/preview.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3590950037c12b50be1cc9dc64cae23fa92d3944d8bd71a7b51439d8f345d50"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::bench::run (cyclomatic 25): rhwp::diagnostics::bench::run 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":"src/diagnostics/bench.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d33f66636c7c5ab762c25b6927f54fa46b9ba63c50ec3016ef4a11fc8e53ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::html_import::is_text_only_html (cyclomatic 25): rhwp::document_core::commands::html_import::is_text_only_html 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adf0a14e01dcd2915313b53025e60098c73ee64ce3446a0eb3775eaf686cc9d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::font_metric_coverage::analyze_paragraph (cyclomatic 25): rhwp::document_core::queries::font_metric_coverage::analyze_paragraph 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":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e40f7cc9e7e3bea36dd6b5e68b427dce511855234ff50b6a70f467e2c98d44"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::identity::walk::walk_ref (cyclomatic 25): rhwp::model::identity::walk::walk_ref 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":"src/model/identity/walk.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b325364a30667329f78264513784a2ffe499900998c108c0c40a3c5198f6e95"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::table_row_grid::visit (cyclomatic 25): rhwp::model::table_row_grid::visit has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table_row_grid.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf5ed2ebbeed3dd6c677bf84f26079821b6128e34be9b1527dd34262191a726"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::body_text::parse_paragraph (cyclomatic 25): rhwp::parser::body_text::parse_paragraph 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":"src/parser/body_text.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8db109d1683946075c275f04b804d3939bcebe63b85a17dba768c253dc4d55"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::pdf::issue7998::local-regions::generate_sources::main (cyclomatic 25): rhwp::pdf::issue7998::local-regions::generate_sources::main 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":"pdf/issue7998/local-regions/generate_sources.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a200b4ed327b76be31bef73c921691e96e52e443c545792bd7ee27ead1a649a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::shrunk_cell_horizontal_padding (cyclomatic 25): rhwp::renderer::composer::stored_cell_reflow::inc::shrunk_cell_horizontal_padding 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820e6e4d61fae0d201b07926816158ed9c4e562b2d267e10f29d98114239265"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_inline_content_frame (cyclomatic 25): rhwp::renderer::float_placement::stored_inline_content_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e8b0b155244b438c67b5619d8f96f636c99fcbe7d527a443c561af006566c4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_editor_tail_frame::stored_editor_tail_frame (cyclomatic 25): rhwp::renderer::float_placement::stored_editor_tail_frame::stored_editor_tail_frame 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":"src/renderer/float_placement/stored_editor_tail_frame.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"be35871a7ca9eead1f95bc649571ef6b58e40778978ce02d4e3f03390d8a381e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement (cyclomatic 25): rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement 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":"src/renderer/float_placement/stored_header_frame.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bf9b6c66b5b01b67ce15f9331f45f3dbf3a7fa049e961cf4d684af640bcbf5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage (cyclomatic 25): rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc74b6b4649650e13fc4b16e76a32b59333d5f2a7349a2666462fcbf1487a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage (cyclomatic 25): rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd8ef2087099888cb0fbe43d6a09b901b8114b18539be382f31e30d8a22f6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::inline_flow::plan_square_table_host (cyclomatic 25): rhwp::renderer::inline_flow::plan_square_table_host 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":"src/renderer/inline_flow.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67a392280ea56888d522524a2ab7f2263255118943ec99f9cf7e59099356a12"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage (cyclomatic 25): rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage 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":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d5d7987f2960002ce539d06c8bb4018fc30ebd4bf43f3a7dd16dd0a13c14ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::static_svg::static_svg_attribute_value (cyclomatic 25): rhwp::renderer::static_svg::static_svg_attribute_value 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":"src/renderer/static_svg.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3eae1e256e6371fc3fdbb548bfafa07bb9ac891c4477ec2dfccf55868e7de6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::svg::svg_outline_font_face_data_impl (cyclomatic 25): rhwp::renderer::svg::svg_outline_font_face_data_impl 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::svg::known_font_filenames (cyclomatic 39) 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":"src/renderer/svg.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa7e1868a426eafeb59bffd4e984f97d98a1773a217f09e9bdc4d6f9561440"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_fit::prepare (cyclomatic 25): rhwp::renderer::typeset::controls::tac_fit::prepare 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":"src/renderer/typeset/controls/tac_fit.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2059b68e836fbfb9c24999b300e2fd365fbcd0028f5da15a35e46bbd8d73c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_footnote_reset_fragments (cyclomatic 25): rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_footnote_reset_fragments 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":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"10693d0b12e39e3daceae92a311bf85187f718627ea3e770cf6ff5c265c73915"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::scan::scan_lines (cyclomatic 25): rhwp::renderer::typeset::paragraph::scan::scan_lines 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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc9cf96bc4e1cbe2152550600bb677a696381487913b5cb1a070096c7a54820"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::body_text::try_serialize_section_inner (cyclomatic 25): rhwp::serializer::body_text::try_serialize_section_inner 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":"src/serializer/body_text.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"817a890e76c71f7654a36bf97588171e90eda1e82203f34eb56c7f91f1f4db57"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::package_check::check_package (cyclomatic 25): rhwp::serializer::hwpx::package_check::check_package 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":"src/serializer/hwpx/package_check.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49d0fbb627dd0668869c038c784ee2b21d82ef8fcfbf6a0e748946d4c2d405f"}},{"ruleId":"D1","level":"warning","message":{"text":"batch_convert::bin::mock_rhwp::run (cyclomatic 25): batch_convert::bin::mock_rhwp::run 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":"tools/batch-convert/src/bin/mock_rhwp.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f572e0e5ffa32c518fd87cd163923b2339795d79c8e518d6b17ca6a722bab59"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.pick_canonical_for_heading (cyclomatic 25): _gen_pack.pick_canonical_for_heading 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":".claude/skills/rhwp-knowledge-map/references/_gen_pack.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5f2599c641f09076075bb21884dc39ff5e51bf4857b5fe2ef03107981ff5c"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.format_human_report (cyclomatic 25): audit.format_human_report 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":"gym/tools/audit.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aab73af330e5b9f3c7329847bda6a0ef060ff44f63c5d38e8b70f69c0ed5ec"}},{"ruleId":"D1","level":"warning","message":{"text":"competitive_bench.render_report (cyclomatic 25): competitive_bench.render_report 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":"gym/tools/competitive_bench.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09b2185f93e7261ce34d48f20a7377c4ad7eae6b813e0084ddb626a0a1f932e"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzz_corpus.fuzz (cyclomatic 25): fuzz_corpus.fuzz 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ddc7a31f5e995060512afcaa77f14fec44cdf012ccc6b904eb68dc21200e5"}},{"ruleId":"D1","level":"warning","message":{"text":"leaderboard._cmd_verify_body (cyclomatic 25): leaderboard._cmd_verify_body 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":"gym/tools/leaderboard.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7912ad054b9d386e3ced9fe39dde4d00fd14d4d0bcc4f4ddd64958ce2c5ac123"}},{"ruleId":"D1","level":"warning","message":{"text":"Palette.pick (cyclomatic 25): Palette.pick has cyclomatic complexity 25 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 12 belong to 4 function items 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":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd82d6ac5747a5be63c12a8759bbd5c0751302127729e556ad0eb3461239f57c"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-loop.runAgent (cyclomatic 25): agent-loop.runAgent has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items 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":"rhwp-studio/src/ai/agent/agent-loop.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"869f729ee243d8f6ff037176a002f1b6359b82a3a7504e49de97453009798ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.scoreControlFallback (cyclomatic 25): diff-engine.scoreControlFallback 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747efc8a52b6059d9367ff8aa92cd3b729bf524e83b245006a2718452a915b4"}},{"ruleId":"D1","level":"warning","message":{"text":"sfnt-face.repairMinimalFormat4Length (cyclomatic 25): sfnt-face.repairMinimalFormat4Length 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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd554e5010c5f7892e0e955b8a71d0a2ed82042a0cb08fdc67137719f2f205e9"}},{"ruleId":"D1","level":"warning","message":{"text":"font-substitution.fontFamilyCandidatesForDisplayWithRules (cyclomatic 25): font-substitution.fontFamilyCandidatesForDisplayWithRules 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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e987033c73ad902a61619bc3672fa1ff4e28aa5cb89d0d5f7db78067399494"}},{"ruleId":"D1","level":"warning","message":{"text":"anisotropic-image.drawPrintFrameImage (cyclomatic 25): anisotropic-image.drawPrintFrameImage has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"71545fc8c2f04aa89b56da4ae338c4be0846610ede3c22aa014f0cbe30a0d704"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderPage (cyclomatic 25): CanvasKitLayerRenderer.renderPage 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"539a205716f8052ba0b9be438c895cd50a11a99b35c709b0e7463959c55f5e61"}},{"ruleId":"D1","level":"warning","message":{"text":"flow-image-clip.collectFlowImagePaintOps::visit (cyclomatic 25): flow-image-clip.collectFlowImagePaintOps::visit 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e2ace1e380b823a19ea309ace0a9dbb42670d241f100c64e9d6e4f6bd1ec06"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplyCharFormatCommand.executeFormat (cyclomatic 25): ApplyCharFormatCommand.executeFormat has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 2 function items 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5fc636f18f74fb5045a65e161a3603affb8947eb7674683a837e1540c4f26"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.handleShiftF11 (cyclomatic 25): input-handler-keyboard.handleShiftF11 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5332794e01818cb721cb62e775b7a7659470fddda8729591a9a9bad10e3a6791"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.updatePictureResizeDrag (cyclomatic 25): input-handler-picture.updatePictureResizeDrag 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfebbb0741b49ce695d5fc1e585f0f529fcc679b6ec952b33dc2e32aebaaec93"}},{"ruleId":"D1","level":"warning","message":{"text":"selection-text.readSelectionText (cyclomatic 25): selection-text.readSelectionText has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 3 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":"rhwp-studio/src/plugin/selection-text.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06d7779e785cb675a609cf4a5d5a2bdb2164599435fa4fa4a14ce50db7ef025"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifyArgs::parse (cyclomatic 24): VerifyArgs::parse 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":"src/cli/queries/verification.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6225385eefb60e22b88ddaf55dfd8626b3e945eeb642a5e7e7af19e50ef88a"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::drain (cyclomatic 24): Scan::drain 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":"src/document_core/commands/paragraph_block/validation/resources.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a615d73a30e727a6672d7ad8e2d5297b49d377dac1fabe1eea90dc2d07ea8c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::paste_html_at_caret_native (cyclomatic 24): DocumentCore::paste_html_at_caret_native 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda748e66055af9d7d90504e32b29dddd63a667332dc1393b36e639883605e3"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::move_vertical_by_path_native (cyclomatic 24): DocumentCore::move_vertical_by_path_native 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"94445cdea82d98934d4d9dc1f927a67a061915a614e04d855e0c3e4fc2babd4c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::collect_layer_hyperlinks (cyclomatic 24): DocumentCore::collect_layer_hyperlinks 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":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e151ad26e85cefed34f8fa0954485e3d109b82a3851f27ac07bdad31c3ab84"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_section_def_json (cyclomatic 24): DocumentCore::apply_section_def_json has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f5c8b87a4f20d83ac7dcf615b2418e92d2022c4cac21dafac2c9871da6915c"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next (cyclomatic 24): Lexer::next 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":"src/eps.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc1b2bd15abd588c793ec141e0131e26e34f048c3bfeca9c263027ac861b2f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::restore_stored_cell_frame_widths (cyclomatic 24): Table::restore_stored_cell_frame_widths 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":"src/model/table.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f09fc9357a117cafe25b68229bbdf9a836cccf3f1ea6598d669dda630ce5ca"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::finish_named_scripts (cyclomatic 24): EqParser::finish_named_scripts 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":"src/renderer/equation/parser_left_scripts.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8811303f7cde08c22be550ea767ec8fc29ac4f9911d1f7f00eaba98759f8b"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_script_span (cyclomatic 24): EqParser::parse_script_span 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":"src/renderer/equation/parser_script_operand.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdaf91abd7658b7cf4c5bca372b1d6faf80333df874e52108124e699ab7f77a"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedTextMeasurer::estimate_text_width_exact_with_storage (cyclomatic 24): EmbeddedTextMeasurer::estimate_text_width_exact_with_storage 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f114c641f60febaba6eca8d1ef6e07218465d6c61c3c6144392850aff2990036"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedTextMeasurer::compute_char_positions_with_hft_tracking (cyclomatic 24): EmbeddedTextMeasurer::compute_char_positions_with_hft_tracking 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b549b5176e5802daf1dfe4223c164f8af4ef39b7f80f71b5dd8a4ac916e4af59"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::calculate_shape_reserved_heights (cyclomatic 24): LayoutEngine::calculate_shape_reserved_heights 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5027}}}],"partialFingerprints":{"codehealthFindingId/v1":"96be48dd84d78f76d383c1bc904081963c8d82d85e11eae3247b8ac814ba6911"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::straddle_page_band_relief (cyclomatic 24): LayoutEngine::straddle_page_band_relief 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":"src/renderer/layout/table_layout/rowspan_fragment_height.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fc627f66c13a3809224f3378746dccdce0d5f073d2e33874e615bef5a16d50"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::native_first_line_restart_cut_closes_frame (cyclomatic 24): LayoutEngine::native_first_line_restart_cut_closes_frame has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/renderer/layout/table_layout/stored_first_line_restart.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6006d4870300959cf9bd74d1168cadebc45880b3f5469c494db6908abe4f6f26"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_inline_picture_closing_row_height (cyclomatic 24): LayoutEngine::stored_inline_picture_closing_row_height 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":"src/renderer/layout/table_layout/stored_inline_closing_frame.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb300d271be7d990b5959318bcb17c95c9cda343a9358469d8b99749097c8dee"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_row_reset_closes_declared_frame (cyclomatic 24): LayoutEngine::stored_row_reset_closes_declared_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b1a3ec6b14d2f76ce7936ff9e2b1637d93db2ea91fd2c4eacc9cfb1a274d75"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_page_reset_cut_trailing_trim (cyclomatic 24): LayoutEngine::stored_page_reset_cut_trailing_trim has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf423a3d3869cb8b3af2bf4b3a58eccc26dafec829b0cf9fa80726f8e02a86"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_row_first_restart_is_joint (cyclomatic 24): LayoutEngine::stored_row_first_restart_is_joint 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19656}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c75515818d6484e78d095012cd5a9a3741329d703c14c5b281825d611b4ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_full_width_row_source_height (cyclomatic 24): LayoutEngine::stored_full_width_row_source_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12f60aa9273156915a3049aa8b894a268bea3e84f313408c2215f5dceaf2479"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::table_subtree_blocks_cursor_probe::paras_block (cyclomatic 24): LayoutEngine::table_subtree_blocks_cursor_probe::paras_block 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e2ef69dd953c9cd796a2bce4b8305b8a7f927e7cb4b9bfd80e27c7c1419dd"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::relocate_float_anchor_lines_below_band (cyclomatic 24): LayoutEngine::relocate_float_anchor_lines_below_band 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":"src/renderer/layout.rs"},"region":{"startLine":11400}}}],"partialFingerprints":{"codehealthFindingId/v1":"755ed621897abe89bf3e640fae99c21a8f5b04650665d2924bfa5e59a0d09e70"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::step_block_table_fragment (cyclomatic 24): TypesetEngine::step_block_table_fragment 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":"src/renderer/typeset/table/continuation/fragment.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f476f8e3815d8c507e3dc6fcf781ab978dbade828cefd52f0d54081a1fce526"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_path_with_gradient (cyclomatic 24): WebCanvasRenderer::draw_path_with_gradient 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9e0d93a30b34a521c15b556be8576daa592c0dd0fe5901685589ffc455d1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::more::probe::collect_stats (cyclomatic 24): rhwp::bin::rhwp-q::more::probe::collect_stats 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":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed0bc8d17fbb0d4ec484524287abad660ee669b8a871090a5e85df940be73ab"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::conversion::export_hwpx (cyclomatic 24): rhwp::cli::commands::conversion::export_hwpx 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":"src/cli/commands/conversion.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"20030b16562dcdd53460e4b252affc8ee6617203a70b5526f92fc8607c86fc0d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_insert_number (cyclomatic 24): rhwp::cli::commands::edit::document_objects::edit_insert_number 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ba9623621bb13558978c1d16209d0c82e56e7ba1cb5b62e7f2e765aa59d17a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_form_value (cyclomatic 24): rhwp::cli::commands::edit::document_objects::edit_set_form_value 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"af98c247a6005cf358b4ad6f421d68ecd91b477bbd36992d046a86f2cc7c2f80"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_page_break (cyclomatic 24): rhwp::cli::commands::edit::document_text::edit_insert_page_break 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_insert_column_break) 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6548174c8a80658c69dec6f8f1d2f1d3001bb134c40cfa1e014f2e0b6f8b4809"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_column_break (cyclomatic 24): rhwp::cli::commands::edit::document_text::edit_insert_column_break 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_insert_page_break) 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae0bff804ad6f0001a48367b1fcc0911fa295215bf5080f7fca68c96827a0b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_para_format (cyclomatic 24): rhwp::cli::commands::edit::formatting::edit_apply_para_format 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7024927d37a0a34049b0526368553c533244e2991fd5199b5c4fa10ede9716"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_delete_header_footer (cyclomatic 24): rhwp::cli::commands::edit::header_footer_content::edit_delete_header_footer 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1f14f57e580b8dc1a8563c20a9942e694a8650dd104c01d12d3a9b596b846f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_apply_para_format_in_footnote (cyclomatic 24): rhwp::cli::commands::edit::note_content::edit_apply_para_format_in_footnote 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d4372869eadf7ad606a443bc46613425446fd35976be592abac9577ffdc066"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_page_hide (cyclomatic 24): rhwp::cli::commands::edit::page::edit_set_page_hide 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a1f5bf86cb0b59247a3bee921d3c184794b2ac31089fd311fbc8df9e6c1b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_set_column_widths (cyclomatic 24): rhwp::cli::commands::edit::tables::layout::edit_set_column_widths 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2f5ef56498d3e1854a9effa526125a05fc07c0a1b2e3b1ffc285272a2492c5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_resize_table_cell (cyclomatic 24): rhwp::cli::commands::edit::tables::layout::edit_resize_table_cell 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99145cfe322e74d306e9af293b111dacf50278a8a1b854a1dc4654deceb853f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::doclang::export_doclang (cyclomatic 24): rhwp::cli::outputs::doclang::export_doclang 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":"src/cli/outputs/doclang.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd7023e9f4156ef6173bc1da816ff55aff85b1f3472d832b50c05949aa44a3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::plan::cmd_run_plan (cyclomatic 24): rhwp::cli::protocol::plan::cmd_run_plan 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":"src/cli/protocol/plan/mod.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edbec550e9e70ef9e4479ba7efac6f283ddc248a82fbc64412d31817130ce35"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::check_stored_line_escape (cyclomatic 24): rhwp::diagnostics::layout_anomaly::check_stored_line_escape 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfdbc8b4bc6f355f732cc8d3aa211afbdefd9ce184be92ea782419cee6c662a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::doclang::eqedit::lexer::lex (cyclomatic 24): rhwp::doclang::eqedit::lexer::lex 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":"src/doclang/eqedit/lexer.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6c2c409583f571ca8d58b2f51066cf00a25bd4ca404bb4b9f096b765ac3b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::doclang::writer::otsl::write_table (cyclomatic 24): rhwp::doclang::writer::otsl::write_table 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":"src/doclang/writer/otsl.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1e7f181a78464f66edcf9809ca8ef8f7ed63b2d69136bee13b8bc2a8f908c6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::template::validate_source_fill (cyclomatic 24): rhwp::document_core::commands::paragraph_block::template::validate_source_fill 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":"src/document_core/commands/paragraph_block/template.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c481ef57df6261fbc76b58baa604bd7d4fbf8e660ec1e7070aa68298ffc359da"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_css_border_shorthand (cyclomatic 24): rhwp::document_core::helpers::parse_css_border_shorthand 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":"src/document_core/helpers.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177767b377aced69012a68943cfdbd6131470a5740952ffcbdc5c7ea661101a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-672::probes::inspect_task672::main (cyclomatic 24): rhwp::mydocs::tech::investigations::issue-672::probes::inspect_task672::main 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":"mydocs/tech/investigations/issue-672/probes/inspect_task672.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfacfd49d229363403eb2e12c0dcf304d4967257bd9a39a889690a52f002f46"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::control::parse_form_properties (cyclomatic 24): rhwp::parser::control::parse_form_properties has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"03404bb5825acedfacd3ec16e5abc59a1e53ca11b163a5f1103a39c8b3f83cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_sec_pr_children (cyclomatic 24): rhwp::parser::hwpx::section::parse_sec_pr_children 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":"src/parser/hwpx/section.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9e8bb22d7c312e2825cced552033a571a7e58a6d20cc44aada04f4227f5e66"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::read_text_content_with_tabs (cyclomatic 24): rhwp::parser::hwpx::section::read_text_content_with_tabs 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dfaf12b0ff44c09b507c0fe07e0aae1d15dc67ad5c530378d54fcb18c10678"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage (cyclomatic 24): rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage 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":"src/renderer/composer/nested_table_frames.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86abbcfabdf4fc43d17f07b0c0f59589b6bf0fceee530b4013283b6cae04516"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_alpha::print_alpha_payload (cyclomatic 24): rhwp::renderer::image_resolver::print_alpha::print_alpha_payload 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":"src/renderer/image_resolver/print_alpha.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e48209ee0a8769b6e6028a938febc297629eb300c78fa719ae54e255657db01"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_codec::print_device_image_payload (cyclomatic 24): rhwp::renderer::image_resolver::print_codec::print_device_image_payload 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":"src/renderer/image_resolver/print_codec.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7640613287fe9b2b03ea26a001988bf5d149bae5c9514150de10e3e08f48c68"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::raster_stroke::raster_line_geometry (cyclomatic 24): rhwp::renderer::raster_stroke::raster_line_geometry 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":"src/renderer/raster_stroke.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a5d0aa627f39e06c5ed4cc6be43cf9d28da304f598f033bdc941d3b39e7edd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::shaping_paragraph::explicit_instance_segment (cyclomatic 24): rhwp::renderer::shaping_paragraph::explicit_instance_segment 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad080e558dd857143830ac14cd71b7eb0718f90b0747b48175443c1351226d01"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::static_svg_raster::prepare_static_svg_raster (cyclomatic 24): rhwp::renderer::static_svg_raster::prepare_static_svg_raster 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":"src/renderer/static_svg_raster.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f900d5e1ab172830c5cb1d6daf445db165cad1edd9de4beb9ca4f54c85675a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::boundary::internal_vpos_page_break_line (cyclomatic 24): rhwp::renderer::typeset::paragraph::boundary::internal_vpos_page_break_line 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":"src/renderer/typeset/paragraph/boundary.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0e6922667c929c2a15168b3b1b946347a2107c6c4fd45194b6ad757d19d95"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::whole_fit::inspect (cyclomatic 24): rhwp::renderer::typeset::paragraph::whole_fit::inspect has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/whole_fit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d732d4b598449a4bd135dabf6ab6c8856d7c725b6369a82d650a6e613389fb38"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::shape::write_fill_brush_with_storage (cyclomatic 24): rhwp::serializer::hwpx::shape::write_fill_brush_with_storage 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":"src/serializer/hwpx/shape.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e9964af977c46cd929b81b180deef7cbaaa4a084512eb3d17f67775b6ae767"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence_html._pack_statistics (cyclomatic 24): evidence_html._pack_statistics 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":"gym/core/evidence_html.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c34eeaa85bd905cf6c8378ac231efe6f9137f9964e18c147546da0a206c4eae"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.exception_kind (cyclomatic 24): runner.exception_kind 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":"gym/core/runner.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"463304ad34e9310f5b7cec7f37f407edf283c9f488aa07570df9484d8b58e6cb"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.score_session (cyclomatic 24): agent_session.score_session 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":"gym/tools/agent_session.py"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fef113f6a24f349ea9febc37b4071d2b1885c2f8000d9cd4012e420336c298f"}},{"ruleId":"D1","level":"warning","message":{"text":"release_diff.validate_report (cyclomatic 24): release_diff.validate_report 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":"gym/tools/release_diff.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"2059a1aa1f1ce7e1704c954caabfa0eaa2b74682251096106db0d5116f74c5a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp.__wbg_get_imports (cyclomatic 24): rhwp.__wbg_get_imports has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 15 function literals inside it that branch (lines 14108, 14134, 14140, \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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":14105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b7962a595f9c67b568e04544c5bb9294f9fd1e9fea3a06f8848736ccf69071"}},{"ruleId":"D1","level":"warning","message":{"text":"navigation-keymap.getNavigationAction (cyclomatic 24): navigation-keymap.getNavigationAction 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":"rhwp-studio/src/engine/navigation-keymap.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92174f73fe20bd772273e85888967e848b4170ac2a4918599b3640fa7ad7b2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.matchWindowedGreedy (cyclomatic 24): diff-engine.matchWindowedGreedy has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f0b48f973fe4eb8b768059ca0b34aed706eccc6e258a51c68ebbf1d0f60db2"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.buildControlDiffs (cyclomatic 24): diff-engine.buildControlDiffs 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6740ab5d34fdd62c7b38d73660c962bd8f77d4a931a404f59ff9d180e12ef083"}},{"ruleId":"D1","level":"warning","message":{"text":"chart-data-target.matchesOne (cyclomatic 24): chart-data-target.matchesOne has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"871604605ec2d53af36fc9057530eeacb4c76132cc55ecceba23f208adf81a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"bounded-response.readBoundedResponseArrayBuffer (cyclomatic 24): bounded-response.readBoundedResponseArrayBuffer has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"rhwp-studio/src/view/canvaskit/bounded-response.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b8692b88415b7676afd505f7ce4fb9559f0786f22ae0b37c5bd69888da5e85"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageRect (cyclomatic 24): CanvasKitLayerRenderer.drawImageRect 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e7236c708900721362f1f03243ea8e369b287a2b6f0cd435567110b3c85ac"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell (cyclomatic 24): CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderCharOverlap) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"31541409a05bf84b76045b32f725c267a3db02bdc727df3024852683c603108b"}},{"ruleId":"D1","level":"warning","message":{"text":"CursorState.moveCellSelection (cyclomatic 24): CursorState.moveCellSelection has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2608299997afd9ab0483ca80d12c58760ba862bd2b6ed577f36195f888a0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-hyperlink.followHyperlinkClick (cyclomatic 24): input-handler-hyperlink.followHyperlinkClick has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 belong to 5 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f84f036cee219db1c387514ec2fe204cce2b3ccb011a1e9cde95a3a7efa7e"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.onCopy (cyclomatic 24): input-handler-keyboard.onCopy 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c4eefec67e312f050f7ddaa0b3cce5cd93f32a875c4e0e589f6f7f4260474"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-mouse.handleResizeHover (cyclomatic 24): input-handler-mouse.handleResizeHover 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c8a3531c6136ab3bd28416f431a43b926548fd5a4c214e150308da66f03d9"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.insertDroppedImageAtClientPoint (cyclomatic 24): InputHandler.insertDroppedImageAtClientPoint has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a2b816e787b6a738a3f7c81d09da39290e490e69198d26df01e26ba1ef5d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"StyleEditDialog.onConfirm (cyclomatic 24): StyleEditDialog.onConfirm has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 belong to 2 function items 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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5b827497487aa60269d0a071ceb4db5918033b9eb41ee93536cd302feff814"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer.renderOutlineTree (cyclomatic 24): viewer.renderOutlineTree has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1196, 1176). 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be7ffd5574d7beaec8318e8163288a5e00184312aef5261ff5191a5ca35a1aa"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::parse_inline_content (cyclomatic 23): DocumentCore::parse_inline_content 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3360855333219ebca87bb4395c8d09998c4fa9cd7e6797748ea43059033a9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_nearest_control_backward_native (cyclomatic 23): DocumentCore::find_nearest_control_backward_native has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (classify_control, find_in_para_before, find_last_in_para). 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. This shape REPEATS in the file: one other method here (DocumentCore::find_nearest_control_forward_native) 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2578fdca695c4f58445333db0f4182a68d60fe1d89b8ec36fb9d2b22701c844"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_nearest_control_forward_native (cyclomatic 23): DocumentCore::find_nearest_control_forward_native has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (classify_control, find_in_para_after, find_first_in_para). 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. This shape REPEATS in the file: one other method here (DocumentCore::find_nearest_control_backward_native) 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5765}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfe3fe3e337fa755aad31f0ab74ad757fd91c9b42665f35b8c416ca851267d6"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_pages_for_paragraph (cyclomatic 23): DocumentCore::find_pages_for_paragraph 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6013}}}],"partialFingerprints":{"codehealthFindingId/v1":"914133903d2f779bc08c461abe87a2e2cd81489cd4f8a432b958771747c51c42"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::hit_test_native::collect_runs (cyclomatic 23): DocumentCore::hit_test_native::collect_runs 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. This shape REPEATS in the file: one other method here (DocumentCore::hit_test_native) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f2825373c293d6992f9111c59cb810ba976d163b39eaec467bbc154eca4a3"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_page_border_fill_native (cyclomatic 23): DocumentCore::set_page_border_fill_native 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3721}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eb311338764448f0b749989817fc124c242ae5d1a7a3eb2116492750b9a11b"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendOverrides::apply (cyclomatic 23): BackendOverrides::apply 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":"src/parser/pdf/policy.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb358e86ea14a9bc958d27fa5ab3547a6bf283e7f55733dee924ea08f603e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Ledger::observe (cyclomatic 23): Ledger::observe 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a998d03c8ecb296802577ec3d19ef444c557ec6c2544407b84248c06b65d79"}},{"ruleId":"D1","level":"warning","message":{"text":"Ledger::candidate (cyclomatic 23): Ledger::candidate 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4db2b2d5799542e8f12deb00e00f05490974d2ed483aba494eb85b310a89f3"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_wrap_around_paras (cyclomatic 23): LayoutEngine::layout_wrap_around_paras 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":"src/renderer/layout/square_host_flow.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"415fa9eea87e63a30db82ffd7c8ea04fb96bcae8dcdc9d738296924a825e33f9"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::reflow_cut_content_height (cyclomatic 23): LayoutEngine::reflow_cut_content_height 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":"src/renderer/layout/table_layout/reflow_fragment_content.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b14f896924d9652f56cf59929291065a19e9daeda9e0e1a2d912938e0e0e784"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::build_render_tree (cyclomatic 23): LayoutEngine::build_render_tree has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (expand_clip). 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":"src/renderer/layout.rs"},"region":{"startLine":4850}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e45cc84f77840984a30e40195110794b2b15804c97d1a14fcade5ba6547235d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::prefill_before_deferred_table (cyclomatic 23): TypesetEngine::prefill_before_deferred_table 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":"src/renderer/typeset.rs"},"region":{"startLine":6570}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cafac8b4c3abb71dfec4095bc03e572d494cd34c231e69bd2de6b04331cfc5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::agent::dsel::eval::attr_of (cyclomatic 23): rhwp::agent::dsel::eval::attr_of 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":"src/agent/dsel/eval.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e705fb9033f1c1f5b575d0067d59864f35036902dc98ed1db709cf32283ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_unicode_scan (cyclomatic 23): rhwp::bin::rhwp-agent::safety::run_unicode_scan has cyclomatic complexity 23 (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 shape REPEATS in the file: one other method here (rhwp::bin::rhwp-agent::safety::run_stego_scan) 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3085b9ba6d9c593fe5bcc0d46131c8cd4066d391710a188f0731a9abb439910"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_stego_scan (cyclomatic 23): rhwp::bin::rhwp-agent::safety::run_stego_scan has cyclomatic complexity 23 (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 shape REPEATS in the file: one other method here (rhwp::bin::rhwp-agent::safety::run_unicode_scan) 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0bde20294e6c21a9034bb9232521fccafa6609e7fb18967e27edc62c968c87"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_in_hf::run (cyclomatic 23): rhwp::bin::rhwp-q::kit::hit_in_hf::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/hit_in_hf.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a98942192846a0c75c31c77b7f265c28f5ff773fba0c36ab6ad5c5522ca12"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_add_bookmark (cyclomatic 23): rhwp::cli::commands::edit::bookmarks::edit_add_bookmark 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark) 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323b7c3c6ff29c66d496f8a8f65f9dfb569f1009068cb0701246049cfce4080"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark (cyclomatic 23): rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::bookmarks::edit_add_bookmark) 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"48539b73902cbfd05e935e5cebc8dad6e714ef426397c8e130789eed2d9812fa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_chart_data (cyclomatic 23): rhwp::cli::commands::edit::document_objects::edit_set_chart_data 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b856ba59ff900eb4d27fcbed5421edfdef3c3193060a6b7aaee61d7448d0798"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_set_numbering_restart (cyclomatic 23): rhwp::cli::commands::edit::document_text::edit_set_numbering_restart 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbdb741f7af6c77b87f4ba7e15deacadf3aa2f74c4376a562f8f9effab690c0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::fields::edit_fill_fields (cyclomatic 23): rhwp::cli::commands::edit::fields::edit_fill_fields 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc9a7eced200273be8b85f6dc834977192ae9b4d17b4a8edf4a9bbb913c455"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer (cyclomatic 23): rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"452de2662896fea292387edd74b417a11a228ef2ace29b44d363b1e4de01ab1c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture (cyclomatic 23): rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7917bfbfd7aa70b461bfde7565bab6319b2fa5e9ad1d7be322280b20fb8811"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_delete_text_in_footnote (cyclomatic 23): rhwp::cli::commands::edit::note_content::edit_delete_text_in_footnote 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"713b3a06826d6cbe6e02c068debd0f28acf3e93dafecd4cedbe699d14abd3c39"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_insert_footnote_text (cyclomatic 23): rhwp::cli::commands::edit::note_content::edit_insert_footnote_text 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15405e67580a890ba34b7684984b4093829a173187fadae9ff36c056fa0ab7f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::document_io::strip_global_auth_options (cyclomatic 23): rhwp::cli::document_io::strip_global_auth_options 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":"src/cli/document_io.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fe38be79a09edde9738698eefd38c6a0346b8d391b838a904955b53806ba80"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::audit::cmd_audit (cyclomatic 23): rhwp::cli::protocol::capsule::audit::cmd_audit 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":"src/cli/protocol/capsule/audit.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c597d468d7b7bb34268f6fca8d1cbf16398675bfe76b47346670abad5e66cba3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::clone_identity::remap::reidentify_with_allocator (cyclomatic 23): rhwp::document_core::commands::clone_identity::remap::reidentify_with_allocator 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":"src/document_core/commands/clone_identity/remap.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7defa93835cad7daa0b182837f0b0bdddbf8fcf4720dc67b5dd1d080ea56cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-594::probes::inspect_pr601::main (cyclomatic 23): rhwp::mydocs::tech::investigations::issue-594::probes::inspect_pr601::main 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":"mydocs/tech/investigations/issue-594/probes/inspect_pr601.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"78413b195c686e429c67496d83d8278c9827806b43fbf1d126014d158a69e91d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_draw_text_body (cyclomatic 23): rhwp::parser::hwpx::section::parse_draw_text_body 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8606aa0b41db217df7d0f3524be8665346c57ac59cec895ecd2fbb9bad40329"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables (cyclomatic 23): rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da26e1c671ef9ca333c0c395b94156b39af6c093c17a3adf1a0011429c16360"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::fit_measured_table_to_declared_height_with_outcome_with_storage (cyclomatic 23): rhwp::renderer::height_measurer::fit_measured_table_to_declared_height_with_outcome_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c526e96ccb5bdc00aadb59f44381b4102ea1fb7464aca86f30fbdb5ab92ca907"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::stored_page_square_preserves_source_origin (cyclomatic 23): rhwp::renderer::layout::stored_page_square_preserves_source_origin 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":"src/renderer/layout.rs"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aba0b5358456aa22e01b7b64dbcd605b97b778174051c67c0e79c0ea6023e5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_edge_borders (cyclomatic 23): rhwp::renderer::layout::border_rendering::render_edge_borders 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956173dfef8a78b983ddbd1f040c6f96d7b0536cb85718467e48f507e48ab42"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::measure_char_width_embedded_decision_for_font (cyclomatic 23): rhwp::renderer::layout::text_measurement::measure_char_width_embedded_decision_for_font has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::layout::text_measurement::vertical_substitute_char (cyclomatic 24) 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f7f106e4820fc827d93cb36b3891c4a3de1e8a2c950c18ae19fab7ec3d5b2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::pdf::direct_pdf_validation::validate_gradient (cyclomatic 23): rhwp::renderer::pdf::direct_pdf_validation::validate_gradient 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":"src/renderer/pdf.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cf3f3030f9d7ca788798be027fc1d53974ed1320c79bedb9ff5ac06e5e2950"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::stored_page_origin::stored_inline_frame_restarts_page (cyclomatic 23): rhwp::renderer::stored_page_origin::stored_inline_frame_restarts_page 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":"src/renderer/stored_page_origin.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f78902704effc276baaa81ee5c441563c12aeaffd4871d07177aac8e4aef255"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::style_resolver::try_resolve_single_char_style (cyclomatic 23): rhwp::renderer::style_resolver::try_resolve_single_char_style has cyclomatic complexity 23 (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":"src/renderer/style_resolver.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf366142e2a81fbddd41b962dd98f52ffcf0a86f7abbcdd91db39eb21259e4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::svg_layer::project_debug_overlay::visit (cyclomatic 23): rhwp::renderer::svg_layer::project_debug_overlay::visit 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":"src/renderer/svg_layer.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b152d8a4e0f5b70cec99d97915f764ebe2b64f236e88d9455b8ab7917046b165"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row (cyclomatic 23): rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row has cyclomatic complexity 23 (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":"src/renderer/typeset.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f73bb14f85c894b506783e91a6215a37b7f52ad585ca218c71ac29fd875827"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::ladder_spacing_omitted_signature (cyclomatic 23): rhwp::renderer::typeset::ladder_spacing_omitted_signature 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":"src/renderer/typeset.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"383b7d70f36f3269e4a8adb669cdad3534f553a062d98484c7aeb037fe26b10f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::place_table_host_shape_with_storage (cyclomatic 23): rhwp::renderer::typeset::controls::place_table_host_shape_with_storage 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":"src/renderer/typeset/controls.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e074016805579350a380ccd1adbc5d78c9109914295cdb4e8c3ab1b7d5f12"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::stored_content_bottom (cyclomatic 23): rhwp::renderer::typeset::paragraph::content::stored_content_bottom has cyclomatic complexity 23 (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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b755b56ae81882c9712522eba269b1690851c4984a3a796de58c1fcaba7481c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::diff_paragraph_linesegs_with_axis (cyclomatic 23): rhwp::serializer::hwpx::roundtrip::diff_paragraph_linesegs_with_axis has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a41e0c4315d88215af228c2673def67c6ad1ef09fb0d0de4dc49f229b570fd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_shape_with_storage (cyclomatic 23): rhwp::serializer::hwpx::section::render_shape_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374a65b442cd2980bdf8e571ae5e2b21631c5c7d7669729a2ed65a367b183c7"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.render_report (cyclomatic 23): runner.render_report 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":"gym/core/runner.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded668760e354eed7b669d9eb3a36747487dc4dd6cb97c9fe851488021422d98"}},{"ruleId":"D1","level":"warning","message":{"text":"robustness.validate_report (cyclomatic 23): robustness.validate_report 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":"gym/tools/robustness.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f928b053d9ced32c8344459a994d1aae4abc8047c99751dfb0b1f897ba27649"}},{"ruleId":"D1","level":"warning","message":{"text":"ModalDialog.show (cyclomatic 23): ModalDialog.show has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. 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":"rhwp-studio/src/ui/dialog.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b211cde2d9f800b48300afdea508185d75bdc8879623b9c074fccabebd916fe"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.shouldPromoteEmptyTextEdit (cyclomatic 23): diff-engine.shouldPromoteEmptyTextEdit has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc3d224c9b84779120a67f7937a9a52214bcfa485a20651138377cbee4cb9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"local-fonts.readSfntFontNames (cyclomatic 23): local-fonts.readSfntFontNames 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"586b92e9a89b2d30d13cbefb91073344b750b1f96069e294b270af83ce00bb14"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderImage (cyclomatic 23): CanvasKitLayerRenderer.renderImage has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"da504d752513297355da356c24715521c3ee320dfe44dbbfa41369350f1803b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.renderPage (cyclomatic 23): PageRenderer.renderPage has cyclomatic complexity 23 (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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c726dde66a89ed7d990ee2a89d895b691cbeb3505c9c5f5a6f4e1bb75001d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-mouse.finishMouseUp (cyclomatic 23): input-handler-mouse.finishMouseUp 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"444227165d95fb445543253d7b27e025732f8df04506dc7d98c1f81e7e10fb0b"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.executeOperation (cyclomatic 23): InputHandler.executeOperation has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 3322). 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c442b9689188bed1fac2345250cbf7a928d04da9b7f262c7d254d844ff6fe"}},{"ruleId":"D1","level":"warning","message":{"text":"numbering-dialog.formatNumber (cyclomatic 23): numbering-dialog.formatNumber has cyclomatic complexity 23 (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":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cef97cb7be244f17b3bcddcb055b5274740a605d620ec5e25dcc497d45025a4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::normalize_xml_import_paragraphs (cyclomatic 22): DocumentCore::normalize_xml_import_paragraphs has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (compute_mask, process_para). 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":"src/document_core/commands/document.rs"},"region":{"startLine":3908}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f442920f9d1b55c53dd34c86dba509dc555d12ad80c5b494e53e5ba7ae5a735"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::recalculate_connector_routing (cyclomatic 22): DocumentCore::recalculate_connector_routing 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":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e16a44cb9ebda762710efdfa21927b1517c0151c0e732c7fe3a480dc4966f46"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::scale_group_children (cyclomatic 22): DocumentCore::scale_group_children 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e3243752111dcc95747b6ace38b16bfa172c46437af4db8478b1bb46dffb1f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::group_shapes_native (cyclomatic 22): DocumentCore::group_shapes_native has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5b02b42106964ae322036ae88e16a04a59269b975d45214d938eba71378eff"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::ungroup_shape_native (cyclomatic 22): DocumentCore::ungroup_shape_native has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b461c2323964c3636e7ddf322065eab9af28c0d0a8045f3a8b5d3788d8a9567"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::recalculate_table_formulas (cyclomatic 22): DocumentCore::recalculate_table_formulas 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":"src/document_core/commands/table_formula.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2cd11e7dfcaf5b204aacc10c8ea9980f6af764a73fb42fe44be682b59780a8"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::handle_cell_boundary (cyclomatic 22): DocumentCore::handle_cell_boundary 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4c6320c76181b0eea413c5ab03ced73ce5f723dc2a1778a1f1564debec3b01"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_page_def_native (cyclomatic 22): DocumentCore::set_page_def_native 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3872}}}],"partialFingerprints":{"codehealthFindingId/v1":"707836ce044a199f7c2c696db8880022839e04e67dd05eac0765acd3c32e932d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::replace_matches_native (cyclomatic 22): DocumentCore::replace_matches_native 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d89689b943f17c276782bfd1f282212f2134c348d87d19ab0800b4e37ea456"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::try_control_text_positions (cyclomatic 22): Paragraph::try_control_text_positions 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":"src/model/paragraph.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f85910f97e129e1f2d941355ed581baf750e20f6892dc8bdc08d6c1982b2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::fallback_paragraph_frame_owner_widths_with_storage (cyclomatic 22): Table::fallback_paragraph_frame_owner_widths_with_storage 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":"src/model/table.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaeb1e98051383738786732bbe3d03816e68620ad7c3d9ff24da2b06c5099b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PaintOp::paint_bounds (cyclomatic 22): PaintOp::paint_bounds 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":"src/paint/paint_bounds.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f17199209d7301eaa101e3d901471cee6e341ee0b216449961a18842a1b72b"}},{"ruleId":"D1","level":"warning","message":{"text":"Hwp3DrawingObject::read (cyclomatic 22): Hwp3DrawingObject::read 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":"src/parser/hwp3/drawing.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1ae15201a8a9ec6d4694e39824c9f19a99aa199316193dd98dbb94af976d57"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::try_parse_scripts (cyclomatic 22): EqParser::try_parse_scripts 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":"src/renderer/equation/parser_attached_scripts.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db014fbe8b21945e9bc643e39143404c701483e26239af897c05458336df3d4"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_fraction (cyclomatic 22): EqParser::parse_fraction 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":"src/renderer/equation/parser_fractions.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ad7d8884c9b02ba3ee7de2d773bb4e57920fae6d9df618d34b4f56aff04b6"}},{"ruleId":"D1","level":"warning","message":{"text":"KerningParagraphBreakSession::boundary_width (cyclomatic 22): KerningParagraphBreakSession::boundary_width 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":"src/renderer/kerning.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce336bb4b3a4573668b04ad89c2264f2ba2281a09d04622e350262c0ce0967e6"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::calculate_body_wide_shape_reserved (cyclomatic 22): LayoutEngine::calculate_body_wide_shape_reserved 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f1f6b19048d7fbe010bf8b4c1e9795d4c500020faaf830a14dba14ad3b56d"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_row_atomic_picture_alignment (cyclomatic 22): LayoutEngine::stored_row_atomic_picture_alignment 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":"src/renderer/layout/table_layout/declared_first_frame.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e567dea2a65aafd525ce077c89c0a1c54a1f5fc1e7706e993bec3a6ac677a7"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_inline_opening_row_frame (cyclomatic 22): LayoutEngine::stored_inline_opening_row_frame 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":"src/renderer/layout/table_layout/stored_inline_row_frame.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ed94e77fc6cf028c64a6bc016824032e1bb284074c230475a5e43fcb84f62"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::first_source_frame_owner (cyclomatic 22): LayoutEngine::first_source_frame_owner 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":"src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8681f51e52eca20ddb89b87f07b86b1ba039f450af03cb37805451c62cb5b16a"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::saved_first_row_opening_frame (cyclomatic 22): LayoutEngine::saved_first_row_opening_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19185}}}],"partialFingerprints":{"codehealthFindingId/v1":"63605350a2ef38823ad7b731aa270d8bf702fa6fc84a1508a223d3a04214f7f1"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::partial_table_cell_probe_plan (cyclomatic 22): LayoutEngine::partial_table_cell_probe_plan 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee83fb6864208f78eeada9643c927835616d9d03d885aa734c9e96ad7c842f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Paginator::place_table_fits_with_storage (cyclomatic 22): Paginator::place_table_fits_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fed5d4f0b24b920d4e78f5f453bfb069f4a74256b57af94281aca4291494f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::prepare_pua_glyphs (cyclomatic 22): SvgRenderer::prepare_pua_glyphs 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":"src/renderer/svg/pua_glyph.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2607c9d9e93f90b2466acdec29df2600706779dd957bfff9ca90b71c779877b4"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgLayerRenderer::render_node (cyclomatic 22): SvgLayerRenderer::render_node 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":"src/renderer/svg_layer.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c5e74a076329a2e35d85542e8256674132adda99efca0df566e6464912f0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::coanchored_closed_first_fragment_row_end (cyclomatic 22): TypesetEngine::coanchored_closed_first_fragment_row_end 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":"src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"898edaadbe140a89892c2e651ea62dd525cbc1fd545a5716fe91589524846485"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::stored_body_closing_fragment_extent (cyclomatic 22): TypesetEngine::stored_body_closing_fragment_extent 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c9ac93b4beda2b0f83f98b6c0447e397886978d0de818fb6c59f3b6e475d54"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::pack::probe::collect_stats (cyclomatic 22): rhwp::bin::rhwp-q::pack::probe::collect_stats 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":"src/bin/rhwp-q/pack/probe.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4908245d5f4b9c8bc2de5ff07baa6362b7a7b5383c7991baea0430a50d49a91"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_set_equation_properties (cyclomatic 22): rhwp::cli::commands::edit::equations::edit_set_equation_properties 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeb6e306b0be5466c5ce1fcf0fbd739b1f14fd9be5036f9e380eb7da39c619f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_style (cyclomatic 22): rhwp::cli::commands::edit::formatting::edit_apply_style 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f39cf30c0e25ad4602c603ccdfb9df8f24b2c91ecc1550cca79638e1e776a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_toggle_hide_hf (cyclomatic 22): rhwp::cli::commands::edit::header_footer_properties::edit_toggle_hide_hf 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e7dc8b93353e93ecd51064707a978054c2601c077d761e1ffd9813e9ce0a01"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::parse_insert_image_args (cyclomatic 22): rhwp::cli::commands::edit::media::parse_insert_image_args 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1853ac5042229a9566324a8bfb07abffd8eaddeaadd4dc0ef00b73b4f6256262"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_set_picture (cyclomatic 22): rhwp::cli::commands::edit::media::edit_set_picture 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c7c646724de8ea1c084c682250710f190d8aa9495ab818bc83702ea6afa9ac"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_split_cell (cyclomatic 22): rhwp::cli::commands::edit::tables::grid::edit_split_cell 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f558066c0217a57f920406f6d231c36d4539970bc16e33f9c4582cc916a0d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_move_table (cyclomatic 22): rhwp::cli::commands::edit::tables::layout::edit_move_table 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"de72667feef1980b41e63ab25e25323b698b8e7347e65b5eb4de537f47c2f67f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_record (cyclomatic 22): rhwp::cli::protocol::exchange::settlement::cmd_settle_record 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db5756b2c13a5e00ea400c309c2df492b361021cd01059959fd0d15ee866529"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_audit_report (cyclomatic 22): rhwp::cli::protocol::trust::governance::cmd_audit_report 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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc5c96db61970b6bf6f007e958e84f2600d940ee64d94682a8ff0bb133a6c54"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::inline_control::remove_slot (cyclomatic 22): rhwp::document_core::inline_control::remove_slot 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":"src/document_core/inline_control.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9269e0ad7fb4abf40f73ed2b95917f52582b025fd2d97cb26ab3bb4fb37722"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::identity::walk::walk (cyclomatic 22): rhwp::model::identity::walk::walk 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":"src/model/identity/walk.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe3b3cefde48515dce98ad4973b43a381854955958decc78f2cfcb9b5237415"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::table_row_grid::projection_with_storage (cyclomatic 22): rhwp::model::table_row_grid::projection_with_storage 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":"src/model/table_row_grid.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a855a8c4b166bedc0f7e31b9bbc5945cc75ce24aa51e0b421f0031b8ea38687f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-574::probes::inspect_574::main (cyclomatic 22): rhwp::mydocs::tech::investigations::issue-574::probes::inspect_574::main has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-574/probes/inspect_574.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fce40877e5a76574eec013c3b187d5b0a9651070fa3f25c7baa4eef5a1a9542"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::ole_chart::legacy_combo_renderer::render (cyclomatic 22): rhwp::ole_chart::legacy_combo_renderer::render 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":"src/ole_chart/legacy_combo_renderer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"698bce5a6d51a8e23bc7dd7f85474b396505adaf8a5e52b0a5359b7fe47d25b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::font_glyph::decode_font_svg_glyph_payload (cyclomatic 22): rhwp::paint::font_glyph::decode_font_svg_glyph_payload 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":"src/paint/font_glyph.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4fdbe9085b52f60bf84e4f68a3c41ba6e3c05c9fe662cd290f3807fe7e10eb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::metafile_print::replay::rasterize (cyclomatic 22): rhwp::paint::metafile_print::replay::rasterize 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":"src/paint/metafile_print/replay.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6a26c86b75146217db350e0ad81ae1e26ab230c4420dc2653dcf3b9e1d4ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_rendering_info (cyclomatic 22): rhwp::parser::hwpx::section::parse_rendering_info has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 4 function items inside it that branch. 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198bdbe10d736a6fcacb6c0bcfcca1061500ebd517d5d92772470f33db91573"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_dutmal (cyclomatic 22): rhwp::parser::hwpx::section::parse_dutmal 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"130d80cc1140a2de62ea320a17c784ae0a3ea227a5a14edfef39376eac3986f7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_hierarchy::compose (cyclomatic 22): rhwp::parser::pdf::table_hierarchy::compose 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce649e3031d2ce717f1b9834c4efa7e9db47cb868d0815ce00c37683aa53ba7e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::rag::chunker::linearize_table_parts (cyclomatic 22): rhwp::rag::chunker::linearize_table_parts 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":"src/rag/chunker.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d6d5d18d31399faced6c28c20bf98d7d966b0a213432d72f8dab3662a3a5b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::cell_grid::place_line_runs (cyclomatic 22): rhwp::renderer::cell_grid::place_line_runs 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":"src/renderer/cell_grid.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e06537d4de68e955f4636d85ec40a3f2c27fa832622ed965a7a2f28dd3df624"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::inline_box_rows::normalized_host_with_table_height_with_storage (cyclomatic 22): rhwp::renderer::composer::inline_box_rows::normalized_host_with_table_height_with_storage 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":"src/renderer/composer/inline_box_rows.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03b95ae0d76eff274fcc55b332c27f9f583e45cca680102abfee982f83f67ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::try_convert_pua_display_text (cyclomatic 22): rhwp::renderer::composer::stored_tac_display::inc::try_convert_pua_display_text 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":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1130c46be6f36aef43f753aaebf238afa74271ccf33d18f670a723c52fff5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::empty_host_float_successor_absorbed_spacing_px (cyclomatic 22): rhwp::renderer::float_placement::empty_host_float_successor_absorbed_spacing_px has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f27f9b555e5c00c94ce8f168c43f2b12330ab3f990633572ce137361b3a6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_resolver::watermark_jpeg_bytes_to_hancom_baked_png_bytes_uncached (cyclomatic 22): rhwp::renderer::image_resolver::watermark_jpeg_bytes_to_hancom_baked_png_bytes_uncached has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 function items 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":"src/renderer/image_resolver.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"761eb92a973647d33b0484c0f3b4d78ca125ac18f5543531711b8359c0d769d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted (cyclomatic 22): rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted 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":"src/renderer/kerning.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"7829678b610fe907e37537082099a1a5d4392540d8bbd0e4419ee1e3e6754343"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::kerning::measure_kerning_paragraph_segments (cyclomatic 22): rhwp::renderer::kerning::measure_kerning_paragraph_segments 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":"src/renderer/kerning.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d0e16c9325956acac27837715ce37e1d656746c1bdf791af802d4a63645e3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_run_font_resource_reject_reasons (cyclomatic 22): rhwp::renderer::layer_renderer::collect_glyph_run_font_resource_reject_reasons 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. This is NOT this file\u0027s highest cyclomatic complexity: VariantRejectReason::as_str (cyclomatic 47) 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":"src/renderer/layer_renderer.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca445073f6ce4948590b77a0ca6ee347885d6759e21d4a2e06eb8a80fbb7f44f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::picture_footnote::get_footnote_paragraphs (cyclomatic 22): rhwp::renderer::layout::picture_footnote::get_footnote_paragraphs 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0deec62ed4fcecbef7d4a494a5c9bae497d4053e770b7f90542906c1b8604d0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::repair_clipped_cell_text_table_seam (cyclomatic 22): rhwp::renderer::layout::table_layout::repair_clipped_cell_text_table_seam 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e7fc5c43619c2581476ff69edad7ace00d7d14f3aef088be9dc0ace380b4b3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage (cyclomatic 22): rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage 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":"src/renderer/typeset/inline_flow/plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f79f963fd9c0d0c0395f03f244a1c87c10cb91f8073501f5ac1af7a81b6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::initialize_first_paragraph_origin (cyclomatic 22): rhwp::renderer::typeset::paragraph::content::initialize_first_paragraph_origin 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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5ec0a454c13f5633e900b372cc5516eb6ed09a8a04d92ee3f79ebaa9e1324b"}},{"ruleId":"D1","level":"warning","message":{"text":"ConversionConfig::validate (cyclomatic 22): ConversionConfig::validate 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":"tools/batch-convert/src/config.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b9cfd0b16411eec28b333b9f01a8a55e78684639fc45ea005a6d2d8aada51"}},{"ruleId":"D1","level":"warning","message":{"text":"differential._values_equal (cyclomatic 22): differential._values_equal 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":"gym/tools/differential.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5898afda687cbb321dcabc5e10021d9d1555efe30b6dfb66e1e145bd958ec076"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.scan_manifest (cyclomatic 22): pack_health.scan_manifest 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":"gym/tools/pack_health.py"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"301ca854b89437b20a57128240aa760dce1099c599c321ffa200e22d98fb1c16"}},{"ruleId":"D1","level":"warning","message":{"text":"release_diff._values_equal (cyclomatic 22): release_diff._values_equal 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":"gym/tools/release_diff.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c347d1d960de157d3ae6692188375dbe97d1cdb7b8327cf4af59d69440b3ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeTextureController._poll (cyclomatic 22): NativeTextureController._poll 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5aed876b7f9a99f39c6c2c8fcb4e59eaae029dcb3fb27a8a417b35c411e95"}},{"ruleId":"D1","level":"warning","message":{"text":"cards.addToolCard (cyclomatic 22): cards.addToolCard has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"23640c8b38dc1c79df8bade28afa1fe492a7813ea82d131a54c29a8d64a9d281"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.findLongestEqualSignatureRun (cyclomatic 22): diff-engine.findLongestEqualSignatureRun has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeae3ed7c3c90e770d94e91e9c7e87c53aeccf14acad48e7af53b2ff97b1c4a"}},{"ruleId":"D1","level":"warning","message":{"text":"canvas-intrinsic-font.fontProgramOwnsFamily (cyclomatic 22): canvas-intrinsic-font.fontProgramOwnsFamily 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":"rhwp-studio/src/core/canvas-intrinsic-font.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff2c53f528e1b23c2fcec5684f9f7d1146e81b375b9bdc00f5ae73f656e87d"}},{"ruleId":"D1","level":"warning","message":{"text":"host-font-provider.copySnapshot (cyclomatic 22): host-font-provider.copySnapshot has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 51). 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":"rhwp-studio/src/core/host-font-provider.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6d32d20e20e666279314ba98520083b524b6f268719820b474b236b9c66394"}},{"ruleId":"D1","level":"warning","message":{"text":"metafile-print.drawPrintMetafile (cyclomatic 22): metafile-print.drawPrintMetafile has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"rhwp-studio/src/view/canvaskit/metafile-print.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b941369ed775ff683364d188ef3c9027c5783b0a32098badd28fad80292e8345"}},{"ruleId":"D1","level":"warning","message":{"text":"static-svg-path-layers.decodeStaticSvgXmlEntities (cyclomatic 22): static-svg-path-layers.decodeStaticSvgXmlEntities 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc65f6ac4c6ef583bf8cd468788f5a2a7e1ae7fd0131482a78158fc7ddbe3534"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageOp (cyclomatic 22): CanvasKitLayerRenderer.drawImageOp has cyclomatic complexity 22 (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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.drawImageOp::drawImage) 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd394f05752468c673f21a646da3b10a46c643f72d8ba32466d3ed6dba2a94b"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.resolvePreparedTypeface (cyclomatic 22): CanvasKitLayerRenderer.resolvePreparedTypeface 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521844da485ec2e3ab506b9ad35a2aef48534382d885f613a08e494f1fd3b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.createOrReuseFlowImageLayer (cyclomatic 22): PageRenderer.createOrReuseFlowImageLayer 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0594f542a2df0cdc6a4ac3b2f86488c5f97e3fd63f6bc23ef547559ea2877ec8"}},{"ruleId":"D1","level":"warning","message":{"text":"office-clipboard-images.extractEmfDibs (cyclomatic 22): office-clipboard-images.extractEmfDibs 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2167710abf012d344b9c709b2f9ab47960aa8e57051d015f4b5ac6edb12c635"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.handleBackspace (cyclomatic 22): input-handler-text.handleBackspace 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa04f527ff8886501ca4c81b32512d82f4cb8277e062118f9b9842bc5336b82"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.handleDelete (cyclomatic 22): input-handler-text.handleDelete 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c6515cebc5bdd5a49f8129a1c5bdc3e4a6045f46948ba540cbc0c7fed28684"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-text.onCompositionStart (cyclomatic 22): input-handler-text.onCompositionStart 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51841af222994edc601b39c549ed3f2b2154fbe3d8fd52b54f4e3566b5ae0bc"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.constructor (cyclomatic 22): InputHandler.constructor has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 772, 674, 713, \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"954c728b2a6221f1527c7110888bbb53815438cea6eefe6696fb6c7a87a9fde7"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfImportDialog.onConfirm (cyclomatic 22): PdfImportDialog.onConfirm has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 223, 251, 248, \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":"rhwp-studio/src/ui/pdf-import-dialog.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b9e831c3b1c9e9da15334138590ef48d1eb9ade5a158e61113d0f2a00e838e"}},{"ruleId":"D1","level":"warning","message":{"text":"CharShapeDialog.populateFromProps (cyclomatic 22): CharShapeDialog.populateFromProps has cyclomatic complexity 22 (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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4feff8ed408d88dd43be32c1a3e7163f39e9785a1429abf7055a2c40fec37f6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 22): (anonymous) has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 4 function items 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":"mydocs/pr/assets/pr8296-maintainer-20261101/canvaskit-probe.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"128106cdce3847c74e4ef01a9694ec218dcf941c7d02d2907a3252d39f9e432f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::paste_control_native (cyclomatic 21): DocumentCore::paste_control_native 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::clipboard::control_kind_label (cyclomatic 24) 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f290d6fd0eefbbf956633cfd840f415a40a0b11076f46e3c16fb713ce1f446b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::from_parsed_document_with_storage (cyclomatic 21): DocumentCore::from_parsed_document_with_storage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4b25c8df19a62ae7ca6d9d8347291a951e0f2ac356d8134244d3930ca78381"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::reflow_linesegs_on_demand (cyclomatic 21): DocumentCore::reflow_linesegs_on_demand 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":"src/document_core/commands/document.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ec22d4e858e8c4fc3a4bbec8107b5e7276246cfd1d529c3618b6c8febc27ce"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::prepare_table_rows (cyclomatic 21): DocumentCore::prepare_table_rows has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template_rows.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daaa81c5b4d6e5fe99f7c5e7b258965a385f12f93d407c61dee46b5bfaa0bae"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_cell_border_fill_ids_native (cyclomatic 21): DocumentCore::apply_cell_border_fill_ids_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40900d54f2bf0b467a36633cf01e9602757398d8ae8431dedd4b87e869e7865"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::create_border_fill_from_json (cyclomatic 21): DocumentCore::create_border_fill_from_json has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function items 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":"src/document_core/html_table_import.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd2b47f4dd46186e4c575a1468c31cb232671894e601de9386b389ec8532f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit (cyclomatic 21): DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea38b711b2a4824e1ea93452619e3e9238a92f6177f9ee4cfa8b2572207e084"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::populate_external_images_from_dir (cyclomatic 21): Document::populate_external_images_from_dir 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":"src/model/document.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88b64c700a47000e50069e94ec9986e843eb915efd9d150c171179dcabe209d"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::merge_from_with_storage (cyclomatic 21): Paragraph::merge_from_with_storage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a880c9662bbda9fd52f33fef9cb9da5c3bda655a49b0de43d673099496b75"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::insert_row_inheriting (cyclomatic 21): Table::insert_row_inheriting 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":"src/model/table.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2f4d8a8384cf9e5a8221c1a4dfcf03b0a011dcc41f558d59172297a4005d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::insert_column_inheriting (cyclomatic 21): Table::insert_column_inheriting 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":"src/model/table.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee782f55cb621fdd66299c4dc96f8f0b92278e259b63b281e4fb3ccfc2d938af"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::merge_cells (cyclomatic 21): Table::merge_cells 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":"src/model/table.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"df132cb13c46555293fd29985851fe667532f8c8612114ed521517e1bed6959b"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotWalk::paragraph (cyclomatic 21): SnapshotWalk::paragraph 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":"src/native_host/accessibility.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0eb715bcdd2697bdc2cf9514bd935a6848dc11f3c855d168332975e967ebbc"}},{"ruleId":"D1","level":"warning","message":{"text":"ParagraphFloatPlacement::from_stored_overlay_guide_chain (cyclomatic 21): ParagraphFloatPlacement::from_stored_overlay_guide_chain 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":"src/renderer/float_placement/stored_empty_host_frame.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f077a70299e39004210ccadbb2c60d71a1b4668cabf24b4a1ee6de916adc9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"HeightMeasurer::cell_nested_controls_bottom_with_storage (cyclomatic 21): HeightMeasurer::cell_nested_controls_bottom_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b166742d406d91a1d76bbd2c3488c4f08e7771af126699e908dea0b27f6e06"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_footnote_area (cyclomatic 21): LayoutEngine::layout_footnote_area 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf23bc2d12bc6d906aba9f015b4863b6151475e80df001569465822de12df9f"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_block_opening_cell_rows (cyclomatic 21): LayoutEngine::stored_block_opening_cell_rows 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e96eb09373e897ded495cb9050c58cafb59b0c26c35718a41244c1b8580f84"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::trust_declared_row_heights (cyclomatic 21): LayoutEngine::trust_declared_row_heights 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b2f6b8be620ed61ec3fa9ca36ea29448678f0f063f61222b7ab1c7384b5dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::sequential_nested_cell_layout (cyclomatic 21): LayoutEngine::sequential_nested_cell_layout has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11578}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee7b0b5c859f20dbf8e26b8e0c5432c0872f59c12f6db964264a9a8226a216b"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderNormalizationOverlay::register_rendered_text_partitions_with_storage (cyclomatic 21): RenderNormalizationOverlay::register_rendered_text_partitions_with_storage 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":"src/renderer/render_normalization.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b861a6b87cb7a0f73e49d5697fb75c1a33b0218fb09b44e552ca3ad40535bb"}},{"ruleId":"D1","level":"warning","message":{"text":"HorizontalShapingTransaction::shadow_measure_with_instance_request (cyclomatic 21): HorizontalShapingTransaction::shadow_measure_with_instance_request 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":"src/renderer/shaping_context.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b64c5a341d0c5585d6b49ff66efbd921efaeaa3c7da816d77a47e1b2abc78"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::agent::dsel::eval::apply_preds (cyclomatic 21): rhwp::agent::dsel::eval::apply_preds has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/eval.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6482c7ff223dcffb940d1b4a8fe90dd63aa90097387bf8a71b239fe28e3d0eff"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::agent::dsel::eval::attr_matches (cyclomatic 21): rhwp::agent::dsel::eval::attr_matches has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/eval.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"008665afefb3e3479ffd0b8376c9fccb8a75314ea93a5d25aa1c02cd66029493"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::chunkplan::run (cyclomatic 21): rhwp::bin::rhwp-agent::chunkplan::run 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":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"387418c52d778b70df1777bcf2a1f22299e171fa1348ae7a451f6c5cec417f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::caption_validation::run (cyclomatic 21): rhwp::cli::commands::caption_validation::run 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":"src/cli/commands/caption_validation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b72d997abd12a6a9e7c4477b86df1b8b2d978e74a640149ced0196a398996ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_delete_text (cyclomatic 21): rhwp::cli::commands::edit::document_text::edit_delete_text has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee095ea72e0831d5ead40ccdc95b8a1227190d8643f95445cb6aebfe2c03a40a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::fields::fill_fields_core (cyclomatic 21): rhwp::cli::commands::edit::fields::fill_fields_core 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f869f2a60eff6cd4f3758932fe99c5c60a053e494ee30690a7e3036fbea655"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_split_paragraph_in_footnote (cyclomatic 21): rhwp::cli::commands::edit::note_content::edit_split_paragraph_in_footnote has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f55f3b428490fb2010a21ce9c6503f3e196c7a0043872761658522f39c0b0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_merge_paragraph_in_footnote (cyclomatic 21): rhwp::cli::commands::edit::note_content::edit_merge_paragraph_in_footnote has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff71df369d8335174ad2cab422f31bc58ca2e0853e97556195ca4148ac5ec4a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_insert_row (cyclomatic 21): rhwp::cli::commands::edit::tables::grid::edit_insert_row has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_insert_col) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f88a18c150ab837ab8932d5d24be238b133e8b3ae29ff595b61dcccccee15f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_insert_col (cyclomatic 21): rhwp::cli::commands::edit::tables::grid::edit_insert_col has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_insert_row) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110fa97062b9f9957429621e4530679cb4860a6d0a4d92d5a0c21b1c4869081"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_set_table_props (cyclomatic 21): rhwp::cli::commands::edit::tables::layout::edit_set_table_props has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7706585ce745b2c1fc97683005595f4e5b40af70974a69190690bef32ecf8bb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_split_table (cyclomatic 21): rhwp::cli::commands::edit::tables::structure::edit_split_table has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68eac317f93628d96d0a8dc1095c0d484d956b3af722f83ba386ec8cc7c2f26"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::text_width_probe::run (cyclomatic 21): rhwp::diagnostics::text_width_probe::run 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":"src/diagnostics/text_width_probe.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd6164874d0078557c11a55e0311157cdfcb4c4828a89c0ed386843479694e9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::footnote_shape::apply_props (cyclomatic 21): rhwp::document_core::commands::object_ops::footnote_shape::apply_props 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":"src/document_core/commands/object_ops/footnote_shape.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c16b0ea9035b260e8bb5efee2ed5d5af64cd04db8489f3c69b2c028b88ac39"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::content_fonts::collect (cyclomatic 21): rhwp::document_core::queries::content_fonts::collect has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/content_fonts.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"25876ec4ad275cad4a8f02af7d4e7d3aa5e378acb95a35787a9cd6c6929637f1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::pii_scan::scan_email (cyclomatic 21): rhwp::document_core::queries::pii_scan::scan_email 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":"src/document_core/queries/pii_scan.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefba473055985f9a71e8810809369d5b01447058daafeb7232e9a5a4d324224"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::emf::emfplus::objects::pen (cyclomatic 21): rhwp::emf::emfplus::objects::pen 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":"src/emf/emfplus/objects.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3a1bed7f8be7c1c6e2d9bc18aa7db5a3863d3b767008d3e12c49038eb3d39c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::metafile_print::text::prepare (cyclomatic 21): rhwp::paint::metafile_print::text::prepare 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":"src/paint/metafile_print/text.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaba6edec8a512fa030273b70cb41a4e42270bf7d831efafa5056a3c633a5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::doc_info::parse_para_shape (cyclomatic 21): rhwp::parser::doc_info::parse_para_shape has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da9936e7f6eae886cfda14d74ac796c5c45517a892f0a69e2f746d9ca47d07f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::convert_para_shape_with_layout_contract (cyclomatic 21): rhwp::parser::hwp3::convert_para_shape_with_layout_contract has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"98213885964121c8cb04f1dca533de7f39921eb700d244c4ce921fbb760cd2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape (cyclomatic 21): rhwp::parser::hwpx::header::parse_para_shape has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475bba39748ac8d06bbf65bc512da776a17509842121dfe49f24512348895b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_tab_item (cyclomatic 21): rhwp::parser::hwpx::header::parse_tab_item has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"721b79e43543a7ecdd8138aced34b0b10d8c2efb2a687555ca53f466de39a72f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::bitmap_raster::prepare_bitmap (cyclomatic 21): rhwp::renderer::bitmap_raster::prepare_bitmap 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":"src/renderer/bitmap_raster.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4d697e4cda96c8a998e4a0522c4a70a54499cb65c0c8ce271bdc8caa27d9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::canvaskit_m07_pack_contract::op_from_matrix_row (cyclomatic 21): rhwp::renderer::canvaskit_m07_pack_contract::op_from_matrix_row 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":"src/renderer/canvaskit_m07_pack_contract.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd02198f4191f0f93128b1495ef14412e777f659b619247c809a66f6061beb3f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::layout_picture_band_impl (cyclomatic 21): rhwp::renderer::composer::line_breaking::layout_picture_band_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5874e64e310132df5b3ddc9ef49214fa443ccd5bad8e1220c6b60f480b8796a2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::stored_external_geometry::stored_rows_require_external_geometry (cyclomatic 21): rhwp::renderer::composer::line_breaking::stored_external_geometry::stored_rows_require_external_geometry has cyclomatic complexity 21 (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":"src/renderer/composer/line_breaking/stored_external_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd47c205b898503363e401d11267eb3642f65328c96c4760f4b7d63febff53e3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::reflow_helpers::inc::recompose_stored_single_line_if_overflowing_cached_with_storage (cyclomatic 21): rhwp::renderer::composer::reflow_helpers::inc::recompose_stored_single_line_if_overflowing_cached_with_storage 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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"72192267d659adae51448c0c888c54ac6a8bd29e2bb7d70f0f7599a97828fb25"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_complete_row_frame_heights (cyclomatic 21): rhwp::renderer::float_placement::stored_complete_row_frame_heights 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":"src/renderer/float_placement.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44c38be2089f22324f8edd19e0195d409940b5b8456ffc9519b82c39057fc1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::justification_spacing::compress (cyclomatic 21): rhwp::renderer::layout::paragraph_layout::justification_spacing::compress 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":"src/renderer/layout/paragraph_layout/justification_spacing.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afef48c220dbd31ef721a45a3e0613e9deae511a02f982a0011a2c44f78b2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::extend_clipped_cell_horizontal_clip_to_nested_table_borders (cyclomatic 21): rhwp::renderer::layout::table_layout::extend_clipped_cell_horizontal_clip_to_nested_table_borders 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7737217de05326e32d50b6cc687212e51209cc4575456a919e736129392bfc4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::kopub_char_advance_em (cyclomatic 21): rhwp::renderer::layout::text_measurement::kopub_char_advance_em 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::layout::text_measurement::vertical_substitute_char (cyclomatic 24) 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6dc4929e26b81d16ba84fe3c6e7532b2f17bdf81b3652535a7da33b142e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::shaping::validate_shaping_request_with_face (cyclomatic 21): rhwp::renderer::shaping::validate_shaping_request_with_face 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":"src/renderer/shaping.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f214f02f7b6dec86990be435c9eb83df04c9000cc1cbac35885f3b4a925e98d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::svg_fragment::svg_text_font_usage (cyclomatic 21): rhwp::renderer::svg_fragment::svg_text_font_usage 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":"src/renderer/svg_fragment.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577c92116ee45df6f2027dfa418e96b64282bea033770c1cad2bd8577406125"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::table_row_frame::project_first_rowspan_frame (cyclomatic 21): rhwp::renderer::table_row_frame::project_first_rowspan_frame 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":"src/renderer/table_row_frame.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c8846727049d33dbe7bae5717db1be6844f1e520a98d1a062aa3bb6651b58"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::accepted_tac_column_frame (cyclomatic 21): rhwp::renderer::typeset::paragraph::content::accepted_tac_column_frame 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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"54747ede97c0a7ca35c5f373d35ad4351d201af4a6d36ee5d11dc88906317ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::control::serialize_group_child_records (cyclomatic 21): rhwp::serializer::control::serialize_group_child_records has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"31357d4b8e8b1b07f1ad54b61bc83c424f47eb335396c1db7c27ecd3bfc0e07b"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_docx.main (cyclomatic 21): extract_docx.main 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":".claude/skills/rhwp-exam-ingest/helpers/extract_docx.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb3d175eeab1e0ac3cecb1d28337078642036cd45570eefaeaceae0dc356834"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.validate_report (cyclomatic 21): audit.validate_report 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":"gym/tools/audit.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d0280502e3f3867fadc89db18a0ad316ed1f3a15354f1af04eda8cd23e5fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"competitive_bench.validate_capability_matrix (cyclomatic 21): competitive_bench.validate_capability_matrix 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":"gym/tools/competitive_bench.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbd5dbae64289cef630fc1ff1817dcfe58c6c32e5060acb49694b248e23fec8"}},{"ruleId":"D1","level":"warning","message":{"text":"competitive_bench.main (cyclomatic 21): competitive_bench.main 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":"gym/tools/competitive_bench.py"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d65e12d4d4dc19b617029c290f0dc1046638fdfe808e471c608e8f903bfa4d"}},{"ruleId":"D1","level":"warning","message":{"text":"_Plan.geometry (cyclomatic 21): _Plan.geometry has cyclomatic complexity 21 (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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da786ca964c4f5b4451bed950f1e111b401685909e64dfc4fd45a2f9487d7e9"}},{"ruleId":"D1","level":"warning","message":{"text":"write-tools.prepareEditTable (cyclomatic 21): write-tools.prepareEditTable has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1391, 1404). 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: write-tools.prepareWrite (cyclomatic 33) 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa667be51cf69ee04f8804897453ce8d636f2daaf4571dd4d103d3fec53684a"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.suppressPureReflowMoves (cyclomatic 21): diff-engine.suppressPureReflowMoves has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1497, 1481, 1482). 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"04eeaca46c554f03d4a84a2c43a6cbd21f29f9b1f795d882f4d4a477bcb186f2"}},{"ruleId":"D1","level":"warning","message":{"text":"local-fonts.loadPreferredLocalFontBytes (cyclomatic 21): local-fonts.loadPreferredLocalFontBytes 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6dc246f5260c2859a2220d80de7a576235e8a745535d1d8dc4389960c38bb"}},{"ruleId":"D1","level":"warning","message":{"text":"canvaskit-char-overlap.replayComposedCharOverlap (cyclomatic 21): canvaskit-char-overlap.replayComposedCharOverlap has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"rhwp-studio/src/view/canvaskit-char-overlap.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23d089849a2309b691fa65b778f8ef998f46bc096ea2aaf41e9bb0ccbd2b95f"}},{"ruleId":"D1","level":"warning","message":{"text":"image-header.gifHasSingleFrame (cyclomatic 21): image-header.gifHasSingleFrame 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fddfea4a0a0daccbaf8b3ddd528b07375581826d9f25f5ce65463a35526140"}},{"ruleId":"D1","level":"warning","message":{"text":"flow-image-clip.flowImageOpsFromNarrowQuery (cyclomatic 21): flow-image-clip.flowImageOpsFromNarrowQuery 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf1bc43a3eeb5604d031426fd8a6f776f3a859c3eba243f03761f74b154b8c"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewportManager.onWheel (cyclomatic 21): ViewportManager.onWheel 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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86353e43c5559b2f5489f14648668c84c7b901a2351178f24f7c09f62ee5af8"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.renderHeaderFooterEditOverlays (cyclomatic 21): CanvasView.renderHeaderFooterEditOverlays has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7a970241bcc8bc065a55ddeb13a4c11a47140c5f42ccaffe7d5990a96f1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.setPageViewSettings (cyclomatic 21): CanvasView.setPageViewSettings 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf2e8e10e1d28518cf26cd416057152581a6d867e49b71040e700097666c5e2"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentAgentController.applyTextCommand (cyclomatic 21): DocumentAgentController.applyTextCommand 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 one function literal inside it that branches (line 464). 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e29957411a3be8c69941360d55c66091c97439fd2e5c9dce8baf6dff4a1d082"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-hyperlink.hyperlinkAtPointer (cyclomatic 21): input-handler-hyperlink.hyperlinkAtPointer has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d475231367979eaa1fa31a5cb6182522477024baf4376af4c056d4b1dbef019f"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.finishTextboxPlacement (cyclomatic 21): InputHandler.finishTextboxPlacement 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d54ae581337f9ec84bfd6c0343b20b35b1fa627c755d15e651d60bd4a5cb739"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.updateTextSelectionDragFromPointer (cyclomatic 21): InputHandler.updateTextSelectionDragFromPointer 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba4470700d7ed78b1c2b47b61b7ef84216c17b25b546365c668d3b1044c7e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.copySelectedObject (cyclomatic 21): InputHandler.copySelectedObject has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to 3 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b789e1264b1d130414421df6559139697146690ba6367792d32e6c0c208b604"}},{"ruleId":"D1","level":"warning","message":{"text":"#runObjectAction (cyclomatic 21): #runObjectAction has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 8 function items 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d14fbb2dd7c357ea68f19513e8d1d29f1739476fd718a96634157b9de471e5"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveSettings (cyclomatic 21): resolveSettings has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/settings-store.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8bc8091456bf238cd4cb8f276e9ec967fbf1dedb87b880ed444ce3ca4eb36c"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect (cyclomatic 21): inspect 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":"rhwp-firefox/dev-tools-inject.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9cba75b3392838d85fc4b652f69176dbdd5e67e1fd107f28680e0d0c771033"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect (cyclomatic 21): inspect 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"134dab346bdb590bec79565ddb61dc3a0414fd81f97602b984e365ffca668da3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pseudo (cyclomatic 20): Parser::parse_pseudo 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":"src/agent/dsel/parse.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"af838f1ab864b3446db9718fcb2136f62c774f7e376203f612172f957312f201"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::clear_missing_lineseg_placeholders_in_control (cyclomatic 20): DocumentCore::clear_missing_lineseg_placeholders_in_control has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (DocumentCore::materialize_missing_lineseg_paragraphs_in_control) 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":"src/document_core/commands/document.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0c71b64975211dfe3b46c56b9895726a1335500b681a1d20cca1ef1585c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::materialize_missing_lineseg_paragraphs_in_control (cyclomatic 20): DocumentCore::materialize_missing_lineseg_paragraphs_in_control has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (DocumentCore::clear_missing_lineseg_placeholders_in_control) 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":"src/document_core/commands/document.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6530d6046a448ac0100312ca605d8db731d7ea02b52cc5f30617a1b36848d34e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::change_shape_z_order_native (cyclomatic 20): DocumentCore::change_shape_z_order_native 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d513ed0dfd7e429f8886ad64a236e3e71f31f53bc9289cccf322605033e7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::reflow_cell_paragraph_with_metrics (cyclomatic 20): DocumentCore::reflow_cell_paragraph_with_metrics 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: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd7a742097a6702514bdc1ef1c5a7dc934b0fa062ae8a4371bde0cbbe4c630a"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit (cyclomatic 20): DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit 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 shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5804da63c64e901362209e55ec4f2d1173496b1addec3a8158964ade0ab03b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts (cyclomatic 20): DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts 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 shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba6d38144b897ce007c546bbed1576bc949ace8f474dce055632ae9b11e778b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::cursor_rect_in_cell_via_page_tree (cyclomatic 20): DocumentCore::cursor_rect_in_cell_via_page_tree has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (find_table_cell_bbox, find_cell_run). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53aa8b3578b66a25dab3d8c7d7b59176891d9876a65e37e7082ee159f3c2d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::header_footer_table_cell_hit (cyclomatic 20): DocumentCore::header_footer_table_cell_hit has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (find_cell, runs, inside). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4999}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fae62026d14840220ef904ed196bfabf40c1f87dd555f5a6fa22f5d2adde56c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_in_footnote_native (cyclomatic 20): DocumentCore::get_cursor_rect_in_footnote_native has cyclomatic complexity 20 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f93042cf855ac05324c56ccbfdb083290fb57908ba9ea9014475cb51b82bc"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::bookmarks_in_layer_tree::walk (cyclomatic 20): DocumentCore::bookmarks_in_layer_tree::walk 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":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"833ce79117c8e4387979162ba5f33771ce6c210cabd2d6ff9254629219a827b7"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_symbol (cyclomatic 20): EqLayout::layout_symbol 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. This is NOT this file\u0027s highest cyclomatic complexity: EqLayout::layout_node (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":"src/renderer/equation/layout.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef1ac336b45126d98699cdc8cdf22e9c4654950c500a0aa95ff9b383c3e5224"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::reflow_nested_closing_band (cyclomatic 20): LayoutEngine::reflow_nested_closing_band 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":"src/renderer/layout/table_layout/reflow_nested_band.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a244c27d6f261c9bfd9e5a57f746715afeae33357f61b05f0bd9096dcf235f"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_block_cut_is_original_source_page (cyclomatic 20): LayoutEngine::row_block_cut_is_original_source_page 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fb4c5d69362773626cfa31f44a02148b843beb2d112caa6baab12c7fe15e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_plain_restart_cut (cyclomatic 20): LayoutEngine::stored_plain_restart_cut 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22584}}}],"partialFingerprints":{"codehealthFindingId/v1":"676510846f0409c240ee5035e5fee5ec26028a733184989430d720ff353fc144"}},{"ruleId":"D1","level":"warning","message":{"text":"TypefaceCatalog::load (cyclomatic 20): TypefaceCatalog::load has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/font_catalog.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b9ddd580a55960d48e2ae0475f14030bfb8b22add4640ac3cfc2055fed404d"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLines::shape (cyclomatic 20): TextLines::shape 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":"src/renderer/skia/text_replay/lines.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ef85005c7b2b6fbcbe2f4705389d6219859a116174017525db70668a39086c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetState::prepare_saved_empty_run (cyclomatic 20): TypesetState::prepare_saved_empty_run 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":"src/renderer/typeset/state/empty_run.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb65473735ea2d1d23443f348b23d0a1544ccd3f01d0f09f0c1722c77b10b2d5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::typeset_inline_flow_with_storage (cyclomatic 20): TypesetEngine::typeset_inline_flow_with_storage 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":"src/renderer/typeset/inline_flow.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5adf5f3cc3e240a08db7efb4975e9ff4310b3c1dee4487b94c8f7c26860e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::apply_square_gradient_fill (cyclomatic 20): WebCanvasRenderer::apply_square_gradient_fill 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70832fa1316d9c085e068ec95d1dab8a7a808b7cf506ed821f60bff529e5b59"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::draw_rect_with_gradient (cyclomatic 20): WebCanvasRenderer::draw_rect_with_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":"src/renderer/web_canvas.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff631feaea529912edec0e8bc8ca47a9697d7a42ead85a5ebd7ef74ae907c91"}},{"ruleId":"D1","level":"warning","message":{"text":"Bitmap::from (cyclomatic 20): Bitmap::from 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":"src/wmf/converter/bitmap.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52e61f8a49fcf300a82e5dabe72cb805b866fc58a262afbb32ba9e2672db3cf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::conversion::extract_pages (cyclomatic 20): rhwp::cli::commands::conversion::extract_pages 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":"src/cli/commands/conversion.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaae5b2652496844da9edfbc7f805765f590a1e501bba4fffc1c5a8878cc601"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_delete_bookmark (cyclomatic 20): rhwp::cli::commands::edit::bookmarks::edit_delete_bookmark 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fcec23e3f4a26ae391152d7a288d043533a103f299e92477917f6994029c98"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_page_border_fill (cyclomatic 20): rhwp::cli::commands::edit::document_objects::edit_set_page_border_fill 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"95762d567462da00e73e34e7baada101c7be604392ee8f3bdd1b9d62daa0f084"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_paragraph (cyclomatic 20): rhwp::cli::commands::edit::document_text::edit_insert_paragraph 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21c5e0aa61bad94c62f51c2ee1840a1844f7dba0407c67494292c2f9104914"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_page_def (cyclomatic 20): rhwp::cli::commands::edit::page::edit_set_page_def 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::page::edit_set_section_def) 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed19a74da9827c795f483163845d75251d99d1e3953bba6e38b3b4328463056"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_section_def (cyclomatic 20): rhwp::cli::commands::edit::page::edit_set_section_def 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::page::edit_set_page_def) 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df2d2fbc4d6a1cceec4c63c1f019a2a10ef0336ec909eac9535c83e50f56293"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_delete_row (cyclomatic 20): rhwp::cli::commands::edit::tables::grid::edit_delete_row 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_delete_col) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf136a4de6dfeade2279cf73040df7cf38a08c1aeaca9b5ac2cee593d019ff"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_delete_col (cyclomatic 20): rhwp::cli::commands::edit::tables::grid::edit_delete_col 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_delete_row) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"949c80450e21487930a44547c29425a7ab2bc886abc2bfafc890c93044ca2d87"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::text::parse_replace_text_args (cyclomatic 20): rhwp::cli::commands::edit::text::parse_replace_text_args 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":"src/cli/commands/edit/text.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"52304754cd7ce2963504e4c6779f4c3f569ac34b486f6eaa2953f71d395e6186"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_propose (cyclomatic 20): rhwp::cli::protocol::exchange::settlement::cmd_settle_propose 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea2980a088078b9203561c41e19a33b257d1791a6e967c372432c56d0bf7a6d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::data_extraction::extract_data_command (cyclomatic 20): rhwp::cli::queries::data_extraction::extract_data_command 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":"src/cli/queries/data_extraction.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e1ffe0414d1e87e79d5e79a9ab0051ce2db44c655bcb5d52d4c088be5cb124"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::search::search_document (cyclomatic 20): rhwp::cli::queries::search::search_document 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":"src/cli/queries/search.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dee885c811ef3850c7d6e69bc6aacbfade03b4fd7357ad9f2553bb590a6e46f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_mel_personnel_probe::patch_section (cyclomatic 20): rhwp::diagnostics::hwp5_mel_personnel_probe::patch_section 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":"src/diagnostics/hwp5_mel_personnel_probe.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae766bfea13f91eef72be809e5dc010f42f0ae7e4ec267ff3ee93f70bfaef3a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_table_probe::patch_section (cyclomatic 20): rhwp::diagnostics::hwp5_table_probe::patch_section 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":"src/diagnostics/hwp5_table_probe.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d32187699b1214ca48a9a7ad980133a45ba2120866788609f7f733743acb78"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::ir_field_sweep::strip_shape (cyclomatic 20): rhwp::diagnostics::ir_field_sweep::strip_shape 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: rhwp::diagnostics::ir_field_sweep::sweep_control (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f52a587238aaeec9566ad44ec85610741be6286fdf403b60f21e09b1fd5b43"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::document::tac_cache_repair::repair_cell_width_caches (cyclomatic 20): rhwp::document_core::commands::document::tac_cache_repair::repair_cell_width_caches 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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"411ecb6d315d2714e66ea979a720f537b365a774c9178fc7cd0c9a4e4afd5dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::plan_identity_edits (cyclomatic 20): rhwp::document_core::commands::object_ops::chart::plan_identity_edits 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feb91f4d2cb3040f3529a482455f301e8e955b6b28afea9c8dc849401d70a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::text_editing::focused_cursor_local_geometry (cyclomatic 20): rhwp::document_core::commands::text_editing::focused_cursor_local_geometry 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: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac17e77099b2955fc07acf5d26955447df2ba8d7094c8ea54afdb7e2a3125a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::font_metric_coverage::classification::classify_decision (cyclomatic 20): rhwp::document_core::queries::font_metric_coverage::classification::classify_decision 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":"src/document_core/queries/font_metric_coverage/classification.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f4356da05755b5afcbd195430e52f6b8ec2d1bb3d31567bf052032701f5ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::collect_cached_focused_tail_lines (cyclomatic 20): rhwp::document_core::queries::rendering::collect_cached_focused_tail_lines 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f85d16c4ae2bc2e6a62484f080e6504ec2c473de59c546cf6471db4614ec08"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::threat_scan::scan_hwp5 (cyclomatic 20): rhwp::document_core::queries::threat_scan::scan_hwp5 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":"src/document_core/queries/threat_scan.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"248da382256f7a56184cdc90404453f66ce52e500db7c035b9eb804ebd1b2d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::gen_table (cyclomatic 20): rhwp::gen_table 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":"src/main.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"90acee673922ddeae24dae90a4c374293d386577483abe680b4dce0935271667"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mcp_serve::session_set_cell (cyclomatic 20): rhwp::mcp_serve::session_set_cell 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::mcp_serve::handle_tool_call (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":"src/mcp_serve.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1cbbdd6644e962a4ff59b2c93ab3e1bc1f206d6806cf33d0aa8c73a16ea63b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1064::probes::dump_table_ctrl_data::parse_parameter_set (cyclomatic 20): rhwp::mydocs::tech::investigations::issue-1064::probes::dump_table_ctrl_data::parse_parameter_set 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":"mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e424a661ac9147fb1a58787f03c22beaa586c7ecdeceb6094be082e1044e39"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::native_host::runtime::worker::worker_loop (cyclomatic 20): rhwp::native_host::runtime::worker::worker_loop 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":"src/native_host/runtime/worker.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a023235d851afbafef67feb5d7ee92249f4d9e1ac9fae62c89369f393e06fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::dot_leader::paths_for (cyclomatic 20): rhwp::paint::dot_leader::paths_for 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":"src/paint/dot_leader.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52e19e439b8cc10cf064da6bcb44c23099b980add0fda58c96139917dc1a4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::load_bin_data_content (cyclomatic 20): rhwp::parser::load_bin_data_content 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":"src/parser/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"339a2a8199ff827d2124e77d6fc1d890a18803834ea72c5bea46a116bab2b11c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::body_text::assign_memo_paragraphs (cyclomatic 20): rhwp::parser::body_text::assign_memo_paragraphs 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":"src/parser/body_text.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ce355ef465ecc4a1c7a6c2aadf7f901611142dd01d598c3a654fca65a9e1d3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_font (cyclomatic 20): rhwp::parser::hwpx::header::parse_font 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":"src/parser/hwpx/header.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e30ef5229b91194e54f4e2670d33d681877c90424f9ae5668941e9099a84fc1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_caption (cyclomatic 20): rhwp::parser::hwpx::section::parse_caption 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d76dce735b94037fcd5d7d1e9dd7ce5827036b4de0ced9d9277bb86e66592e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_container_body (cyclomatic 20): rhwp::parser::hwpx::section::parse_container_body 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":"src/parser/hwpx/section.rs"},"region":{"startLine":5103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f083ca620a5e90fb516aa9bc1069481a0656efc45a484a29b141cefb16a8c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::parse_pdf_with_request_and_progress (cyclomatic 20): rhwp::parser::pdf::parse_pdf_with_request_and_progress 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":"src/parser/pdf/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0887e0896ebc2dbbe7cc7bd3f078b4f04c2916d894f50cebb74c54cce45fb5d6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::empty_faces::from_clip_scopes (cyclomatic 20): rhwp::parser::pdf::table_detection::cell_regions::empty_faces::from_clip_scopes 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":"src/parser/pdf/table_detection/cell_regions/empty_faces.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4372f7adffd5392381ac4b695cd04060e830e5f77934585c3efde285b8342f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::render_backend::scenes::materialize_scene_op (cyclomatic 20): rhwp::render_backend::scenes::materialize_scene_op 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":"src/render_backend/scenes.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"df458171cf858605b5b6a6b6d99a30ff25dfae09446744d788bbfd4bb297d32e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage (cyclomatic 20): rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage 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":"src/renderer/float_placement/reflow_block_cell.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05808a08b7c8f7287982e3c0710a1bd2c651f1bdce963e8b7bb068ea369743b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_header::parse_jpeg_header (cyclomatic 20): rhwp::renderer::image_header::parse_jpeg_header 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":"src/renderer/image_header.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0f027629ab50444cb5ef5046edab7ad690392894eaac06c9c65ade44e78bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::image_resolver::detect_image_mime_type (cyclomatic 20): rhwp::renderer::image_resolver::detect_image_mime_type 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":"src/renderer/image_resolver.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0458737998ffdeeca481b38de4279b29557eea33fc4fdd20b46655fc8d9522"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host (cyclomatic 20): rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host 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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac903c8389831258314648fc1d36d99edcd9b0131ade1e90b67191fdf35fcf3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::kerning::compute_kerning_pair_candidate (cyclomatic 20): rhwp::renderer::kerning::compute_kerning_pair_candidate 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":"src/renderer/kerning.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d749057b3320a9618cafd15dbe63c131e3012cbd840bdaf1b42af99488e12e10"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::apply_table_outer_border_fill (cyclomatic 20): rhwp::renderer::layout::border_rendering::apply_table_outer_border_fill has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1424ce4aaeac59b0be6a16ac362e4f5208d95a75fa81112bd6a45d5f5bd282c4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::extract_tab_leaders_with_extended (cyclomatic 20): rhwp::renderer::layout::text_measurement::extract_tab_leaders_with_extended 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: rhwp::renderer::layout::text_measurement::vertical_substitute_char (cyclomatic 24) 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd5335e61b59f4d8e6f7e96e913dce2b73ef03a04f47048eb358b0deaa79b4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::pdf::svgs_to_pdf_annotations_impl (cyclomatic 20): rhwp::renderer::pdf::svgs_to_pdf_annotations_impl 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":"src/renderer/pdf.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6284ceefafa798aa46d2175eaca663fb6714013f6a4b9e584a7d6f0d74fead05"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::text_replay::decorations::draw_line_shape (cyclomatic 20): rhwp::renderer::skia::text_replay::decorations::draw_line_shape 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":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2fa504bc50d5c267cfe4f6816787ae5ac5774478d95c87e611349d23c91db7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::wasm_api::pdf_import::options (cyclomatic 20): rhwp::wasm_api::pdf_import::options 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":"src/wasm_api/pdf_import.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad19881dfe23ede48e5310ebb636dd8cd620d65cb8be7d9d82cb82b18ae66acf"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.load_pack (cyclomatic 20): runner.load_pack 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":"gym/core/runner.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb9143eb3b587437b72625fac9396d8905d57ff8af4443e609752bcf1125fc"}},{"ruleId":"D1","level":"warning","message":{"text":"report.render_card (cyclomatic 20): report.render_card 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":"gym/report.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dd948f7229b0b2bb8e9565c9c86159c655fc39629b33ffb0d7e872ab5d1257"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.classify_sequence (cyclomatic 20): agent_session.classify_sequence 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":"gym/tools/agent_session.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48d8af9ecec99464716989c4bfed75a0a1c025905c7c4f974a408c704ce1910"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.render_score (cyclomatic 20): agent_session.render_score 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":"gym/tools/agent_session.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc7897a8fce440fa0f51433d15237a84905f3650d1496a49539b103d70eebb"}},{"ruleId":"D1","level":"warning","message":{"text":"competitive_bench.export_text_verdict (cyclomatic 20): competitive_bench.export_text_verdict 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":"gym/tools/competitive_bench.py"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"7483aa03d0c2ed8d3c8013dee48fd495853d2496207e50949c9acfb2f60638bf"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTransport._handlePortMessage (cyclomatic 20): EditorTransport._handlePortMessage has cyclomatic complexity 20 (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":"npm/editor/transport.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"052433f9c9ef01dd76202e28a6aae92f4481ad89aaaea73ad242a2751a6af40a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.expression (cyclomatic 20): Parser.expression 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d690928487b871f68211d84d03f9a885196e4ec785f4c36a7bc72f93120424f"}},{"ruleId":"D1","level":"warning","message":{"text":"action-runtime.evaluateFormAction.assign (cyclomatic 20): action-runtime.evaluateFormAction.assign 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00f7df2cbe1a43e9de4ccfe610287584e9c2333ce780e1e2e21502583fe11cb"}},{"ruleId":"D1","level":"warning","message":{"text":"write-tools.prepareFormatCell (cyclomatic 20): write-tools.prepareFormatCell has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1564, 1584). 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: write-tools.prepareWrite (cyclomatic 33) 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9969538eeaf85f75dd0e0791224ea15b2955a736e858f5303ed3d0da5eda59a"}},{"ruleId":"D1","level":"warning","message":{"text":"claude.classifyClaudeError (cyclomatic 20): claude.classifyClaudeError 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":"rhwp-studio/src/ai/provider/claude.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ee470dca25dd5552363c74e200dd443f6cd7503ece3d356cb22d65a792c745"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmBridge.prepareCanvasMetrics (cyclomatic 20): WasmBridge.prepareCanvasMetrics has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 3 function items 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca146eaa403f76f479562a0f6aac9469d3d61a9741c6cd79942fa20729fcd3"}},{"ruleId":"D1","level":"warning","message":{"text":"VirtualScroll.getVisibilitySnapshot (cyclomatic 20): VirtualScroll.getVisibilitySnapshot 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334572eb521a73435cd5da68194eaf6ef078d7af2ba7b29e36549f8d5b96bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"print-image-sampling.drawPrintAreaImage (cyclomatic 20): print-image-sampling.drawPrintAreaImage 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":"rhwp-studio/src/view/canvaskit/print-image-sampling.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d912b439dddef4f7ab08de9866de5ba0921803433b1b2ecce997b8bb805897c"}},{"ruleId":"D1","level":"warning","message":{"text":"image-header.parseWebpHeader (cyclomatic 20): image-header.parseWebpHeader has cyclomatic complexity 20 (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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10a8d80bce558dfb0e87915e2a6afa89c0e83e22fd49999371a812f7503e66d"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTabLeader::draw (cyclomatic 20): CanvasKitLayerRenderer.renderTabLeader::draw 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"2269349f71d2e8b9b3cc0c25fc0f46c93afb6e8f163ea493db75eb231704a7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStaticSvgTextLayer (cyclomatic 20): CanvasKitLayerRenderer.drawStaticSvgTextLayer 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: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80dd43e85a76f098c3b8f534ca1e004efa610c9da3cdb2b4098aa067c88d259"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasView.buildPrefetchRenderWork (cyclomatic 20): CanvasView.buildPrefetchRenderWork has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 843, 826). 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47c882c0ee261ff7e4aa9d4c1c71f0f2aa92eb352a41e0d5568e0a899276fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"CursorState.moveToParagraphBoundary (cyclomatic 20): CursorState.moveToParagraphBoundary has cyclomatic complexity 20 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ebc2758cbce17605a1b497e1c1bee9c69be1e915d8ea3a69ca55d6e1d2616f"}},{"ruleId":"D1","level":"warning","message":{"text":"input-edit-invalidation.isPageLocalTextEditCommand (cyclomatic 20): input-edit-invalidation.isPageLocalTextEditCommand 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":"rhwp-studio/src/engine/input-edit-invalidation.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b371648295a002db36e94dff1e44fe991479e89861ad35e2d523539509fd79f"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaDialog.onConfirm (cyclomatic 20): FormulaDialog.onConfirm has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item 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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"035b1e7cd9b61b3a07c11c7c3d9970e616d67bff3f6d78d2bfa5db09fbd8075e"}},{"ruleId":"D1","level":"warning","message":{"text":"Toolbar.setupFontControls (cyclomatic 20): Toolbar.setupFontControls has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 274, 265, 319, \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":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f4aef2bc4fda30bcde7e7091f09406dee60e25cf712277975d5cd1561f5207"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 14 function items inside it that branch (label, label::find, a function literal at line 111, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr8187/browser-api.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d6dc4793a096bd8f19bc6e623aa11520b0837820b34913636c6aa6decb3949"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::project_container_float_bands (cyclomatic 19): DocumentCore::project_container_float_bands 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":"src/document_core/commands/document.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc61098a58907c5923403c3f1454af6d317b2512636211d68a1c154c70e7108"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::paste_foreign_document_native (cyclomatic 19): DocumentCore::paste_foreign_document_native 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c376003cd99afb06e227db2b08db084879c5be728ffcc0d166158e1b2d3d71b0"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::css_to_char_shape_id (cyclomatic 19): DocumentCore::css_to_char_shape_id 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31ac5da0f77b744a5f015abcd1c0ee98f872a5e4885d2880303203fe55d59b8"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::find_pages_for_cell_position (cyclomatic 19): DocumentCore::find_pages_for_cell_position has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::text_editing::control_structure_tag (cyclomatic 24) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99acc807734b7c40bcbb4a7ab4071efd3d1388ec1de3e67db1c6bbc65347678"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::move_inline_control_native (cyclomatic 19): DocumentCore::move_inline_control_native 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":"src/document_core/inline_control.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"084dcbbdb8469711c1d53b7bb682471f9866500905d512b81526ee0b1d349193"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::resolve_body_page_fields (cyclomatic 19): DocumentCore::resolve_body_page_fields 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":"src/document_core/queries/body_page_fields.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e55c31532c1fbc0c96fa553dd621ad6b3ed1aaf05b085ed1789924a1573c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::break_at_cursor (cyclomatic 19): DocumentCore::break_at_cursor 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: rhwp::document_core::queries::hwpctrl_sets::control_identity (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1edd0f0740fd381d14b473b16a0a329400737222fc3f869620beadcefba0d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Record::read (cyclomatic 19): Record::read 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":"src/model/border_paint.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1224d019069ec93a3be640a85f65cf694b60064b665fcc35489327f063d554fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::rowspan_declared_overflow_shrink (cyclomatic 19): Table::rowspan_declared_overflow_shrink 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":"src/model/table.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65f4a6fe7037a22d47e50423021963d79d3e740b9abd1973d1f15aa4cbfc593"}},{"ruleId":"D1","level":"warning","message":{"text":"PageLayerTree::typed_text_v2_slots (cyclomatic 19): PageLayerTree::typed_text_v2_slots 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":"src/paint/text_v2_slots.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8e8ed602485deac74fb1e7ab8392b0e7373ee28f5fbf4a4930b3c0b153e36f"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalogue::build (cyclomatic 19): Catalogue::build 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":"src/paint/metafile_print/catalog.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6329063ec61d5827c222a884363cc84986297cb76e53d88d9b441c9ac4552cba"}},{"ruleId":"D1","level":"warning","message":{"text":"Ledger::shared_edges (cyclomatic 19): Ledger::shared_edges has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_inference.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2068aa9919b63353bee69b4da9cf5fdbdcb1fe74b800a83d29e47b892b005d26"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_math_symbol (cyclomatic 19): EqLayout::layout_math_symbol 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: EqLayout::layout_node (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":"src/renderer/equation/layout.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8ccc5b54c75ba8c9d6cc7fb291fbf5155766186b45da7605c1c13bcfab1341"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_eqalign (cyclomatic 19): EqParser::parse_eqalign 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":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ece0003398caf17343fb1ed27eddbbcf1f790f5993ee6a7bedddcab0b1bbfb2"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_matrix (cyclomatic 19): EqParser::parse_matrix 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":"src/renderer/equation/parser_structures.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eb1164985d469423946c787d5eea27ecefd509197d5e5bd1c30e342bdfac5b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::closed_nested_frame_owns_following_empty_line (cyclomatic 19): LayoutEngine::closed_nested_frame_owns_following_empty_line 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":"src/renderer/layout/table_layout/nested_empty_line_flow.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19b438b2f054381aee43ba82cde3c8853e455de6a9c2dddf4ac2cdc83a23be0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_block_source_rows (cyclomatic 19): LayoutEngine::stored_block_source_rows 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"260f17801cabcacee3295c670d419767ce6218b184b738fa02b2962c2d39eb62"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_cut_closes_original_restart_frame (cyclomatic 19): LayoutEngine::row_cut_closes_original_restart_frame 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":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384eb9ee644b9823cdfd57eda9d76f34176c81e3dd4f20f436503bd20fb73ac"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_cut_closes_shared_original_frame (cyclomatic 19): LayoutEngine::row_cut_closes_shared_original_frame 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":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"863efda465f4077a77fc1031acb7ed80f9d020ecfe2d74523ef76bf4db3d0dac"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_wrapper_opening_frame (cyclomatic 19): LayoutEngine::stored_wrapper_opening_frame 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":"src/renderer/layout/table_layout/stored_wrapper_opening_frame.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4379eccf5a220d247265b2599e7c8e2bce3ea0bba4fc4cb3a11e9337261f75"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_zero_origin_text_frame_break_witness (cyclomatic 19): LayoutEngine::stored_zero_origin_text_frame_break_witness 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":"src/renderer/layout/table_layout/stored_zero_origin.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7888e64b4e56733f38cdca2692232d7d97904fc1e344f001a5b2648c95e302"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_joint_zero_origin_boundary (cyclomatic 19): LayoutEngine::stored_joint_zero_origin_boundary 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d828ea6f6322b4d90173b06b9e6d0ce70f225d195b043886b340a41034c6796"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::saved_single_cell_opening_frame_height (cyclomatic 19): LayoutEngine::saved_single_cell_opening_frame_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee727aadaa5b6ffe2e2833e7c8cb98b47e32b061692677f7e3bd0b812904fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::nested_cut_height (cyclomatic 19): LayoutEngine::nested_cut_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbf302e47bd292157409b6682f0e7a1a79688f7c1e564f8414b6d50172ca0e2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::partial_table_page_contains_cell_position (cyclomatic 19): LayoutEngine::partial_table_page_contains_cell_position 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e4555b10378a90bd7111800e7a9d6be6078f28d496e8ec61d91ea95d59db9e"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::render_text_run (cyclomatic 19): WebCanvasRenderer::render_text_run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d128cb5a1c80778fbe53ca7ee23eea96f85b9e9f074cf2aad34bd2a307f9f13"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::difftext::run (cyclomatic 19): rhwp::bin::rhwp-agent::difftext::run 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":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5b7dc637237a83740f1fc01c4612e0a0da87e808886588e602adc6fc2be511"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::grepcmd::run_grep (cyclomatic 19): rhwp::bin::rhwp-agent::grepcmd::run_grep 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":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c245592b5b8513ddc1393d93f14a29c7f664a08ca9737486392d455ae5de9e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::inspect::run_page_window (cyclomatic 19): rhwp::bin::rhwp-agent::inspect::run_page_window 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":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e985e3b5dbbe149533705efc7b4730cfac08fd992bf6c483f1c7a946e90505bc"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::char_index::run (cyclomatic 19): rhwp::bin::rhwp-q::kit::char_index::run 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":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a9c09eb9771efc891a5c60d2acbf92efc0c56c150595fcddc88cd9aee282f6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::form_at::run (cyclomatic 19): rhwp::bin::rhwp-q::kit::form_at::run 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":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44c1f6af703e817971f6df7d35dacb19242a0f1edcab6be0aa3bd79f7b415b6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::form_value::run (cyclomatic 19): rhwp::bin::rhwp-q::kit::form_value::run 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":"src/bin/rhwp-q/kit/form_value.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc30a6b351ea19899b7f355b5aefd16863198c65fc6a91c2080dfd63bf5da4bf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_fn_marker::run (cyclomatic 19): rhwp::bin::rhwp-q::kit::hit_fn_marker::run 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":"src/bin/rhwp-q/kit/hit_fn_marker.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"edae2de01a4bd4ac4846094205df64ecad7dbbc88698d99ecc4a8a2af92d7b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_in_footnote::run (cyclomatic 19): rhwp::bin::rhwp-q::kit::hit_in_footnote::run 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":"src/bin/rhwp-q/kit/hit_in_footnote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dc333489cf177eb0ea35e792ec44ccba11e5706809c1dd6f8da5fd2ab56386"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::controls::edit_delete_control (cyclomatic 19): rhwp::cli::commands::edit::controls::edit_delete_control 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":"src/cli/commands/edit/controls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3587b7c112ec9c709348699186e969801ddfe20481294277d2363aa4511f5ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_split_paragraph (cyclomatic 19): rhwp::cli::commands::edit::document_text::edit_split_paragraph 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"064ee5a9b67783aa5db607479bbbd616a667219c8b117f96966012caf6a1f995"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_delete_equation (cyclomatic 19): rhwp::cli::commands::edit::equations::edit_delete_equation 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4704e585774bbfc45ffa1e7cfd8f83c52d215c9b1b3f92170eed22e126c5f329"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_delete_picture (cyclomatic 19): rhwp::cli::commands::edit::media::edit_delete_picture 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a62da5f858de542f38149ce47ad131a5443b245e679acaa7e9ba911753a465c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_apply_endnote_shape (cyclomatic 19): rhwp::cli::commands::edit::note_content::edit_apply_endnote_shape 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d11e23c2d3caaa67f7aa1c98ebf80bca9edebd4b331f1c4a0071a04524198d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_insert_footnote (cyclomatic 19): rhwp::cli::commands::edit::notes::edit_insert_footnote 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 shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_endnote, rhwp::cli::commands::edit::notes::edit_delete_footnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"445f8f01f7c328fb2572674a5fc970bfccba393a6e88bfa469f9f3c7f47826e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_insert_endnote (cyclomatic 19): rhwp::cli::commands::edit::notes::edit_insert_endnote 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 shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_footnote, rhwp::cli::commands::edit::notes::edit_delete_footnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"da62db27804be401691e3222ae7242df62efc24d2f52a7e75612ec6babd4aa3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_delete_footnote (cyclomatic 19): rhwp::cli::commands::edit::notes::edit_delete_footnote 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 shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_footnote, rhwp::cli::commands::edit::notes::edit_insert_endnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ef4abe6f59f6c470dd38415181aa55f63048f5fe0d43581b68e0295ce9d842"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_delete_shape (cyclomatic 19): rhwp::cli::commands::edit::shapes::edit_delete_shape 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 shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::shapes::edit_ungroup_shape) 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91979416d1cfd339ada97f5d9ea234b94918ddf9904dc0ac956a1518f1b46ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_ungroup_shape (cyclomatic 19): rhwp::cli::commands::edit::shapes::edit_ungroup_shape 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 shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::shapes::edit_delete_shape) 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c799055f55c4e96b5b41650fdf1b52acc3ec80d525e4cfd4e4ab7945ce8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_transpose_table (cyclomatic 19): rhwp::cli::commands::edit::tables::structure::edit_transpose_table 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":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9120348e048669477e973fe4182558755ac11a0b16aba2240a1178522e098efb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::armor_command (cyclomatic 19): rhwp::cli::queries::security_inspection::armor_command 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7950938b375b98be49839be60e1f652356d2aa5b4995df0781d0ea838a76b2d0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::structured_objects::form_value (cyclomatic 19): rhwp::cli::queries::structured_objects::form_value 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":"src/cli/queries/structured_objects.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48d61072f1f313dc967df0a354d6656839e5fbc64527896d5debba507137c74"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info (cyclomatic 19): rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc637dd94ba32a2027e6d9094ffd330a0b56cbdf52468e5f9f1a56ae92bc0131"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::drop_memo_fields (cyclomatic 19): rhwp::document_core::queries::memo_query::drop_memo_fields has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (walk, walk_shape). 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f4a3c24887fdea8bcb8ccdfe3875d0e6f64babf3617161dff0c6343f303a62"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::ole_chart::preview_palette::apply_preview_palette (cyclomatic 19): rhwp::ole_chart::preview_palette::apply_preview_palette 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":"src/ole_chart/preview_palette.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b67f2ec0b01a7f0b19dbd65e67d22f2c359bf277145cdbd7a7e6b0bb3782281"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::metafile_fonts::page_requests (cyclomatic 19): rhwp::paint::metafile_fonts::page_requests 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":"src/paint/metafile_fonts.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb433d24c06d36259829362056a7fca2c66f80591877f1e2e4d322e40d2ae8c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow (cyclomatic 19): rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow 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":"src/paint/shaping_glyph.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"9780872cde460619df025f9dd4fb9ca14bc948e9d570138960c2a83c20702cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::control::parse_table_control (cyclomatic 19): rhwp::parser::control::parse_table_control has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::parser::control::parse_control (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c67625e5e9438355aba76bc969d482e7c9db6604e5c50189dc5e0ea0e1a590c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::note_line_positions::normalize_hwpx_note_line_vpos (cyclomatic 19): rhwp::parser::hwpx::note_line_positions::normalize_hwpx_note_line_vpos 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":"src/parser/hwpx/note_line_positions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0410c926074d883818a4343ca4c35e305ad2ad5fd2cc8a98ded0065049ad5f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::editable::assemble (cyclomatic 19): rhwp::parser::pdf::editable::assemble 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":"src/parser/pdf/editable.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a16b9f8c0bb1729a38c9787a58f1a5859b4b88034b6cac525a45464acdab99"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::canvas_cluster_fit (cyclomatic 19): rhwp::renderer::canvas_cluster_fit 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: rhwp::renderer::installed_font_program_aliases (cyclomatic 36) 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":"src/renderer/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b07787eef8d95cde9f54e5f5fc383a879edddf87145da02d3f0392d0a22710"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::inline_picture_metrics::refresh_picture_rows_with_storage (cyclomatic 19): rhwp::renderer::composer::inline_picture_metrics::refresh_picture_rows_with_storage 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":"src/renderer/composer/inline_picture_metrics.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f4cf41e4604c259c4e6aff32f1c2720b072a0860860dabfe31bf0e0da5c69e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage (cyclomatic 19): rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage 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":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3f6f7023588649609d7fd548c08ba40e5fc5a214c15660b72718f6453a3fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow (cyclomatic 19): rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow 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":"src/renderer/float_placement.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7dbf794652ac19ae7a17232f2836f5ff7941a208a8c3519f596185d6f3f04a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_cell_flow (cyclomatic 19): rhwp::renderer::float_placement::stored_picture_cell_flow 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":"src/renderer/float_placement.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2312b29097557a0576e314ad17a905ebab70d751fa9ecc2b6811955e7baa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::column_rowbreak_fragment_opens_outer_top (cyclomatic 19): rhwp::renderer::float_placement::column_rowbreak_fragment_opens_outer_top 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":"src/renderer/float_placement.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8c35478a30003c135f3cb3a6bce55e84bd03ce1788531e37ddaf1d8b4d5ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::shaping_composition::map_horizontal_shaping_emitted_run (cyclomatic 19): rhwp::renderer::shaping_composition::map_horizontal_shaping_emitted_run 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":"src/renderer/shaping_composition.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97781d08b373afaa459ed3b0b27c30580db54635219a4b96223c8fb824b3bfa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::shaping_vertical::prepare_bounded_vertical_glyph_publication_shadow (cyclomatic 19): rhwp::renderer::shaping_vertical::prepare_bounded_vertical_glyph_publication_shadow 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":"src/renderer/shaping_vertical.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb46bf23e70f5480a108c8cc30805e0edb0f6efa7e664518e8c2570b0a0f31"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::text_direction::resolve_page (cyclomatic 19): rhwp::renderer::text_direction::resolve_page 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":"src/renderer/text_direction.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4603fb742cce0035c38defebdf58022ca0fca519bf03aef9fe4334c8f59a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::overflow::tail_overflow_candidate (cyclomatic 19): rhwp::renderer::typeset::paragraph::overflow::tail_overflow_candidate 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":"src/renderer/typeset/paragraph/overflow.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ab7bedb4d787e756f43ccc633e2255b477b89dcf0dbc033db10025e674eb39"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::security_trailer::open_with_privkey (cyclomatic 19): rhwp::security_trailer::open_with_privkey 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":"src/security_trailer.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77453124535c896bc4ee67096041b40595c75da03d8c71e8c5c8df9d7a0c5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.validate_task (cyclomatic 19): schema.validate_task 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":"gym/core/schema.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a395e921ef6534f2c6df7400cc2d0bf844b0d014b94f21e4fe2cb3811619ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.record_session (cyclomatic 19): agent_session.record_session 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":"gym/tools/agent_session.py"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9b947584d39faedd2f4492c0f5b1d15a1440d796e3f9f340f762e41a53b328"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.classify_schema_message (cyclomatic 19): audit.classify_schema_message 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":"gym/tools/audit.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2f46a5a5795fbaeb3bb5c475b9399df6c959f2c67d29a1b30c4a8b07fff819"}},{"ruleId":"D1","level":"warning","message":{"text":"audit.audit (cyclomatic 19): audit.audit 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":"gym/tools/audit.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e71113be067959345f9056a194ab439c3d1d35c2fc3df98d0895a1d5fe5481f"}},{"ruleId":"D1","level":"warning","message":{"text":"build_baseline.validate_step (cyclomatic 19): build_baseline.validate_step 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":"gym/tools/build_baseline.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c80730074d7e008dca92801fde2415a9667110cda090ace69257973def18b3"}},{"ruleId":"D1","level":"warning","message":{"text":"leaderboard.validate_invite (cyclomatic 19): leaderboard.validate_invite 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":"gym/tools/leaderboard.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"021de1cc17d7867f78518ddd4ab41d436932a1453748c341a280d3de317e3812"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.extract_json_fragment_rows (cyclomatic 19): pack_health.extract_json_fragment_rows 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":"gym/tools/pack_health.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3160b3056e243f2396e824747b5792e0f3a7baf1b62846e04050cb405cd2c506"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.fragment_looks_like_answer (cyclomatic 19): pack_health.fragment_looks_like_answer 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":"gym/tools/pack_health.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbed24f9375199208308af0b6328c8da62d38c85237771e1d825f1ae17d0cb"}},{"ruleId":"D1","level":"warning","message":{"text":"release_gate.render_summary_lines (cyclomatic 19): release_gate.render_summary_lines 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":"gym/tools/release_gate.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa55945988d968e34958bd412654e4c07f6347144f780f71779be8970e4777"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchRunner.run (cyclomatic 19): BatchRunner.run has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d790f4ea380ea2bbfc55af5d031abe788a03a8de90068267661fe868f48c9a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandErrorBoundary.fail (cyclomatic 19): CommandErrorBoundary.fail has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 78). 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":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b1830b6217bde1343393749f474b083d01497f047d58279082d7fc3f667877"}},{"ruleId":"D1","level":"warning","message":{"text":"http.readSse (cyclomatic 19): http.readSse has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 function items 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":"rhwp-studio/src/ai/provider/http.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"65261e0871c43ee2d21d3ce47f1bfc75994c2352fc74d486f8485c22e6164414"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiProvider.streamTurn (cyclomatic 19): GeminiProvider.streamTurn has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 321). 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7648bb056d400b32887e3c7abd67f9e125f327131a8565945f9772c426a7690d"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.buildIdentityTextDiffs (cyclomatic 19): diff-engine.buildIdentityTextDiffs has cyclomatic complexity 19 (threshold 15). Of this number, 18 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"177be5da9b127203669f04518390ab162b6fafe9dac38fb94a6b288470edad81"}},{"ruleId":"D1","level":"warning","message":{"text":"svg-image-header.svgCommentScanSource (cyclomatic 19): svg-image-header.svgCommentScanSource 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"166bb70277eec45c8e3d0c15b11d04f2bc5999340f880c15a5c387d890ff07ba"}},{"ruleId":"D1","level":"warning","message":{"text":"glyph-run-fonts.fontBlobPayloadBytes (cyclomatic 19): glyph-run-fonts.fontBlobPayloadBytes has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: glyph-run-fonts.isBoundedVerticalHwp5CanvasKitCandidate (cyclomatic 31) 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d40590f63e4e7cb8499fd038466ab5fb53c15a6b2ca88ba3344699c4b9a7f05"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitParagraphFonts.source (cyclomatic 19): CanvasKitParagraphFonts.source has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/view/canvaskit/paragraph-fonts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca79a2bac8a2573e7d654cf9d5571be26411181de38d3c929dac6bbf3a8f67e6"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStrokeWithDash (cyclomatic 19): CanvasKitLayerRenderer.drawStrokeWithDash has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f7f193e4e8a361d6979dd97bf7959e98a50ff6037881cf3af7a5d5e0ab19d"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.applyOverlays (cyclomatic 19): PageRenderer.applyOverlays 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83e1985b4b0cf32c1b5d103acb640d4292d99ff8e0cb5838b408036e61610f9"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.scheduleReRender (cyclomatic 19): PageRenderer.scheduleReRender has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (finish, a function literal at line 1191, a function literal at line 1202, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"41908c374849e4bbb3e3fba8b229b0663faae31f208cb039026ab46bf38f950c"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.installEmbedRuntime::onMessage (cyclomatic 19): runtime.installEmbedRuntime::onMessage 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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8e693d190ce1902e35ee0b7ab6914c3d697941fd07b5ddd10ba3a97a2e73bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SetCellBorderFillCommand.execute (cyclomatic 19): SetCellBorderFillCommand.execute has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8298ac233b1b635eb9c08618b7d7d15b6ff8c8c9787030c11d848f4161d7d87f"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.findPictureBbox (cyclomatic 19): input-handler-picture.findPictureBbox 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"aada533576cbbb34804b7773bcfbc6ed2eaac5092972b3732cbef3ecc204eabf"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.relocatePictureToDropPage (cyclomatic 19): input-handler-picture.relocatePictureToDropPage has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaacf30716f8702b84f3e4c5ee904bd53bfa663bcc905788dce8e61feae3f16c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d (cyclomatic 18): rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d 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/rhwp-ooxml-chart/src/renderer/chart_3d.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8793fbd201b0258ac442f51936b37d6fb4bc62ea6125819088152e282dc7ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof::complete (cyclomatic 18): Proof::complete 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebecca6cfba6a4bc51291ca0abe177cede9114c905141929a99795f4c608e63"}},{"ruleId":"D1","level":"warning","message":{"text":"RemapCtx::control (cyclomatic 18): RemapCtx::control 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"df67dcd090a6449a9fc9f6a9606bf99c3b3fad909ca94d9ab4a3398f16dba765"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_text_shadow_font_requests_native (cyclomatic 18): DocumentCore::get_text_shadow_font_requests_native 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":"src/document_core/commands/document/metafile_fonts.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5a29007769a9807f2951723d3b06519abec72e5b2f0ad7a83a3f7b5803f423"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::fit_hwpx_rowbreak_synthetic_cell_lines (cyclomatic 18): DocumentCore::fit_hwpx_rowbreak_synthetic_cell_lines 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":"src/document_core/commands/document.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec286fb370cb4b3ec912151c87899155c8fe3fff8a9df174934f7f61e5cf163"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_hf_template_native (cyclomatic 18): DocumentCore::apply_hf_template_native 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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9f2c73d3cd9e407238246d715611e1761c46264d0808b3709b8a06a94be255"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_chart_edits (cyclomatic 18): DocumentCore::apply_chart_edits 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662d8462b657223a1b9dbb83f58cb7648b3292247b5fa7d7f79868661a7856e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_endnote_shape_native (cyclomatic 18): DocumentCore::apply_endnote_shape_native has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: DocumentCore::footnote_shape_number_format_name (cyclomatic 19) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b907058700962bbfceed5df36e3f36d0dbf3999cc1c2d43d05adfd01a36cc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::compute_cell_page_offset (cyclomatic 18): DocumentCore::compute_cell_page_offset has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (find_cell, matches_cell_run). 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b4b672b4229ed773b4a6c8fa8bd34a3cef0cb87074601496509392edbcb724"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::update_neighbor_borders_for_sides (cyclomatic 18): DocumentCore::update_neighbor_borders_for_sides 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"867ef420bb66efff4e92b807a20c164fe1bf6fb7a402dcc584f5e24d2bd6b8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::delete_bookmark_native (cyclomatic 18): DocumentCore::delete_bookmark_native 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":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d103cc55b7772275dd73c974d042e5e18c5f9b7cdefdd53ebbb73d40f53c1c0"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_table_cell_bboxes_by_path_native (cyclomatic 18): DocumentCore::get_table_cell_bboxes_by_path_native has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (find_nested_table_cells::check_table_match, find_nested_table_cells). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fada88205b098fac05966df2f17ce4ed406c69c769a4d7d346728d40b0ee32"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::rebuild_embedded_exact_font_sources (cyclomatic 18): DocumentCore::rebuild_embedded_exact_font_sources 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce9c22f1beb6a0fd5769778dbc09a73b7508a3680b949ea5d41108ebd418bce"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::page_dump_section_ctx (cyclomatic 18): DocumentCore::page_dump_section_ctx 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5daa5d910ccd62b3f1bf4dee607723dcf0887129e9846bf70ae34dc9bf9cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::sync_tac_host_row (cyclomatic 18): DocumentCore::sync_tac_host_row 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":"src/document_core/tac_host_rows.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30dcfb6fa2781b7b66093f0231d33d65626973a7c2eab2fd366c01816ee8a02"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::split_cell (cyclomatic 18): Table::split_cell 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":"src/model/table.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801937396962c30e5e7931be944020c9dcc85552b50fb81e03073231645ded8"}},{"ruleId":"D1","level":"warning","message":{"text":"PageLayerTree::write_text_v2_export (cyclomatic 18): PageLayerTree::write_text_v2_export 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":"src/paint/text_v2_export.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b6c3243c5ccfafc502b898a8f0f137aec764a5559692e26ca9824e3f6ceed8"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_ladder (cyclomatic 18): EqLayout::layout_ladder 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":"src/renderer/equation/layout/ladder_geometry.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf8e29bddd00455ed41ad7126106935c39448e4cc331caa84dcdfe0526ec93a"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_command_fallback (cyclomatic 18): EqParser::parse_command_fallback 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":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e69b2306f942b476d3c4e7e2303ceba14ae55d8c1733b404a5afbeac34c233"}},{"ruleId":"D1","level":"warning","message":{"text":"HftOutlineFonts::register (cyclomatic 18): HftOutlineFonts::register 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":"src/renderer/hft_outline.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c352aeef4268dd76a6db84afc180c611590468d1d011f0fcecb96106ca93a"}},{"ruleId":"D1","level":"warning","message":{"text":"CondensePlan::prepare (cyclomatic 18): CondensePlan::prepare has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout/condense_spacing.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c0c56c5e361cb9c6724d28e9ff96630bcf974ae37bd8b932d5482ea1cc31e6"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_cell_shape_with_parent_path (cyclomatic 18): LayoutEngine::layout_cell_shape_with_parent_path 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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcd7b11ae318a6399aa8309acbb5308a67ce54ee6ed87ebf09325a1c1c10ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::delay_empty_anchor_topandbottom_flow_units_before_hard_break (cyclomatic 18): LayoutEngine::delay_empty_anchor_topandbottom_flow_units_before_hard_break 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":"src/renderer/layout/table_layout/deferred_flow_units.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0e2f0a2c39031ee0300e59bea28943e82ea2fe3e73f71d844eb28027830e4"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::empty_unit_owns_flow_line_box (cyclomatic 18): LayoutEngine::empty_unit_owns_flow_line_box 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":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6ee07c00b1902e05ee3c6a395e21bfec5545556a166b586fc25c4dfd4e74b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_blank_opening_frame_heights (cyclomatic 18): LayoutEngine::stored_blank_opening_frame_heights 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":"src/renderer/layout/table_layout/stored_page_unit_frames.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cc4c581597189b16cdda6a243ff179b1e523f303a4423dd0cf8722f520382a"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::standalone_table_char_border_fill (cyclomatic 18): LayoutEngine::standalone_table_char_border_fill 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7404d5d87f9cb143990ac5be9d8793c027438ee7ea7e94edcbd54e5542bb86b2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_block_cut_uses_measured_height (cyclomatic 18): LayoutEngine::row_block_cut_uses_measured_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0a1cc6f3060317c13ea52ba8ed40685f59fe840c60f6b0376b35c698f6fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_spanning_frame_cut_trailing_spacing (cyclomatic 18): LayoutEngine::stored_spanning_frame_cut_trailing_spacing 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180a1f44c8f7ab07afb6d2bb581812a89177eebd2eab440597be12a0598d8b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::saved_first_frame_block_cut_fits (cyclomatic 18): LayoutEngine::saved_first_frame_block_cut_fits 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1144555c99d90acb7a5d0f854e546d83832adbd82e6425e2d4c25d53049196"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::build_master_page (cyclomatic 18): LayoutEngine::build_master_page 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":"src/renderer/layout.rs"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e43840b12d578f0a677e3b6328a443c13ac21dd36f18f3dd39bfacaee07a8"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::build_page_number (cyclomatic 18): LayoutEngine::build_page_number 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":"src/renderer/layout.rs"},"region":{"startLine":6535}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0d1dab07607eb613e6bc3456dbdf34c98d38b49b1e5e7d1a94d0929d8e7b11"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfFontFallbackIndex::select (cyclomatic 18): PdfFontFallbackIndex::select has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::pdf::direct_pdf_validation::op_name (cyclomatic 19) 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":"src/renderer/pdf.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"796196f2145c610a73d4ddc47e6473c056106b0bc7afba3f0e261ee2bc26bcc9"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgRenderer::draw_line_shape (cyclomatic 18): SvgRenderer::draw_line_shape has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::svg::known_font_filenames (cyclomatic 39) 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":"src/renderer/svg.rs"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"7479218ee41d07a71d75dba03c1982ab2206f2543d3612c87ad7b89bb7b63b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetState::stored_tac_page (cyclomatic 18): TypesetState::stored_tac_page 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":"src/renderer/typeset/state/stored_tac.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e690b93481addffbb93d21220ab7ba67aa6a63c1f187f6b4d9bc87f1a73282"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::predict_current_column_para_y (cyclomatic 18): TypesetEngine::predict_current_column_para_y 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":"src/renderer/typeset.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e730509c4017354f9efd2c3ac7273cb551236b9e4459738990abbcdaa0a59e92"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::render_page_background (cyclomatic 18): WebCanvasRenderer::render_page_background 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":"src/renderer/web_canvas.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c61ea16f07031d4acf6a46f56b2cee8f7d1e04549af72f78bab9549e1a5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"TernaryRasterOperator::run (cyclomatic 18): TernaryRasterOperator::run 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":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"171c2811e230cd566ddfee4dcd492e80e56a0f550908b39eb39ae99bc8327821"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_armor (cyclomatic 18): rhwp::bin::rhwp-agent::safety::run_armor 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34d74797fb0e9abf114fd9ec0963d0a5f712156d9c2206592d4423f2112153e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::chart_csv::run (cyclomatic 18): rhwp::bin::rhwp-q::kit::chart_csv::run 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":"src/bin/rhwp-q/kit/chart_csv.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"73875edf8f63198ab522ec1fff172ccbf6cc6e08941f7a809850261f7da4a7db"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::field_info_at::run (cyclomatic 18): rhwp::bin::rhwp-q::kit::field_info_at::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/field_info_at.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d53094ca82ec007a72d53051ba471aa5f31760a54f3d21e23e9b234151fe7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::word_end::run (cyclomatic 18): rhwp::bin::rhwp-q::kit::word_end::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/word_end.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"43607f865edf564dc299b39f4bdfe6d7da1a02eb40ae9a9875681aa6b413bc85"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_delete_paragraph (cyclomatic 18): rhwp::cli::commands::edit::document_text::edit_delete_paragraph has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_merge_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca6d373d6eb44b38ea350ae4db71b1992d74f47e23262d3d80c066a4428f231"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_merge_paragraph (cyclomatic 18): rhwp::cli::commands::edit::document_text::edit_merge_paragraph has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_delete_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"140eb53c5f46df5770a5244d697df8b9777e12dc1619ffaafaba581cca72b294"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::sanitize_summary_information (cyclomatic 18): rhwp::cli::commands::edit::privacy::sanitize_summary_information 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ff57a87fafccc2a9afdc355e3885d489e33daff8f2f0e1edd025d10119151"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_fit_table (cyclomatic 18): rhwp::cli::commands::edit::tables::layout::edit_fit_table 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e0be7524be32fd2d06090cf6747f0b50af722e9377881ed6c159c4625ee74"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_merge_table (cyclomatic 18): rhwp::cli::commands::edit::tables::structure::edit_merge_table has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::structure::edit_delete_table) 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":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cf894dbd0ed1ea421300bff45f26fc13f74c02285d02b519c983519cfacb6f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_delete_table (cyclomatic 18): rhwp::cli::commands::edit::tables::structure::edit_delete_table has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::structure::edit_merge_table) 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":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafdeb0f61f4159077aa96f7716ddbf586b1ca67c5493605b65a2b314d7ddf83"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::generation::run_scaffold (cyclomatic 18): rhwp::cli::commands::generation::run_scaffold 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":"src/cli/commands/generation.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"46152ba435bf31c39edf556ba9ffd284bdcb14ffe58d98923912548a9e87a0b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::commands::pdf_import::parse_args (cyclomatic 18): rhwp::cli::commands::pdf_import::parse_args 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":"src/cli/commands/pdf_import.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c0ad635883666ba8a7829632f05eaa34e802f92183086e5d2391fd2f8614e8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::disclosure::cmd_disclose_restore (cyclomatic 18): rhwp::cli::protocol::exchange::disclosure::cmd_disclose_restore 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":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"79df900bb5ecaafaba1149b060e283595639eb06c21336df3bbbfc2efe03c297"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::diag_document (cyclomatic 18): rhwp::cli::queries::diagnostics::diag_document has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::cli::queries::diagnostics::control_kind (cyclomatic 24) 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"603c6ccf1cf3e26372e683b97cc9587ac355cbbe83038a44f25c5e0f84a79577"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::explore::explore_document (cyclomatic 18): rhwp::cli::queries::explore::explore_document 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":"src/cli/queries/explore.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b73ab94441c8c1207d7c6a6fea13abbc0d33921cf0b285b87629d3473a9391"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::page_dump::run (cyclomatic 18): rhwp::cli::queries::page_dump::run 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":"src/cli/queries/page_dump.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16dda99db50ba19e3d97a2d37b1178fde47487536fe0e9963455b93b555a096"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_hidden_text (cyclomatic 18): rhwp::cli::queries::security_inspection::inspect_hidden_text 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c794a0e168f7e3c53b52ea3e6f8c607f8c8818f217879c6ed7ae3f1234c7bd43"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::render_geom_diff::run_single (cyclomatic 18): rhwp::diagnostics::render_geom_diff::run_single has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::diagnostics::render_geom_diff::node_type_str (cyclomatic 24) 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":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"a156bbef2135a7b3af29f88d7144bff3bab3bb4ed225edfa2f36a877e111f52e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::doclang::adapter::inline::extract_inline_segments (cyclomatic 18): rhwp::doclang::adapter::inline::extract_inline_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":"src/doclang/adapter/inline.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad48a5b3c0217521bcd2a7a644672b704b5014ea9c906d4e1925b4639f0c9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::clipboard::clip_paragraph_caret_range_for_clipboard (cyclomatic 18): rhwp::document_core::commands::clipboard::clip_paragraph_caret_range_for_clipboard has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::commands::clipboard::control_kind_label (cyclomatic 24) 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba9d97a188b5ff96c64ab0224963f97841a205403496fbf175163436d7a3190"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::prune_incomplete_memos::scan (cyclomatic 18): rhwp::document_core::queries::memo_query::prune_incomplete_memos::scan 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b64d27ec5a6fb2eb83aeae233e3bd0021281f735585ba74d3fd028a5b6cdc0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::compute_hwp_used_height (cyclomatic 18): rhwp::document_core::queries::rendering::compute_hwp_used_height 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":9233}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f43e826ac178396a0256765c318aecf58591abd98902578f026439ee0acb2c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mcp_serve::scan_workspace (cyclomatic 18): rhwp::mcp_serve::scan_workspace has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::mcp_serve::handle_tool_call (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":"src/mcp_serve.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"717f02ab1d07bc36c6bbaabb2d8efb0ccad95329de714f4dfab2892c398fd9ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::section_tail::collect (cyclomatic 18): rhwp::model::section_tail::collect has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (collect, collect_shape_memos). 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":"src/model/section_tail.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bc63b0503592d5974befc11a885663cd0182c96a1481ea8a99f9f47efe1e10"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::json::write_group_kind (cyclomatic 18): rhwp::paint::json::write_group_kind 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":"src/paint/json.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18aab0d60456ea36d8ae27160e2050a9e669dc171de0384b162abd1e405b7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::doc_info::parse_doc_info (cyclomatic 18): rhwp::parser::doc_info::parse_doc_info 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::parser::doc_info::parse_border_fill (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8391f9ca4ea2bac7af6b4dab5316ac46213190ac6254f4c7f6147eae40f9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::no_lineseg_square_table_host_band (cyclomatic 18): rhwp::renderer::no_lineseg_square_table_host_band has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::installed_font_program_aliases (cyclomatic 36) 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":"src/renderer/mod.rs"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88da4bb4a1db8f37895ee533ecc33064343e8835da9876d78328edd3879c695"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::form_drawing_replay_rejection (cyclomatic 18): rhwp::renderer::canvaskit_policy::form_drawing_replay_rejection has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::canvaskit_policy::paint_op_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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d1a5c7968cfe6144a152edbd3c6c78f7f160ea19de4bf7170f01d7e00a20b9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::try_synthesize_marker_paragraph (cyclomatic 18): rhwp::renderer::composer::composition::inc::try_synthesize_marker_paragraph 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"65953430ffa51a35ea41d1464157615cb15614072fe8c706a7e27b14893790d6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::preserve_context_resolved_runs_with_storage (cyclomatic 18): rhwp::renderer::composer::stored_cell_reflow::inc::preserve_context_resolved_runs_with_storage 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b7124b96404202858b7c348e890a18f82e8d7a40553d21495a10f19febfd7d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::equation::hancom_glyphs::measure (cyclomatic 18): rhwp::renderer::equation::hancom_glyphs::measure 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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc95c82b9dc35aef09f2b12a3859c133c98a1f3e9aa80eadf896889e3ecafd6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_successor_with_following_placement (cyclomatic 18): rhwp::renderer::float_placement::stored_picture_successor_with_following_placement 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":"src/renderer/float_placement.rs"},"region":{"startLine":4721}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c6cedec5d6724a515ffe5104c2e2bb0c38f62a8755b6ee0483c74920ad2ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::empty_successor::stored_empty_successor_geometry (cyclomatic 18): rhwp::renderer::float_placement::empty_successor::stored_empty_successor_geometry 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":"src/renderer/float_placement/empty_successor.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"de447f3f3f96132dd55c47dd10eb6f4cd26fbdf2cd302dc9cf86215083b5a1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::form_appearance::form_drawing (cyclomatic 18): rhwp::renderer::form_appearance::form_drawing 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":"src/renderer/form_appearance.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4cb16c9ade57a43777944f3d43f1d7f344f67ab0afd7bcaf488163c0147c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::solve_rowspan_row_heights (cyclomatic 18): rhwp::renderer::height_measurer::solve_rowspan_row_heights 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":"src/renderer/height_measurer.rs"},"region":{"startLine":6702}}}],"partialFingerprints":{"codehealthFindingId/v1":"158188977c4416dcad55f0c0db0d34364e99d45192f91cdb4140cea975ee860d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::collect_shape_marker_labels (cyclomatic 18): rhwp::renderer::layout::paragraph_layout::collect_shape_marker_labels 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cbf73a9bb353fb5b2ad02eae1063c45971e13a87f01ca848b449aa17c765ac"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::expand_page_fragment_clip_to_own_text_lines (cyclomatic 18): rhwp::renderer::layout::table_layout::expand_page_fragment_clip_to_own_text_lines 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc4cbdaee558cc4e7bdf5ace022e6404110b5b20ec66035cbe43e74c2a819ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::empty_line_flow::closed_stored_empty_line_owns_advance (cyclomatic 18): rhwp::renderer::layout::table_layout::empty_line_flow::closed_stored_empty_line_owns_advance 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":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fcbadbda666a3aec987c2b74c71384709fd4726cdeb326763a89e6d5694163"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::path (cyclomatic 18): rhwp::renderer::skia::glyph_replay::path 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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdad4964b4a292dd12b3b755ea680763d5ed2e9fc4cd3aa073a2950e3d9c144"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::text_shaping::prepare_shaped_spans (cyclomatic 18): rhwp::renderer::skia::text_shaping::prepare_shaped_spans 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":"src/renderer/skia/text_shaping.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd76650b16ad49a2f2ab9122617541b3469588a2b248a4d119b07a4af55ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::style_resolver::refresh_source_program_projection_slots_with_storage (cyclomatic 18): rhwp::renderer::style_resolver::refresh_source_program_projection_slots_with_storage 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":"src/renderer/style_resolver.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b3ac24e68ed7ef776ac88f89d5e40753c5e18d5f25cda426018a6d3442d12"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::text_decoration::resolve_page_phases (cyclomatic 18): rhwp::renderer::text_decoration::resolve_page_phases 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":"src/renderer/text_decoration.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9533e4e6694fde8b0dc3dde5f2d9826c68c230c4c861edf1bef1fe1345f2a6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_reconcile::complete_stored_prefix_advance (cyclomatic 18): rhwp::renderer::typeset::controls::tac_reconcile::complete_stored_prefix_advance 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":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e2ce2f9878fd28ba739b4fe621184a31f7b98c505ff0e8d31c36a7f3ae3e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage (cyclomatic 18): rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"02853ad8c7237252e42c865cb21e2fbc89f5d8af79809c6ca4e63ca70fd3d714"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::control::serialize_shape_fill (cyclomatic 18): rhwp::serializer::control::serialize_shape_fill 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":"src/serializer/control.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a04210521dcd00dce031e1e680e56363fcf09cd7f6e5a10b6b1dab3cb57e3bf"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.transcript_for (cyclomatic 18): _gen_pack.transcript_for 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":".claude/skills/rhwp-bulk-pipeline/references/_gen_pack.py"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b04c0fbec1e1783d4bed59ff311a47e06eaf787f43ab043c81cbb2e8d289f2"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.validate_profile (cyclomatic 18): schema.validate_profile 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":"gym/core/schema.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c70d6e806aa908043c46bb875d425d47625f5c3ab149f4f714a4d8fe4032a9"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence_report._validate_authority (cyclomatic 18): evidence_report._validate_authority 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":"gym/tools/evidence_report.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01cb14dd6e42fe36a41202a2afbaee9f19ed695a16993b0e60ecc5129d93d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzz_corpus.mutant_family (cyclomatic 18): fuzz_corpus.mutant_family 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f24ed2e79c01a70edb9f0bae66c9b219c79750e9308764a88cfa9fc628df412"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.scan_reference_steps (cyclomatic 18): pack_health.scan_reference_steps 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":"gym/tools/pack_health.py"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"824654d8527e4329c95c644cbd4bc28529fb58e47b1dac625b869a4abecb65d9"}},{"ruleId":"D1","level":"warning","message":{"text":"release_gate.fold_preflight (cyclomatic 18): release_gate.fold_preflight 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":"gym/tools/release_gate.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95b030aba360a446dfda31c21ba46c79ac2edd7a19fda85458a59d2c178363c"}},{"ruleId":"D1","level":"warning","message":{"text":"robustness.mutant_family (cyclomatic 18): robustness.mutant_family 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":"gym/tools/robustness.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebf9cd1d9bb477393894341c0e2788b09a14764eeeae58b57266614d067c1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"robustness.audit (cyclomatic 18): robustness.audit 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":"gym/tools/robustness.py"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab9bb4c3067d6d61fd94eeb1bc4b1fadbaedd310516a7e531a14e63cbf598cf"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect-hwp.inspect (cyclomatic 18): inspect-hwp.inspect 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":"mydocs/pr/assets/chrisryugj_20261031/inspect-hwp.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"652cdfa8d6db67cc9cf4eaa06a5d25ac93f4af123cf6943fb54b60ca1faa7c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"_NativeEditorViewState._key (cyclomatic 18): _NativeEditorViewState._key 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":"bindings/Flutter/lib/src/native_editor_view.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da96b9e03f8a402bb172f77390c90d297f14126f9c8feda26eeb6139cccf68"}},{"ruleId":"D1","level":"warning","message":{"text":"download-interceptor-common.classifyDownload (cyclomatic 18): download-interceptor-common.classifyDownload 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d946502d3298c37aacf6bdc5a8a4aaa12eba8e60536743696182f453c17bec"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImage (cyclomatic 18): thumbnail-extractor.extractPrvImage 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346b174d3150fc78098eee6dad10588487d52c5e7798561c31b6b9c0279ef18"}},{"ruleId":"D1","level":"warning","message":{"text":"download-interceptor-common.classifyDownload (cyclomatic 18): download-interceptor-common.classifyDownload 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":"rhwp-firefox/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef1c658c0d4b56435ce54604b9f07ab604cb20aece9ec0f8fc3df0bbabfa3b4"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImage (cyclomatic 18): thumbnail-extractor.extractPrvImage 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ac99240b52f4c8b17b4161461fc1b77395fc4b0e113d53e6c33a1e83be17f0"}},{"ruleId":"D1","level":"warning","message":{"text":"download-interceptor-common.classifyDownload (cyclomatic 18): download-interceptor-common.classifyDownload 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":"rhwp-shared/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4b0ee76d4eff80708adeefa5e697a2222c49be617cc1f793c9b7dce2b961e"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiProvider.streamTurn (cyclomatic 18): OpenAiProvider.streamTurn has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 238). 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":"rhwp-studio/src/ai/provider/openai.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8911bacd5c720fd9a6a34c9ddc89910e11cdfb4e6c13913a52ce5e382e034b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatController.executeWrite (cyclomatic 18): ChatController.executeWrite 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":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd0d2ca1b8f27dfe7f1766a16fd923ec730f43a1871c0727a21f3bce335f73"}},{"ruleId":"D1","level":"warning","message":{"text":"block-calculation-plan.planBlockCalculation (cyclomatic 18): block-calculation-plan.planBlockCalculation 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":"rhwp-studio/src/command/block-calculation-plan.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e403d109d7b77d545054003a2b0e06fb4bb88b0d19f73adcd824f8073bddbf"}},{"ruleId":"D1","level":"warning","message":{"text":"file.runPdfPrint (cyclomatic 18): file.runPdfPrint has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1d2af7de23a7d62d767ad00b43f194e290e637d5eee64c9ceb2fa65c87a0a9"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.charEditOpsFullDp (cyclomatic 18): diff-engine.charEditOpsFullDp 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"841d65f7f9688193bc07ece150d3011538b9a4f500acff71dfc9b068b8683d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.matchSegment (cyclomatic 18): diff-engine.matchSegment has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 1914). 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8841f5ca3d0bf790532eaa86f503ff475684881960cdfd0ba72c33639d0a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"local-fonts.matchingCollectionFace (cyclomatic 18): local-fonts.matchingCollectionFace 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbc86dbf77e936232e2d4a05c3d0434cc9473d714ce4c3041f0f31f2a1b86b5"}},{"ruleId":"D1","level":"warning","message":{"text":"declared-font-environment.loadLocalProgram (cyclomatic 18): declared-font-environment.loadLocalProgram has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd5811baf4a9f4e13c121b157e382b10e5f3058ad67d8430c1ab070a56473b0"}},{"ruleId":"D1","level":"warning","message":{"text":"image-crop-scale.imageCropSourceRect (cyclomatic 18): image-crop-scale.imageCropSourceRect 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":"rhwp-studio/src/view/image-crop-scale.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"008726af9022433d7147c6920f9ce004effe6436796a10e05e19c01469ece940"}},{"ruleId":"D1","level":"warning","message":{"text":"image-header.webpHasSingleFrame (cyclomatic 18): image-header.webpHasSingleFrame 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3863358eadc2ee7c1c7cd260108b2d67192ce9e5a394d67bd79de7376632982f"}},{"ruleId":"D1","level":"warning","message":{"text":"glyph-outline-payload-status.glyphOutlinePayloadStatus (cyclomatic 18): glyph-outline-payload-status.glyphOutlinePayloadStatus has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: glyph-outline-payload-status.hasSvgGlyphContract (cyclomatic 24) 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"999ac290ccf4c6aa5c7712cea1535051561707874313d6e6f128cd85f6e8ede5"}},{"ruleId":"D1","level":"warning","message":{"text":"page-scroll-probe.installPageScrollProbe::inspectMilestones (cyclomatic 18): page-scroll-probe.installPageScrollProbe::inspectMilestones 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. This shape REPEATS in the file: one other method here (page-scroll-probe.installPageScrollProbe::observe) 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb8e791eb302b769a4dcf01080761bd5a6be19619980aeea4d21b33af0a2a99"}},{"ruleId":"D1","level":"warning","message":{"text":"cursor.classifyChar (cyclomatic 18): cursor.classifyChar 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc72f43337ac7f7d2fc59980a180dc1b6ee681c98e46285e70eb30fd775c76d"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertTextCommand.mergeWith (cyclomatic 18): InsertTextCommand.mergeWith 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"5106b31f735b4b50986fd1a3c42f26c3fbf3c980991fcc2576b111ede04568d9"}},{"ruleId":"D1","level":"warning","message":{"text":"TableResizeRenderer.hitTestBorder (cyclomatic 18): TableResizeRenderer.hitTestBorder has cyclomatic complexity 18 (threshold 15). Of this number, 17 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":"rhwp-studio/src/engine/table-resize-renderer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcf9ac9202b20325970dfc5e4aa9579e0d82cc1102175c1b85da6b41becde76"}},{"ruleId":"D1","level":"warning","message":{"text":"CompareDialog.formatFieldValue (cyclomatic 18): CompareDialog.formatFieldValue 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8c13c754dad6707056b287a9070ae39919428c2d14a48aa8cf2ac61ac48fb0"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryDialog.formatFieldValue (cyclomatic 18): HistoryDialog.formatFieldValue 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4055107e83aa52c49246b9f1003629541576337ec34756be4d2f8388da74145"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_of_pie (cyclomatic 17): rhwp_ooxml_chart::renderer::render_of_pie 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"db56675e31a3f56a50419f77773d41e9b0b19e7d5002b44e89045f81c61ac879"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::insert_picture_native_anchored (cyclomatic 17): DocumentCore::insert_picture_native_anchored 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: DocumentCore::format_picture_properties_json (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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c895c93ef90705d8cf410c4ebc72c24af39dd4c18c53fef949f00b98aa06e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::split_section_native (cyclomatic 17): DocumentCore::split_section_native 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":"src/document_core/commands/section_ops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2473d433b4d372da36df09bc9bd1dd8be38af54b1868018db00bb3862623e03f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::merge_table_with_next_native (cyclomatic 17): DocumentCore::merge_table_with_next_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"678a7df73d6014214e138ad74cd7ad610f01a7b4f3c974f928ac4cc89f6d0d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_document_info (cyclomatic 17): DocumentCore::get_document_info 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":"src/document_core/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2a0155147f37b532cd58ae1da501f89de46b986a18e39ace349929efe78aca"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::collect_inline_bboxes (cyclomatic 17): DocumentCore::get_cursor_rect_native::collect_inline_bboxes 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: 4 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e7eebef291097e46494d9ebe6c3ae203ace5cd36c6da8158f17a673386cafe"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::compute_overflow_links (cyclomatic 17): DocumentCore::compute_overflow_links 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6106230767d711d581f1718e3e5d85f108649dc07f09a16e78bd276b1da52d26"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_font_decision_trace_from_tree (cyclomatic 17): DocumentCore::get_font_decision_trace_from_tree 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":"src/document_core/queries/font_decision.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a6cc9e1039ae83b61da1ff070c1f6f60f51b38364e26c73843b8e6b50df55e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_control_lock (cyclomatic 17): DocumentCore::set_control_lock 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: rhwp::document_core::queries::hwpctrl_sets::control_identity (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcc23627d05f62f52fb0749afab1eaf654286b14206d394e5a3ace9370f9188"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::dump_page_items_json (cyclomatic 17): DocumentCore::dump_page_items_json 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6f7b78c1449340dfb32d81d128353ba024491140a0bc33571e1fbeb0efd78"}},{"ruleId":"D1","level":"warning","message":{"text":"Font::set_props (cyclomatic 17): Font::set_props 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":"src/wmf/converter/svg/util.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f96765d2823cb6cb2abe59aeaa98c8a97572a18382927c7f3e5f745f66b6ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::contradictory_column_boundaries_hu_with_storage (cyclomatic 17): Table::contradictory_column_boundaries_hu_with_storage 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":"src/model/table/contradictory_grid.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1882b4f4b141c351c9c479a0df9dea841d8634bb6abf12216e4182418e6259ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Visibility::project (cyclomatic 17): Visibility::project 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":"src/parser/hwpx/tracked_changes.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd39d183e04c334b828b6022cfea2fdd214d848907993aafd4b38eed073a8ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Compound::split (cyclomatic 17): Compound::split 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":"src/parser/pdf/table_paint/compound.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ea4980f5892ecc03db7f9b6c63e40c8deab44070c9ef12b6085a19f7be70e2"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_paren (cyclomatic 17): EqLayout::layout_paren 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":"src/renderer/equation/layout/paren_geometry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7889375bcd4846a778505a748f50880490d98db09e5d2632549db186514fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan::source (cyclomatic 17): Plan::source 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":"src/renderer/equation/legacy_coordinate_plan.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3ef90aafdb2c2267ce8a6e97e627fdf7c95104906e71d245cb10b821dc0bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor::parse_sequence (cyclomatic 17): Cursor::parse_sequence 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":"src/renderer/equation/legacy_hwpeq.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d34778da56756f057475d3bab910f102c33d029ebb8a9d2c9468a36d7aaaa9c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_inline_control_pen (cyclomatic 17): LayoutEngine::stored_inline_control_pen 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4dff8a16f92fc7d02e7ef7404b100c0cde40e01919e00dc867a575bfb168c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::scan_textbox_overflow (cyclomatic 17): LayoutEngine::scan_textbox_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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a411045b7e150cd4be716cef9766d7102b16215549d53cf52a055022269b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_group_child_affine (cyclomatic 17): LayoutEngine::layout_group_child_affine 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4ccfeb73ed8c1d8f40f6dd5dbc15e12f32e2f89ed7bc8151f38ce10353019f"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_inline_picture_preceding_row_frame (cyclomatic 17): LayoutEngine::stored_inline_picture_preceding_row_frame 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":"src/renderer/layout/table_layout/stored_inline_closing_frame.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"91224a4c1e43a05ad8c6866b194718d873e507969cf593df58ca71ceed5bfb3b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_inline_restart_row_end_frame (cyclomatic 17): LayoutEngine::stored_inline_restart_row_end_frame 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":"src/renderer/layout/table_layout/stored_inline_row_frame.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff999b61fab507392f9d010f99036990c0cd3254a16e84919abc87c8f17b733"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_cut_has_original_nested_frame_owners (cyclomatic 17): LayoutEngine::row_cut_has_original_nested_frame_owners 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":"src/renderer/layout/table_layout/stored_nested_fragment_frame.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1cd2056315200e904c03c9af5b6b569cd9aa1c7faaeca0172e8c766b9e8f2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_nested_cut_outer_margin_extra (cyclomatic 17): LayoutEngine::stored_nested_cut_outer_margin_extra 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":"src/renderer/layout/table_layout/stored_nested_outer_frame.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf6c35b8da2d5cbdb98a0bc1f17e79576dce8b51f59b5d4ddf4f0f7715f203"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_complete_terminal_row_frame (cyclomatic 17): LayoutEngine::stored_complete_terminal_row_frame has cyclomatic complexity 17 (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":"src/renderer/layout/table_layout/stored_terminal_row_frame.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7db214aa03a86bea3a95a1a118efcba89890eec2bb5d59d583102b8742c8f42"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_rowspan_page_frame (cyclomatic 17): LayoutEngine::stored_rowspan_page_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24091}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4d8956b75914150e8f4d55cd0bb9d7fd270a6ed8513254cc4457e3d44f51b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_plain_cut_closing_advance (cyclomatic 17): LayoutEngine::stored_plain_cut_closing_advance 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4738ca4d6dbce2292090817ce71527df492c909b0178eaa09525c2bc8b0816a8"}},{"ruleId":"D1","level":"warning","message":{"text":"StrokeDash::intervals (cyclomatic 17): StrokeDash::intervals 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":"src/renderer/stroke_pattern.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00984fcba8c6f3826d6789051a5802ee00156f938c224ea8d68e6f920a29dc"}},{"ruleId":"D1","level":"warning","message":{"text":"TacFlowQuery::tac_table_line_index (cyclomatic 17): TacFlowQuery::tac_table_line_index 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":"src/renderer/typeset/controls/tac_flow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c7e8cc66842924578703ddfea7479e7e5801c56f8844fb5ff78d25d118e799"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetState::spill_page_tail_floats (cyclomatic 17): TypesetState::spill_page_tail_floats 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":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe9569a9882c2b1a358c4332c99d384d4823b605f41c803dc1399f5fbb821a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::judge_hwp3_variant_vpos_reset_break (cyclomatic 17): TypesetEngine::judge_hwp3_variant_vpos_reset_break has cyclomatic complexity 17 (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":"src/renderer/typeset/section/boundary.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7caa77a448b08ea188b2f199572378256717a6a3d3d02cf6731730e34aeabef"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::stored_partial_fragment_height (cyclomatic 17): TypesetEngine::stored_partial_fragment_height 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7bd1217b7e026d55b64b6b481f01abaa56ada0d34af16f0a8677bb3785ff81"}},{"ruleId":"D1","level":"warning","message":{"text":"WebCanvasRenderer::apply_pattern_fill (cyclomatic 17): WebCanvasRenderer::apply_pattern_fill 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c3c0622e617ff46340f18fbbf8eba96c71a2523cab3a406f7c3b345e7df4c7"}},{"ruleId":"D1","level":"warning","message":{"text":"HwpDocument::update_click_here_props (cyclomatic 17): HwpDocument::update_click_here_props has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":6612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f58ba92e295f86333f8c23eb1874f3e0236bc20617524ac8065101446497df5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::difftext::diff_lines (cyclomatic 17): rhwp::bin::rhwp-agent::difftext::diff_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":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5986d089e0df73bd2537f0a6eb758bcbd3fddfd920c56e4d451bc137a3c4a80"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-char-shape::parse_cli (cyclomatic 17): rhwp::bin::rhwp-q::commands::rhwp-q-char-shape::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f03675cbcd7a95f11a2c81439b7b3ee96178f1d7183e99bf82671879bcbcc4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-cursor-rect::parse_cli (cyclomatic 17): rhwp::bin::rhwp-q::commands::rhwp-q-cursor-rect::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5faa131c435db57a559269d50f944b01bdae11c636ec029e4ef6a547c16b801"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-form-info::parse_cli (cyclomatic 17): rhwp::bin::rhwp-q::commands::rhwp-q-form-info::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-form-info.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef13346270c241527fdd6a612828312b14a83dcae8e49dc9e7c2497242a99d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::cur_field_state::run (cyclomatic 17): rhwp::bin::rhwp-q::kit::cur_field_state::run 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":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf601d74f39a305784621417109336b0c5423da22099f0908b217f920033187"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hf_edit_target::run (cyclomatic 17): rhwp::bin::rhwp-q::kit::hf_edit_target::run 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":"src/bin/rhwp-q/kit/hf_edit_target.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecc14dafdb9b1f5dd447428e23a584684d663c4b16083a452ea6fb8d9f4e395"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::disclosure::cmd_disclose_verify (cyclomatic 17): rhwp::cli::protocol::exchange::disclosure::cmd_disclose_verify 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":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01ff97c5e7ec1eaf793a8f1790e091dd1219855893dfd5f581d9d58d867ee1a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::plan::condition::evaluate_step_condition (cyclomatic 17): rhwp::cli::protocol::plan::condition::evaluate_step_condition 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":"src/cli/protocol/plan/condition.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aae2b588f99f3ded05a0adcf33cbfa05415953cc6793b320979a804ebeefce4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::trust::anchor::cmd_anchor_verify (cyclomatic 17): rhwp::cli::protocol::trust::anchor::cmd_anchor_verify 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":"src/cli/protocol/trust/anchor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbccf2dddd25224afa222196bac85033e5d0ce77ef0ad10d124489e2ec00f4fa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_recall_scope (cyclomatic 17): rhwp::cli::protocol::trust::governance::cmd_recall_scope 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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cee97f092e430e0dbe663e303033955a5ed4d5b696bfc2e702db38f655511f3"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::position_diagnostics::dump_carets (cyclomatic 17): rhwp::cli::queries::position_diagnostics::dump_carets 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":"src/cli/queries/position_diagnostics.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"153dae4d85296c26ad970bb2e360b07b02e3fa79a229e04ad06808b5e8c0ac3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::template::select (cyclomatic 17): rhwp::document_core::commands::paragraph_block::template::select 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":"src/document_core/commands/paragraph_block/template.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a3a94a54f9ad6de9c94d02ec7917c483e154f8cf3fb179e734a4f99ceaa7b8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::collect_object_border_fill_refs_from_paragraph (cyclomatic 17): rhwp::document_core::converters::hwpx_to_hwp::collect_object_border_fill_refs_from_paragraph has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"923458ac1b09db2e90d320072a474fe10ecabccc4654e0dac0c9c1f33ec1b801"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::inline_control::caret_slot (cyclomatic 17): rhwp::document_core::inline_control::caret_slot 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":"src/document_core/inline_control.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e57475f5060fa75119f0abd2d795a37879a30f3367b555bec0b4e53b501454"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::inline_control::insert_slot (cyclomatic 17): rhwp::document_core::inline_control::insert_slot 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":"src/document_core/inline_control.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2226b6432db4a2353bea046139907ccabefae825843a28f97fdc49ccd59d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::explain::count_from_paragraph (cyclomatic 17): rhwp::document_core::queries::explain::count_from_paragraph has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/explain.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797ac774534279544d7f01027f45e57ad3cb22dd019db405e1cecb8c510081e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::explore::build_menu (cyclomatic 17): rhwp::document_core::queries::explore::build_menu 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":"src/document_core/queries/explore.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d3d057cbed34d706abca7085308b06a12a390f6881625f0b4c6d4a0d44fda6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::extract_data::try_amount (cyclomatic 17): rhwp::document_core::queries::extract_data::try_amount 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":"src/document_core/queries/extract_data.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d302b77abe47001dbd33e1094e3537d291260c829234bcde307c427085800790"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::collect_fields_from_paragraph (cyclomatic 17): rhwp::document_core::queries::field_query::collect_fields_from_paragraph 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc184a6fc5cc1db65c927f18b715b57364eaf56c604f26b4f259cc6b1c2d2add"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::remove_memo_field_in_para (cyclomatic 17): rhwp::document_core::queries::memo_query::remove_memo_field_in_para 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b43a4e7e40beb0682939b5a0888005f35b2b679c6bf5dc79f2a7189f5d6518"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::assign_master_pages_for_section (cyclomatic 17): rhwp::document_core::queries::rendering::assign_master_pages_for_section 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4780dd6c66f3810d2683ce5f890f34e7512891fc6c6875d25cae939d9f5bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mcp_serve::session_fill_fields (cyclomatic 17): rhwp::mcp_serve::session_fill_fields 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: rhwp::mcp_serve::handle_tool_call (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":"src/mcp_serve.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b33104fb8fa0ec9806e93e79ea1a038729c0a43a54b62fdfbf04590d28f17b1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::border_paint::walk (cyclomatic 17): rhwp::model::border_paint::walk has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1958eceb6ccb8573f3fa97de60c34ec53b55e854c96c3403fb6ebfd6bef73243"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::border_paint::walk_mut (cyclomatic 17): rhwp::model::border_paint::walk_mut has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ebb054ba14fb7e7c92318b9d5ab807c82617f7e7a51889387f393d1ea8dcee"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::table_row_grid::decode (cyclomatic 17): rhwp::model::table_row_grid::decode 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":"src/model/table_row_grid.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"becfc5009bf77ac6073a5254986e6a3d645914a3d3cdb2fbf60127e62448fa06"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::model::text_clip::collect (cyclomatic 17): rhwp::model::text_clip::collect has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/text_clip.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5f37e3dc68a7fa85e0645fe66104547643f32d9e16233bb75b22778c8034f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::main (cyclomatic 17): rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::main has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-705/probes/scan_cell_pagehide.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08de12c79a9af981cdefeeb65116d19aa7d37007a6348dfb18166998842eb0e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::shaping_glyph::project_replay_geometry (cyclomatic 17): rhwp::paint::shaping_glyph::project_replay_geometry 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. This is NOT this file\u0027s highest cyclomatic complexity: HorizontalShapingGlyphLoweringRejectReason::as_str (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":"src/paint/shaping_glyph.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"67551f0bcc62a084230e628d7573128137eecf3e81ad803df4e8acc4e62c3a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::text_variants::validate_leaf (cyclomatic 17): rhwp::paint::text_variants::validate_leaf 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":"src/paint/text_variants.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec560f86e8458d4f084d27ef9b583b1118f9333236236b41311c893dfc10b35"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::strip_hwp3_note_number_suffix_literal (cyclomatic 17): rhwp::parser::hwp3::strip_hwp3_note_number_suffix_literal 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbfdbe3270c76779cffc7e4a151a6baab1e720e6799014685377081c0a004fe"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::fixup_hwp3_outline_fields (cyclomatic 17): rhwp::parser::hwp3::fixup_hwp3_outline_fields 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a10b364005cf7b5fc99f7afcf83000f755289d3f69547c5aa26c2f9f4323f53"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::assign_pic_numbers_in_controls (cyclomatic 17): rhwp::parser::hwp3::assign_pic_numbers_in_controls has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5778}}}],"partialFingerprints":{"codehealthFindingId/v1":"484a0501be0adbc426b0e841db3858191fed4da71faf1c098f06b16b34161980"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::unstored_empty_square_table_host_geometry_px (cyclomatic 17): rhwp::renderer::unstored_empty_square_table_host_geometry_px 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::installed_font_program_aliases (cyclomatic 36) 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":"src/renderer/mod.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"db52ab5b58effacb300bcd50900fe91f3ef38c50cfff0372078fafd858e843f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::image_transition_detail (cyclomatic 17): rhwp::renderer::canvaskit_policy::image_transition_detail 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. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::renderer::canvaskit_policy::paint_op_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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93a76c4c5fda6ca693e677c2fa78da82c5c97f79681c8d48dc86e95d7231910"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::tac_next_line_full_spacing (cyclomatic 17): rhwp::renderer::composer::composition::inc::tac_next_line_full_spacing has cyclomatic complexity 17 (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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"56489af56758e29711e48472565c19daf9c6de10f56d90093ae81e0fbd92c9e9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::apply_reflowed_equation_row_metrics (cyclomatic 17): rhwp::renderer::composer::line_breaking::apply_reflowed_equation_row_metrics 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e177093148168634b1f3855d4e6925f8865c67bfaab6827d9db80cb654bfa1f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::recompose_cell_lines_in_frame_with_storage (cyclomatic 17): rhwp::renderer::composer::stored_cell_reflow::inc::recompose_cell_lines_in_frame_with_storage 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fa7f41038a837243244705049cbcc6c38d783a71f3862b7775d5b4f6c4abc8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_empty_picture_cell_frame (cyclomatic 17): rhwp::renderer::float_placement::stored_empty_picture_cell_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6df3b79896b97e8a40ecd48f60673ea50fb1f6c3178aa31f4b8bbda220c2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_frame_with_guides (cyclomatic 17): rhwp::renderer::float_placement::stored_table_frame_with_guides 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":"src/renderer/float_placement.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58a3dcec7543f2fdd819318e0d84481393c80e40a42cb4d0ce7b6ba8346637a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_two_frame_successor_origin_hu (cyclomatic 17): rhwp::renderer::float_placement::stored_two_frame_successor_origin_hu 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":"src/renderer/float_placement.rs"},"region":{"startLine":4608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae55023bf5fbf6021107600868e5d332c425ce5d4ac2b0842aa21effaf928580"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_single_column_cell_flow (cyclomatic 17): rhwp::renderer::float_placement::stored_single_column_cell_flow 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":"src/renderer/float_placement.rs"},"region":{"startLine":7357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4c294e84f08afaeeccc63d734d9039747eaad23966a32a844d8e89a122d2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::native_hwp5_stored_reset_fragment_paint_geometry (cyclomatic 17): rhwp::renderer::float_placement::native_hwp5_stored_reset_fragment_paint_geometry 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":"src/renderer/float_placement.rs"},"region":{"startLine":9394}}}],"partialFingerprints":{"codehealthFindingId/v1":"804ea28800de42f7d8bc3430919f85af2c9a3c8fe0898b6f24669a784e1a24d2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::picture_anchor::stored_exclusion_anchor (cyclomatic 17): rhwp::renderer::float_placement::picture_anchor::stored_exclusion_anchor 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":"src/renderer/float_placement/picture_anchor.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc496e75fab30fcaa84ca83c2b8509d5f93319d8e9a4175ee6326103ff7123f5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_row_grid::owns_fragment_outer_frame (cyclomatic 17): rhwp::renderer::float_placement::stored_row_grid::owns_fragment_outer_frame 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":"src/renderer/float_placement/stored_row_grid.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaa83eb0204dc0161c3239bc21a7e211e603bcc91b56e6aca2b5879ba1c9fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_span_opening::stored_span_opening_frame (cyclomatic 17): rhwp::renderer::float_placement::stored_span_opening::stored_span_opening_frame 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":"src/renderer/float_placement/stored_span_opening.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"499cf0c44a52d4b47498473d97a5e8a9cc3d5fdc0207fed109e483b7e512657a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::stored_square_picture_wrap_anchor_for_control (cyclomatic 17): rhwp::renderer::height_measurer::stored_square_picture_wrap_anchor_for_control 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":"src/renderer/height_measurer.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf620925072921db1fee9aaea517ceb54b1f3a2094f32a20eaaf1f03a6210dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::height_measurer::compute_row_blocks_with_storage (cyclomatic 17): rhwp::renderer::height_measurer::compute_row_blocks_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":6800}}}],"partialFingerprints":{"codehealthFindingId/v1":"5370a3553c7d4f75aecd57f22b2b32fe60db98e1866c35ec5ae27c12937ae9c4"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::inline_flow::stored_host::plan_stored_empty_square_host (cyclomatic 17): rhwp::renderer::inline_flow::stored_host::plan_stored_empty_square_host 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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"203df373f4753d052737a57145944424a7d91eb2c6df16d1f64736d93e5ff1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::textless_host_ladder_line_advance (cyclomatic 17): rhwp::renderer::layout::textless_host_ladder_line_advance 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":"src/renderer/layout.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996f3b704538e1fdf2a7ca124476e69bd3248c8a356cc3cf4e2aa00c6b4ee59"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_spaced_cell_borders (cyclomatic 17): rhwp::renderer::layout::border_rendering::render_spaced_cell_borders 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: rhwp::renderer::layout::border_rendering::border_line_type_from_code (cyclomatic 19) 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf04fba99e0ae8bf42fe918174a0031ab777c05091c10120fa36a02dfa63454"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_transparent_borders (cyclomatic 17): rhwp::renderer::layout::border_rendering::render_transparent_borders 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: rhwp::renderer::layout::border_rendering::border_line_type_from_code (cyclomatic 19) 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0ddfa4aefa4688bc46ccf6d7e329d7a767422858ab3ee5ce7b930e354b41a8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::emitted_run_layout_positions (cyclomatic 17): rhwp::renderer::layout::paragraph_layout::emitted_run_layout_positions 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1156821e72db5c97d385d2dfadec764551d5fee5a26dd3c44ecf23a8fd5a22f0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_text_metrics::nominal_height (cyclomatic 17): rhwp::renderer::render_normalization::stored_text_metrics::nominal_height 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":"src/renderer/render_normalization/stored_text_metrics.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b61448f2039499da87c63739f837b255817eb3e1e8b94dd14f794dc5e31cdbd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::style_resolver::lookup_font_name_in_environment (cyclomatic 17): rhwp::renderer::style_resolver::lookup_font_name_in_environment 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":"src/renderer/style_resolver.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"16518d17e2d5b8535a7cb42cd7b9b58fa01b91cbaf72dc6ec6956e05b4e61260"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::equation_only_tac_line_assignment_with_storage (cyclomatic 17): rhwp::renderer::typeset::equation_only_tac_line_assignment_with_storage 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":"src/renderer/typeset.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c08b6958f627c1e5a2cc50ff4a9fecd839b2f47c6564df9b99710f76fd0d51"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_first_footnote_overlap_break_line (cyclomatic 17): rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_first_footnote_overlap_break_line 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":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d751e9981f4473f6c5b9be802af24021d80a731d7ff1bf956b4a1ce8b6715b"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::control::write_shape_detail (cyclomatic 17): rhwp::serializer::control::write_shape_detail 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":"src/serializer/control.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5fec51a028874f7c3f736a85b28307e857e079c94657260ad93c153a7e387"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::export_cache::project_paragraphs (cyclomatic 17): rhwp::serializer::hwpx::roundtrip::export_cache::project_paragraphs 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":"src/serializer/hwpx/roundtrip/export_cache.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6255f39b7634c82f3a98bb552d1f15888f2a36d6d5b9d7fd7af2053498f4e21"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_desk::planner::substitute_cli_args (cyclomatic 17): rhwp_desk::planner::substitute_cli_args has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/src/planner.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e496dce434b60c9d33316fd1708353e1b9d789dcf94ff2e23a79006e3aa2658f"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.write_queues (cyclomatic 17): _gen_pack.write_queues 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":".claude/skills/rhwp-chief/_gen_pack.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"825791d96e713edb56cde6614674b38639e3ed39b69b3954a3a7cabe0d562d48"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.resolve_token (cyclomatic 17): agent_session.resolve_token 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":"gym/tools/agent_session.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"761660b5a328dbd13b71a7ea6743e5836d4194325bf2b75d9b36b2763997cb16"}},{"ruleId":"D1","level":"warning","message":{"text":"pack_health.scan_hint (cyclomatic 17): pack_health.scan_hint 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":"gym/tools/pack_health.py"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e464e411728fb1402d8afe261731b53eb75ba9d1218317b285b905a95b88e6f1"}},{"ruleId":"D1","level":"warning","message":{"text":"release_gate.exception_kind (cyclomatic 17): release_gate.exception_kind 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":"gym/tools/release_gate.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb555ae27aded7626790c93add5c1cf63da9e7da44349bd872d506cd531b5ae7"}},{"ruleId":"D1","level":"warning","message":{"text":"trajectory.audit (cyclomatic 17): trajectory.audit 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":"gym/tools/trajectory.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"237c1fa7125ccf0b36c217615913f2117136dfd4f50cb33b596a1bb491891e27"}},{"ruleId":"D1","level":"warning","message":{"text":"_NativeEditorViewState.build (cyclomatic 17): _NativeEditorViewState.build 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":"bindings/Flutter/lib/src/native_editor_view.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2231d7df1ed3b22672c3418e89199f503fb3257ee1f45235b26206e9f624cc3c"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.parseImageData (cyclomatic 17): thumbnail-extractor.parseImageData 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"39628f4e0255015779186c6a7808a1452751b184e9ab9eb4de6e77acd537180c"}},{"ruleId":"D1","level":"warning","message":{"text":"thumbnail-extractor.parseImageData (cyclomatic 17): thumbnail-extractor.parseImageData 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b983304248752839a1533d6328233a96f1ff17fe4043351d6404a9048b9e1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"action-runtime.evaluateFormAction.statement (cyclomatic 17): action-runtime.evaluateFormAction.statement 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ece01ed31973e54278129258641cade18859c4f17c66438c83434c774a925ca"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfImportSession.importPdf (cyclomatic 17): PdfImportSession.importPdf has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items 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. This is NOT this file\u0027s highest cyclomatic complexity: Channel.constructor (cyclomatic 34) 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e274c68977dfc6d1d5726072fae6fe0526471a45c33b7f965558ba6447b2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"command-error.inspectCommandError (cyclomatic 17): command-error.inspectCommandError has cyclomatic complexity 17 (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":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"913e91e87db3cc44da09b531679a860dce77d3a6c37e7047c627785634cec98e"}},{"ruleId":"D1","level":"warning","message":{"text":"write-tools.prepareTable (cyclomatic 17): write-tools.prepareTable has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1226, 1245, 1260). 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: write-tools.prepareWrite (cyclomatic 33) 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfc9a9edbdf9781abedfa104328f1def5cc88164a7e8953090113939006ac72"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.buildTableSummary (cyclomatic 17): diff-engine.buildTableSummary 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a93e299ee28b9ba4d707f0fc19e3e223cdfe46cc157df8c07c56d894b22dbca"}},{"ruleId":"D1","level":"warning","message":{"text":"diff-engine.compareSnapshots (cyclomatic 17): diff-engine.compareSnapshots has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 3 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebab36e86abea35415d106e36aa6834acf52adf713a033fac45e1b82d132a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"font-rule-runtime.resolveProjectedCanvasKitFontPlan (cyclomatic 17): font-rule-runtime.resolveProjectedCanvasKitFontPlan 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":"rhwp-studio/src/core/font-rule-runtime.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedebcdbfb279a9ffa30b17f97c8af2c940e949fe9737077d65ca2a0f82ede36"}},{"ruleId":"D1","level":"warning","message":{"text":"font-decision-trace.canvas2dDecision (cyclomatic 17): font-decision-trace.canvas2dDecision 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":"rhwp-studio/src/core/font-decision-trace.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c820a345b61c2083c33ca10255dc63ecdf1c516d6f6a3c7f32bfde432b5a4"}},{"ruleId":"D1","level":"warning","message":{"text":"layer-tree-transport.readLayerTreeTransport (cyclomatic 17): layer-tree-transport.readLayerTreeTransport 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":"rhwp-studio/src/core/layer-tree-transport.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c59d1f632225491f1253d5990748a2b9aca89f826049f0f589cab2b77ce0f05"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmBridge.getPageLayerTreeObject (cyclomatic 17): WasmBridge.getPageLayerTreeObject 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d6ebf166a976b6eb530cbfd7d459383e4c0b486d13fce535376bd8aec3b1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"virtual-scroll.resolveAutoPageColumns (cyclomatic 17): virtual-scroll.resolveAutoPageColumns 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"92468f70942a1670f38ba1e3d2678565efeae4aa2e9f3aca11dee840c9644f65"}},{"ruleId":"D1","level":"warning","message":{"text":"sfnt-face.canvasKitSfntGlyphCount (cyclomatic 17): sfnt-face.canvasKitSfntGlyphCount 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":"rhwp-studio/src/view/canvaskit/sfnt-face.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"680a47fc2f8a0b0a2733dec90cab7efd16bd7a6015954cdd2b80701d9428edcf"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderLeaf (cyclomatic 17): CanvasKitLayerRenderer.renderLeaf 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: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90b53029b7932949b11a9c036e2f3643d694fcf599e00923b844e3896c16d53"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.recordTextRunCoverageGaps (cyclomatic 17): CanvasKitLayerRenderer.recordTextRunCoverageGaps has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd790aeeda6986d282ef4fcb81f13e688f147c0a375f5c6ef418ef938be947d6"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawCachedGlyphs (cyclomatic 17): CanvasKitLayerRenderer.drawCachedGlyphs 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"601c57c25b7fecf38b569b21c72873cee03af2f54420957c518b964e89cf5a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawEquationDecoration (cyclomatic 17): CanvasKitLayerRenderer.drawEquationDecoration 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. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1940595aaf5dcb279233def8fd8a402db3b59637cf2f4e6787ba71fced59ca86"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.prefetchLayerImages (cyclomatic 17): PageRenderer.prefetchLayerImages has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 6 function items inside it that branch. 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92a478204c80ff5034a1b2a47c25543da6ee3ffa0f8c8d57fe2c86a0cc7eadf"}},{"ruleId":"D1","level":"warning","message":{"text":"DeleteTextCommand.mergeWith (cyclomatic 17): DeleteTextCommand.mergeWith 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"914a5c4480f7dc209e3bb64bf5a1460dbfd1d5ff6627923a8971de5ea8c9cbfa"}},{"ruleId":"D1","level":"warning","message":{"text":"office-clipboard-images.imagePixelSize (cyclomatic 17): office-clipboard-images.imagePixelSize has cyclomatic complexity 17 (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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7494b44dfcfe83fe5861a8c3df90e10141c3359bbe973b883a257a63972bd072"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-picture.calcResizedBboxRotated (cyclomatic 17): input-handler-picture.calcResizedBboxRotated 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbfcea3ccc911573b8fada109644d77130252c9936dc5521d48e47a8d3daf8e"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.restoreEditContextAfterHistory (cyclomatic 17): InputHandler.restoreEditContextAfterHistory 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: InputHandler.cutSelectedObject::isCurrent (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3093}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec1108f5f0528200d07181f284fefe8f51084bf865bf330a648725a0825707b"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.updateCaret (cyclomatic 17): InputHandler.updateCaret 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: InputHandler.cutSelectedObject::isCurrent (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"524c1b9999332ff828cfe7994d1c1970dd5f441a3811f568215e9bae2f67703d"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.cutSelectedObject (cyclomatic 17): InputHandler.cutSelectedObject has cyclomatic complexity 17 (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. This is NOT this file\u0027s highest cyclomatic complexity: InputHandler.cutSelectedObject::isCurrent (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de781aa8d4c21644864e61a2b14a840249c2d7581464c3f7f5df0a60e52215"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartDataDialog.menuItems (cyclomatic 17): ChartDataDialog.menuItems 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ff25acbb2de1e7cdd01bde3c42acf753565c90154ec8e5865e0309c69b7a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartDataDialog.onConfirm (cyclomatic 17): ChartDataDialog.onConfirm has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940029b83bee4e6a0ef5fdf055afb19dc6f63a00b2d2863742aac2e851e6554"}},{"ruleId":"D1","level":"warning","message":{"text":"CompareDialog.renderValueDiff (cyclomatic 17): CompareDialog.renderValueDiff 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac2d8ea435a7e745ef9f7d4df7b2d370d0644a9c790ab06e8d60c6c0d9d4f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryDialog.renderValueDiff (cyclomatic 17): HistoryDialog.renderValueDiff 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"794405f264dc5a39744b7e13ca21052e215c23c22ce0adc8f6428fc2845026e6"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateIPv4 (cyclomatic 17): isPrivateIPv4 has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"rhwp-safari/src/background.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbcd0320864c463310c40e4867b2b4b11b7f1bfa5a2a6d71d7fa36dd6760d1"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateIPv4 (cyclomatic 17): isPrivateIPv4 has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"rhwp-shared/security/url-validator.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5356026bcc0b99ab4ed0837f7ce96ca0f55d70e1ca958390bbab482d71a954"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateIPv4 (cyclomatic 17): isPrivateIPv4 has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"db474ad078dc6c8022b4cb5361d42f1c4c021067675fa0cd4f167c24574d797d"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateIPv4 (cyclomatic 17): isPrivateIPv4 has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"rhwp-firefox/sw/fetch-security.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"785da59ddb3fd6eeb39c4b7e4d3590fe8f7ef68f94ddadf595c42732790e63df"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_stock (cyclomatic 16): rhwp_ooxml_chart::renderer::render_stock 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7cb20ce808610c749fe8355e436a10513bc7ad2f05b0807cbee9c30cd1fa0b"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildState::picture (cyclomatic 16): BuildState::picture 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":"src/document_core/builders/exam_paper_images.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5a44ac8709b41b7d05d5f60fcd2eaa107d1daa80f42aa8f3714c9db55b4060"}},{"ruleId":"D1","level":"warning","message":{"text":"Pool::import (cyclomatic 16): Pool::import 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":"src/document_core/commands/paragraph_block/import/resources/binary.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda98fcd467831cd0a16794f2d5716252ca283a9d595adc684ec059fb9a22024"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::set_page_number_position_native (cyclomatic 16): DocumentCore::set_page_number_position_native 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"96828c8d65c2096effb4394894fe8c20439e5b7aa0a1b1c70cad3ce59287f43b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::navigate_header_footer_by_page_native (cyclomatic 16): DocumentCore::navigate_header_footer_by_page_native 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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a64e87765b79bdded51b1146d9901597ba7ce0b00fdb4bf4c21e0e9f6d8267f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::relocate_floating_picture_native (cyclomatic 16): DocumentCore::relocate_floating_picture_native 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: DocumentCore::format_picture_properties_json (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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e37679273153b9ed718bdc8c8e05ece7462fe9d7ca310867c60834306d8cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::apply_shape_caption_props (cyclomatic 16): DocumentCore::apply_shape_caption_props 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: DocumentCore::footnote_shape_number_format_name (cyclomatic 19) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"52972ce9340ae3a6e38cffad323a93d4aecd93133adbe99e366910a6b932c589"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::split_table_native (cyclomatic 16): DocumentCore::split_table_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6b882bfead184c115379f56ab7aa352db723170520bed1fc6802511298006"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_selection_rects_in_footnote_native (cyclomatic 16): DocumentCore::get_selection_rects_in_footnote_native has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6036}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b8a3f0d325daa855a2fabbf60ad9af7ca08728fa85d6f5040014dd670abaad"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::get_page_overlay_images_native::write_overlay_image (cyclomatic 16): DocumentCore::get_page_overlay_images_native::write_overlay_image 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"047c5db7c6136d243a52c7e82763f402fb96b693eea0d27fa0fefe18595eb732"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCore::search_text_native (cyclomatic 16): DocumentCore::search_text_native 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79bea0fbd90656dbf22ff7dc1500ccfc0cbca503bee0d36dc4994200d61bc17"}},{"ruleId":"D1","level":"warning","message":{"text":"SignalSite::visit_control (cyclomatic 16): SignalSite::visit_control 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":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"40097a915f59f4314aa78b3a2eb34f5b00dd34fa9c5f3ec392484651b4207961"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::paragraphs (cyclomatic 16): Collector::paragraphs has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering_metafile_resources.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"72028608ccea5a291397b9c35e0e741d5560a54f8f373c3d8122dde4ace98378"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::read_string (cyclomatic 16): Lexer::read_string 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":"src/eps.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c02eacda33a82f84560a61f59ffaa8b392947cb5942ac1797d1b2cd9de83175"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::shift_position_metadata_for_stream_insertion (cyclomatic 16): Paragraph::shift_position_metadata_for_stream_insertion 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":"src/model/paragraph.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d34429acfa9aeacfa12915d0705efbbb33f69fc74738570516a83692d3128"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::rebuild_char_offsets (cyclomatic 16): Paragraph::rebuild_char_offsets 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":"src/model/paragraph.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4e0eea77004e854907c0643d36d8405b9c6ddf0b30c762a7d4e3e21d87226a"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::try_map_char_shape_range (cyclomatic 16): Paragraph::try_map_char_shape_range 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":"src/model/paragraph.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7de4fc75f52d854f197c9725dc73d75220abbb0b8e24a8f24a6c534cc1c0e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::delete_column (cyclomatic 16): Table::delete_column 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":"src/model/table.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce138cc3745e3c3af443b1287ee232086823001b575510ea458eaf928be405da"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasRenderer::render_node (cyclomatic 16): CanvasRenderer::render_node 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":"src/renderer/canvas.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3bea6ccc47a4c9dc40fd55c667d7495845b5d0471f27b229ec178589dc7df2"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_matrix (cyclomatic 16): EqLayout::layout_matrix 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":"src/renderer/equation/layout/matrix_geometry.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"738ba533f169ede4f0d2eeda8d3da050d73fff8f4b8fd25e38de9a6bf36e17cc"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_aligned_rows (cyclomatic 16): EqLayout::layout_aligned_rows 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":"src/renderer/equation/layout/matrix_geometry.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c15b513630fc6b1f137ab9fd47bc8add7b903297f176a4d446642a7a4d0a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"EqLayout::layout_plain_matrix (cyclomatic 16): EqLayout::layout_plain_matrix 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":"src/renderer/equation/layout/plain_matrix_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff9713bb213ae2e16a0265f144d67ff1b5eb7fd03aa3b906618c9cae7962163"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_named_script_operand (cyclomatic 16): EqParser::parse_named_script_operand 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":"src/renderer/equation/parser_left_scripts.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce986744de7229dd2718a9dbd79eca44f47bc5dd7f8375005ef500154732eba1"}},{"ruleId":"D1","level":"warning","message":{"text":"EqParser::parse_sqrt (cyclomatic 16): EqParser::parse_sqrt 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":"src/renderer/equation/parser_root.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9d84f2769dc73dc3de4d57475b793ac1054257412bac9ed732e62cd0dc7934"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_partial_paragraph_with_spacing_before (cyclomatic 16): LayoutEngine::layout_partial_paragraph_with_spacing_before 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1de80fb1723e15629c75d35fd957b85f4e73ee32358efda63386b8fd748fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::layout_body_picture (cyclomatic 16): LayoutEngine::layout_body_picture 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf27d8056f4ee28cae21bed1150c64969a2b1f787d91bf9311d2e45b1056bdf7"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::row_block_cut_closes_original_text_frame (cyclomatic 16): LayoutEngine::row_block_cut_closes_original_text_frame 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"750a67e8f3cd8af7484c2d5b9ba63e70d318397e3da3546583a208ede7112eff"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::original_body_closed_table_bottom (cyclomatic 16): LayoutEngine::original_body_closed_table_bottom 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":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a13d0ff40186d280219e550da14b7dc8c358e7889600bd6922da2e67c3ef53"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_deferred_picture_frame_before (cyclomatic 16): LayoutEngine::stored_deferred_picture_frame_before 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":"src/renderer/layout/table_layout/stored_deferred_picture_frame.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3544c040e5931f79966aa469680543df62fdf502f5287f7199378bb5481d1dd"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_heading_before_inline_frame_cut (cyclomatic 16): LayoutEngine::stored_heading_before_inline_frame_cut 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":"src/renderer/layout/table_layout/stored_empty_frame_restart.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c5d7d462f013f337c1e97d096e8b5aad1517523de92d198d9334def8fc50c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::stored_nested_unit_frame_break (cyclomatic 16): LayoutEngine::stored_nested_unit_frame_break 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":"src/renderer/layout/table_layout/stored_nested_source_cut.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f902d4223d04cee54b2549adf25bde1506bc23dc361c291654fb1551ecaf30"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::shared_frame_peer_owner (cyclomatic 16): LayoutEngine::shared_frame_peer_owner 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":"src/renderer/layout/table_layout/stored_shared_cell_frame.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bf70a26ba2a736e178da62d7df51987d90269d0b98d9df28557f5339520e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::table_uses_stored_fragment_coordinates (cyclomatic 16): LayoutEngine::table_uses_stored_fragment_coordinates 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":"src/renderer/layout/table_layout/stored_text_frame_owner.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d97c71747ae3a37df34f3f6f4e70d904a785bc8eff50b622f10ee0aa58332b"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::rewind_rowbreak_orphan_heading_before_recursive_block (cyclomatic 16): LayoutEngine::rewind_rowbreak_orphan_heading_before_recursive_block 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad795a342cdb8b04443b3bfaa51f169e5d0b5afce9bc3254edbebc0823e9ca25"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::fresh_rowbreak_wrapper_safe_prefix_end_cut (cyclomatic 16): LayoutEngine::fresh_rowbreak_wrapper_safe_prefix_end_cut 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7425b01fb7700327a4f551c3ed7b4ef1569f1dd30e2f52b8cdfb8cb6a57f40a1"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutEngine::compute_tac_pic_x (cyclomatic 16): LayoutEngine::compute_tac_pic_x 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":"src/renderer/layout.rs"},"region":{"startLine":17511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2900e74b85d1d9d7f3ad2ea9ccfd91a24192fa30d712302d2e97d032c21de89"}},{"ruleId":"D1","level":"warning","message":{"text":"HorizontalShapingPageSidecars::attach (cyclomatic 16): HorizontalShapingPageSidecars::attach 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":"src/renderer/shaping_publication.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9920ee31484de08612b5c86843152a39f74b107f1f9d8fdea28932b6a0ef2ba"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::emit_endnote_split (cyclomatic 16): TypesetEngine::emit_endnote_split 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":"src/renderer/typeset/notes/endnotes/emit.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"80709af32bbf6b3cc747099fe8c45eaa12acb9dccd773fc598e0cff518243ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::typeset_endnote_flow_tables (cyclomatic 16): TypesetEngine::typeset_endnote_flow_tables 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":"src/renderer/typeset/notes/endnotes/flow_table.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b93efa095015bed26e549a009f059dd561ceabfd431a27b93ee9ec743775fca"}},{"ruleId":"D1","level":"warning","message":{"text":"TypesetEngine::replay_endnote_column_extent (cyclomatic 16): TypesetEngine::replay_endnote_column_extent 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":"src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb7b9bf388e9cf01094e9f3ba53f648c2063702753e50aba3311ec20fbf53f2"}},{"ruleId":"D1","level":"warning","message":{"text":"HwpDocument::remap_style_ids (cyclomatic 16): HwpDocument::remap_style_ids 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":"src/wasm_api.rs"},"region":{"startLine":8391}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8c968098f7f1314f605cbe2d873060ed87916a4582e14054b3898054663502"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::harvest::run_table_csv (cyclomatic 16): rhwp::bin::rhwp-agent::harvest::run_table_csv 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":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff655bff74a59e252d50b29db3a19f1fe67065c458e16b1de0aaa895b80911f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::planlint::run_plan_lint (cyclomatic 16): rhwp::bin::rhwp-agent::planlint::run_plan_lint 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":"src/bin/rhwp-agent/planlint.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"77389e3ee348b7b566bc05f76679a06eb7b531315c179b0dc77bf1cf3cb888ca"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-control-layout::parse_cli (cyclomatic 16): rhwp::bin::rhwp-q::commands::rhwp-q-control-layout::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57986ac1e72f4981048faabe7c616b42663f05a62afc9d978bb87cdc0b7127"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-font-layout-evidence::parse_args (cyclomatic 16): rhwp::bin::rhwp-q::commands::rhwp-q-font-layout-evidence::parse_args 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":"src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"293143f6b1ea36244321a55ca61d324b556387ac245d4f766ab7450620d0a0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-markdown::parse_cli (cyclomatic 16): rhwp::bin::rhwp-q::commands::rhwp-q-markdown::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-markdown.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8523121c99856ba6b5b6bc732535b8596fb9d8212c2a55dca9fd1e7a4cb19e7"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-page-images::parse_cli (cyclomatic 16): rhwp::bin::rhwp-q::commands::rhwp-q-page-images::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-page-images.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a5ff00746b0c003cac47b074bb63791e150243d2bf2686a0431608450486e5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-text-layout::parse_cli (cyclomatic 16): rhwp::bin::rhwp-q::commands::rhwp-q-text-layout::parse_cli 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":"src/bin/rhwp-q/commands/rhwp-q-text-layout.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef68b1f44aef0bf3ba957950ae7b539d5975d1703a7db58c7c4d9b27132b0c26"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::bin_data::run (cyclomatic 16): rhwp::bin::rhwp-q::kit::bin_data::run 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":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b27dbb6136fb7ef309a6f0693482390d2bb2e0d4456f1c943a0d1a72941c23"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::canvaskit_preflight::run (cyclomatic 16): rhwp::bin::rhwp-q::kit::canvaskit_preflight::run 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":"src/bin/rhwp-q/kit/canvaskit_preflight.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ba9edb9411821c1439c02c2075a2e07d8bc2c47ba4ea05b939099b53f1a33f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::batch::ordered::stream_records (cyclomatic 16): rhwp::cli::batch::ordered::stream_records 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":"src/cli/batch/ordered.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce04382f34ea476cc0e4281e64aa3338e359e767711b5fe7ef8188e47f97e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::metadata::capabilities::show_capabilities (cyclomatic 16): rhwp::cli::metadata::capabilities::show_capabilities 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":"src/cli/metadata/capabilities/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1097d595dd99250b34c92a8a335b1a9311bb68032f192336fb8846feccb2c81a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::export_tables (cyclomatic 16): rhwp::cli::outputs::tabular::export_tables 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9866072e839c638b4b77c378c4a9d5c37ee1bb98390a47a9d63615c7bd2c15a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::signing::cmd_verify_signature (cyclomatic 16): rhwp::cli::protocol::capsule::signing::cmd_verify_signature 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":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a216b918b0e12fdb76126f61d58f728e6ad7a025a25a2381ed2893208d4de6e"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::explain::explain_document (cyclomatic 16): rhwp::cli::queries::explain::explain_document 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":"src/cli/queries/explain.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d4e0091e46045d9569c43af07f44c6fa8bdeb36e9ae544488eb1e4b87c5cab"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::cli::queries::structure::export_structure (cyclomatic 16): rhwp::cli::queries::structure::export_structure 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":"src/cli/queries/structure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd6af683889339c44ba4340bb591bbb0d2ee7b274fa046a617a77cb657b6e2"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_char_shape_audit::render_report (cyclomatic 16): rhwp::diagnostics::hwp5_char_shape_audit::render_report 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"8168316aa03fc316297d62754e76af0c8ec52ab39e191b837df1f598198eaeb6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::run_single (cyclomatic 16): rhwp::diagnostics::layout_anomaly::run_single 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: rhwp::diagnostics::layout_anomaly::node_type_label (cyclomatic 24) 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1590b01a051f96bce384327719810c441f44ac853366c3ce4a2b45bc76d29c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::diagnostics::render_geom_diff::parse_cli (cyclomatic 16): rhwp::diagnostics::render_geom_diff::parse_cli 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: rhwp::diagnostics::render_geom_diff::node_type_str (cyclomatic 24) 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":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e72cd585055c33ea3f6af4e83a860f7cad8eaa61e6cda39e7a6dfbad7049f6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::commands::bin_data_prune::visit_bin_data_refs::visit_controls (cyclomatic 16): rhwp::document_core::commands::bin_data_prune::visit_bin_data_refs::visit_controls 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":"src/document_core/commands/bin_data_prune.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcc80ac93c655d341c651f9aa147b33a6d7a03029bb4569a25db95d82be7caf"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::materialize_hwp5_bin_data_order (cyclomatic 16): rhwp::document_core::converters::hwpx_to_hwp::materialize_hwp5_bin_data_order 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b193a807d58f723f75d86d92257c3f0ec974bf9bf02597d32f46b4e20636450"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_controls (cyclomatic 16): rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_controls 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 shape REPEATS in the file: one other method here (rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape) 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7105fceb0c95eae935b27a47188cc51b951151ab1e943dd690f82587334d476a"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::chart_extract::collect_from_paragraph (cyclomatic 16): rhwp::document_core::queries::chart_extract::collect_from_paragraph 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":"src/document_core/queries/chart_extract.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e738910f3c4002cb10c30008c9bbb54b5e8e2c874cd108481bec62d73b8ea81"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::hwpctrl_sets::collect_controls (cyclomatic 16): rhwp::document_core::queries::hwpctrl_sets::collect_controls has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: rhwp::document_core::queries::hwpctrl_sets::control_identity (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7742cbb405c8c2a8a03103a29f66e78b6202cbd67e86b27995c095966cbe4b5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::rendering_metafile_resources::catalogue (cyclomatic 16): rhwp::document_core::queries::rendering_metafile_resources::catalogue 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":"src/document_core/queries/rendering_metafile_resources.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"99436d2fef8befac9cd990978815b1a56884bce34b39919acf7635f3fd98d805"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::document_core::queries::table_csv::parse_csv (cyclomatic 16): rhwp::document_core::queries::table_csv::parse_csv 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":"src/document_core/queries/table_csv.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ae6fed21851dbb34791079d0abc21d170b4d07e0e7d7bca3489d4b466c6a82"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::emf::emfplus::stream::records (cyclomatic 16): rhwp::emf::emfplus::stream::records 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":"src/emf/emfplus/stream.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ce67be5e1ca0be04e025fc2ef84d91589527132ddc629ff2fb0a23b8a74be1"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::pr::assets::seo_rii_20261030::consumer_probe::main (cyclomatic 16): rhwp::mydocs::pr::assets::seo_rii_20261030::consumer_probe::main 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":"mydocs/pr/assets/seo_rii_20261030/consumer_probe.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e6402f80e3c69e6fac2fea6e023486de518cbe4987124b1cc000cbf715c2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main (cyclomatic 16): rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main 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":"mydocs/tech/investigations/issue-836/probes/diag_836.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4e342f6985882025725a7e6232a2a1d12f608e50e57b695e0986d6051390ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::font_glyph::decode_font_bitmap_glyph_payload (cyclomatic 16): rhwp::paint::font_glyph::decode_font_bitmap_glyph_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":"src/paint/font_glyph.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a094d94886f3843055a5e1ee0bac094fcd4eaf20159b67c5d0d512874e4e785f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::metafile_masks::flatten_bitmap_masks (cyclomatic 16): rhwp::paint::metafile_masks::flatten_bitmap_masks 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":"src/paint/metafile_masks.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7777105179b20a06038a98a58dccb701c753a7a463ee88d3c41e3a996d8a7fcd"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::metafile_print::masks::flatten_bitmap_masks (cyclomatic 16): rhwp::paint::metafile_print::masks::flatten_bitmap_masks 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":"src/paint/metafile_print/masks.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d97292aa1e1f43be0daf684cbbeea3b0538a74a08d1c57b144dd700d1a5b83f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::shaping_glyph_vertical::prepare_vertical_font_delta (cyclomatic 16): rhwp::paint::shaping_glyph_vertical::prepare_vertical_font_delta 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":"src/paint/shaping_glyph_vertical.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6cd760531beceff0ccdd361d065c0f3f4cd1675f61f145a68a940602a217ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::paint::text_v2::line_break_risk_for_run (cyclomatic 16): rhwp::paint::text_v2::line_break_risk_for_run 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":"src/paint/text_v2.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"c348339c4c6403cb0f25454f0d5d71abdd686822cf6ce70b4a88f85c9c14565c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwp3::fixup_hwp3_notes_in_controls (cyclomatic 16): rhwp::parser::hwp3::fixup_hwp3_notes_in_controls 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c706e6668f2b390eac1d35dd21bc4c1e0411da2db83aa87edcbc697b9c2b8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_visibility (cyclomatic 16): rhwp::parser::hwpx::section::parse_visibility 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":"src/parser/hwpx/section.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bdee697b156ee044eed7d67ebfce46e2999bf17676c8170e984ac9abd60d0f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hwpx_line_width (cyclomatic 16): rhwp::parser::hwpx::section::parse_hwpx_line_width 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a20d72050112d0350a79638a90563174fb946f274ce2e1cc69ccd5cde70a27"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_switch_chart_or_ole (cyclomatic 16): rhwp::parser::hwpx::section::parse_switch_chart_or_ole 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44cd632d4e2a1d7fd9663ccbf45ecc5d35320cb4f3517adb2c9b9da8a553641"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::recognition::starts_item (cyclomatic 16): rhwp::parser::pdf::recognition::starts_item 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"219103ddd52256994aac4d7e163f4836800c172564a2ee7563d4dec7a32c4229"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::wrap_width::fit (cyclomatic 16): rhwp::parser::pdf::structured_lowering::wrap_width::fit 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":"src/parser/pdf/structured_lowering/wrap_width.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"25efc9486bf143f5a7fe73b4263e4f173e65912a09f867d07b224adb067cfb61"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::observe (cyclomatic 16): rhwp::parser::pdf::table_detection::cell_regions::observe 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":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04f23a9935a313b02dd78619cd0a24bd5afde7dd66271daee038c85408051f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::parser::pdf::table_inference::rectangle (cyclomatic 16): rhwp::parser::pdf::table_inference::rectangle 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f0b04b12672253b56fdacfadb51d0069e0f64ca7ebbb033f78cb1bd592dbd5"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_terminal_suffix_start (cyclomatic 16): rhwp::renderer::float_placement::stored_table_terminal_suffix_start 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":"src/renderer/float_placement.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9f415d224854067a6e419938f5bb6c5a712571ca9c14b5d5991bb79d682b9"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_next_page_placement (cyclomatic 16): rhwp::renderer::float_placement::stored_picture_next_page_placement 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":"src/renderer/float_placement.rs"},"region":{"startLine":5450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce434347a4994b34ef2d8833d3e72e6c241c392d619775b8f3256f2a6125ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::float_placement::resolve_float_exclusion (cyclomatic 16): rhwp::renderer::float_placement::resolve_float_exclusion 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":"src/renderer/float_placement.rs"},"region":{"startLine":8096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36befa2511ab39054febf89cdab00090c27b027bd0660aba0ff2c33f904c8b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::font_fallback::generic_fallback (cyclomatic 16): rhwp::renderer::font_fallback::generic_fallback 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":"src/renderer/font_fallback.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2efad5270e7e2c642b23c24be7c9fd3f07c76a3c7c245036ec2348092366642"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::extend_clipped_cell_vertical_clip_to_nearby_nested_table_borders (cyclomatic 16): rhwp::renderer::layout::table_layout::extend_clipped_cell_vertical_clip_to_nearby_nested_table_borders has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (scan_table_borders). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"92171701273e79c82c785b694feeabed0dafc2fdd6ebf34995c5446a342183d8"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::kopub_cjk_symbol_units (cyclomatic 16): rhwp::renderer::layout::text_measurement::kopub_cjk_symbol_units 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: rhwp::renderer::layout::text_measurement::vertical_substitute_char (cyclomatic 24) 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d87ece10eab39d3ad42358a000aa425b5fb35b2c743eba86a37db8378af1c10"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::legacy_font_advances::select_native_programs (cyclomatic 16): rhwp::renderer::legacy_font_advances::select_native_programs 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":"src/renderer/legacy_font_advances.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35408ee4ded435ade9a95dd1ca3e8fca7a58b04ce6f5a6b9fba3fab0d17df97"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::pdf_synthetic_bold::decide (cyclomatic 16): rhwp::renderer::pdf_synthetic_bold::decide 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":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb8b40cb8dbda31302436d1fa2f0e690906dc29d4cdac725a5fb530066f5705"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage (cyclomatic 16): rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7deb11d9f00fb48bebd94a815d436da135ed266dfa4571de2261c79d40add27"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::skia::text_replay::marks::draw (cyclomatic 16): rhwp::renderer::skia::text_replay::marks::draw 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":"src/renderer/skia/text_replay/marks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8127188ab713dc5ca64506f58c08a6f8956107fd013cf21adfdc73f37eb283f"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::table_row_frame::declared_tail_row_height (cyclomatic 16): rhwp::renderer::table_row_frame::declared_tail_row_height 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":"src/renderer/table_row_frame.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c31d83f343a5d3b1eac5afc1b220a2cc10122a844e663413ae99fc339700a56"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::text_font_presentation::ordinary_text_font_program (cyclomatic 16): rhwp::renderer::text_font_presentation::ordinary_text_font_program 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":"src/renderer/text_font_presentation.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a77155c2226ee364c0f609a220222752f1ac15c6dc7819d69c78b06571d00fa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::wrap_flow::place (cyclomatic 16): rhwp::renderer::typeset::controls::wrap_flow::place 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":"src/renderer/typeset/controls/wrap_flow.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"76953974c4e5c028a16b80eef5a00d992f1e7ae01843f0fa4e55f62e9ae001aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::wrap_match::classify (cyclomatic 16): rhwp::renderer::typeset::controls::wrap_match::classify 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":"src/renderer/typeset/controls/wrap_match.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3517b6609e11c42cc6df10def0c9fe3b6ea7f8b1fb7252bf9153ba21f7307545"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::resource_supervisor::pdf_confinement::linux::confine (cyclomatic 16): rhwp::resource_supervisor::pdf_confinement::linux::confine 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":"src/resource_supervisor/pdf_confinement.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfd40f2a90775dac7f9e86165b242263da956391d395a2edb55aa7ba4d96c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::doc_info::surgical_insert_font_all_langs (cyclomatic 16): rhwp::serializer::doc_info::surgical_insert_font_all_langs 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: rhwp::serializer::doc_info::border_line_type_to_u8 (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":"src/serializer/doc_info.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5400a60d4bfab48549608e9027230b79513147fd428aba9bbd63a1486862107"}},{"ruleId":"D1","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::normalize_paragraph_like_hwpx_export (cyclomatic 16): rhwp::serializer::hwpx::roundtrip::normalize_paragraph_like_hwpx_export 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: IrDifference::fmt (cyclomatic 22) 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8d525064b86f20abce06741b1f4140b7290359e7cbb7622090a08a2e2e0b39"}},{"ruleId":"D1","level":"warning","message":{"text":"_gen_pack.build_ledger (cyclomatic 16): _gen_pack.build_ledger 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":".claude/skills/rhwp-strategist/references/_gen_pack.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d9de67421d47e7b519e4978808bb0c5bc8ffc948a608f4d7c429c53f1e5fc1"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.eval_check (cyclomatic 16): runner.eval_check 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":"gym/core/runner.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"470ec13cae53acd5d2ade3e3991918fca6c4bf01c2306c3cb1b75df3abe8d350"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.score_pack (cyclomatic 16): runner.score_pack 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":"gym/core/runner.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"97da2c56d2443b0fe44169fa4e3caf9361f31cdb6abc1e1bd4d1dd13ff9d4fda"}},{"ruleId":"D1","level":"warning","message":{"text":"agent_session.validate_trace_event (cyclomatic 16): agent_session.validate_trace_event 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":"gym/tools/agent_session.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"910b912a67554de679148dbbad37d70aca7d238f58458f9bc6b27d467980237e"}},{"ruleId":"D1","level":"warning","message":{"text":"fuzz_corpus.exception_kind (cyclomatic 16): fuzz_corpus.exception_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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9fc8bef649f7db78360aecabec2355c46a84529ad1ca1404a2603bb764df53"}},{"ruleId":"D1","level":"warning","message":{"text":"leaderboard.validate_fingerprint (cyclomatic 16): leaderboard.validate_fingerprint 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":"gym/tools/leaderboard.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d48c13c49f9c247cd37a19895d8d78f412a00db926e6e1abf1c0fe06e4704fd"}},{"ruleId":"D1","level":"warning","message":{"text":"release_diff.build_probe_failed_report (cyclomatic 16): release_diff.build_probe_failed_report 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":"gym/tools/release_diff.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f49b5864ae4ae5d3cbcd37894f1f553a470071758697086e46844e166a8fe51"}},{"ruleId":"D1","level":"warning","message":{"text":"release_gate.gate (cyclomatic 16): release_gate.gate 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":"gym/tools/release_gate.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b9d27b7c831b79a4b60503a886fc816b88fc82b6b2eff4dfc2b86f82540de"}},{"ruleId":"D1","level":"warning","message":{"text":"condense_rule_replay.replay (cyclomatic 16): condense_rule_replay.replay 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":"mydocs/tech/investigations/issue-7418/probes/condense_rule_replay.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3ab9c97353a401ac2d1fe49fc36799661fd1941d3129f4517e02068dfc8e24"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeTextureController._closePlatform (cyclomatic 16): NativeTextureController._closePlatform 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc11d75730b3edce098dac93f767fcb0fef0cb7742d26f8af307fbe46447526"}},{"ruleId":"D1","level":"warning","message":{"text":"write-tools.prepareFormatText (cyclomatic 16): write-tools.prepareFormatText 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 one function literal inside it that branches (line 1120). 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. This is NOT this file\u0027s highest cyclomatic complexity: write-tools.prepareWrite (cyclomatic 33) 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c505a59167048184e4a6dd451555cefa2e53f82480b22b0390ac9691503a2"}},{"ruleId":"D1","level":"warning","message":{"text":"gemini.toGeminiSchema (cyclomatic 16): gemini.toGeminiSchema 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d6937f50078b17c446f78fd0b265dd968130c47336dc4e5fcc71dbe4014498"}},{"ruleId":"D1","level":"warning","message":{"text":"file.runPrintPreview (cyclomatic 16): file.runPrintPreview has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a18c9af1d34a6460fc1a08d316b8cd811b6559254c29f6df902726f63ca60b"}},{"ruleId":"D1","level":"warning","message":{"text":"table.blockCalcCommand.execute (cyclomatic 16): table.blockCalcCommand.execute has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd7ebe16312baf3b06cdcdc575900e6094b7d1f808e7203831704e85782eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasSupplementalMetricProvider.prepare (cyclomatic 16): CanvasSupplementalMetricProvider.prepare has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/supplemental-text-metrics.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"45efbbfd4dffe3f5b38927875f8780a297a8f4a36fb4465dbe583ddc42577d7f"}},{"ruleId":"D1","level":"warning","message":{"text":"local-fonts.normalizeSnapshot (cyclomatic 16): local-fonts.normalizeSnapshot 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15f15f05e159fbd1fc4c4182366e87a8c55f7117f4d65f95a79ef5008d05525"}},{"ruleId":"D1","level":"warning","message":{"text":"document-font-status.analyzeDocumentFonts.fonts (cyclomatic 16): document-font-status.analyzeDocumentFonts.fonts 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":"rhwp-studio/src/core/document-font-status.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe52177715390402ccb7c4db8f2bd10ec622a7aa60d30822d6d34b5fd3edaa8"}},{"ruleId":"D1","level":"warning","message":{"text":"replay-fingerprint.replayFingerprint::visit (cyclomatic 16): replay-fingerprint.replayFingerprint::visit 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":"rhwp-studio/src/view/canvaskit/replay-fingerprint.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f956a2ee5aca4f376026a8fc719f5bc2d97f131858a25e9c1dba018dca45f05d"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareHostFonts (cyclomatic 16): CanvasKitLayerRenderer.prepareHostFonts 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: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36f5ef611a872f6b37804430cc829db2815a6d7c8527ab761c769a38896648f"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderGlyphOutline (cyclomatic 16): CanvasKitLayerRenderer.renderGlyphOutline 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: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4573fadf6900ed38aaccef873c737eb8379eae77282f61ca59349d04aa063ce"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawTiledImage (cyclomatic 16): CanvasKitLayerRenderer.drawTiledImage has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"9530e3d5dc8666922af8b046ff0d71d004a9bfbaabb2acaccc426e668fc6e771"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasKitLayerRenderer.recordImageFailure (cyclomatic 16): CanvasKitLayerRenderer.recordImageFailure 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: CanvasKitLayerRenderer.renderOp (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd45a1f4da6f4091fddc1d75562b334240282c6bc93d8b8790c00bd69515ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"raw-svg-prefetch.collectVectorRawSvgDataUrls (cyclomatic 16): raw-svg-prefetch.collectVectorRawSvgDataUrls 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":"rhwp-studio/src/view/raw-svg-prefetch.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa6820a4ef91efef5164c5ac61254acf031c28e38831522be7419fced4d1575"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer.getLayerPlaneSummaryFromOverlayImages (cyclomatic 16): PageRenderer.getLayerPlaneSummaryFromOverlayImages 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ec32db1bf3a4e473edd81d932fb947343f1dea1f0df0164dfd7cc578739bd"}},{"ruleId":"D1","level":"warning","message":{"text":"RendererSession.resolveUncached (cyclomatic 16): RendererSession.resolveUncached 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":"rhwp-studio/src/view/renderer-session.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf45fcda5d513af7f739178281e5c151d6e3d3d55529c637fe68612a90540a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruler.drawVertical (cyclomatic 16): Ruler.drawVertical 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065ecc72bac2982f159e898f08595536b3e6e21389c22576f68a08a2dfa997d"}},{"ruleId":"D1","level":"warning","message":{"text":"CursorState.updateRect (cyclomatic 16): CursorState.updateRect 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8078ad53c7850e6bcc24342424f6ca930407f99ab9a73b128a480f4dae58d37b"}},{"ruleId":"D1","level":"warning","message":{"text":"TextMutationEffectAccumulator.add (cyclomatic 16): TextMutationEffectAccumulator.add 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd9b9b6ff86bfa47b117376ebe381e9c73e533d553d2f87881aeb4983aba5c7"}},{"ruleId":"D1","level":"warning","message":{"text":"CellSelectionRenderer.render (cyclomatic 16): CellSelectionRenderer.render has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"rhwp-studio/src/engine/cell-selection-renderer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0460d4b9ec9459bd9da9bf3c3d264ab78674f8edba1b34ecf30843081594a"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-hyperlink-delete.tryConfirmDeleteHyperlink (cyclomatic 16): input-handler-hyperlink-delete.tryConfirmDeleteHyperlink 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 4 function items inside it that branch (a function literal at line 39, canEdit, a function literal at line 33, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-hyperlink-delete.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb77240e8ed364f009438868d246d79597bb9600f79fcab9e851fe4bc419831"}},{"ruleId":"D1","level":"warning","message":{"text":"input-handler-keyboard.handleHeaderFooterNavigationShortcut (cyclomatic 16): input-handler-keyboard.handleHeaderFooterNavigationShortcut 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f15c8770773b5195faf1b97d81cb804e9b5ba16af55ad8f99c6b2ce46a311ac"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.bodyTableRectsInRange (cyclomatic 16): InputHandler.bodyTableRectsInRange 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 one function item inside it that branches (inRange). 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. This is NOT this file\u0027s highest cyclomatic complexity: InputHandler.cutSelectedObject::isCurrent (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bde9c6599a297fb8df4b40b2413b86e5c391533a5bfe27e569198397edd9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.executeFormActionPlan (cyclomatic 16): InputHandler.executeFormActionPlan 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. This is NOT this file\u0027s highest cyclomatic complexity: InputHandler.cutSelectedObject::isCurrent (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ad45d1411238bbb49e168f71aec2c6a603a718a315d2759bb83e19f8d9ac03"}},{"ruleId":"D1","level":"warning","message":{"text":"CellBorderBgDialog.updateDiagonalPreview (cyclomatic 16): CellBorderBgDialog.updateDiagonalPreview has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function items 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9defe617197c6d93ed10f0623ee120d4792ab5b4d4178e40558c3c4fb37b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartDataDialog.renderGrid (cyclomatic 16): ChartDataDialog.renderGrid has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"71abef8fc031ba5da2dc25df84da3f5da05661e6f324d117a6d547171e3536cc"}},{"ruleId":"D1","level":"warning","message":{"text":"runAgentTask (cyclomatic 16): runAgentTask 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":"rhwp-desk/ui/js/agent.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db381109f6525d05b7910ee8f17951b97f40c681040b41ea9af03762011a6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::cell_units_uncached (cognitive 1398): LayoutEngine::cell_units_uncached has cognitive complexity 1398 (threshold 15). Drivers by points: if/else 318 (977 pts), boolean chains 232, loops 33 (118 pts), match/switch 20 (71 pts) (nesting depth added 795). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53040951cbd3b31f77dd477639185888b34f1d2a2b4f6c060c582e4ecd2b4b6"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_cells (cognitive 1379): LayoutEngine::layout_partial_table_cells has cognitive complexity 1379 (threshold 15). Drivers by points: if/else 313 (995 pts), boolean chains 252, loops 19 (75 pts), match/switch 21 (57 pts) (nesting depth added 774). Of this number, 1365 points are the body\u0027s own statements and 14 belong to one function item inside it that branches. 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd400f6663d46c5c2a2c437df8f5556c7369fbc64b4ca89efa83046763abc5"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_single_column (cognitive 972): LayoutEngine::build_single_column has cognitive complexity 972 (threshold 15). Drivers by points: if/else 258 (684 pts), boolean chains 153, match/switch 45 (111 pts), loops 10 (24 pts) (nesting depth added 506). 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":"src/renderer/layout.rs"},"region":{"startLine":7866}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a23f0a84f70432da98143d313a13b83d52a2155b6fa636ce279fd0fb81fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_horizontal_cell_paragraphs (cognitive 895): LayoutEngine::layout_horizontal_cell_paragraphs has cognitive complexity 895 (threshold 15). Drivers by points: if/else 201 (667 pts), boolean chains 106, loops 12 (61 pts), match/switch 16 (61 pts) (nesting depth added 560). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1420ce544ab4ee54e89167d8ba969ed1c466b4333c405191d251c4055634cd"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightMeasurer::measure_table_impl_with_storage (cognitive 731): HeightMeasurer::measure_table_impl_with_storage has cognitive complexity 731 (threshold 15). Drivers by points: if/else 223 (537 pts), boolean chains 117, loops 26 (52 pts), match/switch 9 (25 pts) (nesting depth added 356). 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6029d5613d3c5b323ed59adb8588343f511ecc03c997b844629ce6b71f43aa41"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_composed_paragraph_in_frame (cognitive 621): LayoutEngine::layout_composed_paragraph_in_frame has cognitive complexity 621 (threshold 15). Drivers by points: if/else 235 (436 pts), boolean chains 146, loops 12 (30 pts), match/switch 5 (9 pts) (nesting depth added 223). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"35986e1a3d3b60ded0fc2a0a491fd1e19561d96474b6ec0167a31e8ba0a34001"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_table_control_block (cognitive 598): LayoutEngine::layout_table_control_block has cognitive complexity 598 (threshold 15). Drivers by points: if/else 186 (464 pts), boolean chains 87, loops 6 (28 pts), match/switch 6 (19 pts) (nesting depth added 313). 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":"src/renderer/layout.rs"},"region":{"startLine":12856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06bef5c60992715d7e30487de3b1d1093718dbc6b8ea9382c3b30ec2060e20e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::emit_line_runs (cognitive 555): LayoutEngine::emit_line_runs has cognitive complexity 555 (threshold 15). Drivers by points: if/else 151 (462 pts), boolean chains 50, loops 10 (38 pts), match/switch 2 (5 pts) (nesting depth added 342). 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":8880}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7ba81e7b56049220b4c997188240c4b1e7f8fcac5876b79fc60b3da98e044"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_resolved (cognitive 552): LayoutEngine::layout_partial_table_resolved has cognitive complexity 552 (threshold 15). Drivers by points: if/else 183 (359 pts), boolean chains 135, loops 21 (51 pts), match/switch 3 (7 pts) (nesting depth added 210). Of this number, 532 points are the body\u0027s own statements and 20 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":6003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6abb1e4dfae8a329fec272c4bcd125a73f6808f761b889dc080b6e27163a6"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-mouse.onClick (cognitive 502): input-handler-mouse.onClick has cognitive complexity 502 (threshold 15). Drivers by points: if/else 124 (352 pts), boolean chains 51, error handling 12 (46 pts), ternaries 12 (35 pts), loops 3 (18 pts) (nesting depth added 300). 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b795811c9e8bacab0a0a019c7e1f62abed6f4c4976d86211fd11707d9f2e6d99"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightCursor::vpos_adjust (cognitive 486): HeightCursor::vpos_adjust has cognitive complexity 486 (threshold 15). Drivers by points: if/else 196 (307 pts), boolean chains 172, match/switch 5 (7 pts) (nesting depth added 113). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c672b2a01b27fd914a1788e99042069809f6a9c479c73cf226f07b5ac49e6980"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.onKeyDown (cognitive 477): input-handler-keyboard.onKeyDown has cognitive complexity 477 (threshold 15). Drivers by points: if/else 177 (336 pts), boolean chains 72, ternaries 11 (36 pts), error handling 9 (32 pts), match/switch 1 (nesting depth added 207). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"795957006b5f9b0190b68b8079cd12291a012886acba9614b87927e1ca2184ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::partition (cognitive 462): rhwp::parser::pdf::table_paint::partition has cognitive complexity 462 (threshold 15). Drivers by points: if/else 98 (328 pts), loops 34 (94 pts), boolean chains 23, match/switch 5 (17 pts) (nesting depth added 302). 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":"src/parser/pdf/table_paint.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"829746a5a7e372fcf9dc3d85974016d9863fa6c9d8cdc73fbb1fb550d69ed20d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_shape_object_with_group_origin (cognitive 453): LayoutEngine::layout_shape_object_with_group_origin has cognitive complexity 453 (threshold 15). Drivers by points: if/else 113 (376 pts), match/switch 8 (42 pts), loops 5 (19 pts), boolean chains 16 (nesting depth added 311). 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce401af83a5365a774a18a1bf5475644fea04a8f58cc95b61c89ebb5b96ecfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaLayerRenderer::render_node (cognitive 410): SkiaLayerRenderer::render_node has cognitive complexity 410 (threshold 15). Drivers by points: if/else 103 (307 pts), match/switch 13 (46 pts), loops 13 (38 pts), boolean chains 19 (nesting depth added 262). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/renderer.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603e9c870da0ca8a35c6b2ef1929a988ac03689350385b00be6a74b32922f06"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::emit_table_fragment (cognitive 408): TypesetEngine::emit_table_fragment has cognitive complexity 408 (threshold 15). Drivers by points: if/else 168 (244 pts), boolean chains 155, match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/emit.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f4001ce55ed36143305205a4a70095d60f626a68ef1dfd2ef3f667dc02090"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_table_item (cognitive 402): LayoutEngine::layout_table_item has cognitive complexity 402 (threshold 15). Drivers by points: if/else 113 (303 pts), boolean chains 60, match/switch 13 (36 pts), loops 1 (3 pts) (nesting depth added 215). 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":"src/renderer/layout.rs"},"region":{"startLine":14945}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a19ad3c1ba4469d8ffea6013cf072179b103466e798ebbcaf42162e6c59bded"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prepare_block_table_entry (cognitive 401): TypesetEngine::prepare_block_table_entry has cognitive complexity 401 (threshold 15). Drivers by points: if/else 151 (237 pts), boolean chains 148, match/switch 7 (9 pts), loops 5 (7 pts) (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80dbdd64152fb1853ebb8680b3fd1f12dc2da44eda2cef48b4fd01d14c09635"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::scan_ordinary_row_step (cognitive 395): TypesetEngine::scan_ordinary_row_step has cognitive complexity 395 (threshold 15). Drivers by points: if/else 138 (253 pts), boolean chains 141, loops 1 (nesting depth added 115). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cc1c0cbbc10838deb3bfa58968d2e75c950aac4d83e08e3abe4706b40f0174"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_paragraph_list_inner (cognitive 384): rhwp::parser::hwp3::parse_paragraph_list_inner has cognitive complexity 384 (threshold 15). Drivers by points: if/else 101 (266 pts), boolean chains 44, match/switch 10 (39 pts), loops 14 (35 pts) (nesting depth added 215). 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a810d711a509828b2654ef2c0b131184ad8c7a153d00688891ab3e105c6f9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::paginate_with_measured_context_with_storage (cognitive 340): Paginator::paginate_with_measured_context_with_storage has cognitive complexity 340 (threshold 15). Drivers by points: if/else 88 (258 pts), boolean chains 64, match/switch 3 (10 pts), loops 4 (8 pts) (nesting depth added 181). 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7202289a8e2c0ac29343fba61d6e802e8129a11eb1ffca8c28de0e0ed2ed0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::typeset_endnote_paragraphs (cognitive 320): TypesetEngine::typeset_endnote_paragraphs has cognitive complexity 320 (threshold 15). Drivers by points: if/else 107 (191 pts), boolean chains 103, loops 5 (15 pts), match/switch 4 (11 pts) (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bb1059266fc1ef1fb8bf6d361ec96f9620abdd26514aecd186dd81d7dcb18f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::grep_with_context (cognitive 316): DocumentCore::grep_with_context has cognitive complexity 316 (threshold 15). Drivers by points: loops 21 (155 pts), if/else 16 (120 pts), match/switch 8 (40 pts), boolean chains 1 (nesting depth added 270). 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":"src/document_core/queries/grep.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8beeb300b2d088576f9b5a8cab32841a74a65944af2e19c68bf9bd853fe1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_column_item (cognitive 310): LayoutEngine::layout_column_item has cognitive complexity 310 (threshold 15). Drivers by points: if/else 78 (256 pts), boolean chains 35, match/switch 6 (19 pts) (nesting depth added 191). 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":"src/renderer/layout.rs"},"region":{"startLine":11586}}}],"partialFingerprints":{"codehealthFindingId/v1":"976f29257b61d0c4f4d31e52dfab9f3fcbfffe5dda5aa02c343ec34e343424ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::reflow_zero_height_paragraphs (cognitive 289): DocumentCore::reflow_zero_height_paragraphs has cognitive complexity 289 (threshold 15). Drivers by points: if/else 55 (192 pts), boolean chains 55, loops 9 (31 pts), match/switch 2 (11 pts) (nesting depth added 168). 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":"src/document_core/commands/document.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca183d60e4ffd64dad6c004f83601d379bf37b39f8bb2feec59fc56379712e08"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_textbox_content (cognitive 281): LayoutEngine::layout_textbox_content has cognitive complexity 281 (threshold 15). Drivers by points: if/else 85 (198 pts), loops 19 (44 pts), match/switch 11 (26 pts), boolean chains 13 (nesting depth added 153). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c10a5c47662a17a3d0abfb74f8efdf1c6dfaae1bb69e1e971ff3f330b54020"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::place_paragraph_controls_with_storage (cognitive 277): TypesetEngine::place_paragraph_controls_with_storage has cognitive complexity 277 (threshold 15). Drivers by points: if/else 40 (175 pts), loops 7 (37 pts), match/switch 9 (37 pts), boolean chains 28 (nesting depth added 193). 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":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"babc21349feaf707fb5ac17558c0cf716625472abf7825225b202fb7ce6e89ac"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_table_cells (cognitive 268): LayoutEngine::layout_table_cells has cognitive complexity 268 (threshold 15). Drivers by points: if/else 75 (185 pts), boolean chains 51, loops 9 (22 pts), match/switch 3 (10 pts) (nesting depth added 130). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":10492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a45dbdd86dc5c57c3857736e6d0adeb789ee0a5266703395776171620c4cf8d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paginate_pass_with_storage (cognitive 267): DocumentCore::paginate_pass_with_storage has cognitive complexity 267 (threshold 15). Drivers by points: if/else 74 (189 pts), loops 22 (60 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 160). 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1b8cd79fe7d85de5a05e6eea012901485d975f6068732ed623be4cbc739598"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_table_with_wrapper_margin (cognitive 265): LayoutEngine::layout_table_with_wrapper_margin has cognitive complexity 265 (threshold 15). Drivers by points: if/else 95 (196 pts), boolean chains 40, loops 10 (21 pts), match/switch 3 (8 pts) (nesting depth added 117). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50fc348ba0495f3e7de733aed2d9006f97a002c93ed5049e658b1f5c6180119"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prepare_table_fragment_budget (cognitive 261): TypesetEngine::prepare_table_fragment_budget has cognitive complexity 261 (threshold 15). Drivers by points: if/else 114 (129 pts), boolean chains 124, match/switch 3 (6 pts), loops 2 (nesting depth added 18). 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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46fdbd7754c539507147a69ae7f6e0efaf1f6d1ce45b4237bf14238f2d5c341"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_hwp3_object_dispatch (cognitive 252): rhwp::parser::hwp3::parse_hwp3_object_dispatch has cognitive complexity 252 (threshold 15). Drivers by points: if/else 84 (161 pts), loops 15 (52 pts), match/switch 12 (30 pts), boolean chains 9 (nesting depth added 132). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a617b97fabebb27bc752a0dc269cec9f2ea9fa03e8fa6ef2fe94683993e85fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_shape_item (cognitive 251): LayoutEngine::layout_shape_item has cognitive complexity 251 (threshold 15). Drivers by points: if/else 50 (195 pts), match/switch 7 (30 pts), boolean chains 26 (nesting depth added 168). 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":"src/renderer/layout/shape_item.inc.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa32349de2a6b9011e3ff6bcd7bd656f75351928a195e1ce76707d8aab6f85b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::render_node (cognitive 248): SvgRenderer::render_node has cognitive complexity 248 (threshold 15). Drivers by points: if/else 80 (201 pts), loops 11 (30 pts), boolean chains 9, match/switch 4 (8 pts) (nesting depth added 144). 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":"src/renderer/svg.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"600902496bd17449551508a7249437c28b3605264ec243853244b1076b9d3882"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::place_table_with_text (cognitive 247): TypesetEngine::place_table_with_text has cognitive complexity 247 (threshold 15). Drivers by points: if/else 106 (164 pts), boolean chains 81, loops 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":"src/renderer/typeset.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4e5929d5afe9b789928452950a0861afb8cba0ef7665446b6da3ff5a913f17"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaTextReplay::draw_text (cognitive 244): SkiaTextReplay::draw_text has cognitive complexity 244 (threshold 15). Drivers by points: if/else 89 (185 pts), loops 10 (24 pts), boolean chains 20, match/switch 4 (15 pts) (nesting depth added 121). 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":"src/renderer/skia/text_replay.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7934dd0f52cbae286f63276532d276a1ada44b49fe697f21bd6e5802655860"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::editable::reflow (cognitive 244): rhwp::parser::pdf::editable::reflow has cognitive complexity 244 (threshold 15). Drivers by points: if/else 39 (148 pts), loops 22 (69 pts), match/switch 4 (22 pts), boolean chains 5 (nesting depth added 174). 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":"src/parser/pdf/editable.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbef6c3ead127ad7b3b87c24229404dbd4107d05a6b44779cbe8473e60c4547b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::writeback_reflowed_table_frames_with_storage (cognitive 239): DocumentCore::writeback_reflowed_table_frames_with_storage has cognitive complexity 239 (threshold 15). Drivers by points: if/else 34 (157 pts), loops 13 (51 pts), match/switch 5 (25 pts), boolean chains 6 (nesting depth added 181). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779497e990cb99810286ec6f8251199fd5fd2a14bf07a10bd86e2d98a15d94b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prepare_block_table_continuation (cognitive 238): TypesetEngine::prepare_block_table_continuation has cognitive complexity 238 (threshold 15). Drivers by points: boolean chains 119, if/else 85 (115 pts), loops 2, match/switch 2 (nesting depth added 30). 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":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef1bc0baa737056712e8dd8f7867e9242f129e920894dfbaef100dd12574619"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::handle_start (cognitive 222): rhwp_ooxml_chart::parser::handle_start has cognitive complexity 222 (threshold 15). Drivers by points: if/else 79 (188 pts), match/switch 9 (26 pts), boolean chains 8 (nesting depth added 126). 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce49cd02356eb7b6e7f977570b6d5d2ba1fc89f57c912ae9622e7bbadd99246"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::navigate_next_editable (cognitive 219): DocumentCore::navigate_next_editable has cognitive complexity 219 (threshold 15). Drivers by points: if/else 53 (196 pts), loops 4 (14 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 155). 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"605271b629002d169dda33a40dbcd432d4ea9974e13d61739f9b3b452040bb5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PicturePropsDialog.populateFromProps (cognitive 207): PicturePropsDialog.populateFromProps has cognitive complexity 207 (threshold 15). Drivers by points: if/else 75 (178 pts), boolean chains 29 (nesting depth added 103). Of this number, 204 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b18e9ad0a76a2784e74fa4c35031fca640cd5a099d081d66ff0bf42d783ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_native (cognitive 206): DocumentCore::hit_test_native has cognitive complexity 206 (threshold 15). Drivers by points: if/else 114 (240 pts), boolean chains 38, match/switch 11 (33 pts), loops 11 (nesting depth added 148). 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. This shape REPEATS in the file: 2 other methods here (DocumentCore::hit_test_native::collect_runs, DocumentCore::hit_test_native::collect_body_inline_image_hits) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e662a89f94dbabad74ebec778e812616dc2e20e4c2b08f875a997d797bbcd6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_tokenize_paragraph_with_regenerated_space_metric (cognitive 205): rhwp::renderer::composer::line_breaking::try_tokenize_paragraph_with_regenerated_space_metric has cognitive complexity 205 (threshold 15). Drivers by points: if/else 61 (167 pts), loops 6 (22 pts), boolean chains 16 (nesting depth added 122). 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9662e08b595dc701e5696b244c8443929f3bda5a13cd77f5ae9e8495f3eb1b75"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_picture (cognitive 202): rhwp::parser::hwpx::section::parse_picture has cognitive complexity 202 (threshold 15). Drivers by points: match/switch 22 (91 pts), if/else 15 (67 pts), loops 12 (42 pts), boolean chains 2 (nesting depth added 151). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f19f2d9e09b815236d7652515496e8c6c9b96036807d7ae70a0e7a2e778b4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_inline_table_paragraph (cognitive 197): LayoutEngine::layout_inline_table_paragraph has cognitive complexity 197 (threshold 15). Drivers by points: if/else 82 (167 pts), boolean chains 18, loops 6 (9 pts), match/switch 3 (nesting depth added 88). 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"71398becf71376c77e8aa8380bdf7decb568be5e5e090888b206da6a2f70a168"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_note_pr_children (cognitive 193): rhwp::parser::hwpx::section::parse_note_pr_children has cognitive complexity 193 (threshold 15). Drivers by points: if/else 22 (126 pts), match/switch 9 (44 pts), loops 6 (21 pts), boolean chains 2 (nesting depth added 154). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb77b86eee5c5c91d4fcbacfdbe225db9e02f2127cdb5d45674c820376cb76e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::nested_table_mixed_fragment_heights (cognitive 192): LayoutEngine::nested_table_mixed_fragment_heights has cognitive complexity 192 (threshold 15). Drivers by points: if/else 58 (136 pts), boolean chains 33, loops 6 (16 pts), match/switch 2 (7 pts) (nesting depth added 93). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a37d25e538f04bf5b7def7ef1c2236ee8617bccd770277b50fee247d9cc42"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_border_fill (cognitive 189): rhwp::parser::hwpx::header::parse_border_fill has cognitive complexity 189 (threshold 15). Drivers by points: match/switch 14 (69 pts), if/else 15 (68 pts), loops 11 (51 pts), boolean chains 1 (nesting depth added 148). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb4501236911ad6ab8b1f7fd97448d33c2234cbee42d736fcaa5ac412b1a1a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_partial_table_item (cognitive 188): LayoutEngine::layout_partial_table_item has cognitive complexity 188 (threshold 15). Drivers by points: if/else 58 (143 pts), boolean chains 33, match/switch 4 (12 pts) (nesting depth added 93). 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":"src/renderer/layout.rs"},"region":{"startLine":16344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e812c9555da5e067d1a8a09e1155a7a5b3d72a6da18cfcc493b5177965a680"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking (cognitive 185): rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking has cognitive complexity 185 (threshold 15). Drivers by points: if/else 84 (127 pts), boolean chains 49, match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4eb6e542dcd98c9a0720a449934b9d2620b23095394b5e884c83498c95d57"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_layout_paragraph_in_frame_impl (cognitive 184): rhwp::renderer::composer::line_breaking::try_layout_paragraph_in_frame_impl has cognitive complexity 184 (threshold 15). Drivers by points: if/else 57 (136 pts), boolean chains 21, loops 8 (20 pts), match/switch 3 (7 pts) (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d6d26558be68e30a3c5205ba6c1d80ebc7f5393523ae46d5121cdd8c0e132d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::scan_table_fragment (cognitive 181): TypesetEngine::scan_table_fragment has cognitive complexity 181 (threshold 15). Drivers by points: if/else 78 (136 pts), boolean chains 45 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ec72752041dddc00b49eeb2c16850fa697e789e22b4a9dabfa60d4981d724e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::data::scan_chart_values (cognitive 178): rhwp_ooxml_chart::data::scan_chart_values has cognitive complexity 178 (threshold 15). Drivers by points: if/else 38 (160 pts), match/switch 4 (11 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 130). 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/rhwp-ooxml-chart/src/data.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36097e8bc404d0959a3340328299528309579392a60c0ad50573c8d295c58fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::fill_one_interval (cognitive 177): rhwp::renderer::composer::line_breaking::fill_one_interval has cognitive complexity 177 (threshold 15). Drivers by points: if/else 56 (148 pts), boolean chains 13, loops 3 (11 pts), match/switch 2 (5 pts) (nesting depth added 103). 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6b42440d5d1406dd3b9f9f414350082e3916715e4f648d7a7c5cf98a1942a8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::parse_table_html (cognitive 175): DocumentCore::parse_table_html has cognitive complexity 175 (threshold 15). Drivers by points: if/else 59 (125 pts), loops 17 (37 pts), match/switch 3 (9 pts), boolean chains 4 (nesting depth added 92). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"663eebe872ad855ab9abba4f7f76978d5ee270ef960e78bbe1c0d99e7e4ce399"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::advance_row_cut_inner (cognitive 170): LayoutEngine::advance_row_cut_inner has cognitive complexity 170 (threshold 15). Drivers by points: if/else 35 (110 pts), boolean chains 53, match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e019aa861c5467949f2661703024fc7cb1a60135805bc0812617baf572d3f1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::static_svg::normalize_static_svg (cognitive 169): rhwp::renderer::static_svg::normalize_static_svg has cognitive complexity 169 (threshold 15). Drivers by points: if/else 37 (127 pts), loops 8 (26 pts), boolean chains 14, match/switch 1 (2 pts) (nesting depth added 109). Of this number, 157 points are the body\u0027s own statements and 12 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":"src/renderer/static_svg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248b58fe361675d80bbb33ba98335894ae624df6bae857c3a04a879d7d1d054"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::split_table_rows_with_storage (cognitive 168): Paginator::split_table_rows_with_storage has cognitive complexity 168 (threshold 15). Drivers by points: if/else 80 (136 pts), boolean chains 31, loops 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":2677}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8fc198e407d8f74666c25b8c76e255ce0bcf658b9df6f62f885c211ef6a0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_reflow_line_segs_impl (cognitive 168): rhwp::renderer::composer::line_breaking::try_reflow_line_segs_impl has cognitive complexity 168 (threshold 15). Drivers by points: if/else 65 (128 pts), boolean chains 22, loops 7 (14 pts), match/switch 2 (4 pts) (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5899}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc345c4f2fa3707036f7a029c2712ab1fef32791d76631fedf54f7156e10050"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::native_webfonts::prepare (cognitive 165): rhwp::renderer::native_webfonts::prepare has cognitive complexity 165 (threshold 15). Drivers by points: if/else 43 (114 pts), loops 12 (21 pts), match/switch 4 (16 pts), boolean chains 14 (nesting depth added 92). 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":"src/renderer/native_webfonts.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4849d60f0aac670b267fa2d1c8df5b0171a592fbc61bc6cad019704f52b5b41f"}},{"ruleId":"D2","level":"warning","message":{"text":"PaintOp::write_json (cognitive 160): PaintOp::write_json has cognitive complexity 160 (threshold 15). Drivers by points: if/else 75 (145 pts), boolean chains 7, loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"663aa1edcefbec862d914577a08e9eec28878f6a08440d788785af97a378363c"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::draw_text_positioned (cognitive 160): SvgRenderer::draw_text_positioned has cognitive complexity 160 (threshold 15). Drivers by points: if/else 58 (119 pts), loops 10 (24 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187300d71f77ca0580b414d04d3b707625b6f3db97d3a5bcaf739d8197c1fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::image_conv::draw_image_bytes (cognitive 157): rhwp::renderer::skia::image_conv::draw_image_bytes has cognitive complexity 157 (threshold 15). Drivers by points: if/else 77 (121 pts), boolean chains 25, match/switch 6 (9 pts), loops 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_conv.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe59c60643d5548109a64323e1e25c1b54c5c9f6192ad00a3f21f04135ee6c59"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_text_positioned (cognitive 155): WebCanvasRenderer::draw_text_positioned has cognitive complexity 155 (threshold 15). Drivers by points: if/else 43 (120 pts), loops 8 (20 pts), boolean chains 9, match/switch 2 (6 pts) (nesting depth added 93). 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af72b322b241d5a12fb0c05589fdcfca36c51cb36ac81921c99a5bcaa2cbc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::native_borders::plan (cognitive 152): rhwp::parser::pdf::structured_lowering::native_borders::plan has cognitive complexity 152 (threshold 15). Drivers by points: if/else 44 (105 pts), loops 13 (26 pts), boolean chains 11, match/switch 4 (10 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering/native_borders.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82eda3c36ca602e7b417743ce59d7390c71c1e8678a3d861704166c88f390c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_paragraph_body (cognitive 150): rhwp::parser::hwpx::section::parse_paragraph_body has cognitive complexity 150 (threshold 15). Drivers by points: if/else 42 (112 pts), loops 7 (15 pts), match/switch 6 (14 pts), boolean chains 9 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad943efa9609c7334442f83ef2601bc4b362a73072d068cdcd9d8db93af4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan (cognitive 148): rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan has cognitive complexity 148 (threshold 15). Drivers by points: if/else 58 (112 pts), boolean chains 20, loops 4 (14 pts), match/switch 1 (2 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d26fec7767f2f9f373158e1fe08c42326b3fd948b158cf3ee4255d7a0a3c076"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::recognition::recognize_page (cognitive 144): rhwp::parser::pdf::recognition::recognize_page has cognitive complexity 144 (threshold 15). Drivers by points: if/else 34 (91 pts), loops 20 (45 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 83). 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b67270a6b11dd863e1d7bb5e26ec30406cd78d9f6fbf6dbe01ee892e19cc83a"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::render_para_border_groups (cognitive 142): LayoutEngine::render_para_border_groups has cognitive complexity 142 (threshold 15). Drivers by points: if/else 36 (106 pts), loops 9 (22 pts), boolean chains 14 (nesting depth added 83). 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":"src/renderer/layout.rs"},"region":{"startLine":7461}}}],"partialFingerprints":{"codehealthFindingId/v1":"894bfc527925c95d759b2a91551f1096dcd7f99ba1965ea23530d787e27e059e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage (cognitive 142): rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage has cognitive complexity 142 (threshold 15). Drivers by points: if/else 36 (116 pts), loops 8 (18 pts), boolean chains 8 (nesting depth added 90). 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":"src/renderer/render_normalization/stored_word_tail.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7bf1c726ac4d494bb05a059b2290ea5c62e802884a3e59cf4953c4b728e007"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::place_paragraph_flow_with_storage (cognitive 141): TypesetEngine::place_paragraph_flow_with_storage has cognitive complexity 141 (threshold 15). Drivers by points: if/else 37 (107 pts), boolean chains 23, loops 2 (9 pts), match/switch 1 (2 pts) (nesting depth added 78). 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":"src/renderer/typeset/section/flow.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5b6e798561d2c2c8e24418bffe3c2d1b55f0f023c2cff6e9a50cef21c170ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage (cognitive 141): rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage has cognitive complexity 141 (threshold 15). Drivers by points: if/else 35 (81 pts), loops 20 (37 pts), boolean chains 23 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c88da4c91d261670426d7a1eb58cde79e87d22f50b68153087b6cb978967e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare (cognitive 140): rhwp::renderer::typeset::controls::stored_tac::prepare has cognitive complexity 140 (threshold 15). Drivers by points: if/else 41 (104 pts), boolean chains 31, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 66). 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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff53b2611d6ff0d0ddcf0b253f781a6e5b703a16e9e70a51eef037122f3d0f34"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::insert_footnote_native (cognitive 137): DocumentCore::insert_footnote_native has cognitive complexity 137 (threshold 15). Drivers by points: loops 18 (65 pts), if/else 15 (61 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 97). 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":"src/document_core/commands/object_ops/note.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"726952329aae9f4db9336a716b5e4c79ddae8bda5624645caec96ac1ba2bad47"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-mouse.onMouseMove (cognitive 137): input-handler-mouse.onMouseMove has cognitive complexity 137 (threshold 15). Drivers by points: if/else 52 (95 pts), boolean chains 23, error handling 4 (19 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceebcf7359c3a044bbeb0768c789d7abf3df167cbeec716dbf10d8ab344dea7b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_char_shape (cognitive 135): rhwp::parser::hwpx::header::parse_char_shape has cognitive complexity 135 (threshold 15). Drivers by points: match/switch 18 (76 pts), loops 11 (48 pts), if/else 3 (11 pts) (nesting depth added 103). 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":"src/parser/hwpx/header.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706ea2d87dca1f8bab990ea5151ac8287860d6c98532beb9438912b8a0e1364"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::body_text::try_serialize_para_text_with_slots (cognitive 134): rhwp::serializer::body_text::try_serialize_para_text_with_slots has cognitive complexity 134 (threshold 15). Drivers by points: if/else 37 (83 pts), loops 19 (38 pts), boolean chains 9, match/switch 2 (4 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/body_text.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"51573ae1789730b8970b222b8af75171b25411febafb5eed77dfc1b7ea72bc90"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_bars (cognitive 133): rhwp_ooxml_chart::renderer::render_bars has cognitive complexity 133 (threshold 15). Drivers by points: if/else 40 (102 pts), loops 5 (16 pts), match/switch 2 (12 pts), boolean chains 3 (nesting depth added 83). 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1354828e046b16fd34d0ec6ae0c9191adb4dd3964c9ab7dd06a0941a3d8a37"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::resolve_row_heights_with_common_fit (cognitive 132): LayoutEngine::resolve_row_heights_with_common_fit has cognitive complexity 132 (threshold 15). Drivers by points: if/else 49 (98 pts), boolean chains 27, loops 7 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9bf80933e91c1a7d677c52cf80729d596ff42629ec9e5c28da51cca5768ee"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::detect_ruled_tables (cognitive 132): rhwp::parser::pdf::table_detection::detect_ruled_tables has cognitive complexity 132 (threshold 15). Drivers by points: if/else 30 (76 pts), loops 23 (37 pts), boolean chains 10, match/switch 5 (9 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cff5230f44cb6763af74e41b89694149f8f561df050177a8046e7d4149d28a8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_embedded_table (cognitive 130): LayoutEngine::layout_embedded_table has cognitive complexity 130 (threshold 15). Drivers by points: if/else 34 (85 pts), match/switch 8 (23 pts), loops 7 (16 pts), boolean chains 6 (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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dd27e0d400919d8e94a7d3231ca4528ebae55fc5d7f83de6b6f1b4fbea065b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::inline_flow::plan_with_storage (cognitive 127): rhwp::renderer::inline_flow::plan_with_storage has cognitive complexity 127 (threshold 15). Drivers by points: if/else 38 (88 pts), boolean chains 15, match/switch 5 (15 pts), loops 6 (9 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08e216c170199f0a65de27979720e850b2fdbfd13f9aa49dffe0b2d5fd23e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::native_saved_reset_cut_trailing_trim (cognitive 126): LayoutEngine::native_saved_reset_cut_trailing_trim has cognitive complexity 126 (threshold 15). Drivers by points: if/else 41 (106 pts), boolean chains 20 (nesting depth added 65). 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19783}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fe6bbdc6afabc0a7d04ff5b6c988be4b41cddc94d1be9e1498abd025c4f8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::mixed_nested_split_from_cut (cognitive 126): LayoutEngine::mixed_nested_split_from_cut has cognitive complexity 126 (threshold 15). Drivers by points: if/else 58 (83 pts), boolean chains 30, loops 4 (9 pts), match/switch 3 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25962}}}],"partialFingerprints":{"codehealthFindingId/v1":"52488dbc7a624929e51bf60a8dcf1fb44942592470ea7abc8a4fb2bc24866d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::paginate_text_lines_with_storage (cognitive 125): Paginator::paginate_text_lines_with_storage has cognitive complexity 125 (threshold 15). Drivers by points: if/else 42 (110 pts), boolean chains 8, loops 2 (7 pts) (nesting depth added 73). 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6fe8a773113d3c7a786ed4220f60d6ce01c4d037388d1f87e77fd89f203324"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextRun (cognitive 125): CanvasKitLayerRenderer.renderTextRun has cognitive complexity 125 (threshold 15). Drivers by points: if/else 65 (131 pts), loops 16 (34 pts), boolean chains 33, ternaries 16 (26 pts) (nesting depth added 94). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderTextRun::drawPass) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dc059401098df67a161f056e83f2f4b178621f3f52e1dbf12f0a877b05151c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::compute_render_normalized_with_storage (cognitive 124): DocumentCore::compute_render_normalized_with_storage has cognitive complexity 124 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 13 (36 pts), boolean chains 19, match/switch 3 (7 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7650d6f141f1542abf404c8088269c67937a647ee880849acfed91f033a1296e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape_switch (cognitive 123): rhwp::parser::hwpx::header::parse_para_shape_switch has cognitive complexity 123 (threshold 15). Drivers by points: if/else 27 (63 pts), match/switch 10 (43 pts), loops 3 (11 pts), boolean chains 6 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cb1535ddf0f5c0ff762c76512d8bb2a06f92b698b34f925806acc6db1e75fa"}},{"ruleId":"D2","level":"warning","message":{"text":"TableBuilder::build_inner (cognitive 122): TableBuilder::build_inner has cognitive complexity 122 (threshold 15). Drivers by points: if/else 37 (76 pts), loops 13 (28 pts), match/switch 3 (12 pts), boolean chains 6 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af715fe3a73e2142c56fbf18d84e2ea4c306b0db94f407945ffa58c5d680fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::dump_page_items (cognitive 120): DocumentCore::dump_page_items has cognitive complexity 120 (threshold 15). Drivers by points: if/else 26 (90 pts), match/switch 3 (15 pts), loops 5 (14 pts), boolean chains 1 (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":7542}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a48c03ccdc1d8b5966b8146101c95d11fc248a973622cf159b7c5113a3d691"}},{"ruleId":"D2","level":"warning","message":{"text":"Run (cognitive 120): Run has cognitive complexity 120 (threshold 15). Drivers by points: if/else 47 (76 pts), error handling 7 (20 pts), boolean chains 11, ternaries 5 (11 pts), other 2 (nesting depth added 48). Of this number, 118 points are the body\u0027s own statements and 2 belong to 2 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"322602b5ca72e63e7c420d47d474ce9d2c67c19c2266da503e3e2fd93c212c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_edit::plan (cognitive 119): rhwp::document_core::commands::border_paint_edit::plan has cognitive complexity 119 (threshold 15). Drivers by points: if/else 30 (74 pts), boolean chains 24, loops 9 (21 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a91eb870be7e0c1f8f295f302c098f60641caf7aa5ec4685d794b36cdcde1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_hwp3_inner (cognitive 119): rhwp::parser::hwp3::parse_hwp3_inner has cognitive complexity 119 (threshold 15). Drivers by points: if/else 44 (82 pts), loops 12 (20 pts), match/switch 4 (10 pts), boolean chains 7 (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":"src/parser/hwp3/mod.rs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6fc96682bd6f795586b44d02e9f11fa7d2c2d0f7163490243be64a72ffe8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_click_here_and_bookmark_markers (cognitive 118): LayoutEngine::layout_click_here_and_bookmark_markers has cognitive complexity 118 (threshold 15). Drivers by points: if/else 29 (75 pts), boolean chains 18, loops 8 (14 pts), match/switch 2 (11 pts) (nesting depth added 61). 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":10668}}}],"partialFingerprints":{"codehealthFindingId/v1":"08db7cdf4b8f130fa028ac6073d4dd37a399b787ffb7a1b5d8f5969b61d08103"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prepare_endnote_emit (cognitive 118): TypesetEngine::prepare_endnote_emit has cognitive complexity 118 (threshold 15). Drivers by points: if/else 35 (82 pts), boolean chains 35, loops 1 (nesting depth added 47). 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":"src/renderer/typeset/notes/endnotes/prepare.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a779237e57b720ba0010764467c11245c60de1fe89fdd2db6b03f51663fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::validate_structure (cognitive 118): rhwp::document_core::commands::object_ops::chart::validate_structure has cognitive complexity 118 (threshold 15). Drivers by points: if/else 34 (78 pts), loops 7 (17 pts), match/switch 6 (14 pts), boolean chains 9 (nesting depth added 62). 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb9186e58c78df6bc9b3396e17997f9e7974984b60b1cac443de0c196207124"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_table_cell (cognitive 117): rhwp::parser::hwpx::section::parse_table_cell has cognitive complexity 117 (threshold 15). Drivers by points: match/switch 19 (63 pts), loops 13 (46 pts), if/else 4 (8 pts) (nesting depth added 81). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b736e97968bc1cb351b32ff994937b05f3bfa29d827f644e439e2379871e1964"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_reconcile::measure (cognitive 116): rhwp::renderer::typeset::controls::tac_reconcile::measure has cognitive complexity 116 (threshold 15). Drivers by points: if/else 47 (82 pts), boolean chains 23, match/switch 3 (6 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":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3083fff148b837be06f66487791016d50ae9e6719b8d838d575536837972a38"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::compute_cell_line_ranges (cognitive 115): LayoutEngine::compute_cell_line_ranges has cognitive complexity 115 (threshold 15). Drivers by points: if/else 41 (96 pts), boolean chains 13, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12025}}}],"partialFingerprints":{"codehealthFindingId/v1":"533695383b44f3e9ddf0a6c6102f32caf6acd2b01733b6c2d083d83bc9afa02b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_columns (cognitive 111): LayoutEngine::build_columns has cognitive complexity 111 (threshold 15). Drivers by points: if/else 36 (72 pts), match/switch 9 (26 pts), boolean chains 12, loops 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":6724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163d057e48e5c50564a8048b1f8468ebb5eb9cd27b64fd1b1d70bffbfaee7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_field_parameters (cognitive 111): rhwp::parser::hwpx::section::parse_field_parameters has cognitive complexity 111 (threshold 15). Drivers by points: if/else 26 (86 pts), loops 7 (20 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6346}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a258b5b8dbcdfc00e3c595fec70cce1c29016de626463ffdd63621079ff126"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.parseStaticSvgFragmentLayers (cognitive 111): static-svg-path-layers.parseStaticSvgFragmentLayers has cognitive complexity 111 (threshold 15). Drivers by points: if/else 30 (69 pts), ternaries 9 (27 pts), boolean chains 10, loops 3 (5 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d416c5c680e2f1f0162c08969f971ef7de840c847b375aa4294bcadf99dc7ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native (cognitive 109): DocumentCore::get_selection_rects_for_target_native has cognitive complexity 109 (threshold 15). Drivers by points: if/else 84 (174 pts), boolean chains 25, loops 9 (17 pts), match/switch 9 (13 pts) (nesting depth added 102). 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53688e55822e1357677271b6133927b7f7dd37611b5d48989bf0fa1cb16b9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPaintGraphPayload::has_colrv1_supported_graph_contract (cognitive 109): ColorPaintGraphPayload::has_colrv1_supported_graph_contract has cognitive complexity 109 (threshold 15). Drivers by points: if/else 32 (83 pts), boolean chains 21, match/switch 2 (3 pts), loops 2 (nesting depth added 52). Of this number, 102 points are the body\u0027s own statements and 7 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":"src/paint/paint_op.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1665fb8d03ea90b4c59d4e99f513294e39e7efe2c596d31800a8f438e16f6d98"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_vertical_cell_text (cognitive 109): LayoutEngine::layout_vertical_cell_text has cognitive complexity 109 (threshold 15). Drivers by points: if/else 37 (71 pts), boolean chains 19, loops 8 (15 pts), match/switch 3 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d7fa170092e84932201c77c317cedb0d04a3bd9a5131d51ef95ebaa30ea508"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerBuilder::build_node (cognitive 108): LayerBuilder::build_node has cognitive complexity 108 (threshold 15). Drivers by points: if/else 41 (91 pts), boolean chains 15, match/switch 2 (nesting depth added 50). 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":"src/paint/builder.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e663fdc5e1887107e043e6a010a2c685322d74fdf59ce5a71bd294ba962c3209"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::prepare_glyph_outline (cognitive 108): rhwp::renderer::skia::glyph_replay::prepare_glyph_outline has cognitive complexity 108 (threshold 15). Drivers by points: if/else 24 (73 pts), loops 5 (16 pts), match/switch 4 (10 pts), boolean chains 9 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5733c0398c8e49d1ddfb0baa3843c96921ac4cddf0b2d94efe33b5e5e5d294b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_header_footer_paragraphs (cognitive 107): LayoutEngine::layout_header_footer_paragraphs has cognitive complexity 107 (threshold 15). Drivers by points: if/else 35 (82 pts), loops 6 (15 pts), boolean chains 9, match/switch 1 (nesting depth added 56). 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":"src/renderer/layout/header_footer_layout.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"30de5830b50b5064dcdede3d1a1c6945f21dae07fa3dd0874bbf6d3a62aa6014"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::find_cursor_in_node (cognitive 106): DocumentCore::get_cursor_rect_native::find_cursor_in_node has cognitive complexity 106 (threshold 15). Drivers by points: if/else 30 (95 pts), boolean chains 10, loops 1 (nesting depth added 65). 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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::collect_text_caret_stops, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c040aae2ea41ae18b91864dd6faf07e5849bc3f09f431aace4549d46a9cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_form_object (cognitive 105): rhwp::parser::hwpx::section::parse_form_object has cognitive complexity 105 (threshold 15). Drivers by points: match/switch 17 (73 pts), loops 9 (28 pts), if/else 2 (4 pts) (nesting depth added 77). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7070}}}],"partialFingerprints":{"codehealthFindingId/v1":"de909bb5a03eb5bebb8768419a00984054805cbf067eaac5b7d0a8eabc2cd458"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::lower (cognitive 105): rhwp::parser::pdf::structured_lowering::lower has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (67 pts), loops 14 (30 pts), match/switch 4 (8 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"47df38ed15602f2ef3bf439b53a8ca8c1c2e6c1bf93fa64440e12c78901bbda7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_v2_export::envelope_node (cognitive 104): rhwp::paint::text_v2_export::envelope_node has cognitive complexity 104 (threshold 15). Drivers by points: if/else 17 (68 pts), loops 7 (23 pts), match/switch 3 (12 pts), boolean chains 1 (nesting depth added 76). 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":"src/paint/text_v2_export.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ef485dfc167f4b96dc654fec3e3170db43d714215cddfeb1ccf73cc5a7abe5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_structure::prepare (cognitive 103): rhwp::document_core::commands::border_paint_structure::prepare has cognitive complexity 103 (threshold 15). Drivers by points: if/else 29 (63 pts), loops 12 (26 pts), boolean chains 10, match/switch 1 (4 pts) (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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddcb86a83b105d2efa903778d3ea9339536d8005b9f328d968ad40277b65c42"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_table (cognitive 103): rhwp::parser::hwpx::section::parse_table has cognitive complexity 103 (threshold 15). Drivers by points: match/switch 18 (70 pts), loops 7 (22 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 74). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18e94b188d41b44878e97d3408ac66076cd56edccb0905ca59844ebdba3b42c"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePuaFontSession.prepare (cognitive 103): NativePuaFontSession.prepare has cognitive complexity 103 (threshold 15). Drivers by points: if/else 22 (62 pts), ternaries 5 (17 pts), loops 6 (14 pts), boolean chains 10 (nesting depth added 60). Of this number, 97 points are the body\u0027s own statements and 6 belong to 3 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95176f45286f383462a42b9cb3ff45c8190582188a5cd7e914052ddcdee64c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_picture_props_inner (cognitive 102): DocumentCore::apply_picture_props_inner has cognitive complexity 102 (threshold 15). Drivers by points: if/else 62 (81 pts), match/switch 8 (20 pts), boolean chains 1 (nesting depth added 31). 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b539fc0450618b96cf8f290c4ee668f04519a191b77ab40b09d2f54918250"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width (cognitive 102): rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width has cognitive complexity 102 (threshold 15). Drivers by points: if/else 28 (70 pts), boolean chains 17, loops 5 (15 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":"src/renderer/composer/cell_line_breaking.inc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb8ecf05ac2df50d66aaa4c02c8dda6fe00ab137cc9c88e5bbbc2cf86119cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"text-variant-selection.selectLayerTextVariantsForLeaf (cognitive 102): text-variant-selection.selectLayerTextVariantsForLeaf has cognitive complexity 102 (threshold 15). Drivers by points: ternaries 11 (40 pts), if/else 10 (36 pts), loops 7 (15 pts), boolean chains 11 (nesting depth added 63). Of this number, 94 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. 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":"rhwp-studio/src/view/canvaskit/text-variant-selection.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b57784e3d4cdf82ac58ec60b1089f3d3de0a34ecd5d08ab22b6532a52f4839"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::typeset_tac_table (cognitive 101): TypesetEngine::typeset_tac_table has cognitive complexity 101 (threshold 15). Drivers by points: if/else 48 (58 pts), boolean chains 41, match/switch 1 (2 pts) (nesting depth added 11). 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":"src/renderer/typeset.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdd87e57ccfe43b471e01eb116ec7b454efdc64acf8d06ec95babaccf221391"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_table_properties_native (cognitive 99): DocumentCore::set_table_properties_native has cognitive complexity 99 (threshold 15). Drivers by points: if/else 49 (66 pts), match/switch 13 (24 pts), boolean chains 7, loops 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f05479888def963eb2308c819dd1216bc4d1aa57ee3283d5baac6fc7f15c06"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_empty_runs_line (cognitive 99): LayoutEngine::layout_empty_runs_line has cognitive complexity 99 (threshold 15). Drivers by points: if/else 22 (84 pts), boolean chains 9, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 66). 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9687663f49f835b40a9135189e0354c50bc4a0aeb7a7356bf9888e37c80f1705"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::compute_table_y_position (cognitive 99): LayoutEngine::compute_table_y_position has cognitive complexity 99 (threshold 15). Drivers by points: if/else 44 (80 pts), boolean chains 14, match/switch 2 (5 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af4298bd883d09f9394ddea43ba9989b634983fd29ca0b1efca62b30e030cba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::parse_hwpx_with_reservation (cognitive 99): rhwp::parser::hwpx::parse_hwpx_with_reservation has cognitive complexity 99 (threshold 15). Drivers by points: if/else 29 (58 pts), loops 12 (25 pts), match/switch 6 (10 pts), boolean chains 6 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2374b362c0eb68570a2fe3e5b7a64dc1cc3f6cac2c8074999b02a9d977346a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::canvas_render::render_box (cognitive 99): rhwp::renderer::equation::canvas_render::render_box has cognitive complexity 99 (threshold 15). Drivers by points: if/else 37 (63 pts), loops 8 (19 pts), match/switch 5 (10 pts), boolean chains 7 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6d8555ebabd80d99fb14178e95c07d16a94bc35193fbf322547173a8e4de12"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::estimate_line_run_widths (cognitive 98): LayoutEngine::estimate_line_run_widths has cognitive complexity 98 (threshold 15). Drivers by points: if/else 31 (74 pts), boolean chains 15, loops 4 (9 pts) (nesting depth added 48). 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d9d30f3bfb4c5b8d0540b97f0b8323c08fa6ae29786593bb1e006ade8998c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::ole_container::parse_ole_container (cognitive 98): rhwp::parser::ole_container::parse_ole_container has cognitive complexity 98 (threshold 15). Drivers by points: if/else 26 (83 pts), boolean chains 9, loops 2 (6 pts) (nesting depth added 61). 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":"src/parser/ole_container.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9072eae0a7d666951980b4ad49cb50e5cd6aaeba9de6e14e0eaf07c5f40bb023"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.fillSnapshotFromWasm (cognitive 98): diff-engine.fillSnapshotFromWasm has cognitive complexity 98 (threshold 15). Drivers by points: error handling 8 (26 pts), ternaries 7 (23 pts), if/else 9 (19 pts), boolean chains 16, loops 11 (14 pts) (nesting depth added 47). Of this number, 95 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c196cd0ff601b59b5fddb1c50a166652d15f974679f59e341b1424b217b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_shape_fill_brush (cognitive 97): rhwp::parser::hwpx::section::parse_shape_fill_brush has cognitive complexity 97 (threshold 15). Drivers by points: match/switch 8 (39 pts), if/else 7 (35 pts), loops 6 (23 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"454fbbbdca72cbd3c957eb3dfd244c56bb52524286118966835c0c171daf266d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage (cognitive 97): rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage has cognitive complexity 97 (threshold 15). Drivers by points: if/else 32 (72 pts), boolean chains 17, match/switch 2 (6 pts), loops 1 (2 pts) (nesting depth added 45). 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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7c40ac8abb6a449a7a37de77242cd16d14a719665016bfc0562a09c122c98b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::compound::plan (cognitive 96): rhwp::parser::pdf::table_paint::compound::plan has cognitive complexity 96 (threshold 15). Drivers by points: if/else 32 (69 pts), loops 8 (22 pts), boolean chains 4, match/switch 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":"src/parser/pdf/table_paint/compound.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c712c0ab30a4f0ed8727946da6c0a1d6f7dfcbc3d97fc069733370092456f19"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::apply_stored_paragraph_boundary_with_storage (cognitive 95): TypesetEngine::apply_stored_paragraph_boundary_with_storage has cognitive complexity 95 (threshold 15). Drivers by points: boolean chains 46, if/else 15 (40 pts), match/switch 3 (9 pts) (nesting depth added 31). 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":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0ae4abb72be66e527683f41529dc4f86bc27ecd5127f1f73c63439d21b847"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::batch::run (cognitive 94): rhwp::cli::batch::run has cognitive complexity 94 (threshold 15). Drivers by points: if/else 30 (69 pts), match/switch 8 (19 pts), loops 3 (4 pts), boolean chains 2 (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":"src/cli/batch/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f08d4a43a2e70fb6bbc0611612c710c4b0e3a60287782e97c034e7c28292076"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::finish_paragraph_anchor_state (cognitive 93): TypesetEngine::finish_paragraph_anchor_state has cognitive complexity 93 (threshold 15). Drivers by points: if/else 26 (66 pts), boolean chains 15, match/switch 3 (12 pts) (nesting depth added 49). 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":"src/renderer/typeset/section/post_flow.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef20bd79b531255eab5358744148767fcd00a9f96e0806e587c570ab769d9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"css-color.parseSupportedCssColor (cognitive 93): css-color.parseSupportedCssColor has cognitive complexity 93 (threshold 15). Drivers by points: if/else 31 (52 pts), ternaries 13 (32 pts), boolean chains 9 (nesting depth added 40). Of this number, 89 points are the body\u0027s own statements and 4 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca6c1fe1d87a9210c8d662404d0b8d3c9f8cb5744a42ec43538631168a06b73"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderEquationBox (cognitive 93): CanvasKitLayerRenderer.renderEquationBox has cognitive complexity 93 (threshold 15). Drivers by points: ternaries 15 (34 pts), boolean chains 31, if/else 11 (22 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 33). Of this number, 90 points are the body\u0027s own statements and 3 belong to 2 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3de59906e1117edd7d72e8987fcbf05751436b4c86e766fbe9739279909d0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calc_visible_content_height_from_ranges_with_offset (cognitive 92): LayoutEngine::calc_visible_content_height_from_ranges_with_offset has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (73 pts), boolean chains 13, loops 2 (3 pts), match/switch 1 (3 pts) (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28583}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb67acc4079f8940d8d7978a63455d6611ce2ed151ffa5c4863402a588f8838"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::pdf::parse_export_pdf_args (cognitive 92): rhwp::cli::outputs::pdf::parse_export_pdf_args has cognitive complexity 92 (threshold 15). Drivers by points: if/else 33 (75 pts), match/switch 3 (9 pts), boolean chains 7, loops 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b231e2e99c7c76133a6f2dc8b180709bd5ab58c5da91f082f7237a244c98123c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::collect_exact_font_slots_from_paragraphs_selected (cognitive 92): rhwp::document_core::queries::rendering::collect_exact_font_slots_from_paragraphs_selected has cognitive complexity 92 (threshold 15). Drivers by points: if/else 14 (59 pts), loops 5 (16 pts), match/switch 4 (13 pts), boolean chains 4 (nesting depth added 65). 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"53912c2cff89eff36cba2234a1b7706e0af80d9ef1945792ff490b1af85a7cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::mini_cfb::build_cfb_with_storage (cognitive 92): rhwp::serializer::mini_cfb::build_cfb_with_storage has cognitive complexity 92 (threshold 15). Drivers by points: if/else 31 (51 pts), loops 22 (34 pts), boolean chains 7 (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":"src/serializer/mini_cfb.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd57677b82fedda643f5715fe02a8db11ce557ff3305be6b7ba7c9c65f23ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_simple_control_char (cognitive 91): rhwp::parser::hwp3::parse_simple_control_char has cognitive complexity 91 (threshold 15). Drivers by points: if/else 29 (64 pts), loops 10 (21 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 48). 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea1572f4b6d872c373d484deb311ee575b2319c569cfadc97aa17c88f64b3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_shape_object (cognitive 91): rhwp::parser::hwpx::section::parse_shape_object has cognitive complexity 91 (threshold 15). Drivers by points: loops 10 (37 pts), match/switch 12 (31 pts), if/else 9 (23 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0307b95bc64b6eaf65737ec8381c413c299598adc10b3b0ca9c83b95b7ae9faf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::query_initial_fit (cognitive 90): TypesetEngine::query_initial_fit has cognitive complexity 90 (threshold 15). Drivers by points: if/else 45 (52 pts), boolean chains 33, loops 1 (3 pts), match/switch 1 (2 pts) (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":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"553acf1098e3aeb7d6d137761960bde87ef29fb0fd6c72e31a2254fe417aa68c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_object_control_char (cognitive 89): rhwp::parser::hwp3::parse_object_control_char has cognitive complexity 89 (threshold 15). Drivers by points: if/else 48 (69 pts), boolean chains 12, loops 2 (6 pts), match/switch 2 (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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f361fdee732e87de3149c6959da268cf27bb0167f8eed87dc162a309463071f1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::parse_html_to_paragraphs_at_depth (cognitive 88): DocumentCore::parse_html_to_paragraphs_at_depth has cognitive complexity 88 (threshold 15). Drivers by points: if/else 40 (77 pts), loops 2 (6 pts), boolean chains 5 (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":"src/document_core/commands/html_import.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf7f4d74f1e0ba678fa9bd973f5bbcb836151068d45b19c8e08d8922b6ae210"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::advance_row_block_cut (cognitive 88): LayoutEngine::advance_row_block_cut has cognitive complexity 88 (threshold 15). Drivers by points: if/else 26 (67 pts), boolean chains 18, loops 2 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23843}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c41a1938c2156c01505c6f2f2b8ad2cc047eed04cda3c26088a79dab2aacb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::svg_render::render_box (cognitive 88): rhwp::renderer::equation::svg_render::render_box has cognitive complexity 88 (threshold 15). Drivers by points: if/else 38 (62 pts), loops 6 (14 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"30036d4f67157e766d86044d4953e2c3196a6e3e8ad0a9d48e910d8112808cca"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::generate_font_style (cognitive 88): rhwp::renderer::svg::generate_font_style has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (74 pts), match/switch 2 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697a7dbc3a51ceb07bbc964a615e7d592562335fb8e121ce583f1baa8644919"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::path_paint::lower (cognitive 87): rhwp::parser::pdf::path_paint::lower has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (50 pts), loops 6 (13 pts), match/switch 6 (13 pts), boolean chains 11 (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":"src/parser/pdf/path_paint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3801f2402efd6913400b231f33c94aeb4042442e756253f4b6c6a08f6ca43c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::drawing_style::resolve (cognitive 86): rhwp_ooxml_chart::drawing_style::resolve has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (68 pts), match/switch 4 (13 pts), boolean chains 3, loops 2 (nesting depth added 57). 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/rhwp-ooxml-chart/src/drawing_style.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6696c7f26c737206c38fa055219e525634bd4dd358c7ea914bbeaed97c620620"}},{"ruleId":"D2","level":"warning","message":{"text":"declared-font-environment.prepareDeclaredFontPrograms (cognitive 86): declared-font-environment.prepareDeclaredFontPrograms has cognitive complexity 86 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 8 (16 pts), ternaries 2 (7 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"664ecfd04d0b2a65fce71fed421e22beba3767e082662a4940aea04b4267fbea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main (cognitive 85): rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (60 pts), loops 9 (12 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-595/probes/inspect_595.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecf0aced5f5581be70d8c25d41ae3107ad53e83c3077e6555b46df229577319"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_object_layout_child (cognitive 85): rhwp::parser::hwpx::section::parse_object_layout_child has cognitive complexity 85 (threshold 15). Drivers by points: if/else 10 (37 pts), match/switch 11 (35 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 57). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036bd5b1e5066ee3295221caa4d20a56298ffe96ef081b600a12c07e107ea7e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTextureController._pump (cognitive 85): NativeTextureController._pump has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (52 pts), boolean chains 23, error handling 3 (5 pts), ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 34). 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f802a8a77f9f6bacd5f6cdad0f9223cdf35b46d2bdc8854668bb9ddf314074"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::exit_control (cognitive 84): DocumentCore::exit_control has cognitive complexity 84 (threshold 15). Drivers by points: if/else 24 (72 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 54). 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfc1a043fedc244c8e0b6b3d4b3e62766b97824ce098661125d37e1eaf49f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object (cognitive 84): rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object has cognitive complexity 84 (threshold 15). Drivers by points: if/else 43 (74 pts), boolean chains 5, match/switch 3 (5 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":"src/parser/hwp3/drawing/shape_mapping.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1efaa089c19c835395b9f5190ff6e33897c19e1544f3651b54c41f47f16aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape_child (cognitive 84): rhwp::parser::hwpx::header::parse_para_shape_child has cognitive complexity 84 (threshold 15). Drivers by points: if/else 18 (45 pts), match/switch 9 (27 pts), loops 6 (12 pts) (nesting depth added 51). 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":"src/parser/hwpx/header.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c32cb162285027e5fb01f34026337bce3c733bc29527ac4b90a4005907b05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::equation_conv::render_box (cognitive 84): rhwp::renderer::skia::equation_conv::render_box has cognitive complexity 84 (threshold 15). Drivers by points: if/else 33 (55 pts), loops 6 (14 pts), match/switch 4 (8 pts), boolean chains 7 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c77bca27dc99082334f0508b20f0f4ef35a11eed574939112e4c47b37e48f96"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_shape_properties_native (cognitive 83): DocumentCore::set_shape_properties_native has cognitive complexity 83 (threshold 15). Drivers by points: if/else 46 (76 pts), match/switch 2 (7 pts) (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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0d6217ff418f0323421d31e029d6f7973c72e21ecac4b57ee2d6fb9cffc2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::mixed_nested_flow_extra_for_height (cognitive 83): LayoutEngine::mixed_nested_flow_extra_for_height has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (59 pts), boolean chains 13, loops 4 (8 pts), match/switch 2 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27215}}}],"partialFingerprints":{"codehealthFindingId/v1":"035e9f1ce03c0a293cafa428991dc4ce6d10c9c6b2ba7460dc8dae1166c97c79"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::replay_endnote_column (cognitive 83): TypesetEngine::replay_endnote_column has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (51 pts), loops 6 (12 pts), boolean chains 11, match/switch 4 (9 pts) (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":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6ed4f9447f79120fae6e824d74e224c357563d771b4f36c9f883ec0702817d"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.exception_kind (cognitive 83): audit.exception_kind has cognitive complexity 83 (threshold 15). Drivers by points: if/else 46 (81 pts), ternaries 1 (2 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":"gym/tools/audit.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff710ace1542e317a09a53d4053277891c7014a678f924e6e6985ca06b231c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::paginate_table_control_with_storage (cognitive 82): Paginator::paginate_table_control_with_storage has cognitive complexity 82 (threshold 15). Drivers by points: if/else 50 (72 pts), boolean chains 6, loops 3 (4 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae2b300a26f8228151eaf184b99c54b8135443d9c83894b306ec835021e2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-594::probes::inspect_pr601::main (cognitive 82): rhwp::mydocs::tech::investigations::issue-594::probes::inspect_pr601::main has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 9 (30 pts), boolean chains 1 (nesting depth added 57). 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":"mydocs/tech/investigations/issue-594/probes/inspect_pr601.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aa9253053cb268dcaa196e859d485c8d50d3b260f62d1d041ed61790aef1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"showHoverCard (cognitive 82): showHoverCard has cognitive complexity 82 (threshold 15). Drivers by points: if/else 36 (67 pts), boolean chains 11, error handling 2 (4 pts) (nesting depth added 33). Of this number, 45 points are the body\u0027s own statements and 37 belong to 6 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":"rhwp-firefox/content-script.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffdc0fc3af35de3553ea6061ef5cc2e3e719ae609d488849ae3d0dc39c021fa"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_shape_props_inner (cognitive 81): DocumentCore::apply_shape_props_inner has cognitive complexity 81 (threshold 15). Drivers by points: if/else 44 (74 pts), match/switch 2 (7 pts) (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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa293c6444e04930c69f23cee136d95a0fe20c111494c8d075da2f05b40cc85"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines (cognitive 81): rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (56 pts), loops 6 (15 pts), boolean chains 10 (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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ccbdd3a49433bbb24435d5593734943850f6cb9ac530f7287b7eb213192e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::resolve_styles_with_environment (cognitive 81): rhwp::renderer::style_resolver::resolve_styles_with_environment has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (54 pts), boolean chains 19, loops 2 (5 pts), match/switch 2 (3 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":"src/renderer/style_resolver.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa9cbdddbe540eef444bacb2baa8524386c711255549d799adb9fa5cd72513b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::execute_plan_steps (cognitive 80): rhwp::cli::protocol::plan::execution::execute_plan_steps has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (50 pts), match/switch 7 (21 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258bccfab7745ce95ef5250e951cc9678f87d762fc57d4aab9cef479f63295c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_common_shape_children (cognitive 80): rhwp::parser::hwpx::section::parse_common_shape_children has cognitive complexity 80 (threshold 15). Drivers by points: match/switch 10 (49 pts), loops 5 (17 pts), if/else 4 (14 pts) (nesting depth added 61). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6947207977b5d447a8d1da2bdfa68df2c6fea81fd81c4c4612746c40b2a8240a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::lowering::lower (cognitive 80): rhwp::parser::pdf::lowering::lower has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (58 pts), boolean chains 11, loops 5 (7 pts), match/switch 2 (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":"src/parser/pdf/lowering.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a2e4bc19117389e466106592f4993646c052ed9de5a1832ff074059e2d5cae"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 80): (anonymous) has cognitive complexity 80 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 12 (23 pts), ternaries 8 (19 pts), boolean chains 12, other 1 (nesting depth added 36). Of this number, 40 points are the body\u0027s own statements and 40 belong to 40 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":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7895691aa661a66a2bb71adbd3e4b13a2c243f024ebbbd200c6567eee5c153c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_block_cell_flow_with_storage (cognitive 79): rhwp::renderer::float_placement::stored_block_cell_flow_with_storage has cognitive complexity 79 (threshold 15). Drivers by points: if/else 21 (56 pts), loops 7 (16 pts), boolean chains 4, match/switch 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":7447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b78e7a7a8ee7fac06c61323fac165ec63e76022f5fe9997974624f61e0bf6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::body (cognitive 78): Reader::body has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (53 pts), loops 5 (10 pts), match/switch 5 (8 pts), boolean chains 7 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b550cf3004e5839b59739123bdb9b477197c9fabcddb05028f0c10c4e01a63"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::absorb_section_tail_with_storage (cognitive 78): TypesetEngine::absorb_section_tail_with_storage has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 22, match/switch 3 (9 pts), loops 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":"src/renderer/typeset/section/tail.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4567e015ba4e0f8c173bb9e202bd4e62288a8c239a2b6dc074d9087e3f8d710"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main (cognitive 78): rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (58 pts), match/switch 5 (11 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 48). 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":"mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13d7248eb076a99f2081f1606ea763c463bc68cbffb4594216bc8f65d9224de"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDocument._complete (cognitive 78): NativeDocument._complete has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 23, ternaries 2 (4 pts), error handling 1 (2 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec15188417b25f42bdb78336c0b4f70cf8da7ed551cfd2efb6a7335a6828c3"}},{"ruleId":"D2","level":"warning","message":{"text":"CharShapeDialog.collectMods (cognitive 78): CharShapeDialog.collectMods has cognitive complexity 78 (threshold 15). Drivers by points: boolean chains 43, if/else 29 (32 pts), loops 2, ternaries 1 (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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"343331bb960b5f32978306e28c6654e51a5048039305acdc7c9be9f759dd818e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::build_canvas_page_layer_tree_shared_with_profile (cognitive 77): DocumentCore::build_canvas_page_layer_tree_shared_with_profile has cognitive complexity 77 (threshold 15). Drivers by points: if/else 32 (64 pts), boolean chains 8, loops 4 (5 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdba678639d62b7fa81114c6bc55f5b1b6af9678ff2b353941d71b369cc8321"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_vertical_textbox_text_with_paras (cognitive 77): LayoutEngine::layout_vertical_textbox_text_with_paras has cognitive complexity 77 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 6 (13 pts), boolean chains 11, match/switch 2 (3 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4714}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92e1b647c6232fca6e6264ae7bd6846138189d898f37a5a9397157d89c8d20"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_bullet_hwpx (cognitive 77): rhwp::parser::hwpx::header::parse_bullet_hwpx has cognitive complexity 77 (threshold 15). Drivers by points: if/else 15 (52 pts), match/switch 4 (16 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ad71197dd74a02fc23d8bd61436d9bbef3b705e5e533b5ebc34e9ef58bfa4e"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextRun::drawPass (cognitive 77): CanvasKitLayerRenderer.renderTextRun::drawPass has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (62 pts), loops 4 (10 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 48). 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderTextRun) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564fcd90ea5dcb40be88279ff9965499cca078c12ed796245beb9a5cbedc852"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.imageForOp (cognitive 77): CanvasKitLayerRenderer.imageForOp has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (37 pts), ternaries 15 (26 pts), boolean chains 9, error handling 3 (5 pts) (nesting depth added 23). Of this number, 53 points are the body\u0027s own statements and 24 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5901}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a657954ddbdc47bcb42fab40ecd3cda50b0e3a5d6eaeb2097e474a80f93fe8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Proof::add (cognitive 76): Proof::add has cognitive complexity 76 (threshold 15). Drivers by points: if/else 27 (66 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e171335d202c5c45922488f913ec6ad5e2769e0d726ccea1e051f39ab1c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_pages_for_paragraph (cognitive 76): DocumentCore::find_pages_for_paragraph has cognitive complexity 76 (threshold 15). Drivers by points: if/else 11 (47 pts), loops 6 (22 pts), match/switch 1 (6 pts), boolean chains 1 (nesting depth added 57). 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e702bb262b91c786ea4e6ffd71309fc08d5cd7b97707a9c40fce31bcbf69c050"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::split_cell_into (cognitive 76): Table::split_cell_into has cognitive complexity 76 (threshold 15). Drivers by points: if/else 37 (56 pts), boolean chains 13, loops 6 (7 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":"src/model/table.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c65c2d09c69f01c4e7e77691f5ce9b51495a211f8965ffadb46ec19cebbd83"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::add_footnote_superscripts (cognitive 76): LayoutEngine::add_footnote_superscripts has cognitive complexity 76 (threshold 15). Drivers by points: if/else 16 (59 pts), loops 5 (13 pts), boolean chains 2, match/switch 1 (2 pts) (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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b298acf909a891047a0c623862ed34eb676ec4b7e11045054fd8c628e52a9127"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_header::svg::parse_header (cognitive 76): rhwp::renderer::image_header::svg::parse_header has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (52 pts), boolean chains 13, match/switch 2 (7 pts), loops 2 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_header/svg.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff050b7af08d7df1b87d463f64f9eab5b77acc892fb8c92bf49f6a840c0e262"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::render_image_node_with_sampling (cognitive 75): SvgRenderer::render_image_node_with_sampling has cognitive complexity 75 (threshold 15). Drivers by points: if/else 38 (47 pts), match/switch 11 (20 pts), boolean chains 8 (nesting depth added 18). 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":"src/renderer/svg.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9f850681392e6ebfc0c16cd176a189aabe470b612c2e53f712049af92d4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::validate_plan_steps (cognitive 75): rhwp::cli::protocol::plan::execution::validate_plan_steps has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 9 (25 pts), loops 4 (7 pts), boolean chains 1 (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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f7dc8231bf13df5c662920125400588d1be06043a9801d8985549d0f9ecc70"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage (cognitive 75): rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (62 pts), boolean chains 7, loops 2 (4 pts), 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac64c627402933bfaf8371cdc74a5cd3f644813fcf6954f30bd412f0beaa05c"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.renderPictureObjectSelection (cognitive 75): input-handler-picture.renderPictureObjectSelection has cognitive complexity 75 (threshold 15). Drivers by points: if/else 16 (50 pts), error handling 4 (13 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (nesting depth added 45). 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"781b3ccec0f2131d20e0aa7d7f1d7be9a2457b8c42777f2cf49a723dd972ee40"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::raster::parse_export_png_args (cognitive 74): rhwp::cli::outputs::raster::parse_export_png_args has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 7 (25 pts), boolean chains 2, loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1c37f13661fa3ef9e24a644e0c1399143cc870942f0e72fe9686305ff445e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::trust::gate::cmd_gate (cognitive 74): rhwp::cli::protocol::trust::gate::cmd_gate has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 11 (25 pts), boolean chains 3, loops 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":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f8e051b3ac23b612911ca92d58ba896077c975d16a4eb26d2fcbad42f8aa29"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::process_controls_with_storage (cognitive 73): Paginator::process_controls_with_storage has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (55 pts), loops 3 (10 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"775a533a60d970a6d1fb15bbbb96a346b321298ac961efc83848d58c5babc411"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::validation::references::validate (cognitive 73): rhwp::document_core::commands::paragraph_block::validation::references::validate has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (49 pts), loops 11 (21 pts), match/switch 2 (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":"src/document_core/commands/paragraph_block/validation/references.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ea8bbbbd4e696fd727ba4315e04c3a9df997c4046b0322e52562d3b670332c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive (cognitive 73): rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive has cognitive complexity 73 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 10 (20 pts), boolean chains 11 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection/cell_regions/local_axes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984bfd1bef8e9950be3a8f022420c08435fa76718176035adda1ec5f65c11f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::renderer::prepare_native_glyph_run (cognitive 73): rhwp::renderer::skia::renderer::prepare_native_glyph_run has cognitive complexity 73 (threshold 15). Drivers by points: if/else 37 (51 pts), boolean chains 16, match/switch 2 (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":"src/renderer/skia/renderer.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c48647eb5c37edd123aeca53ab26166b86beeb063047f517a4c779fd282831b"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.parse_map (cognitive 73): _gen_pack.parse_map has cognitive complexity 73 (threshold 15). Drivers by points: if/else 15 (50 pts), loops 4 (13 pts), boolean chains 6, ternaries 1 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-knowledge-map/references/_gen_pack.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d40dea7729569fdca2764a3b54d15eecc70dcc97c473c3488fd5677aa057b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::insert_text_at_caret (cognitive 72): Paragraph::insert_text_at_caret has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (42 pts), boolean chains 21, loops 9 (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":"src/model/paragraph.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d93b3c43397fdc3a34ebf37a36044f6bf91b34adb6b53329078439280f2cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::reconcile (cognitive 72): Ledger::reconcile has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 11 (22 pts), boolean chains 7 (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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16a0c2492587ee5d5159749a7f31479335952faa1a1c8646c9e7aead22670ee"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_tac_picture_item (cognitive 72): LayoutEngine::layout_tac_picture_item has cognitive complexity 72 (threshold 15). Drivers by points: if/else 34 (54 pts), boolean chains 12, match/switch 4 (6 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":"src/renderer/layout/tac_picture_item.inc.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db15e117ed99e15e51fbd62f13c3518e602e722dd55f4ec680ff1d5dd49e74f"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.onInput (cognitive 72): input-handler-text.onInput has cognitive complexity 72 (threshold 15). Drivers by points: if/else 32 (52 pts), boolean chains 10, error handling 4 (9 pts), ternaries 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065c86155eee6176ecb5e60d4d77b10bbfab1745a6ca68f9fbcd4be05e39bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::reflow_linesegs_on_demand (cognitive 71): DocumentCore::reflow_linesegs_on_demand has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 6 (22 pts), match/switch 1 (5 pts) (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":"src/document_core/commands/document.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60c0960b5a1e51986d3a2a9b34dd48bcdfac37058ffd9977ce7226145bfbe3b"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightMeasurer::measure_paragraph_with_storage (cognitive 71): HeightMeasurer::measure_paragraph_with_storage has cognitive complexity 71 (threshold 15). Drivers by points: if/else 33 (60 pts), boolean chains 7, match/switch 2 (4 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":"src/renderer/height_measurer.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f7c7c78d8b1c3cf5b0010bc9cc6ab8d816f6a1cd7a5ad7212e13ffd81f045d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_inline_flow_plan (cognitive 71): LayoutEngine::layout_inline_flow_plan has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (57 pts), boolean chains 5, match/switch 2 (5 pts), loops 3 (4 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"0051198578a930849b475af9b591367d44b4fcec2f61ea282c2ea38b8fa4b436"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::register_body_footnote (cognitive 71): TypesetEngine::register_body_footnote has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 23, match/switch 2 (5 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":"src/renderer/typeset/notes/footnotes/body.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5cb65e3d5482021a8c80d433619a3cae8075c98d1d0b00eeb23101b4bc0a97"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_watermark (cognitive 71): rhwp::cli::queries::security_inspection::inspect_watermark has cognitive complexity 71 (threshold 15). Drivers by points: loops 10 (33 pts), if/else 12 (30 pts), match/switch 4 (8 pts) (nesting depth added 45). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (rhwp::cli::queries::security_inspection::inspect_unicode) 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d56e6597f76016ceb7968b4d470f243978e56bc8cd53bb3a275101fed416d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_unicode (cognitive 71): rhwp::cli::queries::security_inspection::inspect_unicode has cognitive complexity 71 (threshold 15). Drivers by points: loops 10 (33 pts), if/else 12 (30 pts), match/switch 4 (8 pts) (nesting depth added 45). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (rhwp::cli::queries::security_inspection::inspect_watermark) 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2eb215f355ea2df2b00fab9eac781c8e424b0b2cd2a3a832a7ff6875825206"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::plan_edits (cognitive 71): rhwp::document_core::commands::object_ops::chart::plan_edits has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 5 (13 pts), boolean chains 1 (nesting depth added 44). 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f68f7211236c500d2680e7a2e0a2d0bc3c02146118c54ccba86ce8f5371f6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::cursor_rect::find_cursor_in_cell_node (cognitive 71): rhwp::document_core::queries::cursor_rect::find_cursor_in_cell_node has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (60 pts), boolean chains 7, loops 2 (4 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed72fd967d0191fc3d3344c444ef8ca97df725f7d99dc59a43a06462edd0f85"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::parse_para_text (cognitive 71): rhwp::parser::body_text::parse_para_text has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 3 (7 pts), match/switch 2 (7 pts), boolean chains 4 (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":"src/parser/body_text.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a59a1bb687d658ab98da95c01ca07227f8d75e6dab10e6e457f8ead899beac"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitGlyphRunFontCache.replayStatus (cognitive 71): CanvasKitGlyphRunFontCache.replayStatus has cognitive complexity 71 (threshold 15). Drivers by points: if/else 39, boolean chains 30, ternaries 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"77acd7f5f3b8bdfcbcf57ad1416f7577d9420aaab1ffabe074a6ab5d802f232f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_page_control_layout_native::collect_controls (cognitive 70): DocumentCore::get_page_control_layout_native::collect_controls has cognitive complexity 70 (threshold 15). Drivers by points: match/switch 16 (34 pts), if/else 18 (31 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 32). 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46a82788930549375b9b13f569803dfcb02955d94a7ce95c60d49cfbe6d31ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::query_tail_fit (cognitive 70): TypesetEngine::query_tail_fit has cognitive complexity 70 (threshold 15). Drivers by points: boolean chains 60, if/else 9 (10 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":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"016c38044c865a525353a24970924e9ef8ef5ef00163c2359d876bfa659b68fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::table_calc::tokenizer::tokenize (cognitive 70): rhwp::document_core::table_calc::tokenizer::tokenize has cognitive complexity 70 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 13, match/switch 3 (12 pts), loops 3 (7 pts) (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":"src/document_core/table_calc/tokenizer.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22e3d4b88879cd313c4e711dee3f05bca335ce6e683c7b5aefe85a6e9ec4484"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-574::probes::inspect_574::main (cognitive 70): rhwp::mydocs::tech::investigations::issue-574::probes::inspect_574::main has cognitive complexity 70 (threshold 15). Drivers by points: loops 10 (36 pts), if/else 8 (32 pts), match/switch 1 (2 pts) (nesting depth added 51). 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":"mydocs/tech/investigations/issue-574/probes/inspect_574.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcf29e760296b5c0020c865afce2ec743940b519e3b88ffbbf289d7334373bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage (cognitive 70): rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/reflow_block_cell.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7bff36e369df017ee3ca9f764776caf790a2269bc25b8121ff6a8d3a07ec2e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame (cognitive 70): rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (51 pts), boolean chains 11, loops 3 (8 pts) (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d67518979f83d2cd67f8d28f8398560a7cfc9a8ba5f382d84f2f1de7beca1df"}},{"ruleId":"D2","level":"warning","message":{"text":"schema-validate.validateToolInput (cognitive 70): schema-validate.validateToolInput has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (52 pts), boolean chains 13, loops 3, match/switch 1 (2 pts) (nesting depth added 34). Of this number, 68 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":"rhwp-studio/src/ai/tools/schema-validate.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc9acf2eb4855b65525784368f83ea39f21849f398ac502f000bf4817f0572d"}},{"ruleId":"D2","level":"warning","message":{"text":"host-font-requests.collectHostFontRequests (cognitive 70): host-font-requests.collectHostFontRequests has cognitive complexity 70 (threshold 15). Drivers by points: if/else 13 (47 pts), loops 5 (14 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 46). Of this number, 67 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1181a63ee5250b51c22224d4a56a898b70336806557a3a4ff99ca8dab278d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::equalize_cell_block (cognitive 69): Table::equalize_cell_block has cognitive complexity 69 (threshold 15). Drivers by points: if/else 31 (52 pts), loops 8 (10 pts), boolean chains 7 (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":"src/model/table_equal_size.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb0bb73779ec90fccbff30e9ab047e97ff7303d003c4f1b4fae0a921c2f2699"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::conversion::convert_hwp (cognitive 69): rhwp::cli::commands::conversion::convert_hwp has cognitive complexity 69 (threshold 15). Drivers by points: if/else 17 (50 pts), match/switch 9 (17 pts), boolean chains 2 (nesting depth added 41). 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":"src/cli/commands/conversion.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2171903f2df18831ac56891ad37f2d0495cf9a7c24ff3d12107d377f341cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::digest::digest_document (cognitive 69): rhwp::cli::queries::digest::digest_document has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 9 (23 pts), loops 7 (14 pts), boolean chains 2 (nesting depth added 35). Of this number, 59 points are the body\u0027s own statements and 10 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":"src/cli/queries/digest.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dfb5a50ab1ed7c3812bbb712c4131c57f9319bb86ead6f49e831ab5a48d7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-672::probes::inspect_task672::main (cognitive 69): rhwp::mydocs::tech::investigations::issue-672::probes::inspect_task672::main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 14 (52 pts), loops 6 (13 pts), boolean chains 2, match/switch 1 (2 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":"mydocs/tech/investigations/issue-672/probes/inspect_task672.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f3f591c0e44da3493613768fe884d54824330ead4ee7df076594973c9748cb"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStaticControlText (cognitive 69): CanvasKitLayerRenderer.drawStaticControlText has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 12 (31 pts), if/else 9 (19 pts), boolean chains 15, error handling 1 (3 pts), loops 1 (nesting depth added 31). Of this number, 68 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3483a58baeb97f50d4c9afa6bf577a41203dc2ddadc89845392ff5d55d6cc2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native (cognitive 68): DocumentCore::get_cursor_rect_native has cognitive complexity 68 (threshold 15). Drivers by points: if/else 116 (282 pts), boolean chains 45, loops 13 (20 pts), match/switch 3 (5 pts) (nesting depth added 175). 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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::collect_text_caret_stops, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"36475069cf44281a3320e6a46eb29ef575ee19627c647e101a25efdaee235063"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_column_shapes_pass (cognitive 68): LayoutEngine::layout_column_shapes_pass has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (50 pts), match/switch 4 (9 pts), boolean chains 7, loops 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":17003}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efa223a5671ec703861294bdf68c0cd6c56151038e0537e35606fce78869585"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_set_cell (cognitive 68): rhwp::cli::commands::edit::cells::edit_set_cell has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (38 pts), match/switch 12 (25 pts), loops 2 (3 pts), boolean chains 2 (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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70b3015dd15555deb3c705a10903bd44b3eae1dfc0d3f1ac81da3241bdffcad"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::vector::parse_export_svg_args (cognitive 68): rhwp::cli::outputs::vector::parse_export_svg_args has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (39 pts), match/switch 7 (23 pts), boolean chains 5, loops 1 (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":"src/cli/outputs/vector.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d29e0429fce437db7cf4e01347659984737c60df758817713ee918c715a008"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::extract::extract (cognitive 68): rhwp::parser::pdf::extract::extract has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 11 (14 pts), boolean chains 9 (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":"src/parser/pdf/extract.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb623a67fdda01bb98a0ed03837a0a97acea1e0613bb42f566cfc6f96b905ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::edges (cognitive 68): rhwp::parser::pdf::table_detection::edges has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 3 (9 pts), boolean chains 7, match/switch 2 (6 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8a702ed5affaebeba35b2bb4cb5fc9c834fc9b280dcb16df61291ce3ba48c9"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.showHoverCard (cognitive 68): content-script.showHoverCard has cognitive complexity 68 (threshold 15). Drivers by points: if/else 34 (58 pts), boolean chains 10 (nesting depth added 24). Of this number, 42 points are the body\u0027s own statements and 26 belong to 2 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":"rhwp-chrome/content-script.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ed53560ac1567396c35d155f2a66565d91066e0af4063dc14fe523cfff7664"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::paginate_with_forced_breaks_with_storage (cognitive 67): Paginator::paginate_with_forced_breaks_with_storage has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (55 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"91933870b8613526b40b8c03892163713ad282672b94ebe1150dfa10f273605e"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::update_style_shapes (cognitive 67): HwpDocument::update_style_shapes has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 8 (20 pts), boolean chains 4, match/switch 1 (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":"src/wasm_api.rs"},"region":{"startLine":8113}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cf08f87cb235426830e498baed1b8989e8bc23cbe45f77a4ef8c176691a167"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::select (cognitive 67): rhwp::parser::pdf::table_detection::cell_regions::select has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (50 pts), loops 8 (13 pts), boolean chains 3, match/switch 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":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4238d0de1b11053602ada4127bdde2dbbb33b1521f800d36c2d79d3423c35f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::direct_pdf_validation::validate_op (cognitive 67): rhwp::renderer::pdf::direct_pdf_validation::validate_op has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 18, 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":"src/renderer/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47a7ed85434a7ad16603b28c17130db37c8bd79f45fecdf3b85d025e5afe88b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::empty_float::prepare (cognitive 67): rhwp::renderer::typeset::controls::empty_float::prepare has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 35, if/else 31, match/switch 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":"src/renderer/typeset/controls/empty_float.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5af38a151d00fbba7d7e24b69e519ce7e017009097cde9f241ecccdb820820"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.isStaticSvgStyleSupported (cognitive 67): static-svg-path-layers.isStaticSvgStyleSupported has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 20, loops 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c93e6f640f9d4ae0ff29f2ff56023e21ce30b16ca6dacbe68372c755e231040"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartScales::new (cognitive 66): ChartScales::new has cognitive complexity 66 (threshold 15). Drivers by points: if/else 33 (61 pts), boolean chains 5 (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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"66845d8d127fc0b401c9caefed4672a11dd8f8c5726263b5cb2cd9752fa065e7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_cell_properties_native (cognitive 66): DocumentCore::set_cell_properties_native has cognitive complexity 66 (threshold 15). Drivers by points: if/else 39 (52 pts), boolean chains 8, loops 2 (4 pts), 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07721a0abe908287731e97afe092103685ad74f4dc65fe2faf5b1e71651ce71"}},{"ruleId":"D2","level":"warning","message":{"text":"Accounting::operation (cognitive 66): Accounting::operation has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (56 pts), loops 3 (9 pts), match/switch 1 (nesting depth added 43). 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":"src/native_host/render_snapshot.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fd1a86fb664945dbb20eccc52d45a0fc294b6b9ecabbf8a364d61bbc704762"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::read_command (cognitive 66): Tokenizer::read_command has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 8 (13 pts), boolean chains 9, 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":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cce6848c871186ca1b86540a10c4d4613cc787f62ce070577d3acf9b214707"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::render_node (cognitive 66): HtmlRenderer::render_node has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 9 (19 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 34). 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":"src/renderer/html.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce9c6154b0d62deee402dc410069869a5c111a13c8d6d00adbaeb3a924b9aef"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_extents (cognitive 66): rhwp::cli::queries::diagnostics::dump_extents has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 8 (14 pts), loops 6 (12 pts), boolean chains 4 (nesting depth added 32). Of this number, 62 points are the body\u0027s own statements and 4 belong to 3 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"02eab2c69f5b2ba3300c7ce9f9d72ea04ea76d1a1de119bf28e95aecf650ab7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ParaShapeDialog.collectMods (cognitive 66): ParaShapeDialog.collectMods has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (33 pts), boolean chains 29, loops 2, ternaries 2 (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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e77f6a975adf5eeba83b13a5fc8509f8475992ea626b9aa61741f45cd5df7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::op (cognitive 65): Interp::op has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (58 pts), loops 1 (3 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":"src/eps.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"30619bbf233870003b46e1ad68a4a815222341525a75b28cbb51acd483a75a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::table_subtree_blocks_cursor_probe::paras_block (cognitive 65): LayoutEngine::table_subtree_blocks_cursor_probe::paras_block has cognitive complexity 65 (threshold 15). Drivers by points: if/else 11 (51 pts), loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc691a9813f1f23f82486997464e482765c47dc36cea212327f18086471b543"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::conversion::export_hwpx (cognitive 65): rhwp::cli::commands::conversion::export_hwpx has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (48 pts), match/switch 9 (17 pts) (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":"src/cli/commands/conversion.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1c808e39f47153968b37eaab00eadf79d8f873dd8e477e440f7f167e7b5795"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell (cognitive 65): rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell has cognitive complexity 65 (threshold 15). Drivers by points: match/switch 17 (42 pts), if/else 16 (21 pts), boolean chains 1, loops 1 (nesting depth added 30). 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cc590d89571c2efa194ce8d4e5619c5b318ebf676095da3f2688de75d2d0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::check_stored_line_escape (cognitive 65): rhwp::diagnostics::layout_anomaly::check_stored_line_escape has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (56 pts), boolean chains 6, match/switch 1 (2 pts), 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8279eb2362eada4d62752e0a3a53174f2d21ccd4f9292109e628acf1787a7042"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::text_security::scan_deception (cognitive 65): rhwp::document_core::text_security::scan_deception has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (49 pts), boolean chains 8, loops 3 (8 pts) (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":"src/document_core/text_security.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"21576d1edfbacd10c3f8fbb22fd1875928fdc47dd5ebb9ee450d8aea1f8b5414"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage (cognitive 65): rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage has cognitive complexity 65 (threshold 15). Drivers by points: boolean chains 32, if/else 15 (25 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6e77709cc873447a4db18deb58d1630cf4db0c9443b4c8eab819029452061"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage (cognitive 65): rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage has cognitive complexity 65 (threshold 15). Drivers by points: if/else 30 (54 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6faffd81a4daf4eda1c8679e4a5e3067ea6351a5a7635083638c2bfe545efd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::tools::font_metric_gen::parse_cmap (cognitive 65): rhwp::tools::font_metric_gen::parse_cmap has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (50 pts), loops 5 (11 pts), boolean chains 4 (nesting depth added 37). 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":"src/tools/font_metric_gen.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef4ad0aca1b6c6ef69d6a5befbb4d0f1d2608e86225a8da7d0d1eb26565283a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::delete_range_internal (cognitive 64): DocumentCore::delete_range_internal has cognitive complexity 64 (threshold 15). Drivers by points: if/else 30 (53 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915e0648ed9a35988e13618f6e944dbc929e8dd38cd6390ba43e3d46c35d998"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::resolve_column_widths (cognitive 64): LayoutEngine::resolve_column_widths has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (50 pts), loops 8 (11 pts), boolean chains 3 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded12f8c481c4192fbb817bf4b4ff017c80032af023266eded7fe5fe43d302f3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::vector::export_svg (cognitive 64): rhwp::cli::outputs::vector::export_svg has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 10 (20 pts), boolean chains 1, loops 1 (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":"src/cli/outputs/vector.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3891f138149fe2e320f167b984c978808621a6e17ab5fe73553e83ef913f9285"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images (cognitive 64): rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 7 (12 pts), match/switch 2 (9 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":"src/document_core/builders/exam_paper_images.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c197f0b8a95b7a8131f41c61e157b5db2eb774168616c98ede1ad64d1f676999"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_structure::preserves_layer_order (cognitive 64): rhwp::document_core::commands::border_paint_structure::preserves_layer_order has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 6 (15 pts), boolean chains 3, match/switch 1 (2 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96ddfde617f69184bb9c01c78f266ee5b4a1538979c9ba8f61e22dc1b7358ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_edge_borders (cognitive 64): rhwp::renderer::layout::border_rendering::render_edge_borders has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (50 pts), loops 4 (6 pts), match/switch 2 (6 pts), boolean chains 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e809feb9597271f08a8c6aede0b93d0cfb7741585dafd1247f7f8508280dea8e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg_layer::project_debug_overlay::visit (cognitive 64): rhwp::renderer::svg_layer::project_debug_overlay::visit has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (56 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 46). 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":"src/renderer/svg_layer.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bece7fa5e93f079604a90cc44b4db303e37fe9535c7bc90589b23ee237e5c98"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.annotateDiffSectionPages (cognitive 64): diff-engine.annotateDiffSectionPages has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (49 pts), boolean chains 12, loops 3 (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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"749e13e37e214afd547c71d2f649001301694e36ded30d01ac74b3085ed4e9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.handleCtrlKey (cognitive 64): input-handler-keyboard.handleCtrlKey has cognitive complexity 64 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 10, match/switch 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cce57b56049fc9ea7718333e1839a7ee4eb689eada4ddc5097e297282e6bef5"}},{"ruleId":"D2","level":"warning","message":{"text":"Resources::prepare (cognitive 63): Resources::prepare has cognitive complexity 63 (threshold 15). Drivers by points: if/else 10 (39 pts), loops 5 (15 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import/resources.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"222fe54f39163c99488aeac0e2491287a2a44250d4022fcb66e8052489999ea3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::repair_reparsed_split_cell_cache (cognitive 63): DocumentCore::repair_reparsed_split_cell_cache has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 6 (14 pts), boolean chains 6 (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":"src/document_core/commands/document/reparsed_split_cache.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb84e04af7e008ad9e7d59ab525aff0963f6b79c7160bad141b5258a4797ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prepare_paragraph_boundary_with_storage (cognitive 63): TypesetEngine::prepare_paragraph_boundary_with_storage has cognitive complexity 63 (threshold 15). Drivers by points: boolean chains 36, if/else 22 (27 pts) (nesting depth added 5). 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":"src/renderer/typeset/section/entry.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"405b93305ccb6a5f7e21e66938896680a20c3d5943a40ab707699733391fa479"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::tabular_import::csv_to_table (cognitive 63): rhwp::cli::commands::tabular_import::csv_to_table has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 9 (12 pts), loops 3 (7 pts), boolean chains 2 (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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bea207dcc7ef4977dd821c858d9f3bd2e55f84374f0a0cadef14266d4ec53de"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::picture_footnote::get_footnote_paragraphs (cognitive 63): rhwp::renderer::layout::picture_footnote::get_footnote_paragraphs has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (56 pts), match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 44). 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85b2b85897ccac84c806f895a13a07e37788f901d84370b1c3c5b73ac0be148"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes (cognitive 63): rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 8 (25 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"162ee82f1e6cff0c399a74e81222839ca638600b24038d1e050ad4f274642ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"sfnt-face.normalizeFontFaceData (cognitive 63): sfnt-face.normalizeFontFaceData has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 16, loops 7 (9 pts), ternaries 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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca66baae490b2b56700b60f5d5ce2dc791bf038d53fe77d08004dc455855e7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.comparePositions (cognitive 63): CursorState.comparePositions has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 13 (35 pts), if/else 12 (24 pts), boolean chains 2, loops 1 (2 pts) (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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72b59096e709a13532caa2792736cfab252f4590e75caf918a96819c1913333"}},{"ruleId":"D2","level":"warning","message":{"text":"CartesianLayout::new (cognitive 62): CartesianLayout::new has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 29). 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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a720c108b32f858ca5bd60f18a2844d259f34a9d9ebbc7d1ba52bce958b22b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_empty_prefix_row_closing_frame (cognitive 62): LayoutEngine::stored_empty_prefix_row_closing_frame has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 11, loops 4 (9 pts), match/switch 1 (4 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79c27359edec71d1bdbf0118786503693747c64293f50ae31a608356471307"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_height (cognitive 62): LayoutEngine::row_cut_height has cognitive complexity 62 (threshold 15). Drivers by points: if/else 31 (50 pts), boolean chains 8, match/switch 1 (3 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27921}}}],"partialFingerprints":{"codehealthFindingId/v1":"012cd94079f1c22ed7081496988825dc11c218b6b864de62a606b4228f0b7b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::record_stored_fragment_rows (cognitive 62): TypesetEngine::record_stored_fragment_rows has cognitive complexity 62 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 16, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6963015887efa7310e90a71fad300f071d92de987d8aae423d7b4186191d0757"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::insert::edit_insert_table (cognitive 62): rhwp::cli::commands::edit::tables::insert::edit_insert_table has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (32 pts), match/switch 11 (28 pts), boolean chains 1, loops 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":"src/cli/commands/edit/tables/insert.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2829b841b205a2d040067a7f0bfd4c60b0663d223512b6ed6df24e3c373917d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::harness::cmd_harness_status (cognitive 62): rhwp::cli::protocol::harness::cmd_harness_status has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 9 (18 pts), boolean chains 3, loops 1 (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":"src/cli/protocol/harness.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2cacf9a7fb4f113fa805292c9c89819632678a9a1cfc96268511b90082fb88"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::hwpctrl_sets::scan_paragraph (cognitive 62): rhwp::document_core::queries::hwpctrl_sets::scan_paragraph has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 8 (12 pts), boolean chains 4, match/switch 2 (3 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9380172c3d995932abd19f95a0dd1765e3c6c9ae63e2c2b17b49db27e331cf9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::tracked_viewtext::project_paragraph (cognitive 62): rhwp::parser::tracked_viewtext::project_paragraph has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 7 (12 pts), boolean chains 4, match/switch 2 (3 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":"src/parser/tracked_viewtext.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bae670267bdb914a128a8cf77d94aea818532a89854d7f55c3db0eaf415b336"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::equation_line_metrics::try_refresh_rows (cognitive 62): rhwp::renderer::composer::equation_line_metrics::try_refresh_rows has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 22, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ce1c9f1b04a4c71d7e54c4a5d1745c84522676655f5651d15e3288b4f8035"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_shape (cognitive 61): LayoutEngine::layout_shape has cognitive complexity 61 (threshold 15). Drivers by points: if/else 30 (39 pts), boolean chains 12, match/switch 6 (10 pts) (nesting depth added 13). Of this number, 60 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dbf659948d5ff9b9fbefba88a12357cdae40a0e87674d453dc7faff5b30d06"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_container_children (cognitive 61): rhwp::parser::control::shape::parse_container_children has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 5 (12 pts), boolean chains 6, loops 4 (6 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":"src/parser/control/shape.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb0a65129535ee12551dcb59ee0bdea0c3534156c9c65e222c1be3d94bd210b"}},{"ruleId":"D2","level":"warning","message":{"text":"svg-image-header.parseSvgImageHeader (cognitive 61): svg-image-header.parseSvgImageHeader has cognitive complexity 61 (threshold 15). Drivers by points: if/else 29 (52 pts), boolean chains 4, loops 3, error handling 1, ternaries 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d4b377db01acf6cc0cc804038fb176fa18d914959bb3931cf6994809e70527"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareBundledFonts (cognitive 61): CanvasKitLayerRenderer.prepareBundledFonts has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 14, ternaries 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 29). Of this number, 60 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b925db7bfb7cfe9ba9ade3f2a792d562e5aea18770cd3c060ed960f1522de"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::lineage::trace_lineage (cognitive 60): rhwp::cli::protocol::capsule::lineage::trace_lineage has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 6 (16 pts), boolean chains 2, loops 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":"src/cli/protocol/capsule/lineage.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bc2750b5c4ae8ce4dc9aa087e75e5a49f08c494ce6fe8e8a244d5c004db3d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::observed_line_text (cognitive 60): rhwp::parser::pdf::structured_lowering::observed_line_text has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 9, loops 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"982f3c772c79349140eac0b99d034cab9034dba0a17e3ce8c62100c079ac6da3"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.validate_report (cognitive 60): fuzz_corpus.validate_report has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (44 pts), loops 6 (9 pts), boolean chains 7 (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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b42ee7fe6d9b47b4bbe353eed53ba27ca45c6d0d738e9e3d244cac7054e699"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.findPictureAtClick (cognitive 60): input-handler-picture.findPictureAtClick has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 16, loops 3 (5 pts), error handling 2 (3 pts), ternaries 3 (nesting depth added 17). Of this number, 53 points are the body\u0027s own statements and 7 belong to 4 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab86b07778880c7ba23c1bb3e7908084e924022d6c7aeccd83bc76a4c38b2052"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 60): (anonymous) has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 10, error handling 4 (8 pts), match/switch 1 (nesting depth added 29). Most of this is not in the body itself: 15 of the 60 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 261, 239, 352, \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":"rhwp-safari/src/background.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3fce71c09a385d345a2ca218863b28332ada2f5462959c867b7b073c1f038f"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::clone_series (cognitive 59): Planner::clone_series has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (44 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1483de8dd40e6dca10d180886d5c4b62ebe20d3195f0fa6f2091a47e6bb2c1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::parse_inline_content (cognitive 59): DocumentCore::parse_inline_content has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 4 (6 pts), match/switch 1 (5 pts), boolean chains 2 (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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99c91307c9fa3a5083ef4a7997de03fba8a55dc0d36340acba67f78999e128b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::collect_layer_hyperlinks (cognitive 59): DocumentCore::collect_layer_hyperlinks has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (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":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d88442aaa2cb35e7ec9a3636a94a296a3ea966e3a69eb32cac9b0a5d7017447"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::replay::cmd_replay (cognitive 59): rhwp::cli::protocol::capsule::replay::cmd_replay has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 17 (32 pts), if/else 14 (23 pts), boolean chains 3, loops 1 (nesting depth added 24). 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":"src/cli/protocol/capsule/replay.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b148544f6c03e95ccd1dd9690184af59c7f0637d8d34b45c6805cdc31e37f3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::document::initial_fields::process_para (cognitive 59): rhwp::document_core::commands::document::initial_fields::process_para has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 33). Of this number, 56 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"src/document_core/commands/document/initial_fields.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bee2355bff76a237a5d76929ced0c597f65df8b241378c5b7f30a4307aa224"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_nested_row_frames_with_storage (cognitive 59): rhwp::renderer::float_placement::stored_nested_row_frames_with_storage has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 8 (11 pts), boolean chains 10 (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":"src/renderer/float_placement.rs"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601010e78d488a1b58339b89a77dc860340cbc7652b0737ae288051e1f1cd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"release_gate.validate_verdict (cognitive 59): release_gate.validate_verdict has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (38 pts), boolean chains 20, 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":"gym/tools/release_gate.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a22677c8dac94c27dfb54815bd21ab8f976c27811a58ea47092efb64043806"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resize_table_cell_native (cognitive 58): DocumentCore::resize_table_cell_native has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 8 (17 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35b1aee8893a1c3b90fb07741b41e012d8174d5277cf0081c3be065fb4b6cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify (cognitive 58): rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (37 pts), match/switch 8 (10 pts), loops 5 (8 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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec50b5f5fcffe5baccddbb29ff4dde39996504121199ff0fca16d3672a1c026"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape (cognitive 58): rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (52 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (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. This shape REPEATS in the file: one other method here (rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::fill) 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db6bb846484915cbc1962e6102047e0bbbac9618537410abe80aac4db67a0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::auto_numbers::assign_auto_numbers_in_controls (cognitive 58): rhwp::parser::auto_numbers::assign_auto_numbers_in_controls has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 9 (24 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 34). Of this number, 52 points are the body\u0027s own statements and 6 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":"src/parser/auto_numbers.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d369c72af13d7b40d02cf2227e353e39107e47523a5457684f9c2cfa92621196"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::build_fallback_row_col_x (cognitive 58): rhwp::renderer::layout::border_rendering::build_fallback_row_col_x has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 8 (23 pts), boolean chains 3 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"26daa966202100aafd9463ae57eadd43ed4b3e1cf02edf2e043e91408606d0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::flow::place_with_storage (cognitive 58): rhwp::renderer::typeset::paragraph::flow::place_with_storage has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 15, loops 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":"src/renderer/typeset/paragraph/flow.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"53efeae433e3824a93d502c34dca6707f2f071d15d948586c72002c0673f65aa"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::place_empty_line_inline_equations (cognitive 57): LayoutEngine::place_empty_line_inline_equations has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (46 pts), boolean chains 6, match/switch 2 (3 pts), loops 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"84af0ffda4b872818688939188b5e25443fd6a79964e7ea4cdc3cc904a38e361"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::scan::run (cognitive 57): rhwp::bin::rhwp-agent::scan::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (35 pts), match/switch 6 (15 pts), loops 5 (6 pts), boolean chains 1 (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":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32004de045cfab2121f2575963a17ea11ee92ab79f2c138fc3e39fc0dbad35a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::kitty::export_kitty (cognitive 57): rhwp::cli::outputs::kitty::export_kitty has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 11 (29 pts), if/else 12 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 29). 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":"src/cli/outputs/kitty.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"465db4f75afc2791420825f4ea81c5b3a6e2e60f364bc05cd47610221d370e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::sixel::export_sixel (cognitive 57): rhwp::cli::outputs::sixel::export_sixel has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 11 (29 pts), if/else 12 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 29). 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":"src/cli/outputs/sixel.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afe0dcef413d010f76c21868e9e4c2af861ad5eaea63dfc4670b5fba9d5509"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::run (cognitive 57): rhwp::mcp_serve::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 11 (27 pts), loops 2 (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":"src/mcp_serve.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4129482e6b49e269ca8462b5b4e3801a6de1ac44d4cdd4e0852220b4ba0831"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::paragraph (cognitive 57): rhwp::parser::pdf::structured_lowering::paragraph has cognitive complexity 57 (threshold 15). Drivers by points: if/else 33 (44 pts), loops 4 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"5279ebb6b9d082cf342a81a2e70e98c40377de64558f89e12d17e8701ebdb186"}},{"ruleId":"D2","level":"warning","message":{"text":"MetafileFontSession.prepare (cognitive 57): MetafileFontSession.prepare has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (32 pts), ternaries 3 (12 pts), boolean chains 8, loops 2 (3 pts), error handling 1 (2 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7b5ba97272aede2816cd44150ab453ad0b1a5de65a906d77fd56f1c624db5a"}},{"ruleId":"D2","level":"warning","message":{"text":"page-renderer.collectLayerPlaneSummary (cognitive 57): page-renderer.collectLayerPlaneSummary has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (48 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"848c2e0c43d083e01abd06684a6263b9178ba18265a1ce6eaaae8feb16224574"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.onPaste (cognitive 57): input-handler-keyboard.onPaste has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 11, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 21). Of this number, 37 points are the body\u0027s own statements and 20 belong to 3 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"34835c2852e7274771ef5ea5ed6d7442e37f9164813567132f97a91eea584a11"}},{"ruleId":"D2","level":"warning","message":{"text":"wire (cognitive 57): wire has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (28 pts), ternaries 11 (12 pts), boolean chains 9, error handling 2 (4 pts), loops 4 (nesting depth added 7). Most of this is not in the body itself: 2 of the 57 points are its own statements and the rest belongs to 25 function literals inside it that branch (lines 911, 972, 885, \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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5512a4a02d0b8333a26b1c6fbb055ebbedc88343a3587fd50b12a58035c876"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::update_connectors_in_section (cognitive 56): DocumentCore::update_connectors_in_section has cognitive complexity 56 (threshold 15). Drivers by points: if/else 9 (31 pts), match/switch 6 (13 pts), loops 7 (10 pts), boolean chains 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a020ca98664fb609f8c72c90a23e401d1abd058675016fd82ed9c374b844f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resolve_body_page_fields (cognitive 56): DocumentCore::resolve_body_page_fields has cognitive complexity 56 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 9 (25 pts), match/switch 1 (5 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":"src/document_core/queries/body_page_fields.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b98c9830b2f78f758706f9f009e38c68f7a2fca02155886b1e2aee069ae737b"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::split_at (cognitive 56): Paragraph::split_at has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 10, loops 8, match/switch 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":"src/model/paragraph.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2b06950bc96b51346419528b5a61f6dbdd1548990151c550b2493bbe9af676"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::advance_row_block_cut_with_row_offsets (cognitive 56): LayoutEngine::advance_row_block_cut_with_row_offsets has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 11, loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/row_block_cut.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"684d237a213d1f8f8a470330fb986795df415370d1c6e72db0b675d0ec2f4c84"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutFrame::try_carve (cognitive 56): LayoutFrame::try_carve has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 4 (8 pts), boolean chains 7 (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":"src/renderer/layout_frame.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa3ae6bbda8857ff29c24ae1c91085b1daedd12f04cec7f51f09b7970f53977"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::compute_endnote_metrics (cognitive 56): TypesetEngine::compute_endnote_metrics has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 14 (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":"src/renderer/typeset/notes/endnotes/metrics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"217010d16a427a53dc639676ddec4802dba3d6021482d56bffe5efd1804a914c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_markdown (cognitive 56): rhwp::cli::outputs::text::export_markdown has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 7 (10 pts), loops 2 (4 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":"src/cli/outputs/text.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7765f038b5dd1f9db53e1efc862a471222bcd33d890d39e091f0b9024dc78294"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::logical_font_frame::frame_with_style (cognitive 56): rhwp::renderer::equation::logical_font_frame::frame_with_style has cognitive complexity 56 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 8, loops 2 (4 pts), match/switch 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":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3c0c4b9e4c4c38c3c2fe274ae4f4db102405a64df702dfe17411fa7a75a6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCanvasFontSession.resolve (cognitive 56): HostCanvasFontSession.resolve has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 10 (21 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 22). Of this number, 51 points are the body\u0027s own statements and 5 belong to 4 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe74f180a98f61bc7e189a26d8461ad058b7cd878f9c4ab0b029eccc72c1c77"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::handle_end (cognitive 55): rhwp_ooxml_chart::parser::handle_end has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (47 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 30). 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"976ca31271b0f4af56d817dc6587ac74ff6e4b04f800c7fa342604b24a270025"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calculate_body_wide_shape_reserved (cognitive 55): LayoutEngine::calculate_body_wide_shape_reserved has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (38 pts), match/switch 4 (12 pts), loops 2 (3 pts), boolean chains 2 (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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5245}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e75dfa69287ed09fb22e84d2873e081966f7f4e11cd3ab141b0c66859e5209"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_master_page (cognitive 55): LayoutEngine::build_master_page has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 3 (15 pts), match/switch 1 (6 pts), boolean chains 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":"src/renderer/layout.rs"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4abdfd330e5048ce79509e5814093302314e94e828acacc12d30993c058c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::chart_to_csv (cognitive 55): rhwp::cli::outputs::tabular::chart_to_csv has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 7 (13 pts), loops 5 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d73c0bd2d7c2273a2ce695c4209d509e4acb0e456864c3eafd7b822e5b71d"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-mouse.onDblClick (cognitive 55): input-handler-mouse.onDblClick has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 9, error handling 3 (9 pts) (nesting depth added 26). 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba18b3713e484a7a3364f533794fbd06fbfba7739078bb07fe7ec9bbec6fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.onCompositionEnd (cognitive 55): input-handler-text.onCompositionEnd has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 11, ternaries 3 (11 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfce4c0f0c953bd46fed2f880977c465f33f0f33b3b7dba64550c7e094b0a34"}},{"ruleId":"D2","level":"warning","message":{"text":"main.initialize (cognitive 55): main.initialize has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (34 pts), ternaries 6 (10 pts), boolean chains 7, loops 2 (3 pts), error handling 1 (nesting depth added 13). Most of this is not in the body itself: 14 of the 55 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 873, documentFontRequirements, a function literal at line 856, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/main.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b338d82ad646467bae79598f5c981124e463c30d1f7fabb8c9c0b425bc45afd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::walk (cognitive 54): Walk::walk has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (43 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/owned.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6696e350ba70a0773b35e306ee3010ccbe6f693daf8d0fc94c8de6cf13dd4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::cursor_rect_in_cell_fast_on_page (cognitive 54): DocumentCore::cursor_rect_in_cell_fast_on_page has cognitive complexity 54 (threshold 15). Drivers by points: if/else 32 (39 pts), boolean chains 14, match/switch 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cc487de821ad4679e4756c00565de0b568ab308fc7e9ed215fc60d27031c08"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::move_vertical_by_path_native (cognitive 54): DocumentCore::move_vertical_by_path_native has cognitive complexity 54 (threshold 15). Drivers by points: if/else 26 (45 pts), boolean chains 6, match/switch 2 (3 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"147d673213b7bf73ca27c620f9fc85aca63c6662049cfe6f8af35221b26e0cca"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::delete_text_at (cognitive 54): Paragraph::delete_text_at has cognitive complexity 54 (threshold 15). Drivers by points: if/else 26 (43 pts), loops 8, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f420b6e9b5278bbc782a1e51d9b85e7fbd7d97d1301a673e3a2918d7f230c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::shared_edges (cognitive 54): Ledger::shared_edges has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 8 (22 pts), boolean chains 1 (nesting depth added 34). Of this number, 52 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_inference.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09a5123cb77015979eb52869891cc59ad037de998862396051062059e01ec4c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::sequential_nested_cell_layout (cognitive 54): LayoutEngine::sequential_nested_cell_layout has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 3 (6 pts), match/switch 1 (3 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d661a812bd50d173880efc887e065632ae12175715232a91e2d9f4d3604c9f84"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::ordinary_rowbreak_fragment_heights (cognitive 54): LayoutEngine::ordinary_rowbreak_fragment_heights has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 12, loops 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27488}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b08a8dcb1092ce5b59abc2a3269bcfe8ad85ce421ac52a58b784f896e3ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::scan_block_table_split_rows (cognitive 54): TypesetEngine::scan_block_table_split_rows has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (43 pts), boolean chains 9, loops 2 (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":"src/renderer/typeset/table/scan/runner.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b572ce3aaee8ccb988af143b03ff0f2f9ebdc592d445ed44aaecb39eb14cea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::fingerprint::run (cognitive 54): rhwp::bin::rhwp-agent::fingerprint::run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 5 (9 pts), loops 3 (8 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":"src/bin/rhwp-agent/fingerprint.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"961019ed85fb53c98c52d25e68bd852c483a0e347612f8e066b37891351d69ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::execute_redact (cognitive 54): rhwp::cli::commands::edit::privacy::execute_redact has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 6 (10 pts), loops 4 (9 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abef9febb3d76cd01b4bf6d72eb80a2c6d8f6947d3f4b60beb71105161b7fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_text (cognitive 54): rhwp::cli::outputs::text::export_text has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 11 (26 pts), if/else 14 (22 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 24). 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":"src/cli/outputs/text.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e48a20a390b50dffcedf1124d78d3a08fea81bd8c7477cd3ca6796141b7b43"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_future_paper_shape_frame (cognitive 54): rhwp::renderer::float_placement::stored_future_paper_shape_frame has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 12, loops 2 (3 pts), match/switch 1 (3 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":"src/renderer/float_placement.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45e68a1ab58c1916da82f4bb5cb689210daf5626238f9702bf6e07ee7955655"}},{"ruleId":"D2","level":"warning","message":{"text":"background.browser.runtime.onMessage.addListener() (cognitive 54): background.browser.runtime.onMessage.addListener() has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 10, error handling 1 (2 pts), match/switch 1 (nesting depth added 26). Most of this is not in the body itself: 9 of the 54 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 261, 239, 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":"rhwp-safari/src/background.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a07993d028af402783c15312f48be369abda9123f4890beb56475c8d5e65a"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderCharOverlap (cognitive 54): CanvasKitLayerRenderer.renderCharOverlap has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 19 (50 pts), if/else 26 (40 pts), boolean chains 23, loops 3 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0648dde737d20aee73e64f0bc98a928c7465a85c0b9b59df427660ca6c8ef6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d (cognitive 53): rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26 (43 pts), loops 4 (10 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/rhwp-ooxml-chart/src/renderer/chart_3d.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"106fccfd6da82cab56a4bc2d83c5dc79bb56cedefd57bf778b5459cd8285842b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::piiscan::run (cognitive 53): rhwp::bin::rhwp-agent::piiscan::run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 5 (12 pts), loops 4 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/piiscan.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e4fbad592144d6540b847ae69965d8b395d35b5a42da1424d54615437847e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_unicode_scan (cognitive 53): rhwp::bin::rhwp-agent::safety::run_unicode_scan has cognitive complexity 53 (threshold 15). Drivers by points: loops 7 (24 pts), if/else 11 (21 pts), match/switch 4 (8 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (rhwp::bin::rhwp-agent::safety::run_stego_scan) 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfcd33d7d7021768be3ddffbea7a0f9c7a58524dae50dd95c0e6d41063b31f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_stego_scan (cognitive 53): rhwp::bin::rhwp-agent::safety::run_stego_scan has cognitive complexity 53 (threshold 15). Drivers by points: loops 7 (24 pts), if/else 11 (21 pts), match/switch 4 (8 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (rhwp::bin::rhwp-agent::safety::run_unicode_scan) 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f67dbeada542264d2160bd78251d34dd11008c38e4a0f71fa242cc4f550c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::plan::execution::run_plan_engine (cognitive 53): rhwp::cli::protocol::plan::execution::run_plan_engine has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (33 pts), match/switch 12 (16 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"585aeab5ae8a2a3b66dccf901b1860ae079edd654c55e5d93d6a67a811a6510d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::structured_objects::header_footer (cognitive 53): rhwp::cli::queries::structured_objects::header_footer has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 7 (14 pts), loops 2 (5 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":"src/cli/queries/structured_objects.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c0b4215134fb393de1614abea37f976b78717e51f08c77132461a749fe5ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::document::tac_cache_repair::physically_stale (cognitive 53): rhwp::document_core::commands::document::tac_cache_repair::physically_stale has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 8, loops 3 (6 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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"007826f28edfc5e8228da77eb4547345c8dc83442c7c522bb65421d7fcb2b7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::identity::collect_ids (cognitive 53): rhwp::model::identity::collect_ids has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 5 (16 pts), match/switch 3 (8 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":"src/model/identity.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9ca30e01e974f6819d8b2b79c063761a323cc2f2db93476589ec7b1fd49338"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.handleF11 (cognitive 53): input-handler-keyboard.handleF11 has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (24 pts), error handling 6 (13 pts), loops 2 (7 pts), ternaries 2 (5 pts), boolean chains 4 (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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b54c248adf89cb80b41b6b5152e2a4ca3b70f79a2bcca12a115ac5af609b12d"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedTextMeasurer::estimate_text_width_exact_with_storage (cognitive 52): EmbeddedTextMeasurer::estimate_text_width_exact_with_storage has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 2 (9 pts), boolean chains 6, loops 1 (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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c16601a9dc445eada5c258dd7ab59897da8a44b71393cda8a67cb81e2ec44e"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_text_with_effects (cognitive 52): WebCanvasRenderer::draw_text_with_effects has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"5328b3e2b1bb0063707728bdd621a5f5a2856ae9a635da180772f83e406cde05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::raster::export_png (cognitive 52): rhwp::cli::outputs::raster::export_png has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (40 pts), match/switch 7 (9 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":"src/cli/outputs/raster.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2139390066ad6bcfc5c80c8c9f7be1961506bdbad85bd0e25a52848f4dcfb671"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::rows_geometry::inspect (cognitive 52): rhwp::document_core::commands::paragraph_block::rows_geometry::inspect has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 13, loops 5 (9 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":"src/document_core/commands/paragraph_block/rows_geometry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5e03fc37ee921129e29a79d484f3ee8c180f49c7a4c615e57e8cb55315316d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::structure::classify_clause (cognitive 52): rhwp::document_core::queries::structure::classify_clause has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (13 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 29). 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":"src/document_core/queries/structure.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f09f9b768b02fba02378ca37357387827bb5f215abcf05313d179d0e387484"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_equation_layout_kind (cognitive 52): rhwp::paint::json::write_equation_layout_kind has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 6 (13 pts), match/switch 1 (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":"src/paint/json.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a6911c6b576411bf7ae5df849e4b9cddccb1d29e1cf971b5a90cbd05ba3bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_check_contract (cognitive 52): pack_health.scan_check_contract has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/pack_health.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e92724c55a139eb12dc3f4bff19afe78fe241f67c96f880f92b86e73657e5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"AssistantView.proposal (cognitive 52): AssistantView.proposal has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 9 (25 pts), if/else 19 (21 pts), boolean chains 6 (nesting depth added 18). Of this number, 45 points are the body\u0027s own statements and 7 belong to 4 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c09cc2252a39128c6584e290fd592b2b73b1c59d38112cdcdf6d7273b38d1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderNodeContents (cognitive 52): CanvasKitLayerRenderer.renderNodeContents has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 7, loops 2 (6 pts), error handling 1 (5 pts), ternaries 2 (4 pts) (nesting depth added 29). 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"248dcf04afd75f069e22400816e949f873fd559fcb70aee8e9b0d0f3108c38c3"}},{"ruleId":"D2","level":"warning","message":{"text":"showHoverCard (cognitive 52): showHoverCard has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (42 pts), boolean chains 7, error handling 1 (3 pts) (nesting depth added 20). Of this number, 42 points are the body\u0027s own statements and 10 belong to 5 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":"rhwp-safari/src/content-script.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e483d0c0dea0ffb2599519b6f38e703ca5306d0f2fd1dde80588f0d71dc8e2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes (cognitive 51): DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 9, loops 1, match/switch 1 (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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_text_caret_stops, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"142729ac1c4a80596c3ad4497654b556175c225d162b6ff54d8dbdee339f834d"}},{"ruleId":"D2","level":"warning","message":{"text":"FontEnvironment::from_document_lookup (cognitive 51): FontEnvironment::from_document_lookup has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 6 (8 pts), boolean chains 7, match/switch 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":"src/renderer/font_environment.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288991329d45f0c719b409b30dfd72f08af1bde8f443b271a724a2c2da4b96e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_footnote_area (cognitive 51): LayoutEngine::layout_footnote_area has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7551b86b2aab64162afb2756d2dbbd582c3c4367483ed8cc3e794f31fb2ff20c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::process_multicolumn_break (cognitive 51): TypesetEngine::process_multicolumn_break has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 12, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/columns.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db32256bc3a9cd688b9ab9b193a1eeacffda5e9fbf42064f8f7b6319c74f645"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::run_section_with_storage (cognitive 51): TypesetEngine::run_section_with_storage has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 8, loops 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":"src/renderer/typeset/section.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea1ab18ed02793440134b6cec2a6f837820abbd875ff57a73b0279f49004675"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::stored_fragment_row_plan (cognitive 51): TypesetEngine::stored_fragment_row_plan has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 17, loops 3 (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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b058697e6fb7bbc32fba55f0ee99e964d9b7d78c5c95904b6da7ecb5ca801"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_conformance (cognitive 51): rhwp::cli::protocol::trust::governance::cmd_conformance has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 8 (16 pts), boolean chains 6, 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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ea468d4dfbc093360fa8796403fa77aeb2e2e29b6c7c0bc136f56714be166f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::collect_max_field_id (cognitive 51): rhwp::document_core::queries::field_query::collect_max_field_id has cognitive complexity 51 (threshold 15). Drivers by points: loops 15 (43 pts), if/else 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 33). 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb6f0cac37fc9c904ff837cb378a3936128368be683fb5974690a9aad904c78"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::font_metric_coverage::analyze_paragraph (cognitive 51): rhwp::document_core::queries::font_metric_coverage::analyze_paragraph has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 8 (15 pts), match/switch 2 (9 pts), boolean chains 5 (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":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef08f6a36efcf5083dab66d03790e8f78f71e00dd687b97131a369dd95e69c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::collect_cached_focused_tail_lines (cognitive 51): rhwp::document_core::queries::rendering::collect_cached_focused_tail_lines has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (42 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"614df5d6df5ee1ffe590987fc43656a811fb78182731bc641d377e9e07d83a03"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.audit_one_pack (cognitive 51): audit.audit_one_pack has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (31 pts), ternaries 3 (8 pts), boolean chains 6, loops 5 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cf1509ee7558d32f2c418a2b1caf5b8769ad59709fd9b4d78a0c8bf1021b93"}},{"ruleId":"D2","level":"warning","message":{"text":"authority_ledger.build_ledger (cognitive 51): authority_ledger.build_ledger has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 7, error handling 2 (6 pts), ternaries 4 (6 pts), loops 3 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/authority_ledger.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bdd6be05b8f972ba879d1a640fd8b0451a56414edfff6221a3dc1df4bad02d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeOwnerTransport._poll (cognitive 51): NativeOwnerTransport._poll has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 8, ternaries 2 (5 pts), error handling 1 (2 pts), loops 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":"bindings/Flutter/lib/src/native_ffi.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0296be0caaa4a537d03c500cdfbed5d9e05ac0a9afe61889ea428b786595ba92"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitGlyphRunFontCache.registerResources (cognitive 51): CanvasKitGlyphRunFontCache.registerResources has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 11, error handling 1 (3 pts), loops 2, ternaries 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"949591b07d6712ad42b681d6e27b27b99e6226106e8d08d724d18f9957381c52"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.create (cognitive 51): CanvasKitLayerRenderer.create has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (29 pts), error handling 6 (9 pts), boolean chains 6, ternaries 4 (6 pts), loops 1 (nesting depth added 17). Of this number, 50 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc448aed36433b5a9d8d9a6fc33b9eb44cc744abe3899f80bf18037036dd7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::renumber_footnotes_in_section (cognitive 50): DocumentCore::renumber_footnotes_in_section has cognitive complexity 50 (threshold 15). Drivers by points: loops 7 (29 pts), if/else 3 (18 pts), match/switch 1 (3 pts) (nesting depth added 39). 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":"src/document_core/commands/footnote_ops.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef09d60ac318162ae64f16aaf8f4cfe0fc84ffa354d2b823ce44d894cba2810"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::create_shape_control_native (cognitive 50): DocumentCore::create_shape_control_native has cognitive complexity 50 (threshold 15). Drivers by points: if/else 28 (33 pts), match/switch 7 (12 pts), boolean chains 4, loops 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc35faf874d7a563de97ea05a51ab752b95bc76659581b67a8aa1add005c32c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_in_header_footer_target_native (cognitive 50): DocumentCore::hit_test_in_header_footer_target_native has cognitive complexity 50 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 7, loops 4, match/switch 1 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 27 belong to 5 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4252032af404e0fbcc9824a6b4428080de1e5bd7025b54ee72e5b92c6790e9da"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::bookmarks_in_layer_tree::walk (cognitive 50): DocumentCore::bookmarks_in_layer_tree::walk has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 30). 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":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"757769a9632ac52b86739ec076044a49710576ce30bc55b7a339b088f307d9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::reflow_recursive_run_extra (cognitive 50): LayoutEngine::reflow_recursive_run_extra has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 11, match/switch 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26991}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b257be40e528dc4ff05ea81d7547931d583790e665f0a9a033b81e704c9730"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::edit_sanitize (cognitive 50): rhwp::cli::commands::edit::privacy::edit_sanitize has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 5 (8 pts), boolean chains 5, loops 4 (5 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccd0dd1b4ee7aabee56b279c154c8fbd17ddfded652c595dec52f1f90b4e750"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::vector::export_render_tree (cognitive 50): rhwp::cli::outputs::vector::export_render_tree has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 9 (18 pts), loops 2 (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":"src/cli/outputs/vector.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b61b91ad1da093b8eb2492a36fa5e7408a422ff5ebdf8511afa8648c9b6819"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::border_paint::decode (cognitive 50): rhwp::model::border_paint::decode has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 19, loops 3 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab80bca942cc73e42701f949a468e2274a33b23a2bf82800d3f2c8531dec2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruler.drawHorizontal (cognitive 50): Ruler.drawHorizontal has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 9, loops 3 (6 pts), ternaries 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27e14366482565f8dafe010e6b66e9ec60cfb082b7a7232977ba9978d4d492"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.finishResizeDrag (cognitive 50): input-handler-table.finishResizeDrag has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 3 (10 pts), boolean chains 4, ternaries 2, error handling 1 (nesting depth added 22). Of this number, 46 points are the body\u0027s own statements and 4 belong to 2 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"68978e540d719387c98c419c425e67e470ec924cf7c92555d4d9ab337921c4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setupEventListeners (cognitive 50): main.setupEventListeners has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27 (30 pts), ternaries 6 (10 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 15 function items inside it that branch (a function literal at line 1406, a function literal at line 1311, a function literal at line 1334, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/main.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"16320ce739515b6de4351fc6ac16d1f6e6a14ca1026b244c0c3e03612e5aaa3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::paragraphs (cognitive 49): Collector::paragraphs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (27 pts), loops 6 (16 pts), boolean chains 3, match/switch 1 (3 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":"src/document_core/canvas_metric_requests.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1052dc678bc5aceaae81daf456f6a97e7c908cfea99f107ebf658b5ea07c8678"}},{"ruleId":"D2","level":"warning","message":{"text":"LenientCfbReader::open (cognitive 49): LenientCfbReader::open has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 7 (12 pts), boolean chains 6 (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":"src/parser/cfb_reader.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76592f9b878af63f2c2d6fd11eed22c54847f25e567023abdb9f8e67fb5b6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::relocate_float_anchor_lines_below_band (cognitive 49): LayoutEngine::relocate_float_anchor_lines_below_band has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 26). 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":"src/renderer/layout.rs"},"region":{"startLine":11400}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0fa65f238848b82ea2e1c2c662970409e057ab53eb8e5942c55a463637048a"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_image (cognitive 49): WebCanvasRenderer::draw_image has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 6 (11 pts), boolean chains 7 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a620735ff9b83b25eb39b20f6f992e332634d444f94293d345f137d23820adc"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_image_with_fill_mode (cognitive 49): WebCanvasRenderer::draw_image_with_fill_mode has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (13 pts), match/switch 5 (10 pts), boolean chains 2 (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":"src/renderer/web_canvas.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5526609cf14ebbcd29887269ea347224daa2f9b1926fa0a359781ca9c0bbe6a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::fn_selection_rects::run (cognitive 49): rhwp::bin::rhwp-q::kit::fn_selection_rects::run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 10 (24 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afd5c4b2e026da36f5283dfab2a2588d9066a6ed6332cc11753175e55984838"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_text (cognitive 49): rhwp::cli::commands::edit::document_text::edit_insert_text has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (32 pts), match/switch 8 (15 pts), boolean chains 1, 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf903dfc003756a3cc6a6ff7733e01e567bae22847b4357124a5ad45cd535f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_insert_equation (cognitive 49): rhwp::cli::commands::edit::equations::edit_insert_equation has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (26 pts), if/else 8 (22 pts), loops 1 (nesting depth added 31). 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e1cbe359a93f863f9618a70a6e7e95cac0fa8e8fb0712c05378e61b66bc3d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text (cognitive 49): rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 11 (24 pts), loops 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c79ec448ab012c2624e5f57f17435352a1e070eb47efef2163db45306cb869"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_insert_picture (cognitive 49): rhwp::cli::commands::edit::media::edit_insert_picture has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 16 (28 pts), if/else 11 (18 pts), loops 3 (nesting depth added 19). 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"347a9d8803bc12a985f7f58f30e8ab25aebf8ffb0a4fa12a8c5f388fc18f1aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::text::edit_replace_text (cognitive 49): rhwp::cli::commands::edit::text::edit_replace_text has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (29 pts), match/switch 12 (18 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":"src/cli/commands/edit/text.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"76831cfaddbfbde57542c2f0ad1b9f1b36567847b30450067c1d83079c664e49"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::pr::assets::seo_rii_20261030::consumer_probe::main (cognitive 49): rhwp::mydocs::pr::assets::seo_rii_20261030::consumer_probe::main has cognitive complexity 49 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 9 (24 pts) (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":"mydocs/pr/assets/seo_rii_20261030/consumer_probe.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24a8a6c3116cb79afe08589ba5d05078e5c31989a86171885ddbabf5001949f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_text_export_metadata (cognitive 49): rhwp::paint::json::write_text_export_metadata has cognitive complexity 49 (threshold 15). Drivers by points: if/else 41 (44 pts), loops 3, boolean chains 2 (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":"src/paint/json.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be29cefbb704a93fa465b4e7db6cf55ed5dbcb812a7e8969d1c36b3445a2c19"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::parse_paragraph (cognitive 49): rhwp::parser::body_text::parse_paragraph has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (36 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (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":"src/parser/body_text.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c17a454aea25b14bbf70354b18c5f46bf83ecdd3aead1726a6b7371874960e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::editable::assemble (cognitive 49): rhwp::parser::pdf::editable::assemble has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (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":"src/parser/pdf/editable.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f62587afc21de3a7a86d653c87e18fcde767edfaac896d10d1cda2975daeb18"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.statement (cognitive 49): Parser.statement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 5 (11 pts), loops 3 (6 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6334783846b010d6bcd40fc7b5a9efb9b986083a071b664ef45152d73332a93"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.matchSegmentDp (cognitive 49): diff-engine.matchSegmentDp has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 9, loops 6 (9 pts), ternaries 3 (6 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da3881dd1169359944b5afe8f85ab605653bfe2c0cae3c446277af3a32f09c"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.copySelectedObject (cognitive 49): InputHandler.copySelectedObject has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (33 pts), error handling 4 (12 pts), boolean chains 4 (nesting depth added 28). Of this number, 38 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5685}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef1cb88d39f03dfe52573d00e4a60036d6b765a1ceb9a56e6806c03a44045dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::parser::parse_chart_xml (cognitive 48): rhwp_ooxml_chart::parser::parse_chart_xml has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 3 (7 pts), loops 4 (5 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b774784b0bcd00991ba38f49f8270dcfeb6d74abff1a1cd9ab6aa9eaa50583d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::create_table_with_options_native (cognitive 48): DocumentCore::create_table_with_options_native has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 5 (9 pts), boolean chains 6 (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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71ad2e855a5a8510325b3efef54ddb5902ee0a88850788d31647cc81ef71428"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::handle_cell_boundary (cognitive 48): DocumentCore::handle_cell_boundary has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 5, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e99f7581c4a064afa8192a5149920c671268fffb9594d3029539a00760e857"}},{"ruleId":"D2","level":"warning","message":{"text":"TypefaceCatalog::load (cognitive 48): TypefaceCatalog::load has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 5 (10 pts), boolean chains 3 (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":"src/renderer/skia/font_catalog.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e12994247e7c6163f12cc537bc73f7929bb1aac009b3db6fb49bb3ff93f82cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::prepare_pua_glyphs (cognitive 48): SvgRenderer::prepare_pua_glyphs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg/pua_glyph.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a136425eec7161b89b3f866f4302b85ec55928e0e4ebee86b408b7f9e249b813"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::register_queued_table_footnotes (cognitive 48): TypesetEngine::register_queued_table_footnotes has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 17, 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":"src/renderer/typeset/table/footnotes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91ac120151f30ecd0e58c1c93517e26c0cf16a13ae2851a44060e76aba7d8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_text_run (cognitive 48): WebCanvasRenderer::render_text_run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 3, loops 1 (3 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdbd2006325864c10eea62d369bb7b1ef5ba1439b965038810fad77b6f8475b"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_image_with_sampling (cognitive 48): WebCanvasRenderer::render_image_with_sampling has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 7, match/switch 2 (6 pts), loops 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1723e03b20cf3bebbe26af266755411011c46ce10247ff8d691d2499334c6b18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::emf::emfplus::player::render (cognitive 48): rhwp::emf::emfplus::player::render has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 4, loops 2 (4 pts), match/switch 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":"src/emf/emfplus/player.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5651aede15d9f1235791a6ce0ed939110ff214c5b5ef3c7aa1e9b4edafa6c4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_print::replay::rasterize (cognitive 48): rhwp::paint::metafile_print::replay::rasterize has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 3 (6 pts), boolean chains 2 (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":"src/paint/metafile_print/replay.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0a4b832eae35427d969865999619e97f80b51ba3426f1cba08831f17ecd1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::parse_table_control (cognitive 48): rhwp::parser::control::parse_table_control has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 3 (8 pts), match/switch 2 (7 pts), boolean chains 2 (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":"src/parser/control.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a803a34a7051b4a2ede2301af60a01fb2d02a43db90f4b9395b288127c8a927"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::assign_pic_numbers_in_controls (cognitive 48): rhwp::parser::hwp3::assign_pic_numbers_in_controls has cognitive complexity 48 (threshold 15). Drivers by points: loops 8 (27 pts), if/else 4 (19 pts), match/switch 1 (2 pts) (nesting depth added 35). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5778}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8216cc5c1d39b7454393d9465621221e33412f69b674ea3ca14b01897ff25e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage (cognitive 48): rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (7 pts), boolean chains 6 (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":"src/renderer/composer/nested_table_frames.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfda74e58a399be82e4cef4308d9a864b514f7d8c1f658bd78ee69dea737dde"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::navigate_header_footer_by_page_native (cognitive 47): DocumentCore::navigate_header_footer_by_page_native has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 2 (11 pts), boolean chains 2, loops 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6aa58943b24cf91cf057e5cc21ef9ad70fd1c9abe2f3af135383de6821678d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::compute_overflow_links (cognitive 47): DocumentCore::compute_overflow_links has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (28 pts), match/switch 4 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3330c49e3e059eafce6c97a94da7a508416d7b0463dc71ac3fb31ea7c6cc9ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::replace_matches_native (cognitive 47): DocumentCore::replace_matches_native has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 7 (13 pts), match/switch 3 (9 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fbba0600964e4f455314fd3fe1d6de7dbeabc840879195bb497f7826627879"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGPlayer::ext_text_out (cognitive 47): SVGPlayer::ext_text_out has cognitive complexity 47 (threshold 15). Drivers by points: if/else 30 (40 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"90103365fc0074ec38921e643d02dfa92c2b315b33389a8371b63478795ef25c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::tabular_import::csv_to_chart (cognitive 47): rhwp::cli::commands::tabular_import::csv_to_chart has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 11 (17 pts), loops 2 (4 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bab617bddb43ffb8c6c376c51941fd6d06c9e0d5584ecb21c18b9a645b6f46a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::raw_provenance::seal_raw_bearing_controls (cognitive 47): rhwp::model::raw_provenance::seal_raw_bearing_controls has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 5 (13 pts), match/switch 2 (4 pts) (nesting depth added 28). Of this number, 30 points are the body\u0027s own statements and 17 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":"src/model/raw_provenance.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a98bfe4574538242c98a750115df7f720d3744356446edba0515cada9070737"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::try_convert_pua_display_text (cognitive 47): rhwp::renderer::composer::stored_tac_display::inc::try_convert_pua_display_text has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (11 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8577413e34ef959af90681ac1bece83c6a95e0fc2051e2cc871ba9ea30e2d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage (cognitive 47): rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 3 (8 pts), loops 5 (7 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c16f85d213715ab6df563b43ef044f864a314ef5f482f05fc25ee40c5d21e8"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.pack_issue_line (cognitive 47): audit.pack_issue_line has cognitive complexity 47 (threshold 15). Drivers by points: if/else 26, ternaries 9 (18 pts), boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32a5531b37a83f52d75491ed6d3b4d00b5cd1931d210f1be5708158df56545c"}},{"ruleId":"D2","level":"warning","message":{"text":"discriminate.validate_report (cognitive 47): discriminate.validate_report has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 7, loops 5 (6 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":"gym/tools/discriminate.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"033a86efd9450251250c030aa6c7cc80e9dc9070428cd41f00acd8d9f1ac6608"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.deterministic_mutants (cognitive 47): fuzz_corpus.deterministic_mutants has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (27 pts), loops 17 (19 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c1af69cf2aeb10a23fcf0e698db2d1d3d15942800827e59cb28a4ee0480fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"robustness.deterministic_mutants (cognitive 47): robustness.deterministic_mutants has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (27 pts), loops 17 (19 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":"gym/tools/robustness.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32d888c2e51354175b208e750342cb8216a8415bbf5bda90b014512f9f36d75"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCanvasFontSession.prepare (cognitive 47): HostCanvasFontSession.prepare has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 9, loops 5 (7 pts) (nesting depth added 18). Of this number, 34 points are the body\u0027s own statements and 13 belong to 5 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3939c8fc290078f80c4894b9a6f06f3a4c411329c5e62d28e4f17b2024ce69"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextDecoration::draw (cognitive 47): CanvasKitLayerRenderer.renderTextDecoration::draw has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 11, loops 3 (6 pts), ternaries 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderTextDecoration::drawLineShape) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f53eaef9d96d122ee5ddda22e4fd44facec4ff92cad94a7b46bca008b2c7dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_picture_properties_native (cognitive 46): DocumentCore::set_picture_properties_native has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 8, loops 2 (7 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a4a4d93824d564d15479f5ffbabff365551faf4c62bff934a87d6c66b9f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::reflow_cell_paragraph_with_metrics (cognitive 46): DocumentCore::reflow_cell_paragraph_with_metrics has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (40 pts), boolean chains 4, match/switch 2 (nesting depth added 25). 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b66971e1957efa9a40bd2781dc0a5a7b5dc0068cd2f3bcd2be7ffedcf2a83"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit (cognitive 46): DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 4, match/switch 2 (3 pts), loops 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aaac7d96997d955a6ac5001a6604b57f9f2c58927619ade9a6902dcb245055"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::populate_external_images_from_dir (cognitive 46): Document::populate_external_images_from_dir has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (9 pts), loops 4 (7 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":"src/model/document.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998c24b77a13bbcf8791e5623de1f2da9b784dbf4549055552458c3c07407c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::closing_row_frames_with_storage (cognitive 46): Table::closing_row_frames_with_storage has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 10 (17 pts), boolean chains 5, match/switch 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":"src/model/table/row_frames.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"26469daecdb384c021154b4e9719b5779aeb4cb60ba9027d4297f3ef987f6bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderNormalizationOverlay::register_rendered_text_partitions_with_storage (cognitive 46): RenderNormalizationOverlay::register_rendered_text_partitions_with_storage has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (33 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"519443a330aeb225154cef5ad5c17a32157f9fa251dac8bd87f228f296d1393b"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::get_click_here_props (cognitive 46): HwpDocument::get_click_here_props has cognitive complexity 46 (threshold 15). Drivers by points: if/else 4 (22 pts), loops 6 (18 pts), match/switch 1 (4 pts), boolean chains 2 (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":"src/wasm_api.rs"},"region":{"startLine":6549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7031c488d9be6cae045fca3bf5343cc856e628ebcb80c0091ccf3eda61aa18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::evidence::run (cognitive 46): rhwp::bin::rhwp-agent::evidence::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 5 (8 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/evidence.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"89893cad951fb60390f90df5aa2184566d2ea528e3969fde9d45c78c329413bb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::table_to_csv (cognitive 46): rhwp::cli::outputs::tabular::table_to_csv has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 7 (13 pts), loops 4 (7 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f06acdde9c9c96b2dec2c4b3d0a9eaa2978c325f5fbf40188e11404597085"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::ole_chart::legacy_column_renderer::render (cognitive 46): rhwp::ole_chart::legacy_column_renderer::render has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 6 (11 pts), boolean chains 5, match/switch 1 (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":"src/ole_chart/legacy_column_renderer.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82af868db47d91c6211fe9c9ed827c62f0a5558cd35bd9ee3b352ad9a6e0a18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_tab_def (cognitive 46): rhwp::parser::hwpx::header::parse_tab_def has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 4 (13 pts), loops 3 (6 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":"src/parser/hwpx/header.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"02da6dc6ac20c07542b00db424af46698ec594d4ab8b33cc10e68cc775591ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_topology::evidence (cognitive 46): rhwp::parser::pdf::table_topology::evidence has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 12 (19 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2633b026f8f61fe87026730831a560f0e697837b22ce123d09cf3ee3f68020"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_inline_content_frame (cognitive 46): rhwp::renderer::float_placement::stored_inline_content_frame has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 7, loops 4 (6 pts), match/switch 1 (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":"src/renderer/float_placement.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844b739104f7e857918b42b7d09342e625cc793e991afa04743b7cbe990b1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.cleanupParagraphAlignStepsToDiffItems (cognitive 46): diff-engine.cleanupParagraphAlignStepsToDiffItems has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 4 (13 pts), boolean chains 6, loops 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b485b72a5dca2de6a86f9bec357aa06adf1fde690503614d8bfe714e3b2195"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPrvImageFromCFB (cognitive 46): extractPrvImageFromCFB has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 6 (12 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/background.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6689c5acd106d78f852272027874312aaa402cc7413bf5294da70ecc6484180a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_in_footnote_native (cognitive 45): DocumentCore::hit_test_in_footnote_native has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 6, loops 3, match/switch 1 (nesting depth added 15). Of this number, 16 points are the body\u0027s own statements and 29 belong to 3 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf694e6cf192cbe2afcc102a2352d4eb9d56e5a2a08e9e9e5746a9bc48047eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_font_decision_trace_from_tree (cognitive 45): DocumentCore::get_font_decision_trace_from_tree has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_decision.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c54cb0a36299bb99b09a4c73b20df82ffdde2ca971608cdb8c491eb502f282"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::replace_text_keeping_slots (cognitive 45): Paragraph::replace_text_keeping_slots has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 11, loops 5 (7 pts), match/switch 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":"src/model/paragraph.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"96633d72886a773137194be4b2f3615099e1f58819b994a80e8b2c2a3ca8b126"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::compute_table_x_position (cognitive 45): LayoutEngine::compute_table_x_position has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 5 (9 pts), boolean chains 5 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6752}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d8fb97339d0e18fa23d22da28ed149e37bde11cc3e60501b09334a990c4b05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::verify::run (cognitive 45): rhwp::bin::rhwp-agent::verify::run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 8 (17 pts), loops 3 (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":"src/bin/rhwp-agent/verify.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d45c7e48e04ac901f4f642980f45297ba897a194763e0e4e4d01a8a998c50b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf (cognitive 45): rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 10 (23 pts), if/else 10 (21 pts), loops 1 (nesting depth added 24). 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5462f9d463a95adeddbb7babf1f631cc156c94be1ef4bceeb24a64871c017fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_group_shapes (cognitive 45): rhwp::cli::commands::edit::shapes::edit_group_shapes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 8 (18 pts), 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"347be2779ffc65057d48f1f871b74d9d06b7cce61c8e98ff9649578de23e17c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::scan_workspace (cognitive 45): rhwp::mcp_serve::scan_workspace has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (34 pts), match/switch 2 (6 pts), loops 2 (3 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":"src/mcp_serve.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe79810b050d0174484a1f8d178650218558eba6a01d7643e6eb67c9da36f943"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::load_bin_data_content (cognitive 45): rhwp::parser::load_bin_data_content has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 5 (13 pts), boolean chains 2, loops 2 (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":"src/parser/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"1351e2b52de33eece9229c2c56ac3cfe4247b7918a0b3ea095b770b3f7c8c617"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::assign_memo_paragraphs (cognitive 45): rhwp::parser::body_text::assign_memo_paragraphs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (34 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"752c4f47f74f79503f70590761c69ea9fafd6129640c5567eb7d363d7d7faeac"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_draw_text_body (cognitive 45): rhwp::parser::hwpx::section::parse_draw_text_body has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 7 (33 pts), loops 3 (9 pts), if/else 1 (3 pts) (nesting depth added 34). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c6472090c39b4de23112586e80dd58041c2c8bec4494e8557b0326bdd3adf9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::shrunk_cell_horizontal_padding (cognitive 45): rhwp::renderer::composer::stored_cell_reflow::inc::shrunk_cell_horizontal_padding has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 5 (11 pts), boolean chains 5, match/switch 1 (3 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90507005b1f28af57a212fbe343df3589bc473886064fc05a0d6ffd57b99b43"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::serialize_hwpx_into (cognitive 45): rhwp::serializer::hwpx::serialize_hwpx_into has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (23 pts), loops 10 (13 pts), match/switch 3 (5 pts), boolean chains 4 (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":"src/serializer/hwpx/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd479fb573beccd816adc95d7545d9d3a4251fab01c71b98aeef7afaec91d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::package_check::check_package (cognitive 45): rhwp::serializer::hwpx::package_check::check_package has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 6 (7 pts), loops 4 (5 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":"src/serializer/hwpx/package_check.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4350fcdb2f671e044d5948dcfb583bcda05997c759d2bbe0baf71854ba941c2"}},{"ruleId":"D2","level":"warning","message":{"text":"action-runtime.evaluateFormAction.invoke (cognitive 45): action-runtime.evaluateFormAction.invoke has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 5 (11 pts), boolean chains 7 (nesting depth added 16). Of this number, 43 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cede740a07f833a89520f0310d68c404da5bcf0705e09e72f321079155f6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"form-replay.formDrawingReplayRejection (cognitive 45): form-replay.formDrawingReplayRejection has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 10, match/switch 1 (2 pts), 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":"rhwp-studio/src/view/canvaskit/form-replay.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed47e2cf1702c8a0be338a5e8703a58bbe1593947df00c804b1d687049b74d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareLocalFonts (cognitive 45): CanvasKitLayerRenderer.prepareLocalFonts has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 10, loops 4 (5 pts), error handling 1 (2 pts), ternaries 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ab9110f7a239c6e4040f7a3c7a3aff210f947df8b856bb7bce67580fae77a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow-image-clip.collectFlowImagePaintOps::visit (cognitive 45): flow-image-clip.collectFlowImagePaintOps::visit has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (22 pts), if/else 8 (14 pts), boolean chains 5, loops 2 (4 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbcfa9c72dd4d26371e72803af2e9616754c19d3a8ac6854fcfa99cb64a79fb"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.handleShiftF11 (cognitive 45): input-handler-keyboard.handleShiftF11 has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 5 (11 pts), loops 2 (7 pts), ternaries 2 (5 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb982707502b05e417b33c8f2d6c6b18333a9d8a0edd05fb0fd16a7d0d93edd0"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.finishPictureResizeDrag (cognitive 45): input-handler-picture.finishPictureResizeDrag has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 4 (14 pts), boolean chains 5, error handling 3 (4 pts), loops 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2887504814fe5b06c1fe60dc09e7cc5a8f7249178ce69720646d1b3f4c679790"}},{"ruleId":"D2","level":"warning","message":{"text":"MovePos (cognitive 45): MovePos has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 6 (13 pts), other 8, loops 2 (5 pts), boolean chains 3, match/switch 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cb059c47df7c8e3a6b3e0beb8e0e8947580d09d6397220a4ce9b49e9f3418f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_next_editable_control_native (cognitive 44): DocumentCore::find_next_editable_control_native has cognitive complexity 44 (threshold 15). Drivers by points: if/else 27 (54 pts), loops 5 (10 pts), match/switch 2 (6 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. This shape REPEATS in the file: one other method here (DocumentCore::find_next_editable_control_native::find_in_para) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2239c41b5822f60d8fbf0661b617d43218868ae317a2276b032c56eb0d02bde1"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitReplayPlanBuilder::item_for_op (cognitive 44): CanvasKitReplayPlanBuilder::item_for_op has cognitive complexity 44 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01940b4011f2c14577ca0a0096040339c9224a0e7b0273e19ceae6847556aec"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::resolve_span_content_requirements (cognitive 44): LayoutEngine::resolve_span_content_requirements has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 12, loops 6 (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":"src/renderer/layout/table_layout/plain_cell_flow.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8322be8cfe7d95f50fd4bc90c009370309e92faa48265550a2d5a32897dbce55"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::should_defer_fresh_rowbreak_wrapper_prefix (cognitive 44): LayoutEngine::should_defer_fresh_rowbreak_wrapper_prefix has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 6, loops 2 (3 pts), 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28157}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e787ff39f7ddf3cf2f1af131162176e2bbfc9aad3caf6fb626aa161fba8d99"}},{"ruleId":"D2","level":"warning","message":{"text":"Bitmap::from (cognitive 44): Bitmap::from has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 8 (19 pts), boolean chains 1, 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":"src/wmf/converter/bitmap.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f2d2582c14fd3ebfdebc46a1d3486441013a60dba3c88af82f55bd0f67e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_delete_text_in_cell (cognitive 44): rhwp::cli::commands::edit::cells::edit_delete_text_in_cell has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 8 (18 pts), loops 1 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7056cdaea3765df16de257adcb22226b10e02f4848bc364a26bdefd86dd43"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template (cognitive 44): rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 7 (18 pts), loops 1 (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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1989185a865c8d2737e0a9df93a0545669e18a3e4ea58bf368aeff056cdc1c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::document::tac_cache_repair::repair_cell_width_caches (cognitive 44): rhwp::document_core::commands::document::tac_cache_repair::repair_cell_width_caches has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"728b1543f1b7fb3540ca34f5fbf5ea196fa9abaa245b7cf1156127fae09c0e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::plan_identity_edits (cognitive 44): rhwp::document_core::commands::object_ops::chart::plan_identity_edits has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (10 pts), match/switch 1 (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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79b5b659362db21b8af598de5adf7fd96cfa4df25bc75a7d92b45e0952bb73e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::collect_fields_from_paragraph (cognitive 44): rhwp::document_core::queries::field_query::collect_fields_from_paragraph has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 6 (16 pts), match/switch 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bdd42e5215a466a87fc9e635910db0f646abb29b2a550977347b8dcf96e43a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::run_cli_tool (cognitive 44): rhwp::mcp_serve::run_cli_tool has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 9 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_serve.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"252365c85dbf1e1331f249dbaf36dd0dfcb94ce5b277a7b394584c69e858c1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1058::probes::repro_1058_footnote_insert::main (cognitive 44): rhwp::mydocs::tech::investigations::issue-1058::probes::repro_1058_footnote_insert::main has cognitive complexity 44 (threshold 15). Drivers by points: if/else 6 (30 pts), loops 6 (12 pts), boolean chains 1, match/switch 1 (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":"mydocs/tech/investigations/issue-1058/probes/repro_1058_footnote_insert.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"382298b5cf1d9bd6d69ce35165b92974653bb0b7f31c9020386fd056c356c811"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::content::parse_content_hpf (cognitive 44): rhwp::parser::hwpx::content::parse_content_hpf has cognitive complexity 44 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (11 pts), match/switch 3 (10 pts), boolean chains 6 (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":"src/parser/hwpx/content.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac096372341bd015ceaa65cd486dcf66d8e4941482588d3418fadeea511d1a35"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::recognition::validate_table (cognitive 44): rhwp::parser::pdf::recognition::validate_table has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (10 pts), boolean chains 9 (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":"src/parser/pdf/recognition.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cd36d1dd9bff2517fd05683a7e5fd9f0f475c52fe10a753df4f22f77c8fb67"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_hierarchy::compose (cognitive 44): rhwp::parser::pdf::table_hierarchy::compose has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 8 (11 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799206cbe520f619028fed75077bc1d6d8698a33d9676e44e23061bbc335672"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_next_page_placement (cognitive 44): rhwp::renderer::float_placement::stored_table_next_page_placement has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 13, loops 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":"src/renderer/float_placement.rs"},"region":{"startLine":5724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31686d0136eac0cab4c0bf8c48ba27653057d5e15ccfadc1486af0eaf16d783"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::extend_clipped_cell_horizontal_clip_to_nested_table_borders (cognitive 44): rhwp::renderer::layout::table_layout::extend_clipped_cell_horizontal_clip_to_nested_table_borders has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 3 (7 pts), boolean chains 5 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"45018f909185a16872faa5ac01be9b82f740181ab1a5c763515eaa8a97e2ecb5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage (cognitive 44): rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7ce305b829a3586a1c1b14505d58c5d7704b51129b94f082a456798cd7fce7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow (cognitive 44): rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 23, if/else 12 (15 pts), match/switch 4, loops 2 (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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69aa51eab62e815409ed33cdbb13e4b68372c5460550b6a45546759c1b31e80"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::table::fit_measured_for_host_with_storage (cognitive 44): rhwp::renderer::typeset::table::fit_measured_for_host_with_storage has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 14, 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":"src/renderer/typeset/table.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135487fadde84e4e6c2d33b8009f95f1cc2c07838315cce4bb4f4550480856c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::table::host_spacing::resolve (cognitive 44): rhwp::renderer::typeset::table::host_spacing::resolve has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 21 (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":"src/renderer/typeset/table/host_spacing.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"420f819e757c29b73a93b8c2e058122261ef75335ff2abf3bab25f27221d74b8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::diff_paragraph_linesegs_with_axis (cognitive 44): rhwp::serializer::hwpx::roundtrip::diff_paragraph_linesegs_with_axis has cognitive complexity 44 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 26). 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"da46ece98a22e6e2c90a776dc02973edfde91ae78905dc61ce97d296ca302628"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.validate_session (cognitive 44): agent_session.validate_session has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 10, 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":"gym/tools/agent_session.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c484904568192b05205a6b2c2c7ef628728ae7e18b398146e6e63a345ca28e"}},{"ruleId":"D2","level":"warning","message":{"text":"trajectory.validate_report (cognitive 44): trajectory.validate_report has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 7, loops 2 (4 pts), ternaries 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":"gym/tools/trajectory.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff5969f71b3343851282e710480eef34c948f9ea5f4dce8a17b1316f995c16"}},{"ruleId":"D2","level":"warning","message":{"text":"background.extractPrvImageFromZip (cognitive 44): background.extractPrvImageFromZip has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 8, error handling 1 (4 pts), loops 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":"rhwp-safari/src/background.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8b2919dfc84b33d8d7af40cdc0282168ce1475ea571d4caf1c6cf5d6c7e0d5"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareInsert (cognitive 44): write-tools.prepareInsert has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (21 pts), ternaries 9 (14 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 14). Most of this is not in the body itself: 5 of the 44 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1023, 1000, 1031). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3aee553b945071fd2a387828901c66a4c09acddcb1bdbac9a76e26d99c5f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.isStaticSvgAttributeSupported (cognitive 44): static-svg-path-layers.isStaticSvgAttributeSupported has cognitive complexity 44 (threshold 15). Drivers by points: if/else 32, boolean chains 10, ternaries 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"970dbe0d15a9e64ba3ad7ab94d9a73a9b3c722f537f6d0480a21131a78686395"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paste_html_at_caret_native (cognitive 43): DocumentCore::paste_html_at_caret_native has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 7 (13 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1263b8c96bb6adfa0a1db9ed75bf6a6e29adb514ff5e860e780fef1a34008c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_common_obj_attr_from_json (cognitive 43): DocumentCore::apply_common_obj_attr_from_json has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27 (31 pts), match/switch 6 (12 pts) (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":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"024133733ca0def102d9c87644ea2dd44ab9ec09eaec8b6b1e86fd85d1df49c1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_pages_for_cell_position (cognitive 43): DocumentCore::find_pages_for_cell_position has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (14 pts), match/switch 2 (6 pts), boolean chains 2 (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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6189}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cb552e5eb4ced60e1fe353d6a8b46d1419387b30c7417389693f5415c0e47b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_page_flow_image_ops_native (cognitive 43): DocumentCore::get_page_flow_image_ops_native has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18bd028b085a08a9a9606a3554cf9bea20ffb9e54d7c3b531697de08fc5d4f7"}},{"ruleId":"D2","level":"warning","message":{"text":"CharShapeMods::apply_to (cognitive 43): CharShapeMods::apply_to has cognitive complexity 43 (threshold 15). Drivers by points: if/else 36 (41 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c3f4293f14cf4f581895d18cbf5122a7e3d715ea2455ffaf4b8beb31a240d1"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_eqalign (cognitive 43): EqParser::parse_eqalign has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 3 (8 pts), boolean chains 4 (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":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fe526929fc5995de701d0efa0e25234e2169d7070839801737ad4624b803ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::next_token (cognitive 43): Tokenizer::next_token has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (29 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (2 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":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c5b95d4f30b399d6b2e0bfcaeb9a5b7dd95b9ea9d10c74cc7c8f8a2485076"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_inline_picture_closing_row_height (cognitive 43): LayoutEngine::stored_inline_picture_closing_row_height has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 9, loops 4 (8 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":"src/renderer/layout/table_layout/stored_inline_closing_frame.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d55147077ca95e29eb9bbd41e28d518a8e874003526268ac054bb9630a177"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::scan_rowspan_block_step (cognitive 43): TypesetEngine::scan_rowspan_block_step has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (35 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":"src/renderer/typeset/table/scan/runner/block_step.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a36bd2b4bef8dcc74c7c6b2a2c75a4d2c0c22cd1caef3001c198afc916cf72"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_char_overlap (cognitive 43): WebCanvasRenderer::draw_char_overlap has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3c6c9d55a6cd5886c691f0a5a29baddea358500966ae3ae9b5f705cb0f36b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text (cognitive 43): rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 10 (24 pts), if/else 9 (18 pts), loops 1 (nesting depth added 23). 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e422e5c5024f701ec4182ea31090f5968685230964a23dc2258617d5db93a3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf (cognitive 43): rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 9 (22 pts), if/else 11 (20 pts), loops 1 (nesting depth added 22). 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"11835f384e7f03eb8bef797c38824aec459cd629c89dd1f8882a6a8da323691e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_insert_image (cognitive 43): rhwp::cli::commands::edit::media::edit_insert_image has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (29 pts), match/switch 8 (11 pts), boolean chains 2, loops 1 (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":"src/cli/commands/edit/media.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9994cfeea4bf14939e31684e49234e352a7b4a4a6469cadf8af81c43222f7428"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::writer::otsl::write_table (cognitive 43): rhwp::doclang::writer::otsl::write_table has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 5 (9 pts), match/switch 2 (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":"src/doclang/writer/otsl.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec56ae1c9249a59f42060124d3da5372a891d805d6f6bff0efac378d9225552"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::fixup_hwp3_outline_fields (cognitive 43): rhwp::parser::hwp3::fixup_hwp3_outline_fields has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 6 (11 pts), boolean chains 1 (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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9118ee6220f48901dcf4bddea630276006368073a8f0092829e3dfb8418f16c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::tracked_changes::project_content (cognitive 43): rhwp::parser::hwpx::tracked_changes::project_content has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (40 pts), boolean chains 2, loops 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/tracked_changes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab7b7a0248363e49ce1d329e948f22da35fd05e89604613a7dd42717744b18d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage (cognitive 43): rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 8, match/switch 3 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"54668f4df687d57cf98212f24c0bffbe5b30eb668eea1a11b95ba85622be729a"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.resolve_token (cognitive 43): agent_session.resolve_token has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (32 pts), error handling 1 (6 pts), boolean chains 4, loops 1 (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":"gym/tools/agent_session.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9508b150b0b701f0a803c58db8eecc2c8b89b2e80635602cc5963df65e5c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"action-runtime.tokens (cognitive 43): action-runtime.tokens has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56525ba0283d730de4c0fea130183bcd4c0ce20e4c1d8319205bb3374534d03"}},{"ruleId":"D2","level":"warning","message":{"text":"onmessage (cognitive 43): onmessage has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 11, ternaries 3 (5 pts), other 4, error handling 1, match/switch 1 (nesting depth added 11). None of this is in the body itself: all 43 points belong to 2 function literals inside it that branch (lines 14, 45). 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":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ce64548c7e116fd3198be3303a6ad4349848fe423de0b1fc0692dce5ab50b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalogue::build (cognitive 42): Catalogue::build has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 3, loops 2 (3 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":"src/paint/metafile_print/catalog.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a366d15797b8b17b7439f8778222ddd056e95418a4a1d93b16de534e86df2bad"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_picture_full (cognitive 42): LayoutEngine::layout_picture_full has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (24 pts), match/switch 7 (13 pts), boolean chains 5 (nesting depth added 11). 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"835993253bdbed850ae19c3aad16675cdbcfd519e428ee689a64ff9113a7f663"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_cell_reset_closes_body (cognitive 42): LayoutEngine::stored_cell_reset_closes_body has cognitive complexity 42 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 12 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01fda816c6af6bbff2d01409aafb853649adcce34708886e335ab0336945335"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell (cognitive 42): rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 11 (28 pts), if/else 8 (13 pts), loops 1 (nesting depth added 22). 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bdcde0cf8afcdcefbfc3b4e23a2fd4b99d6549843f75c40f88ad618572d9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::doclang::export_doclang (cognitive 42): rhwp::cli::outputs::doclang::export_doclang has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 4 (5 pts), loops 2 (4 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":"src/cli/outputs/doclang.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"900adb6287cda3b82ef75d299819c91752f8433d8a462ccc190853757269cfe9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::ole_chart::legacy_combo_renderer::render (cognitive 42): rhwp::ole_chart::legacy_combo_renderer::render has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 7 (10 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":"src/ole_chart/legacy_combo_renderer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f2326f2ff571663894b5432e83660f9f3f04c2b024c977f5cecfef72ba416c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::pdf::issue7998::local-regions::generate_sources::main (cognitive 42): rhwp::pdf::issue7998::local-regions::generate_sources::main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (11 pts), match/switch 2 (8 pts), boolean chains 6 (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":"pdf/issue7998/local-regions/generate_sources.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca09e9b8270570cccc2e07249ae6d3f04bd9117268968eebb8af8049951ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::cell_grid::place_line_runs (cognitive 42): rhwp::renderer::cell_grid::place_line_runs has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 6 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/cell_grid.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea8d481c3deb93854e0cf03e051e8f0e84f7ee7a17e1bcb86613c2d8104efc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::recalculate_section_vpos (cognitive 42): rhwp::renderer::composer::line_breaking::recalculate_section_vpos has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 9, match/switch 3 (5 pts), 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":6674}}}],"partialFingerprints":{"codehealthFindingId/v1":"889454a31ec6a5755461232f23f85f17dadccdc76e248f537cf70ba83af60716"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage (cognitive 42): rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 9, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"43decf40c1a2eb51027abb49037d51e312f3912ecef25aca23c77d6ab3291b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::extract_tab_leaders_with_extended (cognitive 42): rhwp::renderer::layout::text_measurement::extract_tab_leaders_with_extended has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 6, 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b109a11edcd0203c452b53aa17d1a29a243f7b8156999a5cacfc7ede86d27d96"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::static_svg_raster::prepare_static_svg_raster (cognitive 42): rhwp::renderer::static_svg_raster::prepare_static_svg_raster has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (6 pts), match/switch 3 (6 pts), boolean chains 5 (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":"src/renderer/static_svg_raster.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd42b5223f8b9c7cd9e58a79c0f7e63313993a7b3536869b1f1fbc47ffdc3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_footnote_reset_fragments (cognitive 42): rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_footnote_reset_fragments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 10, loops 3 (4 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":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe180ea508c0a8ca29409f1bae849c7ec1c154052283d65aa33ad99a588469c2"}},{"ruleId":"D2","level":"warning","message":{"text":"authority_ledger.classify_authority (cognitive 42): authority_ledger.classify_authority has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 9, loops 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/authority_ledger.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5518863a579789ba463dbab6d26e053f198bab7d7d42c8638be5a987ea8d0bef"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard.render_markdown (cognitive 42): leaderboard.render_markdown has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 4 (8 pts), loops 4 (7 pts), boolean chains 6 (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":"gym/tools/leaderboard.py"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"47864442cc9fc838399a0bfef32eead88fdfc5ccf3994da626b641be58a5a8a4"}},{"ruleId":"D2","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImageFromZipAsync (cognitive 42): thumbnail-extractor.extractPrvImageFromZipAsync has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b2bee53d66245c0efba8a3847878d0ad6d3070c836aa033c843ed0be9394b"}},{"ruleId":"D2","level":"warning","message":{"text":"thumbnail-extractor.extractPrvImageFromZipAsync (cognitive 42): thumbnail-extractor.extractPrvImageFromZipAsync has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa99c07e3a76e98045a0f23f29038c7c552e9e8ab5691a30b78bc96845ebdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.makeSurface (cognitive 42): CanvasKitLayerRenderer.makeSurface has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 8, ternaries 4 (5 pts), error handling 2 (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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded09ebb56b5fb51bdb27cf8e304e2843c3243a6f69eabd54045d0e9680e7d45"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawPatternFill (cognitive 42): CanvasKitLayerRenderer.drawPatternFill has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 7 (36 pts), loops 2 (3 pts), boolean chains 2, if/else 1 (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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9710cc62f920d46ca91fdba9c7388646ebce09e70629714cbe1648fb858fe84"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.renderCanvas (cognitive 42): CanvasView.renderCanvas has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 8, ternaries 3 (5 pts), error handling 1 (nesting depth added 13). Of this number, 32 points are the body\u0027s own statements and 10 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d5071559ae2025820a403c1ed3f794aafebc6cb961990a12b37df88968bc8a"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplyCharFormatCommand.executeFormat (cognitive 42): ApplyCharFormatCommand.executeFormat has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (21 pts), error handling 4 (8 pts), loops 4 (6 pts), ternaries 4 (6 pts), boolean chains 1 (nesting depth added 16). Of this number, 32 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a7f5e4f3de0f8fdd4a7cfacf7758c8a505ec019f161853953a22530da90f6"}},{"ruleId":"D2","level":"warning","message":{"text":"SetCellBorderFillCommand.execute (cognitive 42): SetCellBorderFillCommand.execute has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 3 (8 pts), error handling 2 (3 pts) (nesting depth added 24). Most of this is not in the body itself: 13 of the 42 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2667, 2663). 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"81358680d5ebddfa50fe198df288be98793862d3ea712e940186a26779399f59"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.deleteSelectedCellBlock (cognitive 42): InputHandler.deleteSelectedCellBlock has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 13, loops 2 (4 pts), ternaries 1 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 24 belong to 2 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f9e3ded3d719a16a7c76b4de3cecbe44ac96f6bacede0b3e5c82c12090803"}},{"ruleId":"D2","level":"warning","message":{"text":"TableCellPropsDialog.onConfirm (cognitive 42): TableCellPropsDialog.onConfirm has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 23, if/else 15 (17 pts), ternaries 2 (nesting depth added 2). 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5ea1fa9ebd705c440da1e39d0d8df2ff24721f05801e65b20bfe397280574f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::project_container_float_bands (cognitive 41): DocumentCore::project_container_float_bands has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 5 (14 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 26). 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":"src/document_core/commands/document.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b2dbb1361ad4a77bafd4373a589484ee0c14f2b91500f73e725e2a5aba9373"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit (cognitive 41): DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 20). 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit, DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98ee5b36b290c8fbcd739f49ee76fcc23b9b1947b5f443cf141827431715be6"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_native::collect_runs (cognitive 41): DocumentCore::hit_test_native::collect_runs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (DocumentCore::hit_test_native, DocumentCore::hit_test_native::collect_body_inline_image_hits) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f98f9d1c06a4b0194f39a7b3c628f1df76db880484678f70d15a74b4988bb"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calculate_shape_reserved_heights (cognitive 41): LayoutEngine::calculate_shape_reserved_heights has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 5 (11 pts), 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5027}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d38f5aa2baffa78545a79a907c2e9972d077b9582f35634f69f319fce9d3335"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::saved_block_reset_opening_frame_height (cognitive 41): LayoutEngine::saved_block_reset_opening_frame_height has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 10, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21367}}}],"partialFingerprints":{"codehealthFindingId/v1":"10316930bf06b47202e9f566720da4f041239fab0aa9349506c0561b524c35ca"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_insert_text_in_cell (cognitive 41): rhwp::cli::commands::edit::cells::edit_insert_text_in_cell has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 11 (28 pts), if/else 7 (12 pts), loops 1 (nesting depth added 22). 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"53440b69ad4bd80c303f9313ca1b5b047d64819c8b72d3ad1d2c4f243f50399d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text (cognitive 41): rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 10 (19 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df3d58bde420f7e6abe03c5179d5948d7a03108bc1a2bb0401cc7970ab4060"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::bundle::cmd_bundle_export (cognitive 41): rhwp::cli::protocol::exchange::bundle::cmd_bundle_export has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 8 (14 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"59129ad9ffaab6c84157919493ac60f7dca55731fbbd7e62c5a7023d2c4a8c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::bench::run (cognitive 41): rhwp::diagnostics::bench::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 4 (10 pts), loops 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":"src/diagnostics/bench.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e554a920f07c02c2fc69390a8ffbdbff6b1388c4078b11ce35127f975d31a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::pr::assets::issue_536_seo_rii_20261021::consumer_probe::main (cognitive 41): rhwp::mydocs::pr::assets::issue_536_seo_rii_20261021::consumer_probe::main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 7 (19 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":"mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d9117d48f6068642036b27be773dbedbad14ee6890caff6462a3557a7cf9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::compute_char_positions_walk (cognitive 41): rhwp::renderer::layout::text_measurement::compute_char_positions_walk has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 2 (7 pts), match/switch 1 (4 pts), boolean chains 2 (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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d101a7e4e662adf58f49ba1915eb412b8d20ac727d8b021c13388fe99eeac"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::static_svg::static_svg_attribute_value (cognitive 41): rhwp::renderer::static_svg::static_svg_attribute_value has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 7 (15 pts), boolean chains 10 (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":"src/renderer/static_svg.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"086f46d650cce6b3b646a206b1f9fca75b75610cb093166fb7d74a78eb1af6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::order::for_paragraph_with_storage (cognitive 41): rhwp::renderer::typeset::controls::order::for_paragraph_with_storage has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 12, loops 2 (4 pts), match/switch 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":"src/renderer/typeset/controls/order.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe21b304b152f239d71f447f58c2ac82c2d52b7fe37b7cb48a9fe298a4046d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::scan::scan_lines (cognitive 41): rhwp::renderer::typeset::paragraph::scan::scan_lines has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 13, match/switch 1 (3 pts), 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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d041384149cf1dba6c60cbdcb9f7d3a309b5b29cbb6d35726a62db547f1bb162"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix (cognitive 41): rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 19, if/else 10 (16 pts), match/switch 3 (6 pts) (nesting depth added 9). 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":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4d6d29cafa83a2d4d76553ef3b3fda6c25aa744adc3f12bcc0c27ba1300faf"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.format_human_report (cognitive 41): audit.format_human_report has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (10 pts), boolean chains 8, ternaries 3 (6 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":"gym/tools/audit.py"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ec08f089577d5974036fb3f88d81a9b7f30c0ff43920ecdddb505e9b84e17"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.updateVisiblePages (cognitive 41): CanvasView.updateVisiblePages has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 8, loops 4 (6 pts), ternaries 5 (6 pts) (nesting depth added 9). Of this number, 38 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"054320ad465806b2b1d934b19019abd36268a444f434a4ac28b9b4a53b9dee47"}},{"ruleId":"D2","level":"warning","message":{"text":"page-scroll-probe.installPageScrollProbe::observe (cognitive 41): page-scroll-probe.installPageScrollProbe::observe has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, ternaries 4 (10 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a56bf3a63e6a44d93e5f98230ed8079c497c6d014702a7c3f0febd4f6ffa7"}},{"ruleId":"D2","level":"warning","message":{"text":"runAgentTask (cognitive 41): runAgentTask has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (31 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 1, other 1 (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":"rhwp-desk/ui/js/agent.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1daf93e854db6bcc0bb924307e39f175f4b5d6be23cb617422989a036fd30b"}},{"ruleId":"D2","level":"warning","message":{"text":"Proof::complete (cognitive 40): Proof::complete has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 5 (9 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e82d151db284c09f8883c8fde47e1b02031aadbc373610436bf8791e8f433e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::drain (cognitive 40): Scan::drain has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (7 pts), match/switch 2 (6 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":"src/document_core/commands/paragraph_block/validation/resources.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4008fc90f71721bf6b92a86a09a1ac7a6f07027c3a5febb33d51189c62811d38"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::number_paragraph_endnotes (cognitive 40): DocumentCore::number_paragraph_endnotes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 4 (21 pts), loops 5 (16 pts), match/switch 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c485c67224ecc783d450b33e529c224e27d4a71a5abf6790e71d63ac8a362098"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit (cognitive 40): DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 6, loops 4 (6 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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::collect_text_caret_stops, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a00836b87e9a5e412a8ad68880e96a71601ddad3a83298fb1f71c50a6aa3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_control_lock (cognitive 40): DocumentCore::set_control_lock has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 4 (7 pts), match/switch 2 (5 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6f01097a88639c986686c9ba67eaf3ec57414c6417d3090e7d96842c871906"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_control_z_order_at (cognitive 40): DocumentCore::set_control_z_order_at has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 5, loops 3 (4 pts), match/switch 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe7a99905ffac1b36e151f37d022491c39aa6d4d665da11724a8d294dd12223"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::page_dump_section_ctx (cognitive 40): DocumentCore::page_dump_section_ctx has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 8 (15 pts), match/switch 1 (4 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f312528ea748577619f0407a674a235d420bfd64802cfb93ca1bd1507ec82"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::observe (cognitive 40): Ledger::observe has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 8 (12 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83b49d4893401275aaca0acd69c25591ea5b9318bfc5127077d4b8ad90098b0"}},{"ruleId":"D2","level":"warning","message":{"text":"KerningParagraphBreakSession::boundary_width (cognitive 40): KerningParagraphBreakSession::boundary_width has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (14 pts), boolean chains 6 (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":"src/renderer/kerning.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"34181d4bea9205f4bcf13bcf3720fd131e2982723efb0fcc8eba1eb8804e74e6"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_wrap_around_paras (cognitive 40): LayoutEngine::layout_wrap_around_paras has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9, match/switch 3 (9 pts), 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":"src/renderer/layout/square_host_flow.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f2bd91d614c367465572f5873eee3e63c0bbae0a0a7b1a0aea49a0c5eee579"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calc_cell_remaining_content_height (cognitive 40): LayoutEngine::calc_cell_remaining_content_height has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 1, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726415853062da5c48eccd7414524e236a97828b6395aa109574789f7ecf8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::saved_first_frame_block_cut_fits (cognitive 40): LayoutEngine::saved_first_frame_block_cut_fits has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (32 pts), boolean chains 7, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25101}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c1f9a703ea6e6089aa03dd31cf8ed23353f74bf3285245b8755f6313f96557"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::vpos_snap_current_height_with_storage (cognitive 40): TypesetEngine::vpos_snap_current_height_with_storage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 17 (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":"src/renderer/typeset/section/vpos.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70619611555767e3679873351946e30650c0aadab4d2d6e44a72a2ec24e2067"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::query_whole_table_fit (cognitive 40): TypesetEngine::query_whole_table_fit has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 30, if/else 9, match/switch 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":"src/renderer/typeset/table/block/whole_fit.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7503cabbdbc8a6ce7945c46772938d8f1a5b8e4df765ead4c6707fa47e57c"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_path_with_gradient (cognitive 40): WebCanvasRenderer::draw_path_with_gradient has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 2 (4 pts), boolean chains 2, 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91f673d2dd74e753c112ee1986f8e7015560892096e9304ec5968854c92c7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::create_numbering (cognitive 40): HwpDocument::create_numbering has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 2 (8 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":"src/wasm_api.rs"},"region":{"startLine":8573}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd62eea8fd399b89726ba18df21bd7e0286b0624324cca8a709a15e8a8e16e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_insert_shape (cognitive 40): rhwp::cli::commands::edit::shapes::edit_insert_shape has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 10 (23 pts), if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc46dc6256d55faa35abb7a74801887175b187f6e828f5988cd9915e73bd4a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::text::export_llm (cognitive 40): rhwp::cli::outputs::text::export_llm has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 10 (23 pts), if/else 10 (14 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28ae0335b69b4ef142620cc13492458d09a20fe14e3d0e5dd1dc1835db5990d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::html_import::is_text_only_html (cognitive 40): rhwp::document_core::commands::html_import::is_text_only_html has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 7, match/switch 2 (5 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de982f1bc6696c056205420af837c01ed8748a9e8b11131bb56751a8f836f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::border_paint::encode_with_storage (cognitive 40): rhwp::model::border_paint::encode_with_storage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 5, match/switch 2 (3 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":"src/model/border_paint.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1fe995fa60acc1a3e497fe5c560ac0b37386c6dc4e5f433d15f8b1bb95377d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::parse_form_properties (cognitive 40): rhwp::parser::control::parse_form_properties has cognitive complexity 40 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 5 (12 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 19). 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":"src/parser/control.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df4d1b457b876326b69a69b452d0fa88acaee73a61fb585608141b543bcf3e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::inject_footnote_markers (cognitive 40): rhwp::renderer::composer::stored_tac_display::inc::inject_footnote_markers has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 4 (10 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":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e387b5f162950fd0777e1f233c58b96a30da42a374903143f2237fe72701344"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::kerning::measure_kerning_paragraph_segments (cognitive 40): rhwp::renderer::kerning::measure_kerning_paragraph_segments has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 6 (15 pts), boolean chains 4 (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":"src/renderer/kerning.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"309329acc5c3e34e9d0ef1803fdf5b8846008d8d7cd3ffe19297beb90ce81de9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::path (cognitive 40): rhwp::renderer::skia::glyph_replay::path has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 2 (5 pts), boolean chains 3, match/switch 2 (3 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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c63268509b4047634173381c2268a8fc19070178f0d2b4d9146922ee30e71"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::ladder_spacing_omitted_signature (cognitive 40): rhwp::renderer::typeset::ladder_spacing_omitted_signature has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 6, loops 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":"src/renderer/typeset.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"019e6475e766e61e0deeb6f629366df50f303a88b8e447557987c9ff7bf9a31b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::wrap_flow::place (cognitive 40): rhwp::renderer::typeset::controls::wrap_flow::place has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (34 pts), boolean chains 6 (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":"src/renderer/typeset/controls/wrap_flow.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362aaedcd19bd19003af03e6c96553ab489ed7d2dbd3e5e4bb9f2ac8928be05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_control_slot_with_storage (cognitive 40): rhwp::serializer::hwpx::section::render_control_slot_with_storage has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 7 (14 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"76564bdaadbc46362ac729c8a651314854b6a08a62e2256c75e77fc748562722"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_convert::bin::mock_rhwp::run (cognitive 40): batch_convert::bin::mock_rhwp::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (5 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/batch-convert/src/bin/mock_rhwp.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ece0c2143c6a7f28ca289480a424a4987b44baefcf28ba869f4081e3e555e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"authority_ledger.classify_baseline (cognitive 40): authority_ledger.classify_baseline has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 9, loops 2 (4 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":"gym/tools/authority_ledger.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"624d91c568c9c0d2b66a14ac50ea74113b9acf8ed80ffd70519fe6470d8ee5ee"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.fuzz (cognitive 40): fuzz_corpus.fuzz has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 5 (10 pts), loops 4 (7 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c6da466cfa160868b44f366e98879561ce4549c83df45d12719cdee08c9ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.refreshRenderSurfacePlan (cognitive 40): CanvasView.refreshRenderSurfacePlan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 8, ternaries 5 (8 pts), loops 3 (4 pts) (nesting depth added 13). Of this number, 36 points are the body\u0027s own statements and 4 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c981910f87d01d4bf1817e8dfe5074c593c710a385bb47b1b477f6b0d4f35"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotOptions (cognitive 40): snapshotOptions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 14, loops 4 (5 pts), ternaries 1 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 15 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a04635340e8b4d7ac2c8eb26bef1b2ebe38626b1affcdc19c7f4e44556c81c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::enter_paragraph (cognitive 39): DocumentCore::enter_paragraph has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (39 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52b62b41409f39eba7dc55780a49d2466bf93688d80569bebe968d18f1b3953"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::reflow_cut_content_height (cognitive 39): LayoutEngine::reflow_cut_content_height has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (33 pts), boolean chains 4, 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":"src/renderer/layout/table_layout/reflow_fragment_content.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"111fa8891878ca36dabd1beb7458f694e7d20df251a974e2acbe011c51ecea68"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::straddle_page_band_relief (cognitive 39): LayoutEngine::straddle_page_band_relief has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 10, 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":"src/renderer/layout/table_layout/rowspan_fragment_height.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cff61620b0aa84e3ea74783db502eba2fb54294437ab4404404f1989ef76a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_mixed_opening_frame (cognitive 39): LayoutEngine::stored_mixed_opening_frame has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 16, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"372cb7a47e780b99b4286f680fc02fa5aa2dc2d3689a4ce7e7ec6cede1683112"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::rowbreak_straddle_cut_units (cognitive 39): LayoutEngine::rowbreak_straddle_cut_units has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_span_content.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a623b304d2f16bf41429635399b82d2546522f9d940f506401d29d99ed4615"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf (cognitive 39): rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 9 (18 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b75b137afb66a69bbbd51ccf28d8b74b198211b42c04680609be744a27289"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::parse_redact_args (cognitive 39): rhwp::cli::commands::edit::privacy::parse_redact_args has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 3 (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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce62a5005b96265fc1acb8e2b5d2055e07c4816c3a8e2b63f297481124c02fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_split_cell_into (cognitive 39): rhwp::cli::commands::edit::tables::grid::edit_split_cell_into has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 11 (28 pts), if/else 5 (10 pts), loops 1 (nesting depth added 22). 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb52e10b2ddd423c3903a1cf48023e6b0a64c06ed87e6aad7cd90d775ed9b04"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::verification::run (cognitive 39): rhwp::cli::queries::verification::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 5 (8 pts), match/switch 5 (7 pts), boolean chains 1 (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":"src/cli/queries/verification.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4111f9f6b4e14604b5cde692cae667c36b8d428618f9ade0faf2d22af332c87"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::eqedit::lexer::lex (cognitive 39): rhwp::doclang::eqedit::lexer::lex has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (11 pts), boolean chains 2, match/switch 1 (2 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":"src/doclang/eqedit/lexer.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5044543bc1c5522b22d263536508896bd91e7168a866995750dd2a65c58d09"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering_metafile_resources::catalogue (cognitive 39): rhwp::document_core::queries::rendering_metafile_resources::catalogue has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 7 (17 pts), match/switch 1 (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":"src/document_core/queries/rendering_metafile_resources.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"278a1c51592f195dc25ba252b9f7bc41cc1d87613181f6df0542f3258b7f9ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::parse_pdf_with_request_and_progress (cognitive 39): rhwp::parser::pdf::parse_pdf_with_request_and_progress has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (10 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":"src/parser/pdf/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"524e0697c2536a006f35b1272946789ece0c724e5538dbd14f20e5e4b35ba5d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_span_opening::stored_span_opening_frame (cognitive 39): rhwp::renderer::float_placement::stored_span_opening::stored_span_opening_frame has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (8 pts), boolean chains 5 (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":"src/renderer/float_placement/stored_span_opening.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"48474cac40a23c8c2a817d5efa7ade975d598695c34606aa37f4f594bc86a015"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg_fragment::svg_text_font_usage (cognitive 39): rhwp::renderer::svg_fragment::svg_text_font_usage has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 1 (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":"src/renderer/svg_fragment.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ba28f8b5abf50eccd72355379af3d2738a3229bab9bd78ed248ea25659ad5c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::square_host_frame::stored_host_origin (cognitive 39): rhwp::renderer::typeset::controls::square_host_frame::stored_host_origin has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 9, loops 2 (3 pts), match/switch 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":"src/renderer/typeset/controls/square_host_frame.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22c3bdd10d1d8d269a2e3f25cf7ee082a172ccc9fb9ca8801d93d4a56489fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::doc_info::try_serialize_doc_info (cognitive 39): rhwp::serializer::doc_info::try_serialize_doc_info has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 10 (20 pts), loops 11 (12 pts), if/else 3 (6 pts), boolean chains 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":"src/serializer/doc_info.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed2b012cc7eb699d659ec3eef45ec198e4bde9a216d6ac61c73d44dfa3d1388"}},{"ruleId":"D2","level":"warning","message":{"text":"differential.validate_report (cognitive 39): differential.validate_report has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 6, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead4422ffb3bce34be281951383948d1c4ff482d78ddca41df2ea0face048ff"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_reference_steps (cognitive 39): pack_health.scan_reference_steps has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 5, loops 2 (4 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":"gym/tools/pack_health.py"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb90162e02e9ca9c51ea157be5ad973bc91b1d0bf234d2c36a21f515f2468785"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-loop.runAgent (cognitive 39): agent-loop.runAgent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 6 (14 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 20). Of this number, 36 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/ai/agent/agent-loop.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cd7947cde9c3a7ef8384ba4af8e4e450c571a36db1495232c8447b041d5428"}},{"ruleId":"D2","level":"warning","message":{"text":"office-clipboard-images.extractEmfDibs (cognitive 39): office-clipboard-images.extractEmfDibs has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 5 (17 pts), if/else 6 (14 pts), boolean chains 7, loops 1 (nesting depth added 20). 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"89be9b3d1ba1b7792d4bd56c30350a8594e2c582807bc4040e8fa89e6ff75ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.handleDelete (cognitive 39): input-handler-text.handleDelete has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 4 (9 pts), error handling 2 (3 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f8446248b593cf6a9d3e9f946d6bbac2e3236a044167b94b664fc085f9531"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_value_grid (cognitive 38): rhwp_ooxml_chart::renderer::render_value_grid has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6be9714c9b9d1d40595afa4135c494a7f12b04c746992f90f15b2b05b39865"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_in_header_footer_native (cognitive 38): DocumentCore::get_selection_rects_in_header_footer_native has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 6, loops 2 (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 12 belong to 3 function items 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5547}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fb198d96fd7682bdeee40ab9f88849b69245551b7a6647c27dd5bb7ebcc529"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::fix_context_text_positions (cognitive 38): DocumentCore::fix_context_text_positions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 1, match/switch 1 (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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efd7e09386d2ae7ba01ee4a49e438a05df42f045201afcfff31ce662e30a2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"FontGlyphLowerer::lower_portable_glyph_run (cognitive 38): FontGlyphLowerer::lower_portable_glyph_run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 6, 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":"src/paint/font_glyph.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3496a2f8bd6466d1f655ec99cec0bf0cdfd979d8e8f2923c9c8fa364d880f7"}},{"ruleId":"D2","level":"warning","message":{"text":"PageLayerTree::typed_text_v2_slots (cognitive 38): PageLayerTree::typed_text_v2_slots has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (17 pts), match/switch 4 (13 pts), if/else 2 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/text_v2_slots.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c2ce18f3c6e28585a62805271e81626a711d0e14290b392e5600b44b77a789"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::scan_textbox_overflow (cognitive 38): LayoutEngine::scan_textbox_overflow has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 5 (11 pts), loops 3 (4 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"8383983b27f27723d80de9e1b0356f2325c0a202c96cf33d5e3d932af74bc03d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::native_multirow_saved_reset_frame_cut (cognitive 38): LayoutEngine::native_multirow_saved_reset_frame_cut has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 23, if/else 12 (15 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0962c2a95a56f2c182e3566432790cbce4d57caa8cdf2bb3b42473b53ecee7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::native_intra_para_saved_reset_trailing_trim (cognitive 38): LayoutEngine::native_intra_para_saved_reset_trailing_trim has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 11 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b062baa0c6078099f76fcd2898106c9d747b26231d144e2db46282f6fed3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::query_new_note_fit (cognitive 38): TypesetEngine::query_new_note_fit has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 33, if/else 4, match/switch 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":"src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af568c963538c9888e1bc9271f3052ef4d7d5f30fb7da85efce05aa28385552"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_rect_with_gradient (cognitive 38): WebCanvasRenderer::draw_rect_with_gradient has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (38 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"566f26175e2ef4223aeace8d8f68074e646e80f0039ab9c1f432166305025c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell (cognitive 38): rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 7 (12 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9850639f4c5a9ce0829624ea6aedd6adbd718c5bc057351ce8ea0bbdb73996"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell (cognitive 38): rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 7 (12 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2616cbf49eb377cdf3b732602d132fc07d96da607a2dfd1bee29342b114f236f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_cell_style (cognitive 38): rhwp::cli::commands::edit::formatting::edit_apply_cell_style has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 7 (12 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f5ef23c4b2d6e3b5521e1ba8bc75111d9d8393cd285f525e66caba98d92cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_delete_header_footer (cognitive 38): rhwp::cli::commands::edit::header_footer_content::edit_delete_header_footer has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 6 (15 pts), loops 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"19508411b8f658321b4575bb94b1bfa82a4f84e3c1eef001423217206ede0f55"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_merge_paragraph_in_hf (cognitive 38): rhwp::cli::commands::edit::header_footer_content::edit_merge_paragraph_in_hf has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 9 (18 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f31e5a4e2c3cea58cc6892b3d994f5dc462f57cfed544f934b33e86430fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::bin_data_prune::visit_bin_data_refs (cognitive 38): rhwp::document_core::commands::bin_data_prune::visit_bin_data_refs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 7 (12 pts), match/switch 2 (3 pts) (nesting depth added 17). Most of this is not in the body itself: 4 of the 38 points are its own statements and the rest belongs to 4 function items inside it that branch (visit_shape, visit_controls, visit_drawing, \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":"src/document_core/commands/bin_data_prune.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"967c03feb2fd373d608a5cb3f0d08545b074f4dd56ed741abd5163f3d4ffc1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::table_csv::parse_csv (cognitive 38): rhwp::document_core::queries::table_csv::parse_csv has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (9 pts), loops 3 (7 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":"src/document_core/queries/table_csv.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"855d7468384e713326074f427a2041706824e573842065f46e34f8d7e85264bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-671::probes::inspect_task671_v2::main (cognitive 38): rhwp::mydocs::tech::investigations::issue-671::probes::inspect_task671_v2::main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 4 (12 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-671/probes/inspect_task671_v2.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe359fc58a2dc50e9292f8571e4c9df725cab7835952f3d6d986d2e96309f4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::font_glyph::decode_font_svg_glyph_payload (cognitive 38): rhwp::paint::font_glyph::decode_font_svg_glyph_payload has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (6 pts), match/switch 2 (4 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":"src/paint/font_glyph.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"997d988d996d552dff7f613e5be970e7caf20dca369bf5092f46f3f445a01c45"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::body::lower (cognitive 38): rhwp::parser::pdf::structured_lowering::body::lower has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 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":"src/parser/pdf/structured_lowering/body.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1586ce9cc5ee55aa8e0f9dae14e29dbaae4ede794fd87fb31d9d1fe289ebd4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::empty_faces::from_clip_scopes (cognitive 38): rhwp::parser::pdf::table_detection::cell_regions::empty_faces::from_clip_scopes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 7 (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":"src/parser/pdf/table_detection/cell_regions/empty_faces.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea4784d1ea1f0b7ac50076329c00f5b6e0780173c914a5fdfe8b83b882bc9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::body_text::try_serialize_section_inner (cognitive 38): rhwp::serializer::body_text::try_serialize_section_inner has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (8 pts), boolean chains 7, match/switch 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":"src/serializer/body_text.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"309edba3d8add7cde9bbb187b18cf8c8e80b683af4b59d96fa4146564d9c7c47"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::serialize_control (cognitive 38): rhwp::serializer::control::serialize_control has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (7 pts), match/switch 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":"src/serializer/control.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeacd9693df121e56f115b05913ae63782a4a8c68433aa7eca899f2b1b9a385"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard.verify_entry (cognitive 38): leaderboard.verify_entry has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 4 (7 pts), error handling 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":"gym/tools/leaderboard.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d77b561f17e8bb8f5fa28988394cbfe54f8527635c0f5270a5b933b799d328"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard._cmd_verify_body (cognitive 38): leaderboard._cmd_verify_body has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 8 (13 pts), boolean chains 7, error handling 1 (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":"gym/tools/leaderboard.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2068c2b0ea229872542f943ea9c1557aaa7666ca7b02021527f6a96c767920c"}},{"ruleId":"D2","level":"warning","message":{"text":"release_diff.validate_report (cognitive 38): release_diff.validate_report has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (35 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":"gym/tools/release_diff.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d355dc8ad89705e241de93b51a8a17da6c86f5388ad5b95000ded0ed5ddadce1"}},{"ruleId":"D2","level":"warning","message":{"text":"image-header.parseJpegHeader (cognitive 38): image-header.parseJpegHeader has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 11, loops 2 (3 pts), ternaries 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"003062b20edf254e1349ba4836046e8c3d27803f74765d2b5b5bf7e517463288"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.onCopy (cognitive 38): input-handler-keyboard.onCopy has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 4 (9 pts), boolean chains 3 (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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a23461af7c6e93683448b69f5e71cef7bbd254ad3b616093d10da33f241cca0"}},{"ruleId":"D2","level":"warning","message":{"text":"pick (cognitive 38): pick has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (7 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 14). Of this number, 20 points are the body\u0027s own statements and 18 belong to 7 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":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b5e6e9f39ddf4163c52017b427a212a8cd6de8804245754cf0a6a30c986b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::try_patch_cached_focused_cell_tail_line (cognitive 37): DocumentCore::try_patch_cached_focused_cell_tail_line has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 11, loops 3, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":7951}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1d01aee93e0f4583e544acfeef36eb668f11e34a9c15627f989a2c444fc0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::replay_numbering_page (cognitive 37): DocumentCore::replay_numbering_page has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (30 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 26). 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":8679}}}],"partialFingerprints":{"codehealthFindingId/v1":"0933462dca4c7f18cb793d148adf8a3baa7a8226a62eba942548776370af0a12"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::try_control_text_positions (cognitive 37): Paragraph::try_control_text_positions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 6 (9 pts), boolean chains 3, 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":"src/model/paragraph.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cde49837af017196e03571a8724886aa6c57fbdbb91e69c6b4b7f2f559a103"}},{"ruleId":"D2","level":"warning","message":{"text":"ParagraphMachine::feed (cognitive 37): ParagraphMachine::feed has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 16 (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":"src/parser/pdf/recognition.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"72697fd48d3673ae56cc59dd7de90f84ef51f2bd3fb1078f9d27928a0cc6661a"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_element_atom (cognitive 37): EqParser::parse_element_atom has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 6, match/switch 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":"src/renderer/equation/parser_atoms.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5780cbdba331168cf0e803a44b35bf222618ccbfcca4ebb65b9156c50c9ef0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedTextMeasurer::compute_char_positions_with_hft_tracking (cognitive 37): EmbeddedTextMeasurer::compute_char_positions_with_hft_tracking has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4 (12 pts), boolean chains 8, match/switch 1 (2 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"76544fbac386eeb64d033f06e8890798ed54dbd30ab2296aeb0887d7ae165307"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_nested_cut_outer_margin_extra (cognitive 37): LayoutEngine::stored_nested_cut_outer_margin_extra has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (24 pts), boolean chains 7, loops 2 (3 pts), 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":"src/renderer/layout/table_layout/stored_nested_outer_frame.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d91677d19f05ab9ffb71ee86d9528f1d5d60a2ebf117dabe6785d0e3851057"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_in_hf::run (cognitive 37): rhwp::bin::rhwp-q::kit::hit_in_hf::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 7 (15 pts), loops 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":"src/bin/rhwp-q/kit/hit_in_hf.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6cd71366571d4d8be77687401effc2c276918ecd9be7a9cb9153ea6daef8cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_column_def (cognitive 37): rhwp::cli::commands::edit::page::edit_set_column_def has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 9 (26 pts), if/else 5 (10 pts), loops 1 (nesting depth added 22). 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb68e7456c20d15d3ad5c385ddfcd593599f43ea081aa907c9419f6eb19876a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::plan::cmd_run_plan (cognitive 37): rhwp::cli::protocol::plan::cmd_run_plan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (13 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/mod.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0cb253cc3ecf22370a7177b0995034caf1dcfa6c9819a45fd849e5ca49d063"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::text_width_probe::run (cognitive 37): rhwp::diagnostics::text_width_probe::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2, match/switch 1 (2 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":"src/diagnostics/text_width_probe.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c4650bdf502851d2b168e74d42e2e00b79ca45221315d907994742a82cb56a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::doc_tree_nav::resolve_paragraphs (cognitive 37): rhwp::document_core::queries::doc_tree_nav::resolve_paragraphs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (34 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e451aed62fe3dbd187f8a6f5e08ac0e4219baf6dff76ae28e5d12f5567b4249d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::hwpctrl_sets::collect_controls (cognitive 37): rhwp::document_core::queries::hwpctrl_sets::collect_controls has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 21). 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"475afa1139696e80bbfccafb7509bf48c4b315a4590c16e882498671a6351daf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_print::text::prepare (cognitive 37): rhwp::paint::metafile_print::text::prepare has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 3 (6 pts), boolean chains 4, match/switch 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":"src/paint/metafile_print/text.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e672fcd9568e24608b0c2253c4118de9aa174460ab3e37e565744b3e3bc6e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_gso_control (cognitive 37): rhwp::parser::control::shape::parse_gso_control has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 3 (6 pts), boolean chains 3, 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":"src/parser/control/shape.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d050cdd6fb39929fbf1971e1a4386365f18fe0353170280305b879c1b024e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::stored_tac_lines (cognitive 37): rhwp::renderer::composer::stored_tac_display::inc::stored_tac_lines has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (15 pts), match/switch 2 (4 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":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"866319e67630687bc410fed3ea66accc90330c2eb463fd50cb41a21e18f75e46"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_paragraph::eligible_segments (cognitive 37): rhwp::renderer::shaping_paragraph::eligible_segments has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (28 pts), loops 4 (5 pts), boolean chains 4 (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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626b6b539a5baf03eefcb69a8c2d63224fa6fb752980ef9fda99329840b210d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::refresh_source_program_projection_slots_with_storage (cognitive 37): rhwp::renderer::style_resolver::refresh_source_program_projection_slots_with_storage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 4 (6 pts), boolean chains 5 (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":"src/renderer/style_resolver.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7755739cb9ccd771c610bd811aebaf8b7c3cdd80138d786238f0d637151f6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare_computed (cognitive 37): rhwp::renderer::typeset::controls::stored_tac::prepare_computed has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 17, if/else 16 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 2). 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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8589c20c195c4e467601312d563e66040c9be31886c6c6adbefe0adfeaeadc4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::package_check::check_master_pages (cognitive 37): rhwp::serializer::hwpx::package_check::check_master_pages has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (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":"src/serializer/hwpx/package_check.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b83d69d478cfacce91d28c0409056afd3f7c6918322b4f3369460a9f85d49d"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._role_statuses (cognitive 37): evidence_report._role_statuses has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 8 (10 pts), boolean chains 6, loops 2 (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":"gym/tools/evidence_report.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd7587803642a7c541f06a47cb12c564338562fa612ba2601d35eae33b4db6e"}},{"ruleId":"D2","level":"warning","message":{"text":"action-runtime.evaluateFormAction.expression (cognitive 37): action-runtime.evaluateFormAction.expression has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), ternaries 3 (8 pts), boolean chains 6, match/switch 1 (2 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1552f73b512ce019366db3a792ca53df8f5708810db1b63366d70775dd2c80"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.matchWindowedGreedy (cognitive 37): diff-engine.matchWindowedGreedy has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 16). Of this number, 29 points are the body\u0027s own statements and 8 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf52b3123bbfc137fe22d332fa6f355a2d5134ae9f075a9ea441ee46128aca"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.normalizeLocalFontRecords (cognitive 37): local-fonts.normalizeLocalFontRecords has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 7, if/else 4 (7 pts), loops 1 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67e2d6acb0d9910a6dd027e94e486e9b65ba74045fec1d4fb7ccf4197984a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerResourceStore.hydrate (cognitive 37): LayerResourceStore.hydrate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 29, resolve, a function literal at line 54). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/layer-resource-store.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f12c20eb10b685b0d39b52bb29bd8597218a56388257f211a9d5a0c8fa4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"text-v2-normalizer.normalizeTextV2Tree::expand (cognitive 37): text-v2-normalizer.normalizeTextV2Tree::expand has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"137c2d0af61f714ef469afc2c3cc17039c680b82a2fcac673e3ddf9d69535d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageOp::drawImage (cognitive 37): CanvasKitLayerRenderer.drawImageOp::drawImage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 13, error handling 1 (4 pts), ternaries 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.drawImageOp) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c25059a091aab8e7f6bf98ccc9e0893a20b061a0bab4af367731925bcc1be1"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.overwrittenTextAt (cognitive 37): input-handler-text.overwrittenTextAt has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 9, loops 2, error handling 1, ternaries 1 (nesting depth added 11). Of this number, 34 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e0f677215cc0b2011fba89ac3c224292cf7c63dc2228c2542074579ea7a40a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::replace_text_in_cell_field_impl (cognitive 36): DocumentCore::replace_text_in_cell_field_impl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 10, 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0934cc29242e48c958e1d4875bfb1ff4e3ee71033ca6a36d155e2f80b1edf6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_nearest_control_backward_native (cognitive 36): DocumentCore::find_nearest_control_backward_native has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (8 pts), match/switch 1 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 14 belong to 3 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. This shape REPEATS in the file: one other method here (DocumentCore::find_nearest_control_forward_native) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5672}}}],"partialFingerprints":{"codehealthFindingId/v1":"169acbdcd28bc8c10706c470e57772df99c5669975b9c16f29a9ada72e11af6c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_nearest_control_forward_native (cognitive 36): DocumentCore::find_nearest_control_forward_native has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (8 pts), match/switch 1 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 14 belong to 3 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. This shape REPEATS in the file: one other method here (DocumentCore::find_nearest_control_backward_native) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5765}}}],"partialFingerprints":{"codehealthFindingId/v1":"428a411bc40711adcca2298dacaa60b2c0cb488150ada3b2481ef0ea283837e8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_page_border_fill_native (cognitive 36): DocumentCore::set_page_border_fill_native has cognitive complexity 36 (threshold 15). Drivers by points: if/else 27 (32 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":3721}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9908461be02258de0081d1d7c87ef18e815402128f3c5bff4adb4d76d59cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotWalk::paragraph (cognitive 36): SnapshotWalk::paragraph has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (9 pts), match/switch 1 (2 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":"src/native_host/accessibility.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2d7082ce4d0104faefe594f0392760902dd41467502b9db195a15c46c7e073"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightMeasurer::cell_nested_controls_bottom_with_storage (cognitive 36): HeightMeasurer::cell_nested_controls_bottom_with_storage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 5, match/switch 1 (2 pts), loops 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e2b2674b571fd2dc95bef3988ad401d8c153cf838bb5454b3790607a616087"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightMeasurer::measure_section_selective_with_storage (cognitive 36): HeightMeasurer::measure_section_selective_with_storage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 3 (7 pts), match/switch 1 (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":"src/renderer/height_measurer.rs"},"region":{"startLine":6311}}}],"partialFingerprints":{"codehealthFindingId/v1":"af92eaea042f8ed5b434863adc0f9f80f9e6a468ca9c39325e4ce93ede66bcde"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_plain_paragraph_contract (cognitive 36): LayoutEngine::row_cut_plain_paragraph_contract has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 12, 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":"src/renderer/layout/table_paragraph_cut.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9da5875674ad90c6f043658269971aaf546d22d3397cd1a4be8c34fda941a41"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::render_page_background_image (cognitive 36): SvgRenderer::render_page_background_image has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (21 pts), match/switch 6 (11 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9f3e96beb0932f0834cac965d8126c8ef953ecdbf20b3475ab0c91f435b6af"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_page_background (cognitive 36): WebCanvasRenderer::render_page_background has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 1 (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":"src/renderer/web_canvas.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9223886e7c5ea69b356dbedb1910b82511f0075a5eff2be4277ffac08d597e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer (cognitive 36): rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 6 (15 pts), loops 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04ddf92d507814352174287b3b0d80ef3010852352a4b65497c51309d2f0d58"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::document_io::strip_global_auth_options (cognitive 36): rhwp::cli::document_io::strip_global_auth_options has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 5, match/switch 1 (2 pts), 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":"src/cli/document_io.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5f52c60b2ac502e248161eb481ff6a7e7bd971f15054ea0316a721f316eab8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::adapter::geometry_pass::walk (cognitive 36): rhwp::doclang::adapter::geometry_pass::walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 5, loops 1, match/switch 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":"src/doclang/adapter/geometry_pass.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8ebf6ccc5bcf75d20a5a0e93fb70c273db1b84de950878e8b266035a7692bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::eps::raster_to_png (cognitive 36): rhwp::eps::raster_to_png has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (10 pts), match/switch 2 (5 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":"src/eps.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"6818394f4d785857c537734d3e95f346f418c72ff19a83b26a48c94466018bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::table_row_grid::projection_with_storage (cognitive 36): rhwp::model::table_row_grid::projection_with_storage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 8 (13 pts), boolean chains 3 (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":"src/model/table_row_grid.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5671073fe944d4f1842c28bbe684888d6894a45a73e3b4c989f216e143fca4a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_equation (cognitive 36): rhwp::parser::hwpx::section::parse_equation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 4 (12 pts), loops 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8649d18e824a1333bfc0a5ad8255118f1779615d1a78b4b95d9a293b0b78a524"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::preserve_context_resolved_runs_with_storage (cognitive 36): rhwp::renderer::composer::stored_cell_reflow::inc::preserve_context_resolved_runs_with_storage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (12 pts), boolean chains 5 (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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5613de36dc52de7e599459bc0e31907b26d84ba8717269b05469e2b6bd3565b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_run_reject_reasons (cognitive 36): rhwp::renderer::layer_renderer::collect_glyph_run_reject_reasons has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 12, 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":"src/renderer/layer_renderer.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d61073565d714fbf09fd663cee40971947ffcaab710ed17cd4f39d7b27d16d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::stored_page_square_preserves_source_origin (cognitive 36): rhwp::renderer::layout::stored_page_square_preserves_source_origin has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 10, loops 3 (5 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":"src/renderer/layout.rs"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc36d17426637d405b0ee8df2fdf5a1d543f3485c64ac8f9de27d658adb63a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::cache::inline_resource_estimate (cognitive 36): rhwp::renderer::skia::cache::inline_resource_estimate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (26 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/cache.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"103c37d41be4fdb1e0e4bc0bbab02ed94e5ade0d2f0eb916ded747646e7dff59"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.render_report (cognitive 36): competitive_bench.render_report has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 8 (10 pts), boolean chains 6, ternaries 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":"gym/tools/competitive_bench.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a956a1286b429e23c754691c97693ed645cd637e31f147419deaadbb4114e7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_positive (cognitive 36): evidence_report._validate_positive has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 12, loops 2, 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":"gym/tools/evidence_report.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad19d5e7e12c96ac2dc0bd2f7fafde749ddb786eb53964a4b0668583eb6b1e64"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect-hwp.inspect (cognitive 36): inspect-hwp.inspect has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (7 pts), boolean chains 4, ternaries 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":"mydocs/pr/assets/chrisryugj_20261031/inspect-hwp.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b33245d27c6f70a2f4b55b217dc59a0a65018fcb554c0982a8a89f1355f21b2"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.fontDecisionEvidence (cognitive 36): CanvasKitLayerRenderer.fontDecisionEvidence has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 11 (17 pts), boolean chains 11, if/else 7 (8 pts) (nesting depth added 7). Of this number, 32 points are the body\u0027s own statements and 4 belong to 3 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"357d1f61eeeabb5c1ed04648fd1c3dff17387af516999ef49c11f75af744013e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure (cognitive 35): rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 6, match/switch 3 (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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea408c36a9c64a0a4ff178c371553baa915668adce872704c89a8afc1fcfcaf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_of_pie (cognitive 35): rhwp_ooxml_chart::renderer::render_of_pie has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (10 pts), match/switch 4 (5 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb66936beabbedb3f5dd91b51d4ab05b024af3d2b496be85f351695e22ad6f8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::css_to_para_shape_id (cognitive 35): DocumentCore::css_to_para_shape_id has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (29 pts), match/switch 2 (3 pts), boolean chains 2, 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbfc5baccb3b3649813394158602c8a481c561252d44e5423dff35114d32d1c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::delete_text_in_cell_native_impl (cognitive 35): DocumentCore::delete_text_in_cell_native_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 10, 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e7dad2cf751532fece745a20161f4cb71c3fc1115d2df060ff2d4589cab117"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_field_hit_for_guide (cognitive 35): DocumentCore::find_field_hit_for_guide has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 1 (nesting depth added 20). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df5ecac2a877c771d995386bffe7bd6b9c805db6b80310661acfd006c8f5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::extract_data (cognitive 35): DocumentCore::extract_data has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (23 pts), if/else 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 24). 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":"src/document_core/queries/extract_data.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f8bbadfd3dad0251903a02da9568af93a17c5b26ddb1cd6898a0110c2188f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::try_map_char_shape_range (cognitive 35): Paragraph::try_map_char_shape_range has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 4, loops 2 (nesting depth added 17). 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":"src/model/paragraph.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b685ee1a6f7e176c43bb27b8f438c0be1f42a3c8503a220738c5d70dfe53a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::insert_row_inheriting (cognitive 35): Table::insert_row_inheriting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 4 (6 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":"src/model/table.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e231abbf2aaa2505faad6e0d00be0cb5febb6574be4a88f8691b7d558291a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::insert_column_inheriting (cognitive 35): Table::insert_column_inheriting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 4 (6 pts), boolean chains 5 (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":"src/model/table.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb9f7769f87b96a95aa189859c87e7ce30cb2f5b85601827d641990148d6f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::candidate (cognitive 35): Ledger::candidate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 9, loops 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0509c28da736d7971e30cd943e034f72ab96ff0c231f8328dfc32d0c171ff"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::try_parse_scripts (cognitive 35): EqParser::try_parse_scripts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 9, 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":"src/renderer/equation/parser_attached_scripts.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f591537b797d1b504af504469f38c355f07841fb69a7bce87f1b96a7698df15a"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_script_span (cognitive 35): EqParser::parse_script_span has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 11, 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":"src/renderer/equation/parser_script_operand.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b959d4844bfa424acaf278cf748bb7099fbed5ea65e2ffcd3cca44bec3eb21d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_block_cut_is_original_source_page (cognitive 35): LayoutEngine::row_block_cut_is_original_source_page has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d506eee26f37d45b8f87a405ab3e08d1ae7f9ec8554ffe875135e096bdca475e"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::place_table_fits_with_storage (cognitive 35): Paginator::place_table_fits_with_storage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 10 (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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a133fffb24a4151a207da1e6d4d317d37eda921dac83ad2dc6bf07b5c6570a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::draw_char_overlap (cognitive 35): SvgRenderer::draw_char_overlap has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 5, loops 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":"src/renderer/svg.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6270206eee172bff8417d3f36ef5d41032d00fde8c0bd7972af4bd1f77d099f2"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgLayerRenderer::render_node (cognitive 35): SvgLayerRenderer::render_node has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 4 (8 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":"src/renderer/svg_layer.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"877f01df7113da02642ca80e37ffc31b99ed215f5e891e773ca031cb66ca3bae"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::difftext::run (cognitive 35): rhwp::bin::rhwp-agent::difftext::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 5 (10 pts), loops 3 (8 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":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e9f10695f061615bd791768b7b5aef59c8728744951a314e6a01639902c085"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_set_column_widths (cognitive 35): rhwp::cli::commands::edit::tables::layout::edit_set_column_widths has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 7 (15 pts), loops 2 (4 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af012d2d95500bd1310dacddfc3e233a9ed96612c331cb56162d2f01c07c4a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_split_table (cognitive 35): rhwp::cli::commands::edit::tables::structure::edit_split_table has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 6 (15 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d8a064bd5da912e835836d5b4dbc2ddccf6dd4a75b92f761372e64697c60d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::capsule::audit::cmd_audit (cognitive 35): rhwp::cli::protocol::capsule::audit::cmd_audit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 7 (12 pts), loops 3 (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":"src/cli/protocol/capsule/audit.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f22266030585263c2ce5d60debbc0609eb459ae8ad95506c41cf69c70eb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_contract_probe::build_probe_file (cognitive 35): rhwp::diagnostics::hwp5_contract_probe::build_probe_file has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (32 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":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b3abf37437bd6567b4d9ee5f7efb0c6763d7e9d560f3ba99d53487f7786ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_table_probe::patch_section (cognitive 35): rhwp::diagnostics::hwp5_table_probe::patch_section has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, loops 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":"src/diagnostics/hwp5_table_probe.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd70a52bf26fb8bd7b875ec1e8e8a45329e86897a6a01945b8bd95aa2dbfc6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::adapter::inline::extract_inline_segments (cognitive 35): rhwp::doclang::adapter::inline::extract_inline_segments has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 2 (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":"src/doclang/adapter/inline.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"803de57e30f5bee459152645c1098b18aa6082c0132fdd8b6c9247b1698c58b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::pii_scan::detect (cognitive 35): rhwp::document_core::queries::pii_scan::detect has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/pii_scan.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a0978ab8e03d9dd29c34f73b889cc869ba0d4264ae3b26e136e4e8090e0873"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_visibility (cognitive 35): rhwp::parser::hwpx::section::parse_visibility has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 1 (2 pts), 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":"src/parser/hwpx/section.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabc060612c814856b8999ef316de57f032b5414074e6853ecb6f8e93ec36e76"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::mapped_symbol_fonts::try_split_mapped_symbol_font_runs (cognitive 35): rhwp::renderer::composer::mapped_symbol_fonts::try_split_mapped_symbol_font_runs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (9 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":"src/renderer/composer/mapped_symbol_fonts.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"23843997459df4353cd22975accefd4889672eb54e9e4d917aebd266fd74e198"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_complete_row_frame_heights (cognitive 35): rhwp::renderer::float_placement::stored_complete_row_frame_heights has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 8, loops 3 (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":"src/renderer/float_placement.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e466af7755e243e8239bbe33e1ca33662d8074787a19e145ebd6a8026083e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement (cognitive 35): rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 10, 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":"src/renderer/float_placement/stored_header_frame.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ebdf0c0b959802e1bfdb7ba03bac7098bc466905554f5aa53870ad20903e88"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::compute_row_blocks_with_storage (cognitive 35): rhwp::renderer::height_measurer::compute_row_blocks_with_storage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 7 (12 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":"src/renderer/height_measurer.rs"},"region":{"startLine":6800}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2b14dd4346014b792c69273983a868b1cd8db2a1995c4e968895b74726fdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::lookup_font_name_in_environment (cognitive 35): rhwp::renderer::style_resolver::lookup_font_name_in_environment has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (6 pts), boolean chains 3 (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":"src/renderer/style_resolver.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8749191d7bbf015f75cd398942a2ce5e07ef080befeb48854f212e44bafa0962"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::svg_outline_font_face_data_impl (cognitive 35): rhwp::renderer::svg::svg_outline_font_face_data_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 5, loops 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":"src/renderer/svg.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2c8f42b76a445e39cd8c3887888c37fa939069f5a2bcdb5d0b0e5471334b83"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.build_menu (cognitive 35): _gen_pack.build_menu has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 14, ternaries 3 (6 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":".claude/skills/rhwp-explore/references/_gen_pack.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde55c44b84dde93049b22734c1ab6e9bb786a6b063adec56e8bfffdb9fb34d"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.build_ledger (cognitive 35): _gen_pack.build_ledger has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (9 pts), boolean chains 3 (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":".claude/skills/rhwp-strategist/references/_gen_pack.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd59cf1a6c8c3c0b6d02d8d51bb199fbfbd3032e726b2066a4559b44053a6695"}},{"ruleId":"D2","level":"warning","message":{"text":"build_baseline.validate_step (cognitive 35): build_baseline.validate_step has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 1 (3 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":"gym/tools/build_baseline.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceda6bf28563b64692d72fc76569e0d8523b290ebacb66088f1cff7187802c9"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDocument._pump (cognitive 35): NativeDocument._pump has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 5, ternaries 1 (4 pts), error handling 1 (3 pts), loops 1 (2 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78c2e700133f979043dd46f3d0143600b5547299fc134775aa6ba32a341e809"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation-keymap.getNavigationAction (cognitive 35): navigation-keymap.getNavigationAction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (31 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":"rhwp-studio/src/engine/navigation-keymap.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bea9cd50fa32781e7bb9a96948dbf3983ba4fa268c1f4b6b8c1d32883b2d05d"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.parseStaticSvgTransform (cognitive 35): static-svg-path-layers.parseStaticSvgTransform has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 11, ternaries 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303922eea58f1185f5829e5569756ef249cff73ff1a381ee84bd4a12e94137a"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.finishImagePlacement (cognitive 35): input-handler-table.finishImagePlacement has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 8, error handling 3 (5 pts), ternaries 3 (4 pts) (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361f15994b449fd8ec06a7ff928417ff5989eeb56e3dd8d35e7a3951d2485b1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::change_shape_z_order_native (cognitive 34): DocumentCore::change_shape_z_order_native has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 2 (3 pts), match/switch 2, 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2e1b436eef07d6f45309ab0b258f098a18ffe0e02f3ea0b32c8eb22e115c7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::recalculate_table_formulas (cognitive 34): DocumentCore::recalculate_table_formulas has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, loops 3 (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":"src/document_core/commands/table_formula.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a803b2c059d24d490eab65b35f483e3c7a483069a2f07051f0e55cd74f3fdb5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_cursor_hit_at_x_on_line (cognitive 34): DocumentCore::find_cursor_hit_at_x_on_line has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (54 pts), loops 6 (13 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (DocumentCore::find_cursor_hit_at_x_on_line::collect_image_candidates) 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"683a81f727c1c546c6a504011eb126b8ebae1f55bee428939264fabb240eb376"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_table_cell_bboxes_by_path_native (cognitive 34): DocumentCore::get_table_cell_bboxes_by_path_native has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 16). Most of this is not in the body itself: 5 of the 34 points are its own statements and the rest belongs to 2 function items inside it that branch (find_nested_table_cells, find_nested_table_cells::check_table_match). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0097631d1c5be59401c877fff5b0a81e85542d80227d4330b4fd0b6a7662c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_in_footnote_native (cognitive 34): DocumentCore::get_cursor_rect_in_footnote_native has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 15 of the 34 points are its own statements and the rest belongs to 2 function items inside it that branch (collect_cursor_runs, find_number_run_end). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3444e68ed2c5172103f45b477a77a42c45fc5c92be3ecf2a902462a89151fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::object_cycle_json (cognitive 34): DocumentCore::object_cycle_json has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 2 (9 pts), match/switch 2 (9 pts) (nesting depth added 23). 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930a357512242aafb19be8b28b85337190dae83b210344219944c48f75af63d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::dump_page_items_json (cognitive 34): DocumentCore::dump_page_items_json has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (11 pts), loops 4 (10 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4464bc6484a2178fda935862b54fa92b7fbc1134797857486fb6194f151e16ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::emit_path (cognitive 34): Interp::emit_path has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (33 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":"src/eps.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea14af50fd6770d9e06d42870ea9eeaafad9512a82b404417a696439552885e2"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_aligned_rows (cognitive 34): EqLayout::layout_aligned_rows has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 3, 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":"src/renderer/equation/layout/matrix_geometry.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc085e2d107c57b1af044d279bd2bac391202634e8b25bf7ef086d8d0d34eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::row_children (cognitive 34): EqLayout::row_children has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 7, match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/symbol_spacing.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3062d557a0d8c1d453c1a5233126b16e45e0a24c2fe93df404ce9167246508d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_row_atomic_picture_alignment (cognitive 34): LayoutEngine::stored_row_atomic_picture_alignment has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, loops 3 (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":"src/renderer/layout/table_layout/declared_first_frame.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8445b3d4932fb79919ffa61f13a6cb8dd274a4825c667b6f4b37d47ecc006"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_inline_opening_row_frame (cognitive 34): LayoutEngine::stored_inline_opening_row_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, loops 3 (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":"src/renderer/layout/table_layout/stored_inline_row_frame.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0013636a62737a83aaa1e7947037b167eb6a7018af2fec642afa36e90a3e8554"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_has_original_nested_frame_owners (cognitive 34): LayoutEngine::row_cut_has_original_nested_frame_owners has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 5, loops 2 (3 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":"src/renderer/layout/table_layout/stored_nested_fragment_frame.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"722974c3b5f15abeaa48833f9b4aa301b636561f492d6a418c6015ef928b82f6"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_row_reset_closes_declared_frame (cognitive 34): LayoutEngine::stored_row_reset_closes_declared_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 10, loops 4 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02a348415056a8aa19bddb05cafad12307545d57f6afffb632a218e1f663353"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::saved_first_row_opening_frame (cognitive 34): LayoutEngine::saved_first_row_opening_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, loops 3 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacdc3f91f24dbfb1fab8da0751b75613431f9cdecd814da1ee761badf023b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_stored_zero_origin_rewind_unit_indices (cognitive 34): LayoutEngine::row_stored_zero_origin_rewind_unit_indices has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (27 pts), boolean chains 4, loops 2 (3 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e2994baf7871b6f34490d83c109c31f71811f7753079ca29b11d413e52197"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_set_numbering_restart (cognitive 34): rhwp::cli::commands::edit::document_text::edit_set_numbering_restart has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 9 (23 pts), if/else 5 (10 pts), loops 1 (nesting depth added 19). 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd57863a0aca6836ec47f0b69f4755abd517a3fbf1c6ef29b932ccca188bf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_char_format (cognitive 34): rhwp::cli::commands::edit::formatting::edit_apply_char_format has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 10 (15 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f4f3999759ce2a934a3f44c3329a7ec15538256a3266f9bb71728d458ae8ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::generation::build_from_ingest (cognitive 34): rhwp::cli::commands::generation::build_from_ingest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 10 (14 pts), boolean chains 1, 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":"src/cli/commands/generation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7defd17a15c10434df84765392895e2843f6cf85e40d96931bda718d8c69ddc9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::preview::extract_thumbnail (cognitive 34): rhwp::cli::outputs::preview::extract_thumbnail has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 7 (11 pts), 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":"src/cli/outputs/preview.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd7113540a7517bf52739615cb3daad388b72b387ad6dae83f110f21c725189"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::harness::cmd_harness_wrap (cognitive 34): rhwp::cli::protocol::harness::cmd_harness_wrap has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 11 (17 pts), if/else 14 (16 pts), loops 1 (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":"src/cli/protocol/harness.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f76308e61520451f85498811bebaa2af876916c1f5301115bd3cdf8a2f10a0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::template::validate_source_fill (cognitive 34): rhwp::document_core::commands::paragraph_block::template::validate_source_fill has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ec2b5a9daa33bd63f0fc3e0357579160422d33a3655933deadc6d8b511d131"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::assign_master_pages_for_section (cognitive 34): rhwp::document_core::queries::rendering::assign_master_pages_for_section has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (5 pts), boolean chains 4 (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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e40abb11434bd2ee1085c1ab88d79fb923e5e2893dfa7a3c88e50c69ea4fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::threat_scan::scan_hwp5 (cognitive 34): rhwp::document_core::queries::threat_scan::scan_hwp5 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 6 (10 pts), loops 3 (6 pts), boolean chains 3 (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":"src/document_core/queries/threat_scan.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde57b50392e9950ad3baaa99add4085e6dfe1ae92e1601fd9eb31b846485d25"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::eps::parse_patterns (cognitive 34): rhwp::eps::parse_patterns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (6 pts), loops 2 (4 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":"src/eps.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbee0b68434c9b49732ea9223476f886c8cd99c2b76f711669de76a4908fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::populate_link_image_paths (cognitive 34): rhwp::parser::populate_link_image_paths has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (19 pts), match/switch 2 (9 pts), loops 3 (6 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":"src/parser/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a12030bda86b2aaea1ceae9493aafab102c2bd23c7a5308ae991cd448b9a375"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::watermark_jpeg_bytes_to_hancom_baked_png_bytes_uncached (cognitive 34): rhwp::renderer::image_resolver::watermark_jpeg_bytes_to_hancom_baked_png_bytes_uncached has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 11). Of this number, 27 points are the body\u0027s own statements and 7 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":"src/renderer/image_resolver.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3e1844da8d6c198f12f4c2fb80304922ba0a6e7fa731415cc2ad7aed3942e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_alpha::print_alpha_payload (cognitive 34): rhwp::renderer::image_resolver::print_alpha::print_alpha_payload has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (10 pts), boolean chains 9 (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":"src/renderer/image_resolver/print_alpha.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c228c1d290b2827c08cb5d66e52a393f858054817b6caeea9df0d2c5836abc0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::mixed_host_line::prepare (cognitive 34): rhwp::renderer::typeset::controls::mixed_host_line::prepare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19, boolean chains 11, match/switch 2 (3 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":"src/renderer/typeset/controls/mixed_host_line.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff990713d8c2db4690bb3116538404563e99f28fa6c38a2afa673a5d7262851"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.score_session (cognitive 34): agent_session.score_session has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7, loops 5 (6 pts), ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/agent_session.py"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"996e9ef4d3744ba7ba50ee5d97ed672f0a5422b6335badaa4407053e8ad8e4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.scorecard_emptiness_issues (cognitive 34): competitive_bench.scorecard_emptiness_issues has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 12 (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":"gym/tools/competitive_bench.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9fe63f4cc45cbdf8a2b9725dead1e704768c6caa9fb70a116c7adbd8114121"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildControlDiffs (cognitive 34): diff-engine.buildControlDiffs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (7 pts), boolean chains 6 (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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"af937cada0c4597c951646e0b8cd32ae3b2c5cc4553b2ea8c93b1ecfcd8f1b50"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp-dev.initRhwpDev (cognitive 34): rhwp-dev.initRhwpDev has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, error handling 3 (4 pts), loops 3 (4 pts), ternaries 3 (nesting depth added 7). Of this number, 33 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"920de9f16390f5b82f6783a5e2fb92e86caf425f0d1264cae30aba236351ab43"}},{"ruleId":"D2","level":"warning","message":{"text":"svg-image-header.svgCommentScanSource (cognitive 34): svg-image-header.svgCommentScanSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f1ae935a9923bfb65a45166baac08fd70588df5a1a15afe2a00cd7cce1928b"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.replaceTextAtRaw (cognitive 34): input-handler-text.replaceTextAtRaw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 4 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4be4ad7331aaa3df407c7434dac4a5efa36f2bf7a882d9ab43e79521449240d"}},{"ruleId":"D2","level":"warning","message":{"text":"#runTableAction (cognitive 34): #runTableAction has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5 (9 pts), boolean chains 6, other 5 (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 2 belong to 5 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e3596ac99c950bf5f6eccb41e34043f60487522d79b368481cceaf901a8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::onmessage (cognitive 34): constructor::onmessage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 8, ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"435abacf320cdfccf8c35e28b158364360626753813562b148ac9f6217d50d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_combo (cognitive 33): rhwp_ooxml_chart::renderer::render_combo has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 5 (8 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce7b50ff4d4b00c46ceebcf2104b115d6a6baef7688391b7cb1dfc4d3b8964a"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::restore_stored_cell_frame_widths (cognitive 33): Table::restore_stored_cell_frame_widths has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (8 pts), boolean chains 6 (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":"src/model/table.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1792ccc4b4dba8f925f93665051eb7ded4371b5632f8fc4192c440577c3b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::fallback_paragraph_frame_owner_widths_with_storage (cognitive 33): Table::fallback_paragraph_frame_owner_widths_with_storage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (9 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":"src/model/table.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc3421ee8d075e2773e6c771c02ada799e45a48f554cbee68389f569cad26e"}},{"ruleId":"D2","level":"warning","message":{"text":"Compound::split (cognitive 33): Compound::split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (7 pts), match/switch 1 (3 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":"src/parser/pdf/table_paint/compound.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ab1a267e9993b543680cf1e2fdf10e0603da970054b63790871ca01bfcf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_block_opening_cell_rows (cognitive 33): LayoutEngine::stored_block_opening_cell_rows has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 7, loops 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dce099850744de46b02fdd3ff87da5b431e8a6ad415e0b8c44e880e00908a7"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::first_source_frame_owner (cognitive 33): LayoutEngine::first_source_frame_owner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 12, 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":"src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d957ea51ffcd733cd30a8b2e36d720da90497d30db5781c56e788940586d213f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_joint_zero_origin_boundary (cognitive 33): LayoutEngine::stored_joint_zero_origin_boundary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 6, loops 3 (6 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f16d947cc51fb1c146452f949f2ae3ba64f11382423e517ceca54e3572a070"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_full_width_row_source_height (cognitive 33): LayoutEngine::stored_full_width_row_source_height has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080197a813acdb6e7baa2625a1d0f4e38e1a2c569739f040f64098a7602aa17"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::cells::edit_set_cell_props (cognitive 33): rhwp::cli::commands::edit::cells::edit_set_cell_props has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 6 (11 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"913bd2581ce527675c3584b7db3b9149c7d6a06a56f57e55418bd5224dc36b14"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_page_break (cognitive 33): rhwp::cli::commands::edit::document_text::edit_insert_page_break has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_insert_column_break) 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c3ebdde45916b9784c1bf52e65d6a2bb7aa0783ccf9bd2a5f0dba75d85323a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_column_break (cognitive 33): rhwp::cli::commands::edit::document_text::edit_insert_column_break has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_insert_page_break) 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bba43b4966804764edf3f1222e75833ac27a017d938d19e03a541f1dc9dceb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_merge_cells (cognitive 33): rhwp::cli::commands::edit::tables::grid::edit_merge_cells has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 11 (22 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0d28c3b30bc1d4c234c3324b723e1f685092cbb4851d664c127813a314fa3f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::pdf::export_pdf (cognitive 33): rhwp::cli::outputs::pdf::export_pdf has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 10 (12 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":"src/cli/outputs/pdf.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"26663b43784cdb25afbe64d4b8797aea087e5b1a04ce69eeb074b39f824ac90c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_audit_report (cognitive 33): rhwp::cli::protocol::trust::governance::cmd_audit_report has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 12 (18 pts), if/else 8 (11 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d6df3a68cc78495ec3e731f01bbef12b6da2d3e45492bbe0c10e274b62f87c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::clone_identity::remap::reidentify_with_allocator (cognitive 33): rhwp::document_core::commands::clone_identity::remap::reidentify_with_allocator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 3 (4 pts), loops 1 (2 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":"src/document_core/commands/clone_identity/remap.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fd3d6cf1ba9cef15f7b572d2f59b14a8e6197202334f83d0bfe68fdc031863"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::table_row_grid::visit (cognitive 33): rhwp::model::table_row_grid::visit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (9 pts), match/switch 1 (3 pts) (nesting depth added 17). Of this number, 19 points are the body\u0027s own statements and 14 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":"src/model/table_row_grid.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f5d78989f150a3acc87182f68b3ff13554bb3b9e4dee5557c997dd855b123c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::parse_section_with_previous (cognitive 33): rhwp::parser::body_text::parse_section_with_previous has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (13 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":"src/parser/body_text.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5916c3c52be1fd34198937a5297c582e8a96f80416bee958dce0999127455f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_hwpx_header_with_plain_margin_units (cognitive 33): rhwp::parser::hwpx::header::parse_hwpx_header_with_plain_margin_units has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (19 pts), loops 3 (9 pts), if/else 1 (5 pts) (nesting depth added 24). 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":"src/parser/hwpx/header.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5106d966f63cd7df7cbc5be1db2902ddffa3cb4d46d80a8a5f9e54b8065d120"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::resolve_stored_line_segs_in_frame_with_storage (cognitive 33): rhwp::renderer::composer::line_breaking::resolve_stored_line_segs_in_frame_with_storage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 12 (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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e730fd1dc8c01d94b6e7457d6f50f31db7c0fff5e51140f9c2a75dda82a16cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage (cognitive 33): rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9, loops 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":"src/renderer/height_measurer.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"07431223ca486052faae6a00950860785f0f36102a0f6d7e2b2cbf34891abe3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::fit_measured_table_to_declared_height_with_outcome_with_storage (cognitive 33): rhwp::renderer::height_measurer::fit_measured_table_to_declared_height_with_outcome_with_storage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 8, loops 3 (7 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"908e3a40f0aa50b1cf9c35841cc9a5f5515ef932083ff025be410e207660fca0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes (cognitive 33): rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (9 pts), loops 4 (5 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":"src/renderer/image_resolver.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5857bf2543950ea0a760e8cdca0cda41c7dcb32af4a815af33240e62f157c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted (cognitive 33): rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 3 (5 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":"src/renderer/kerning.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3472b5216f29ad5f96ee28658cfff6032e66e8440bb189672d5bafcfbb42f16b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_spaced_cell_borders (cognitive 33): rhwp::renderer::layout::border_rendering::render_spaced_cell_borders has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (8 pts), boolean chains 5 (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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7af0c1b9f9ca5b4d0c91422567c055eff7966309058116ad37436997dfaa68b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::repair_clipped_cell_text_table_seam (cognitive 33): rhwp::renderer::layout::table_layout::repair_clipped_cell_text_table_seam has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (8 pts), boolean chains 7 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd437efef216f150f5732122957baf372e68c3d6de54b36ebd4fa2be5aecd9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::reconstruct_nested_table_fragment_frame (cognitive 33): rhwp::renderer::layout::table_layout::reconstruct_nested_table_fragment_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 7, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"99835605edd7715366a2252296fbd71c23c6cf8e80aa80dcb4660bfe0aa94bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_html._pack_statistics (cognitive 33): evidence_html._pack_statistics has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, ternaries 4 (8 pts), loops 5 (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":"gym/core/evidence_html.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2abf7fc2d2906d94e41fcc48a706a09d46706b93bf9438a04131142c1c2197"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.validate_capability_matrix (cognitive 33): competitive_bench.validate_capability_matrix has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (7 pts), boolean chains 3, ternaries 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":"gym/tools/competitive_bench.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"da66cc5f3f85c938a82e23df7446ab03f5bba991d3e53e76a9a729215c3a23a2"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard.validate_invite (cognitive 33): leaderboard.validate_invite has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 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":"gym/tools/leaderboard.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63cc7bfd96fb28341c763eba6ab9f14e23ef9565303389fe106838dc1f5bde"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell (cognitive 33): CanvasKitLayerRenderer.renderCharOverlap::draw::drawCell has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 7, loops 1 (2 pts), ternaries 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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderCharOverlap) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"63034c84f146942603d7fd96288a225e8fec9140ae30615d733bde1fe124c330"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.resolvePreparedTypeface (cognitive 33): CanvasKitLayerRenderer.resolvePreparedTypeface has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), ternaries 3 (6 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"933dafb812293102e28dff5e8f7e84fe8d70301e104d09ae443817411e407d89"}},{"ruleId":"D2","level":"warning","message":{"text":"rpc-router.routeEmbedRequest (cognitive 33): rpc-router.routeEmbedRequest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 6 (12 pts), boolean chains 8, match/switch 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":"rhwp-studio/src/embed/rpc-router.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfd9d1adae07c95890938e8558a3dd6e838cc52207db4f6647d17e1c1cc93d7"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.updatePictureResizeDrag (cognitive 33): input-handler-picture.updatePictureResizeDrag has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (7 pts), boolean chains 6, error handling 3 (5 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"856650d9514367931301fef9e471a810b4b312f6499cbb34a773eca87c59077f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setupGlobalShortcuts (cognitive 33): main.setupGlobalShortcuts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 9). None of this is in the body itself: all 33 points belong to one function literal inside it that branches (line 989). 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":"rhwp-studio/src/main.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f08ee207f93401b5d6608fe4f68e778c20a85faeeafe0d39dd0fef4bfac39f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 33): (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (9 pts), ternaries 4 (7 pts), boolean chains 2, other 1 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 11 belong to 4 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":"mydocs/pr/assets/pr8296-maintainer-20261101/canvaskit-probe.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf7aa5546d6acdd7c6c2e4219efb22e8590a7b5ffecfd18bc929862629d8cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_active_hf_info (cognitive 32): DocumentCore::get_active_hf_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 1 (7 pts), 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07439472bf041e3935bcf21d5566d14b18f60ae3c881a9605b72b155f9142f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next (cognitive 32): Lexer::next has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (9 pts), boolean chains 5, match/switch 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":"src/eps.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5489b51a96cc5e1d294d9a83a32977e7c5ceaa70ee2fb1db525d04b6f034a1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParaShapeMods::apply_to (cognitive 32): ParaShapeMods::apply_to has cognitive complexity 32 (threshold 15). Drivers by points: if/else 31 (32 pts) (nesting depth added 1). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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":"src/model/style.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d2ae19d5c04f0c9fb422c700ff926fddb3b37926fd32e44ee18f9f2afcadcc"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::nested_header_reservation_for_cut (cognitive 32): LayoutEngine::nested_header_reservation_for_cut has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), match/switch 1 (4 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":"src/renderer/layout/table_layout/nested_header_frame.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"56103f32667c4c9f6f3ed3dfe6eb0283f81e835d3ddecdcd539b7310d6f962a1"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_row_first_restart_is_joint (cognitive 32): LayoutEngine::stored_row_first_restart_is_joint has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 7, loops 3 (4 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19656}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb3ff1d7b554b27b31ff56d52f6288a70b3d30a7a06bed3b1a5ab67887066db"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::emit_endnote_split (cognitive 32): TypesetEngine::emit_endnote_split has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, 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":"src/renderer/typeset/notes/endnotes/emit.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f90a468ada613dedd3b1c473dad5bf6184be69821afb9c2c435a251c1e4d5c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializeContext::try_collect_from_document (cognitive 32): SerializeContext::try_collect_from_document has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 12 (13 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":"src/serializer/hwpx/context.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7f376a160d0ed524434d4448de0526d2ffc1d1501a7029ad07d2f0bc061c95"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::inject_external_image (cognitive 32): HwpDocument::inject_external_image has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (9 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":4561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d42c17825d1daf7be519b377f1dec363afd2a6350009584c7645048a3b7d729"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::chunkplan::run (cognitive 32): rhwp::bin::rhwp-agent::chunkplan::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 6 (10 pts), loops 3 (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":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a6ac4757380db5acd49ca93f8b858997dd68a2a8d9123d1ca3066aa07e126f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_chart_data (cognitive 32): rhwp::cli::commands::edit::document_objects::edit_set_chart_data has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 8 (14 pts), 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"39771c12f1185e97dc63fa3292c2aff4e26859f0fc23b45696bdc299151f9c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_para_format (cognitive 32): rhwp::cli::commands::edit::formatting::edit_apply_para_format has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 9 (14 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d8525db614a6b8309f51dac9cf587d7fa3df28a9bded6f5b23c9ac3f1d4083"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_mel_personnel_probe::patch_section (cognitive 32): rhwp::diagnostics::hwp5_mel_personnel_probe::patch_section has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 3 (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":"src/diagnostics/hwp5_mel_personnel_probe.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacb8f542eb3f75700af7c360b11422be74fc1f00e6012dd7a01b2d8d2f9b22"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::render_geom_diff::run_single (cognitive 32): rhwp::diagnostics::render_geom_diff::run_single has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (10 pts), loops 2 (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":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d090b59e61ab91897a1b851e3c0e46e20acad6a4f2e365a7a9be1e34f5b947"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::pii_scan::collect_texts (cognitive 32): rhwp::document_core::queries::pii_scan::collect_texts has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (23 pts), if/else 1 (5 pts), match/switch 1 (4 pts) (nesting depth added 24). 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":"src/document_core/queries/pii_scan.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0308722cd7901ebdde90f077fa318c9cede4f051ceeb2d0b3ed7c42e963f9f3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_fonts::page_requests (cognitive 32): rhwp::paint::metafile_fonts::page_requests has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (6 pts), boolean chains 4, 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":"src/paint/metafile_fonts.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1838cb1a7314bd2393b2c897dafe8483d831c9f712643e6bafe1c8e5a568604"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::cell_border (cognitive 32): rhwp::parser::pdf::structured_lowering::cell_border has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a3db42eca930364544fef7b01e3eee1b0878bc96578b0cf58e2494b003432d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::empty_faces::complete (cognitive 32): rhwp::parser::pdf::table_detection::cell_regions::empty_faces::complete has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (4 pts), boolean chains 3 (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":"src/parser/pdf/table_detection/cell_regions/empty_faces.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8e6c2e407997f569d2ba829750a5935a8889bc855925227d7844fcb5ea425"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_cell_flow (cognitive 32): rhwp::renderer::float_placement::stored_picture_cell_flow has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b40f9f48509ae4858bb224545032691354538e3d48daf3b36e07658ae20014"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_header::parse_jpeg_header (cognitive 32): rhwp::renderer::image_header::parse_jpeg_header has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_header.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e544ddd07043a4040025c971fbf0d8b5ec131387b3ee231686ef2c22412e7ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_prefilter::resize_opaque_window (cognitive 32): rhwp::renderer::image_resolver::print_prefilter::resize_opaque_window has cognitive complexity 32 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 18). 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":"src/renderer/image_resolver/print_prefilter.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ebfb88fbaf2d16529fd686213db6eef76df8809e473b948053571fe7a5e197"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_run_font_resource_reject_reasons (cognitive 32): rhwp::renderer::layer_renderer::collect_glyph_run_font_resource_reject_reasons has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 8, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layer_renderer.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"2077117f604f75b777117a070be1c777ac51c09cc8f39ea4f7cbacb051937ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::apply_table_outer_border_fill (cognitive 32): rhwp::renderer::layout::border_rendering::apply_table_outer_border_fill has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 8 (13 pts), boolean chains 4 (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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"59544454ced093573740b259837e1585b3aca916610219d36ec303b5c226d5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_fit::prepare (cognitive 32): rhwp::renderer::typeset::controls::tac_fit::prepare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15, boolean chains 9, match/switch 4 (8 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/tac_fit.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc5c7b497d3ac86673afe1a06e8d52d87be1171ad8e8425662e9512dc242c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::accepted_tac_column_frame (cognitive 32): rhwp::renderer::typeset::paragraph::content::accepted_tac_column_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 6, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca23bfa509343c812de0635f6e7e17c2981cc415e5843880c2875bef16d7fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage (cognitive 32): rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 14 (15 pts), match/switch 1 (2 pts) (nesting depth added 2). 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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14510f1781a20fcbfa44f9c55d8a919190c571ad2382732c14e02e7dc65379f1"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.exception_kind (cognitive 32): runner.exception_kind has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (22 pts), ternaries 5 (10 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":"gym/core/runner.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01cdf8267a800f047b8a5b6047d0abf1c5b76455c85ee9bc973ceb8649246a"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.render_report (cognitive 32): runner.render_report has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (7 pts), loops 4 (6 pts), boolean chains 5 (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":"gym/core/runner.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a5f37027e8c9a92809f7ec93355d783c6f8841cf771f438f52ed22b91a126"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTextureController._poll (cognitive 32): NativeTextureController._poll has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 10, ternaries 1 (2 pts), error handling 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb626a3e5f9a17a0818f4fa61869ddf253943728a963c53b033e06aded9c94fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.expression (cognitive 32): Parser.expression has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 2 (4 pts), boolean chains 2, ternaries 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3a51f3c839d6d840976cced2548fb0801980176d6bd154628f166daa8d69e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatController.executeWrite (cognitive 32): ChatController.executeWrite has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 7 (12 pts), error handling 2, 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":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19f0da562fc8c8fe929d4d4e941f9a563dc4ecc305a25076bcb5ea65ded1381"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.executeOperation (cognitive 32): InputHandler.executeOperation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 3 (6 pts), boolean chains 5, error handling 1 (2 pts), match/switch 1 (nesting depth added 12). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to one function literal inside it that branches (line 3322). 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a792c93293614d7f11af67dfde8b6c18a6bfaef9c712425a4da5118cf8d781c"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.updateCaret (cognitive 32): InputHandler.updateCaret has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), error handling 2 (7 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f3cee8b997a76151301c1fc42462770c781f0df251f46509d8bef3e2219340"}},{"ruleId":"D2","level":"warning","message":{"text":"#runPageAction (cognitive 32): #runPageAction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8, other 6, ternaries 4 (6 pts) (nesting depth added 3). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function items 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e05ba0f244edc155da0475cfe2db598b7410a7355959ae167ff32fd7e9a65bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_text_shadow_font_requests_native (cognitive 31): DocumentCore::get_text_shadow_font_requests_native has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), match/switch 1 (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":"src/document_core/commands/document/metafile_fonts.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f44796b67a6470b246862814ef6aa0571648d394906d0c8df5db2b4240890"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::reflow_unstored_caption_paragraphs (cognitive 31): DocumentCore::reflow_unstored_caption_paragraphs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (11 pts), match/switch 2 (7 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":"src/document_core/commands/document.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"088ad7f1f5091f833d8675158b604b5ba5f0b956be12a153072ec8fae523bd55"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::project_unstored_float_bands (cognitive 31): DocumentCore::project_unstored_float_bands has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (11 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":"src/document_core/commands/document.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"322924de41875c14cc131b12f60909ab1dff34374deca1690d5f8eb93e0fefda"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_reference_para_shape_for_style (cognitive 31): DocumentCore::find_reference_para_shape_for_style has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 3 (14 pts) (nesting depth added 23). 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2fb545ca8aea839b3f72bdbca6c15f7aa0668e6584cd4dbfd19d6ad0d8e07b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::insert_picture_native_anchored (cognitive 31): DocumentCore::insert_picture_native_anchored has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"440fc16e9b21a20bb21b540f6e20061d74dc1f5fc2285b3f07e3f250fc88b8af"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_native::collect_body_inline_image_hits (cognitive 31): DocumentCore::hit_test_native::collect_body_inline_image_hits has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 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. This shape REPEATS in the file: 2 other methods here (DocumentCore::hit_test_native, DocumentCore::hit_test_native::collect_runs) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edddcfa000e81ed8e647696606b27200f9aa2a278348bf7d1073c98e6d8617d"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::rowspan_declared_overflow_shrink (cognitive 31): Table::rowspan_declared_overflow_shrink has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 3 (4 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":"src/model/table.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d85798791db8ab2956f811ea1619515710a44e7a80cd328f5c50c197cf60b4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::partial_table_cell_probe_plan (cognitive 31): LayoutEngine::partial_table_cell_probe_plan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 8, 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f8c4726cc7b21c315852d23e65c2a1a5ed9bb20ae1cd0398f1097ff0999859"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::stored_body_closing_fragment_extent (cognitive 31): TypesetEngine::stored_body_closing_fragment_extent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 7 (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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae602270cd6514d887a85c92d99fbd9eaa7fdcca59307145b6a44f62ee50a24"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::step_block_table_fragment (cognitive 31): TypesetEngine::step_block_table_fragment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 10, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9236fffce5dc1e73b6bcc8c235bc2332d5d05277c73430d64668d2f945bc9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::agent::dsel::eval::apply_preds (cognitive 31): rhwp::agent::dsel::eval::apply_preds has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (9 pts), match/switch 3 (7 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":"src/agent/dsel/eval.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"958ba23fd32ad954285da5120aac5550a12f94d08f804b0d0f4b2b0c1ab9f7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::form_at::run (cognitive 31): rhwp::bin::rhwp-q::kit::form_at::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), 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":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faeafdd5aeab0cd0263eb39ef7c16a0bfd8d963c98b3a85b092f501db933d63"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::form_value::run (cognitive 31): rhwp::bin::rhwp-q::kit::form_value::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), 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":"src/bin/rhwp-q/kit/form_value.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ddca29129cbb7182272e62ee33e08bdc3dff4c79cff88d1a6d7f002f39134"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_fn_marker::run (cognitive 31): rhwp::bin::rhwp-q::kit::hit_fn_marker::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), 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":"src/bin/rhwp-q/kit/hit_fn_marker.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45bc1c601f7909b8dfb85a9c2ee7459ac55e7dea6d0a204ecdebf82695830c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hit_in_footnote::run (cognitive 31): rhwp::bin::rhwp-q::kit::hit_in_footnote::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), 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":"src/bin/rhwp-q/kit/hit_in_footnote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f8e90a96603c9a5fc6e1a9742769aed7d68beb160dafde72e3a2b8441c78ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::batch::ordered::stream_records (cognitive 31): rhwp::cli::batch::ordered::stream_records has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 7 (13 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":"src/cli/batch/ordered.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"84073c37d430973ad9a4c4b4439517715bb7d572d1754335c720faf2fc21bcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_insert_number (cognitive 31): rhwp::cli::commands::edit::document_objects::edit_insert_number has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f085f75f49fbf9b5941b27eba42d08f4a46e80ad5b7588dbb61adf7d1fb9ed63"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_form_value (cognitive 31): rhwp::cli::commands::edit::document_objects::edit_set_form_value has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 6 (12 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7883874a2cd1fc3932b5fe038f0847d7d08b3938ce254f9da4664beb8863540"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell (cognitive 31): rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 6 (12 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0600030e021ae0cf71c51c5d7b47174e42676e668e21b3e54aa7de5f616d5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_split_cell (cognitive 31): rhwp::cli::commands::edit::tables::grid::edit_split_cell has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99446f18e6a7aaf7268430c4d21f4fab470f8eeb0300b513453bf8b1adcedcf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_resize_table (cognitive 31): rhwp::cli::commands::edit::tables::layout::edit_resize_table has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7731c4095b8a513a1c0269da8fc832619ec1b65c8ad147c4fd13783f213ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_resize_table_cell (cognitive 31): rhwp::cli::commands::edit::tables::layout::edit_resize_table_cell has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2843282a5b684fe87f20302cec567aab56806d1df579019b1a1321b2689992b7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::document::tac_cache_repair::repair (cognitive 31): rhwp::document_core::commands::document::tac_cache_repair::repair has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (11 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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd90f91123d38f7309cd43380f07d12c27e34a2a9ea914664979fd0c0751859"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_char_shape_mods (cognitive 31): rhwp::document_core::helpers::parse_char_shape_mods has cognitive complexity 31 (threshold 15). Drivers by points: if/else 29, 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":"src/document_core/helpers.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c099c42c5b2ad2d22d54787448068fb3830fd7868bf7edcbf06f034dd776b64b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::content_fonts::collect (cognitive 31): rhwp::document_core::queries::content_fonts::collect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 5 (13 pts), 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":"src/document_core/queries/content_fonts.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2fff53e3e0e5d06079cf3b41951abb36d658598e86b47af3f4bf622fccd270"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::hits_in_supported (cognitive 31): rhwp::document_core::queries::memo_query::hits_in_supported has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 22). 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eec533e72f79f47ee83dbde0e206e9427fde0a05cf59ab05bb7acf64256091"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::stego_scan::scan_hidden (cognitive 31): rhwp::document_core::queries::stego_scan::scan_hidden has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (8 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":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"82591a9ead78a5dca0496289840571f53dfa6231060b59230f3258484b2cf337"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::identity::walk::walk_ref (cognitive 31): rhwp::model::identity::walk::walk_ref has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (19 pts), match/switch 3 (8 pts), if/else 1 (4 pts) (nesting depth added 21). 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":"src/model/identity/walk.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a4cda14e9e84d8d9a2027b10894c0c4c6879e18357e79e3dd427b516bf985"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1600::probes::vpos_reset_analyze::analyze (cognitive 31): rhwp::mydocs::tech::investigations::issue-1600::probes::vpos_reset_analyze::analyze has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 4 (9 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":"mydocs/tech/investigations/issue-1600/probes/vpos_reset_analyze.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ee87d016cf5801ebc8e9e8fa24918f9103053f5decd804de5729bc99729b59"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::dot_leader::paths_for (cognitive 31): rhwp::paint::dot_leader::paths_for has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/dot_leader.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b0243ecd60e262750e472de38623761033231e685ef5b5b13d9db9dc87cd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::link_orphan_field_ends_with (cognitive 31): rhwp::parser::body_text::link_orphan_field_ends_with has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (5 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":"src/parser/body_text.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f9823048bda95703b6f4762c8da4048e3f0ad56ce8db1777d9c7d6e70c5db"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_compose (cognitive 31): rhwp::parser::hwpx::section::parse_compose has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 4 (10 pts), loops 3 (6 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6668}}}],"partialFingerprints":{"codehealthFindingId/v1":"339add3bdf77ff5d839949eef23b372d5dab4df23a4e7ff5e2de1d5fbdf043f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::rag::chunker::linearize_table_parts (cognitive 31): rhwp::rag::chunker::linearize_table_parts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5 (8 pts), boolean chains 6 (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":"src/rag/chunker.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb929dbb2d8f5cab464930e9d3e7cf2e97765f0c5fe743f322caa43d5deadd8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::count_layer_tree_work_units (cognitive 31): rhwp::renderer::canvaskit_policy::count_layer_tree_work_units has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce133961a2978429d03100cf769d43ef5fc59a3a790672fa889b8ca2630163"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::apply_reflowed_equation_row_metrics (cognitive 31): rhwp::renderer::composer::line_breaking::apply_reflowed_equation_row_metrics has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (6 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d36d45885bec4bc4818526719ee7101c13d67857910ea658f3eb1e14ee0e389"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_empty_control_table_frame (cognitive 31): rhwp::renderer::float_placement::stored_empty_control_table_frame has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 14 (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":"src/renderer/float_placement.rs"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c2ce19ac5f04db39df94b7c535d10887af68072a7f4829d2840f4f4222578"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_editor_tail_frame::stored_editor_tail_frame (cognitive 31): rhwp::renderer::float_placement::stored_editor_tail_frame::stored_editor_tail_frame has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 13, 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":"src/renderer/float_placement/stored_editor_tail_frame.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e166ca2e6a87baf89c1c99b6fc571f771187cdc42abe7b41013c45b197d9a78"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::font_symbol_coverage::bitmap::may_supply_ink (cognitive 31): rhwp::renderer::font_symbol_coverage::bitmap::may_supply_ink has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_symbol_coverage/bitmap.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"377c6332c4a42345795ac30ecc57c7e41f47b11cc2426a7b7196896005dfbb77"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::render_transparent_borders (cognitive 31): rhwp::renderer::layout::border_rendering::render_transparent_borders has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 4 (6 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca700c3cf2ec1a145ad2ddddf0395b92805e7d617e88cddbfb643c5cfea24f76"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::try_resolve_styles_for_document (cognitive 31): rhwp::renderer::style_resolver::try_resolve_styles_for_document has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/style_resolver.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66bffbd30463cee43648921022050dfccb8060c74d188317ff415cee232b366"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::serialize_group_child_records (cognitive 31): rhwp::serializer::control::serialize_group_child_records has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 6 (13 pts), match/switch 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":"src/serializer/control.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3b8d90bec2f7c13a9432790a78f8f79e1c6706910ada378c42eb1b4890ec62"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::write_section_with_storage (cognitive 31): rhwp::serializer::hwpx::section::write_section_with_storage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 pts), match/switch 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"346b5ec87083f247f0ef80ad2f43d93d6ade26029119682b6a6659a782bab247"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_desk::planner::substitute_cli_args (cognitive 31): rhwp_desk::planner::substitute_cli_args has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 18). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/src/planner.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"653318c59ff67775a375e86cd6450367fb83ba6a2135be5bd0b6d051d37a0bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.extract_json_fragment_rows (cognitive 31): pack_health.extract_json_fragment_rows has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 1 (5 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"gym/tools/pack_health.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d355b477a71071429f4cbdd2cd89461a6862c87e4523f29784dd0248d8b62583"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.fragment_looks_like_answer (cognitive 31): pack_health.fragment_looks_like_answer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 1 (2 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":"gym/tools/pack_health.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"87896f9dc3fc658e70d376219fd6fc30b5404b914248d30653c475805ea745f1"}},{"ruleId":"D2","level":"warning","message":{"text":"condense_rule_replay.replay (cognitive 31): condense_rule_replay.replay has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (11 pts), boolean chains 4, loops 3 (4 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":"mydocs/tech/investigations/issue-7418/probes/condense_rule_replay.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bfc1f2539c766d014cda2de1d6caf7d64b4ec0b1147362a5617329e8ae6694"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildGranularControlDiffs (cognitive 31): diff-engine.buildGranularControlDiffs has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, ternaries 4 (10 pts), if/else 4 (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"75640989eb23461279283686071989f33255636539148726b941f4aef24c160b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow-image-clip.flowImageOpsFromNarrowQuery (cognitive 31): flow-image-clip.flowImageOpsFromNarrowQuery has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 7 (11 pts), boolean chains 4, error handling 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73faf31b86568a429f542c05c4ae284aa826e4f180d217cea70a0e7cd99aa70"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::prepare_table_rows (cognitive 30): DocumentCore::prepare_table_rows has cognitive complexity 30 (threshold 15). Drivers by points: loops 11 (15 pts), if/else 9 (14 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template_rows.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aecb4fafec85a3ae94b2d799b43acaa45b69ceaf6220e99a67db4ac7928d896"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::finish_loaded_source_cache_after_cell_edit (cognitive 30): DocumentCore::finish_loaded_source_cache_after_cell_edit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 4 (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":"src/document_core/loaded_frame_restore.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66bc06ebb851a02a35c03c10b2397fad5cc9bb2e75ce789463a55118a594b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::delay_empty_anchor_topandbottom_flow_units_before_hard_break (cognitive 30): LayoutEngine::delay_empty_anchor_topandbottom_flow_units_before_hard_break has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 7, loops 3 (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":"src/renderer/layout/table_layout/deferred_flow_units.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e166605e47c586461235f3732880cf41057a7b760cc87f7baceffdd57797c943"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_closes_shared_original_frame (cognitive 30): LayoutEngine::row_cut_closes_shared_original_frame has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdbe8bf37f86e5434ddc7fbbaecea5864791dd10fbb006c6b50f08cf7c7c365"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_plain_restart_cut (cognitive 30): LayoutEngine::stored_plain_restart_cut has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 11, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22584}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3b34ce77ab1dffed2ea8ef60e808e5d6e14a46f2bd7239fef8823b02664d44"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfFontFallbackIndex::select (cognitive 30): PdfFontFallbackIndex::select has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (3 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":"src/renderer/pdf.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb12a4a3ea03477537fecc2d1742e7f899658d8013d2bc8e02f6c9c445e5860"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::prepare_saved_empty_run (cognitive 30): TypesetState::prepare_saved_empty_run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 7, 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":"src/renderer/typeset/state/empty_run.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc56caec1dc0c893d013c8e2530cef16de5269636550443d13a210fff30e5614"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::char_index::run (cognitive 30): rhwp::bin::rhwp-q::kit::char_index::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (14 pts), 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":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fcdcc4ff8282a7d6e80bcd390d4b3f323afe440d50f3c678d534112a5ba47f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::field_info_at::run (cognitive 30): rhwp::bin::rhwp-q::kit::field_info_at::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 6 (14 pts), 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":"src/bin/rhwp-q/kit/field_info_at.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5328271bd53f96430a27612add501b91dbb1cbcbe037e8211a9ada69380e16e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::caption_validation::run (cognitive 30): rhwp::cli::commands::caption_validation::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 6 (10 pts), loops 4 (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":"src/cli/commands/caption_validation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ef3f9a94cf9b76a561d09e257239361d1d264eaeaf11309ca266f15799da25"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::conversion::extract_pages (cognitive 30): rhwp::cli::commands::conversion::extract_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 5 (6 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":"src/cli/commands/conversion.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be693b0594d0d50323300b575abe18f84913599e9903e8bbb3ce241b3431e80"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_add_bookmark (cognitive 30): rhwp::cli::commands::edit::bookmarks::edit_add_bookmark has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 6 (12 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark) 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"af531c5138658413c174e7471e7fccd56461a721780ae5b2293ed2e71f75dedc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark (cognitive 30): rhwp::cli::commands::edit::bookmarks::edit_rename_bookmark has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 6 (12 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::bookmarks::edit_add_bookmark) 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3322748fe343e13045e3d140eb186e95fa0fa1e791cf1056a3ec05edba46a200"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_delete_text (cognitive 30): rhwp::cli::commands::edit::document_text::edit_delete_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 6 (14 pts), 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e672ada216f015fd4adc5889e0747130e90d60ea76bfb9c842d4da4cef5726"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_delete_text_in_footnote (cognitive 30): rhwp::cli::commands::edit::note_content::edit_delete_text_in_footnote has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 6 (14 pts), 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbc0dac824215ebc08348f8bdf1ad622e88d5410f69304c14ad22eac274d55"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_merge_paragraph_in_footnote (cognitive 30): rhwp::cli::commands::edit::note_content::edit_merge_paragraph_in_footnote has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 6 (14 pts), 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c60eb775b6cc504609c774e86c2878ebef7a17d17aa92118678fa7d2c8a3862"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_apply_para_format_in_footnote (cognitive 30): rhwp::cli::commands::edit::note_content::edit_apply_para_format_in_footnote has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 7 (12 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d93e22076dd8afee03283e024fb9b591728e23bf8d3788ac7b34ead77c00a68"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::privacy::sanitize_summary_information (cognitive 30): rhwp::cli::commands::edit::privacy::sanitize_summary_information has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3088cbdff5e634cbead6a66719701ee15f11304bf28757582ef1370f669bff1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_insert_row (cognitive 30): rhwp::cli::commands::edit::tables::grid::edit_insert_row has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_insert_col) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c420aacbbca16ac159e8715fc33ea9368b3b14a15c819e6229b2552f475d75"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_insert_col (cognitive 30): rhwp::cli::commands::edit::tables::grid::edit_insert_col has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_insert_row) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8b4b836d1012b69bc59fc02d172b8f853f58b8f8c808c820a332156f061ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_delete_row (cognitive 30): rhwp::cli::commands::edit::tables::grid::edit_delete_row has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_delete_col) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"491fa62b4078e0862ac8473f642db56e83a801e172d4a541aae6d1fcfd5f2663"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::grid::edit_delete_col (cognitive 30): rhwp::cli::commands::edit::tables::grid::edit_delete_col has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 5 (10 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::grid::edit_delete_row) 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8ee37b10066f80ba1894af33d89e461f124093200033721e940cc516fca0a0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::for_each_ole_mut (cognitive 30): rhwp::document_core::converters::hwpx_to_hwp::for_each_ole_mut has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (9 pts), match/switch 2 (3 pts) (nesting depth added 13). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 5 function items inside it that branch (walk_shape, walk_controls, walk_drawing, \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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e09be769222373adc848edb6b478f2c62243fd9ba0f364aa3be71140aeac865"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::materialize_object_attr_bit28 (cognitive 30): rhwp::document_core::converters::hwpx_to_hwp::materialize_object_attr_bit28 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (10 pts), boolean chains 2, match/switch 2 (nesting depth added 10). Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (walk_shape, walk_control, stamp, \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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d875fe57ff6dd49b933f6c997e88066d3b43ffc0430653a967e014d8547a981"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_para_shape_mods (cognitive 30): rhwp::document_core::helpers::parse_para_shape_mods has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, match/switch 3 (6 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":"src/document_core/helpers.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a567fbaacf26fedea627e5e593a3ad49372ebbca62a90796274a8411543f05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::explain::count_from_paragraph (cognitive 30): rhwp::document_core::queries::explain::count_from_paragraph has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 19). 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":"src/document_core/queries/explain.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4c174f71d20397a604e47f0f267cc1d024d49da4bdc87fb1316dab71761e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::main (cognitive 30): rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::main has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (15 pts), match/switch 3 (9 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-705/probes/scan_cell_pagehide.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8754ad228ba553dfccdfe9d9de3c94207a3bd6cd4a789ab7b716d0e07fd9ac40"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_variants::validate_leaf (cognitive 30): rhwp::paint::text_variants::validate_leaf has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (4 pts), boolean chains 2, match/switch 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":"src/paint/text_variants.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"923902b8838bbfed4f05ff940d7bda55f1f499cd30a12732bf3dd79c0124e8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::link_orphan_field_ends (cognitive 30): rhwp::parser::hwpx::section::link_orphan_field_ends has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b09a1252e80491782e53c6c16da17d078178c2131696c6a65b61076b44454"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::read_text_content_with_tabs (cognitive 30): rhwp::parser::hwpx::section::read_text_content_with_tabs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (5 pts), boolean chains 2, 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa378c5ba5c089c4bf2cc19e11ec635a1800a39d3947edb88277f34048ac8e07"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::normalize_edges (cognitive 30): rhwp::parser::pdf::table_detection::normalize_edges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e0a7743fee9ef7efc57517e0aba3eeeedc963b5adba4520b0fd515410a53c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::bitmap_raster::prepare_bitmap (cognitive 30): rhwp::renderer::bitmap_raster::prepare_bitmap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 6, 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":"src/renderer/bitmap_raster.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae87a99ad9af1814f3adab3ef4b2d352c5145462ee497fa9b8f8f4fc8eb29ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::pua_surface::inc::try_convert_pua_enclosed_numbers (cognitive 30): rhwp::renderer::composer::pua_surface::inc::try_convert_pua_enclosed_numbers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 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":"src/renderer/composer/pua_surface.inc.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36a796bb1e791c0b1677229bc4d4283faaaa4a251647ad07de5921a22a7bb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::reflow_helpers::inc::recompose_stored_single_line_if_overflowing_cached_with_storage (cognitive 30): rhwp::renderer::composer::reflow_helpers::inc::recompose_stored_single_line_if_overflowing_cached_with_storage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea7f6c348a136e11dd19958abfc3b4ab3ac394d3b4f9c9ddb9aadca702f3969"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::justification_spacing::compress (cognitive 30): rhwp::renderer::layout::paragraph_layout::justification_spacing::compress has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 7, 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":"src/renderer/layout/paragraph_layout/justification_spacing.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51d176e44519ff80301dd9eaeff35cf0cc826ae69da2fdcc45d2ad6c89ffd77"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage (cognitive 30): rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, 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":"src/renderer/typeset/inline_flow/plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeea4658a7edbcdc7260e94fd147ada9a074e53fa07a4acbe345db37913e2e57"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::initialize_first_paragraph_origin (cognitive 30): rhwp::renderer::typeset::paragraph::content::initialize_first_paragraph_origin has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 11, 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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"7330dea5ab6958b0f96b032dbe6e0b51ce9f9d3775e76dfc59459c1d25d7ea8f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::web_canvas::detect_image_mime_type (cognitive 30): rhwp::renderer::web_canvas::detect_image_mime_type has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 14. 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":"src/renderer/web_canvas.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7b1821a152bea8a31f3a3fc0061ae46fa96dce16979d7950cbadafc6f254e"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-font-cmap.repairTerminalFontCmap (cognitive 30): browser-font-cmap.repairTerminalFontCmap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 7). Of this number, 26 points are the body\u0027s own statements and 4 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":"rhwp-studio/src/core/browser-font-cmap.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0b5cccbac52322ea894da5329594b3887e9d6a4289246e4c427f53144c452e"}},{"ruleId":"D2","level":"warning","message":{"text":"canvas-intrinsic-font.fontProgramOwnsFamily (cognitive 30): canvas-intrinsic-font.fontProgramOwnsFamily has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 7, loops 2 (3 pts), error handling 1, ternaries 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":"rhwp-studio/src/core/canvas-intrinsic-font.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5d1badb4e72796ca2132096aa912fe8dfdbdb42434effea2a282cfddc04d58"}},{"ruleId":"D2","level":"warning","message":{"text":"sfnt-face.repairMinimalFormat4Length (cognitive 30): sfnt-face.repairMinimalFormat4Length has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, loops 3 (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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac99489594874d8c688f760ce981e06a608885369eda711cf97b706f288d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"image-header.gifHasSingleFrame (cognitive 30): image-header.gifHasSingleFrame has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"506642ccca52345df4a6f86780a70b2b28bab1afcc07a71c5ccc8c2a277018a4"}},{"ruleId":"D2","level":"warning","message":{"text":"bounded-response.readBoundedResponseArrayBuffer (cognitive 30): bounded-response.readBoundedResponseArrayBuffer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 5 (10 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 8). Of this number, 27 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/view/canvaskit/bounded-response.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf0da76f3ae13ab60b9e18aedeb0f7312b7d43bfe8c53e2d770839f6f2b81d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderColorPaintGraphNode (cognitive 30): CanvasKitLayerRenderer.renderColorPaintGraphNode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 9 (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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba509a3b935345f277452074d0182b9f3112936c5d63a4b1d1efffac19af1a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageRect (cognitive 30): CanvasKitLayerRenderer.drawImageRect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, ternaries 2 (4 pts), error handling 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acc2b35ff1c70b076764e5a6d5ed2714ee26bc4eaa701e8343692194bc99f48"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.findPictureBbox (cognitive 30): input-handler-picture.findPictureBbox has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (21 pts), boolean chains 4, loops 2 (3 pts), error handling 1, ternaries 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c5b8e1a33085e333827fc8659e6bf3f30fab6c5f28cdb218b90738aa01ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"_decode (cognitive 30): _decode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 9, other 1 (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 1 belongs 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae36a87bfb76b2593858b4c9b1da8873d2e4af84d1720e4f0b25a66c0ec488b"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPrvImage (cognitive 30): extractPrvImage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cab9a24f30f8a4c7d766d1318c85d3432bf90254f8deadf0274d14a8cbc0391"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPrvImage (cognitive 30): extractPrvImage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e63f1f444523c183718acafe93094fccb1998f26c71a9e3183866f5ea7e298"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect (cognitive 30): inspect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 3 (4 pts), ternaries 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":"rhwp-firefox/dev-tools-inject.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b0859cb45bf09b56c6f335dd3848da926dc547b3b994cb32d1f5b961b0edb0"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect (cognitive 30): inspect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 3 (4 pts), ternaries 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9053152b8f71154fc865f499f36287092f9c8fa9598dd5a72e83e922146f6dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_stock (cognitive 29): rhwp_ooxml_chart::renderer::render_stock has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"d665d855d39c0c40e9837e121e2af02b174f597f93ab975e436dcafab5cdf14b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pool::import (cognitive 29): Pool::import has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 3 (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":"src/document_core/commands/paragraph_block/import/resources/binary.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee60558e9a8e7c03067af2467df7b014596adf27d7ed12ed1b16163b3c60967c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::copy_selection_logical_native (cognitive 29): DocumentCore::copy_selection_logical_native has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d734c3e32e2feeb3795364c87d810338bf7ede30ce5ba7f6ff5bb447693ed405"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_in_header_footer_native::find_cursor_in_hf_subtree (cognitive 29): DocumentCore::get_cursor_rect_in_header_footer_native::find_cursor_in_hf_subtree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 3, loops 1 (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. This shape REPEATS in the file: one other method here (DocumentCore::get_cursor_rect_in_header_footer_native) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4772}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf799b6b7a24bc410137ac042367fadf11f229c1871c55058ef1c6b06150a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_plain_matrix (cognitive 29): EqLayout::layout_plain_matrix has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (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":"src/renderer/equation/layout/plain_matrix_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f472b701f509ca991de634c9d40c2764288b29b185c68c93f3323d78403e266d"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::parse_sequence (cognitive 29): Cursor::parse_sequence has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 pts), match/switch 1 (2 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":"src/renderer/equation/legacy_hwpeq.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"687181279aed564cffd6f28c5625cd5bb4b0cb8cf5d819e9232a64fcfc7ee82c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::shared_frame_peer_owner (cognitive 29): LayoutEngine::shared_frame_peer_owner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 5, 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":"src/renderer/layout/table_layout/stored_shared_cell_frame.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a3be8290ba6722101bef362385ac65ffd60f299e1bc1fdd11138731ec08b65"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_page_number (cognitive 29): LayoutEngine::build_page_number has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 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":"src/renderer/layout.rs"},"region":{"startLine":6535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baa0d20e10d0874fe553ec1c104955c165901971ca2873fcd3b19c730999328"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_node (cognitive 29): WebCanvasRenderer::render_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (3 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":"src/renderer/web_canvas.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58e2b11bac565447243787f82870a68db637bf28a8ddec1ee2adf7bf75a3e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::word_end::run (cognitive 29): rhwp::bin::rhwp-q::kit::word_end::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 6 (13 pts), 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":"src/bin/rhwp-q/kit/word_end.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209b651469adace5b8fa45c9ccce3e5a91911d0812df387b1ca4782748e5a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::fields::fill_fields_core (cognitive 29): rhwp::cli::commands::edit::fields::fill_fields_core has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (6 pts), boolean chains 3, 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fde580a244a50cd8f03b99d1233937cd3e0868e5f3edb76bb330128cc173db"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_toggle_hide_hf (cognitive 29): rhwp::cli::commands::edit::header_footer_properties::edit_toggle_hide_hf has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 6 (12 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3285f866111f3331eaf1b57fcbf2c355fc777f01fe0fa59e56f465cd1b699c20"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::diag_document (cognitive 29): rhwp::cli::queries::diagnostics::diag_document has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 6 (7 pts), match/switch 3 (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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"152333400a6bd94847e94ce53426e2a6e403df82d486fc7b27b5e5b88a0404dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::page_dump::run (cognitive 29): rhwp::cli::queries::page_dump::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 5 (12 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":"src/cli/queries/page_dump.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4532bf2f16dcc346fb70d583bce8fe3367a6e49f3263587d9c50cc7b956b677"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::structured_objects::form_value (cognitive 29): rhwp::cli::queries::structured_objects::form_value has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 7 (12 pts), 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":"src/cli/queries/structured_objects.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2e215d7ef3d61318a618e9b16831590b14e9fdf4bcf431d2111ab2371a94b6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::compute_hwp_used_height (cognitive 29): rhwp::document_core::queries::rendering::compute_hwp_used_height has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 6 (10 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":9233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26eca00042af0e4f28d6a88498db157f88ba55f9c4ee0650af1d79e7c216a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::hyperlink_format::attach (cognitive 29): rhwp::model::hyperlink_format::attach has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (9 pts), match/switch 1 (3 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":"src/model/hyperlink_format.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d3029ccb2d395cca166d73d69ea4e45936cac531f3f5d0634ae48cf8720248"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::paint_bounds::glyph_path_bounds (cognitive 29): rhwp::paint::paint_bounds::glyph_path_bounds has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). 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":"src/paint/paint_bounds.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c072ff45b320564a9bcaeb027abd55eea56c7c35c368f923ad29b0c97e6801"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::load_bin_data_content_lenient (cognitive 29): rhwp::parser::load_bin_data_content_lenient has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (12 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":"src/parser/mod.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65b59e90e8e79c18671a740acb3b102e106572c475061c5c00009956f3cd656"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::parse_field_control_char (cognitive 29): rhwp::parser::hwp3::parse_field_control_char has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (10 pts), loops 1 (2 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7805b49cc687ba5fb31f8d88b1ccbc02af8947d41026203058c7c8a136206cc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_container_body (cognitive 29): rhwp::parser::hwpx::section::parse_container_body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (23 pts), match/switch 2 (5 pts), loops 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":"src/parser/hwpx/section.rs"},"region":{"startLine":5103}}}],"partialFingerprints":{"codehealthFindingId/v1":"45616aac9120d41c440cc490cfb2a27b0d6e73b1075ba3e8f7354e0f58382a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::char_overlap::project (cognitive 29): rhwp::renderer::char_overlap::project has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 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":"src/renderer/char_overlap.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0c55b5fac357f7e6108b7597e260ccbabde8b0a56b47fb37016f5acf2850a2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_codec::print_device_image_payload (cognitive 29): rhwp::renderer::image_resolver::print_codec::print_device_image_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_codec.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d6be8bedd92e5fb47468aa821e674434ac75363eb4922dd7add6099cd481cc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::measure_char_width_embedded_decision_for_font (cognitive 29): rhwp::renderer::layout::text_measurement::measure_char_width_embedded_decision_for_font has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 11 (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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3d3c8ef6f7cb0f8e5b427b86d8f653da213dfb6322486d2d2b6d231557676f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::prepare_glyph_effects (cognitive 29): rhwp::renderer::skia::glyph_replay::prepare_glyph_effects has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c32e3348960d5a6a131cf907bd89c4a2ca3b19d2de050addd7f6a062b69b0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::mini_cfb::try_build_entries (cognitive 29): rhwp::serializer::mini_cfb::try_build_entries has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 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":"src/serializer/mini_cfb.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29fd435a5368f580a0e3e346c45ba7306586f5bf9fc43d289b88d296f0b34da"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_docx.main (cognitive 29): extract_docx.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (4 pts), ternaries 3 (4 pts), boolean chains 1, error handling 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":".claude/skills/rhwp-exam-ingest/helpers/extract_docx.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4195892ed95300096d25e9bf550d53372288d25e3856e63d23d76d2579d3dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildTableSummary (cognitive 29): diff-engine.buildTableSummary has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 3 (9 pts), error handling 5 (8 pts), if/else 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"652d7a3ca3199cded7ea897fac74a5cbcb18a6fbbf41786960d5398ee022f171"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.fillMissingParaAnchorsFromNeighbors (cognitive 29): diff-engine.fillMissingParaAnchorsFromNeighbors has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb5675bb717e55ab654f5eddd4865074cd02afb69d68310aa7f79aae6309382"}},{"ruleId":"D2","level":"warning","message":{"text":"font-rule-runtime.resolveProjectedCanvasKitFontPlan (cognitive 29): font-rule-runtime.resolveProjectedCanvasKitFontPlan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), ternaries 2 (5 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":"rhwp-studio/src/core/font-rule-runtime.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9963148b2f1afe97c997289158b3fce7149fb00da2001746814cd63de85dd8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"host-font-requests.collectDocumentCanvasKitFontUsage (cognitive 29): host-font-requests.collectDocumentCanvasKitFontUsage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), ternaries 1 (5 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275e5f9e736667d968a28dc17a4c3e50f2547092d3dac48df405208b027466e"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualScroll.getVisibilitySnapshot (cognitive 29): VirtualScroll.getVisibilitySnapshot has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (8 pts), ternaries 4 (5 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a5d491d6b9cae2a228f6d7e352398197876ed62277259d19ec9ff9a055a31d"}},{"ruleId":"D2","level":"warning","message":{"text":"compatibility-glyph-view.compatibilityGlyphView (cognitive 29): compatibility-glyph-view.compatibilityGlyphView has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, ternaries 3 (8 pts), if/else 4 (6 pts), loops 2 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 12 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":"rhwp-studio/src/view/canvaskit/compatibility-glyph-view.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab7045b7ef79d7c4238a1eef2e8323192e5114c52411497f96e93f2e3bf1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.decodeStaticSvgXmlEntities (cognitive 29): static-svg-path-layers.decodeStaticSvgXmlEntities has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 2 (7 pts), boolean chains 5, 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"45727d0337bde0307b8990e1a10d04c36966f7129dcf703b9b0004e12fe5eb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.finishTextboxPlacement (cognitive 29): InputHandler.finishTextboxPlacement has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, ternaries 2 (3 pts), error handling 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d7a32a6fdcaa892e86c3f3e40215d4278365b8fd9c90b5ff98a8d31610073"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartDataDialog.renderGrid (cognitive 29): ChartDataDialog.renderGrid has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (7 pts), boolean chains 2, loops 1 (nesting depth added 13). Of this number, 16 points are the body\u0027s own statements and 13 belong to 3 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00087a1b4000771c2cea26e2fca259e25a873faa89de9aa38210d280be622c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_line (cognitive 28): rhwp_ooxml_chart::renderer::render_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6644b3da9a57a5fd9b303436723173f718f4c39279b5169b6b34d771acb1af"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_para_properties_at_native (cognitive 28): DocumentCore::get_para_properties_at_native has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (3 pts), match/switch 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf03da9acdd4e39be8d101659fddff96dee25887aa0a04726cfc4ceaa534b68"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::ungroup_shape_native (cognitive 28): DocumentCore::ungroup_shape_native has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 6 (10 pts), loops 3 (4 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b380639d33200ce608f30643f580cd94b9de5482eb457afa104f637479da6"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_in_footnote_native (cognitive 28): DocumentCore::get_selection_rects_in_footnote_native has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 2, loops 2 (nesting depth added 10). Most of this is not in the body itself: 13 of the 28 points are its own statements and the rest belongs to 2 function items inside it that branch (collect_runs, x_at). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1707edb7150f91d51cfb427d81ff65b274705742666c80caa0a466c6b1beb7f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::rebuild_embedded_exact_font_sources (cognitive 28): DocumentCore::rebuild_embedded_exact_font_sources has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (5 pts), boolean chains 3, 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d5e69193cb8cfa1cc2957e841cdb475788dc89023d756a53bc8e3ac9c58189"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_section_def_json (cognitive 28): DocumentCore::apply_section_def_json has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (26 pts), loops 1 (2 pts) (nesting depth added 4). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2646f3ba904298e9a686b10c349c4fea47a70a6b7d23a04603aa1add904bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePaintContext::publish_glyph_geometry::collect (cognitive 28): PagePaintContext::publish_glyph_geometry::collect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (22 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":"src/paint/paper_viewport.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae4ed194dddbc1292132c649ac3b46a0d677773517f5bd8ba80a5bc8818ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_ladder (cognitive 28): EqLayout::layout_ladder has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 6 (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":"src/renderer/equation/layout/ladder_geometry.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a91fea9b0bc6eade36687495c85de5b79f2fc3c6d8ee26c948747df8265655"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_matrix (cognitive 28): EqParser::parse_matrix has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_structures.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aacc0e494c8f5e66af9e8a4b2245e2604936573a25ec3d217bedba77afcc8f"}},{"ruleId":"D2","level":"warning","message":{"text":"CondensePlan::prepare (cognitive 28): CondensePlan::prepare has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, 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":"src/renderer/layout/paragraph_layout/condense_spacing.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"839690a943e87f9fe40404f68477b78cab691e01b7547755648363be1a232e84"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_group_child_affine (cognitive 28): LayoutEngine::layout_group_child_affine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts), boolean chains 1, match/switch 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb68268cdc6ac773c580fa838f177f716842377f4840d694d2ac2ae85106332"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::reflow_external_cut_frame (cognitive 28): LayoutEngine::reflow_external_cut_frame has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 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":"src/renderer/layout/table_layout/reflow_external_cut.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4282b87237aaddd14f395a82c02e320e4915d87adb56e108922e824e330c29"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::reflow_nested_closing_band (cognitive 28): LayoutEngine::reflow_nested_closing_band has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, 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":"src/renderer/layout/table_layout/reflow_nested_band.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"64291cdba6a6c0fdacbece729ac921342236bc17311bb2ccfe273edb8cdebc8e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::nested_cut_height (cognitive 28): LayoutEngine::nested_cut_height has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26889}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebc805bf9a775577ed6a1c01d81fb213ff9b7e347603e4b0910526389929493"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderNormalizationOverlay::collect_nested_tables_with_storage (cognitive 28): RenderNormalizationOverlay::collect_nested_tables_with_storage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb37cf5cc40284ac973751a66e7693a6fc0e88680d717bcba64243042deb266"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::agent::dsel::lex::lex (cognitive 28): rhwp::agent::dsel::lex::lex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts), boolean chains 5, match/switch 2 (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":"src/agent/dsel/lex.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0f12cbb14978c10208c71fb55ad3882da67afd473522a46ab1c689dadb0eee"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::cur_field_state::run (cognitive 28): rhwp::bin::rhwp-q::kit::cur_field_state::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (12 pts), 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":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cae51e29a7832a795b035f3de208829761931258f8b2650dc916144e2a477a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::bookmarks::edit_delete_bookmark (cognitive 28): rhwp::cli::commands::edit::bookmarks::edit_delete_bookmark has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 5 (11 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b7185f06b5dc11e7a4694e7281ea3aac5c1d3fe93506c68da82b1645d92994"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_set_equation_properties (cognitive 28): rhwp::cli::commands::edit::equations::edit_set_equation_properties has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (7 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06c18ce3b6788bca2833625687d30e62d58398d91f960bf949abf144ebd021b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::formatting::edit_apply_style (cognitive 28): rhwp::cli::commands::edit::formatting::edit_apply_style has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 8 (13 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7345898e83faa3fa3274df04a056d7161c16357e0569da4ee9248e97dad3519"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture (cognitive 28): rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 5 (10 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40f4ed98b5024037b3dd8d01c1a604ebbf38e03926a37abd83207ef59404ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_insert_footnote_text (cognitive 28): rhwp::cli::commands::edit::note_content::edit_insert_footnote_text has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 5 (10 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c4c930039ca1ba7d3a75cd122a26f4cdc8d965e31aa30bc9773a28b0c31e52"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_move_table (cognitive 28): rhwp::cli::commands::edit::tables::layout::edit_move_table has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 6 (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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"7863ca568ff39c1f1e704abb2545b69f6eaa8c58821d33d74938bd465353757b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_verify (cognitive 28): rhwp::cli::protocol::exchange::settlement::cmd_settle_verify has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 8, boolean chains 4, loops 1 (nesting depth added 7). 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab56cee6ad6c024df494c1375da583411d98c9a3e6cac69c23f9305f52f863e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::position_diagnostics::dump_carets (cognitive 28): rhwp::cli::queries::position_diagnostics::dump_carets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (8 pts), match/switch 4 (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":"src/cli/queries/position_diagnostics.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"826dcb1768e0de67f293c338a5378c11109de856df5848f84635e8ddedc9e649"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::inline_control::remove_slot (cognitive 28): rhwp::document_core::inline_control::remove_slot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, loops 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":"src/document_core/inline_control.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f74451b923b67afe5f1936627ef392c8e5854e30301edb877acd148e70b27a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::emf::emfplus::objects::pen (cognitive 28): rhwp::emf::emfplus::objects::pen has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, 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":"src/emf/emfplus/objects.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb99b754bce6d8d87e95fb41c96539fd42d71808207d02f1313cb53973f8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::pr::assets::pr7143_repro_probe::main (cognitive 28): rhwp::mydocs::pr::assets::pr7143_repro_probe::main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 6 (12 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":"mydocs/pr/assets/pr7143_repro_probe.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b5e3ef9ef9ae2412103582947c1284a5607a951ae468218151d1c92b94f0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main (cognitive 28): rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 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":"mydocs/tech/investigations/issue-836/probes/diag_836.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4abb3a4ce8fa11097e0b981111e43c5e98991eaf87599ba06b11ace8ce5c670"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::ole_chart::legacy_presentation::parse_inner (cognitive 28): rhwp::ole_chart::legacy_presentation::parse_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8, match/switch 3, loops 2 (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":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe7488fc561927c3fec6871a1308d531c7ff482c8a8fd8b3ad6109e5c554de9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_v2::collect_node (cognitive 28): rhwp::paint::text_v2::collect_node has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 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":"src/paint/text_v2.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1036710b9ad2f53d7c3acd8435560c859e4526fe051e94964888a31aedda7e26"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::doc_info::parse_fill (cognitive 28): rhwp::parser::doc_info::parse_fill has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16564a7308a7b5c3150522d44237f56bab59c259826d8f4405c16a096abca82"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_line_shape_attr (cognitive 28): rhwp::parser::hwpx::section::parse_line_shape_attr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 6 (13 pts), loops 1 (nesting depth added 15). Of this number, 26 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4246}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa10c37b1e445f0f95403179de53bed4a8578bd4abc6c073a7b4de5f7f0ae8b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_single_column_cell_flow (cognitive 28): rhwp::renderer::float_placement::stored_single_column_cell_flow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, 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":"src/renderer/float_placement.rs"},"region":{"startLine":7357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce55e391a402a02e683bdc9c4dfdaf268e91c8cb88301f9cdd9ec50e29413d17"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::solve_rowspan_row_heights (cognitive 28): rhwp::renderer::height_measurer::solve_rowspan_row_heights has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (7 pts), boolean chains 4 (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":"src/renderer/height_measurer.rs"},"region":{"startLine":6702}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca735e761d22da8609dbbd0064b387d2ef2ef0882efa94aab34e761a631b38"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_text_metrics::project_with_storage (cognitive 28): rhwp::renderer::render_normalization::stored_text_metrics::project_with_storage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_text_metrics.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"87987be3ca7b9d2c7840ff0760b10a99c68cf6faa54fd9893a129096660bce76"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::wasm_api::pdf_import::options (cognitive 28): rhwp::wasm_api::pdf_import::options has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 3, 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":"src/wasm_api/pdf_import.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cd4aebcebb583819a33550649688140684f9fe37868c50e09ee5d8f643d392"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.write_queues (cognitive 28): _gen_pack.write_queues has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), ternaries 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":".claude/skills/rhwp-chief/_gen_pack.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7a180b183aa863f3841ce05493c6b6be491578d8177dd7d199ac98c2f091bf"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.readSfntFontNames (cognitive 28): local-fonts.readSfntFontNames has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a8ca08ce67aabd9e998830d048131e34f1049432555bdfbde92d9fb1a6dd37"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.matchingCollectionFace (cognitive 28): local-fonts.matchingCollectionFace has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb335a004e7348b0f79eac070e2f4b7ac1ea83649485f7ede3b646e5f8826a7"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitParagraphFonts.source (cognitive 28): CanvasKitParagraphFonts.source has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 3 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":"rhwp-studio/src/view/canvaskit/paragraph-fonts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d49c34a3fc46fd0fc5d7b58002c077e26e1af24515b56c534adb67ad0733ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTextDecoration::drawLineShape (cognitive 28): CanvasKitLayerRenderer.renderTextDecoration::drawLineShape has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (27 pts), match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.renderTextDecoration::draw) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03a9454386a40c3e1427356fc698c85943aac635405273a622e8195b41c450c"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.renderHeaderFooterEditOverlays (cognitive 28): CanvasView.renderHeaderFooterEditOverlays has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 2 (5 pts), ternaries 2 (5 pts), loops 1 (nesting depth added 11). Of this number, 27 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a57435f43d0ea2024d58737f596f451711ecee39ebc7c304e6870217bb45f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentAgentController.revertTextCommand (cognitive 28): DocumentAgentController.revertTextCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (19 pts), error handling 3 (5 pts), boolean chains 4 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 14 belong 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacd4548656663b043ae6b65bfd2359f4e618d028f2a3b65871cd4e80e739a0"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.moveToParagraphBoundary (cognitive 28): CursorState.moveToParagraphBoundary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ee6812c55fdd39e950deb9bca269e5213ca16651d0024afd065af8c8ac25c"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.handleBackspace (cognitive 28): input-handler-text.handleBackspace has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 4, error handling 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcb629bb5c80c722e3bae5115e1477ef3fb3be7564bfb1e534ed9a2454cdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.findTableByOuterClick (cognitive 28): InputHandler.findTableByOuterClick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddccba7bdbb05f4e53277ed91ccd44bead9bf271170f6d2e9e50053f38c39fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareDialog.renderValueDiff (cognitive 28): CompareDialog.renderValueDiff has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (26 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"53854e478c4d7c5d4a69a45cb8c9d669dd7ccd8e45db98a0d0a67b06bef4e4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryDialog.renderValueDiff (cognitive 28): HistoryDialog.renderValueDiff has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (26 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a4072c183c2efb703039a750cb69c6f2a08ed184a65549b8db0e957bb47f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer.renderOutlineTree (cognitive 28): viewer.renderOutlineTree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (6 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 12). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1196, 1176). 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b912056f350699caac35bf349fa436f8decc950dd4dc703ccb07bb63d532f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_category_labels_at (cognitive 27): rhwp_ooxml_chart::renderer::render_category_labels_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"2898635bdf1c0869153092a6aed548088c760116875bf7facc4ea40a0b7bdec9"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_cursor_hit_at_x_on_line::collect_image_candidates (cognitive 27): DocumentCore::find_cursor_hit_at_x_on_line::collect_image_candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 2, loops 1 (nesting depth added 17). 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. This shape REPEATS in the file: one other method here (DocumentCore::find_cursor_hit_at_x_on_line) 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb704816962fdd9de339e2b4ecbafc94dc958415436b2bf87596ec8f8aecc7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts (cognitive 27): DocumentCore::get_selection_rects_for_target_native::collect_rendered_line_starts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, match/switch 3 (5 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. This shape REPEATS in the file: 3 other methods here (DocumentCore::get_selection_rects_for_target_native, DocumentCore::get_selection_rects_for_target_native::find_body_cursor::visit, DocumentCore::get_selection_rects_for_target_native::find_cell_cursor::visit) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe195261027dda4aa14b4498d6ac7a05dca08be36b6becadd38acd01cb6ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_by_path_with_hint::find_cursor_by_path (cognitive 27): DocumentCore::get_cursor_rect_by_path_with_hint::find_cursor_by_path 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. This shape REPEATS in the file: 2 other methods here (DocumentCore::get_cursor_rect_by_path_with_hint, DocumentCore::get_cursor_rect_by_path_with_hint::find_any_run) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4018}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de48a8156ff44934ddd5aa3bfe494b6b110670f1140a91b60112acf4d69fd21"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::header_footer_table_cell_hit::find_cell (cognitive 27): DocumentCore::header_footer_table_cell_hit::find_cell has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5018}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d62dda6e8ea4e3cb0b46bb8e621aab503f8f4d9bf4bafabd665ba9e5c57a32"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hit_test_footnote_native (cognitive 27): DocumentCore::hit_test_footnote_native has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 18). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to one function item inside it that branches (find_fn_idx). 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9183d66ac93a14684995e3db04d439067c3f3ce9d050e745b2c62a1f15591663"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_page_overlay_images_native::collect (cognitive 27): DocumentCore::get_page_overlay_images_native::collect has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (DocumentCore::get_page_overlay_images_native::write_overlay_image) 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae3e649875430fe9b9be97f235a6f2801c79bce296bf127e0a41f718c6024c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_position_of_page_native (cognitive 27): DocumentCore::get_position_of_page_native has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (9 pts), match/switch 1 (6 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d092bcc795bb96bb63ec3573716415fa47d6d8edc54a0080960e7478741f105"}},{"ruleId":"D2","level":"warning","message":{"text":"PageLayerTree::write_text_v2_export (cognitive 27): PageLayerTree::write_text_v2_export has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (9 pts), match/switch 2 (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":"src/paint/text_v2_export.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb83a7e52b9f761986d4c1c18802a515b7fda673f46bb94cd12cd6ef313982d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Hwp3SpecialChar::parse (cognitive 27): Hwp3SpecialChar::parse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (5 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":"src/parser/hwp3/special_char.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6110aeaaae20580f2cb04c100efe188499e52e7fe79082a257b9bc59dc2b87c8"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_command_inner (cognitive 27): EqParser::parse_command_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea61afc8c2e6a7f01382656151406bd8d179b793e6304297c0801f354caa193"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_fraction (cognitive 27): EqParser::parse_fraction has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 3, match/switch 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":"src/renderer/equation/parser_fractions.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f96fbcc919c478fdaca76d78de69f783a8f104dbf1607e4f8fd2498d17c683"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::place_unmatched_line_tac_pictures (cognitive 27): LayoutEngine::place_unmatched_line_tac_pictures has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 1 (3 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee2e2319e97dba45ec1a41eee4d746f49a63d01a493a1f990eae1f0ef20141"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_rowspan_page_frame (cognitive 27): LayoutEngine::stored_rowspan_page_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24091}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c326e32bf72ce05fe0c017f1b1cae45dc2db1d1582dc506c575342551774599"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderTree::clip_overlapping_same_bin_images (cognitive 27): PageRenderTree::clip_overlapping_same_bin_images has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 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":"src/renderer/render_tree.rs"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c90711c4d6af8b54a1f4d2fa3987217e328b2e251e31ae8ccd24df4d975859"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::stored_partial_fragment_height (cognitive 27): TypesetEngine::stored_partial_fragment_height has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 9, 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cfcf678a77d1d4e6acbd18eae3cee009f1e490ea761068d958e1b00d8afde5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::prefill_before_deferred_table (cognitive 27): TypesetEngine::prefill_before_deferred_table has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 9, 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":"src/renderer/typeset.rs"},"region":{"startLine":6570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0543a13839bc7ef84a2f4756310dbecd171a1de0371fa8e8f1469516939570"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::chart_csv::run (cognitive 27): rhwp::bin::rhwp-q::kit::chart_csv::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (8 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":"src/bin/rhwp-q/kit/chart_csv.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ea677963ec358df9458a52e3a2975238281e58de55ec243583d48201dcb57"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_insert_paragraph (cognitive 27): rhwp::cli::commands::edit::document_text::edit_insert_paragraph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (7 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acdb864a5749daad45475e38c2d3118a08c4b6082ca09c97fb454dab9df4198"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::parse_insert_image_args (cognitive 27): rhwp::cli::commands::edit::media::parse_insert_image_args has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7fc52d791e217fc105a58586674fe7961862c3f610ba3cb8a2640ea795db9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_set_picture (cognitive 27): rhwp::cli::commands::edit::media::edit_set_picture has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 6 (11 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cbacb000644fd0cf049daff281614331c946ddae52374ec7f5ba0a5dc0639b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_record (cognitive 27): rhwp::cli::protocol::exchange::settlement::cmd_settle_record has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 5 (8 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8a6e90adb8400331eacd20ab64e4408b8f270ad9498ece9f1c5fe045b501d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::explore::build_menu (cognitive 27): rhwp::document_core::queries::explore::build_menu has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/explore.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b62de1f45b3009925d361aa1d61469cb54ce641e8748da549e6b04e1658cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::stego_scan::scan_whitespace (cognitive 27): rhwp::document_core::queries::stego_scan::scan_whitespace has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88d9bace186f15ce9c559aa7addcb17f31df9322e4f3d064ad0093594bf8480"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::collect_text_variant_features (cognitive 27): rhwp::paint::json::collect_text_variant_features has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 2 (7 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 18). 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":"src/paint/json.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ae28d239506f253abf9db9e89bd8005cc97e5ac182e3d2f626025f0d9739d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::layer_tree::bind_text_run_sources (cognitive 27): rhwp::paint::layer_tree::bind_text_run_sources has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 2 (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":"src/paint/layer_tree.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d0085ef35743120fdc9cadd4c5772145b0c280ef4063795a0ec129484e3621"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_variants::validate_text_visual_node (cognitive 27): rhwp::paint::text_variants::validate_text_visual_node has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (9 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 15). 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":"src/paint/text_variants.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8379e0d5ac636ed605290c3e308855efd87f7b1d690bc6015bee7f6f7719358a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_para_shape (cognitive 27): rhwp::parser::hwpx::header::parse_para_shape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (10 pts), 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":"src/parser/hwpx/header.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2feb6f58b097b577b527a8adc6aa15edbb2256b26b50126dd1f9e71041307"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_ctrl_field_begin (cognitive 27): rhwp::parser::hwpx::section::parse_ctrl_field_begin has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf4577e7518fb8053d8e154322b369be6f8ab69ddb17d2dd74ee078d9ffbe85"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::arabic_context::apply_lookup_with_storage (cognitive 27): rhwp::renderer::arabic_context::apply_lookup_with_storage has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 17). 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":"src/renderer/arabic_context.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc7d1ceccbf2892c2de52ea38128fb3557864ac086c52883d1cf47e3a0dcfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::arrow::heads (cognitive 27): rhwp::renderer::arrow::heads has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (10 pts), loops 3 (5 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":"src/renderer/arrow.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa6bd28c8fe5f40b2bc86fe380fd6da131f529de4221550e15df039c4840701"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::reflow_helpers::inc::trim_leader_fill_overflow_with_storage (cognitive 27): rhwp::renderer::composer::reflow_helpers::inc::trim_leader_fill_overflow_with_storage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"047ce52421af6fc7194163c97ce88405c1e4ba4e23ac8a5b07b164bdf8e578e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::form_appearance::form_drawing (cognitive 27): rhwp::renderer::form_appearance::form_drawing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2, 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":"src/renderer/form_appearance.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85fdceb9172b2a41f6bea9307d804bd5bc2395b2bd96e23c7c783af9bb9312"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::svgs_to_pdf_annotations_impl (cognitive 27): rhwp::renderer::pdf::svgs_to_pdf_annotations_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 7 (9 pts), match/switch 1 (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":"src/renderer/pdf.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bacf8e3a5ea32da15ea34ab86513cbe93b9cb6254b84b85cbf99a767e8c5387"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::font_lookup::typeface_candidates_for_families_for_source (cognitive 27): rhwp::renderer::skia::font_lookup::typeface_candidates_for_families_for_source has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (9 pts), boolean chains 3 (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":"src/renderer/skia/font_lookup.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"be91bbcd8cdbacd9270049f84a13c4ab710523e007736e6612e4376048c4955b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::text_replay::marks::draw (cognitive 27): rhwp::renderer::skia::text_replay::marks::draw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/marks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"880266a157ac5f76ce5d248da78d09b27bd7ff08cf201e57751657e1c43fdf7b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line (cognitive 27): rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (10 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 2). 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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b79657932c91ddf8ba42362bb4ca5697d74336feb65bc524dbe756cbe5ab800"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::boundary::internal_vpos_page_break_line (cognitive 27): rhwp::renderer::typeset::paragraph::boundary::internal_vpos_page_break_line has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 12 (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":"src/renderer/typeset/paragraph/boundary.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf6c2fc60a6fbf862801257d4b38efa22a1b2a057bdcf1f35c3dbc5200192e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::header::write_fontfaces (cognitive 27): rhwp::serializer::hwpx::header::write_fontfaces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 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":"src/serializer/hwpx/header.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90913bc8ae637f7499aa2a0655007f1c6f565c48929b15e397d67d5b6f712d"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.main (cognitive 27): competitive_bench.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"gym/tools/competitive_bench.py"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"346957139ab3726fab836755d5918c8aa79bc722dd93f7ddb8c41c515a281754"}},{"ruleId":"D2","level":"warning","message":{"text":"index.imagePixelSize (cognitive 27): index.imagePixelSize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00541f6cf8d440518931151a7237d548c58ef694e435ec305848d83fcdfe1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildIdentityTextDiffs (cognitive 27): diff-engine.buildIdentityTextDiffs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 1 (nesting depth added 10). Of this number, 26 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"37091c08bfc18fcdeed91c37f263466090b8f1118a0612e33841dcfc4e579879"}},{"ruleId":"D2","level":"warning","message":{"text":"host-font-requests.hancomEquationFamilies (cognitive 27): host-font-requests.hancomEquationFamilies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), match/switch 1 (2 pts), ternaries 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acf1b117400bf694bb20dd7fbcc13cfcfcc69dd77427c8f796e03cf1b497bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"layer-tree-transport.readLayerTreeTransport (cognitive 27): layer-tree-transport.readLayerTreeTransport has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 3 (6 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/layer-tree-transport.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fbc7d0cdd5f74391a8929c7136704f8d7d59c673b594cf4b67c686c0a61d24"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmBridge.prepareCanvasMetrics (cognitive 27): WasmBridge.prepareCanvasMetrics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, loops 3 (7 pts), ternaries 1 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0e738c68cb7254a0ee758835240486839b2955bf00dfe79fd592d63b7da1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"input-edit-invalidation.isPageLocalTextEditCommand (cognitive 27): input-edit-invalidation.isPageLocalTextEditCommand has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (25 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":"rhwp-studio/src/engine/input-edit-invalidation.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78565b0c1c99325de145911d16c5a5d2cef18c7f67ee6de67bd856a0ff47d20"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.findSingleCellResizeTarget (cognitive 27): input-handler-table.findSingleCellResizeTarget has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, loops 1, ternaries 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b33e2ae89006b3ce3d9f47f913fe7e757650e5499e446a1925ccbc345bcb9"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.getParaFormatTargetsForRange (cognitive 27): InputHandler.getParaFormatTargetsForRange has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, loops 3 (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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db020f3c455290e3f899f012f1bb4c46ba25016b496b845be8dc386c97215b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfImportDialog.onConfirm (cognitive 27): PdfImportDialog.onConfirm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12, ternaries 4 (9 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 223, 251, 248, \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":"rhwp-studio/src/ui/pdf-import-dialog.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bd36904230c0f057ddbd722327649785d550979654a11ea4224474a1e90f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareResultWindow.highlightPreview (cognitive 27): CompareResultWindow.highlightPreview has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts), ternaries 4, 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88c87c5a7245b5f88cbdc1dba565dba8b42518b417f3b96edbc89dbb847e7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolbar.setupFontControls (cognitive 27): Toolbar.setupFontControls has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 8). None of this is in the body itself: all 27 points belong to 5 function literals inside it that branch (lines 274, 319, 265, \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":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4a535d1307010859d36bc93d1fbcb889bbbf014480b8dd1144ca3627747fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifyArgs::parse (cognitive 26): VerifyArgs::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (8 pts), 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":"src/cli/queries/verification.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43b4beca648bf91a71ecefe3d0f37e6df61fd21fc21b51813d6299cfe773b5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::from_parsed_document_with_storage (cognitive 26): DocumentCore::from_parsed_document_with_storage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa430d5d293615d63ba87d3165695e51c98e083cf6cf58f1d512cdad75453ed"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::css_to_char_shape_id (cognitive 26): DocumentCore::css_to_char_shape_id has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (5 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb9ab1a0df74fdf039052555abeed0a89edb2e6efc70687315eba408df26a2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_next_editable_control_native::find_in_para (cognitive 26): DocumentCore::find_next_editable_control_native::find_in_para has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (6 pts), loops 2 (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. This shape REPEATS in the file: one other method here (DocumentCore::find_next_editable_control_native) 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3f256ab69f33c7be89d7987ef3fd862eb31e14934f0aa75d7c800748b8fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::create_border_fill_from_json (cognitive 26): DocumentCore::create_border_fill_from_json has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 2, match/switch 1 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 3 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":"src/document_core/html_table_import.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"12adba9fa4b3c4ce3783c0cb72461ffd427893e46b2facd21cb651d0f5196d86"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::move_vertical_native (cognitive 26): DocumentCore::move_vertical_native has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 3 (7 pts), boolean chains 2 (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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"248057aad27d3f496b7e086bddfd54ce127ce63617381cd51ebefce365c18b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_by_path_with_hint (cognitive 26): DocumentCore::get_cursor_rect_by_path_with_hint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 42 (84 pts), match/switch 6 (8 pts), boolean chains 6, loops 4 (5 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 (DocumentCore::get_cursor_rect_by_path_with_hint::find_cursor_by_path, DocumentCore::get_cursor_rect_by_path_with_hint::find_any_run) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f7ef6500b4d03b9e3f7937392c0825e3d2fd2a2010f45a376355928cb4d9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_in_header_footer_native (cognitive 26): DocumentCore::get_cursor_rect_in_header_footer_native has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25 (53 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 29). 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. This shape REPEATS in the file: one other method here (DocumentCore::get_cursor_rect_in_header_footer_native::find_cursor_in_hf_subtree) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5837b013aabf661bc62e3d0f2fdd68be9b986dff9bba4204eeddb4ef8e84cabd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hidden_text_paragraph_pages (cognitive 26): DocumentCore::hidden_text_paragraph_pages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 2 (11 pts), loops 4 (10 pts), match/switch 1 (5 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":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2abeeb612cac7f6cc73b19d93bcf576fbf56740b951e24aa85b2aab45edb6a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::off_page_paragraphs (cognitive 26): DocumentCore::off_page_paragraphs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c315fca97244e22ead8f66ffd31e835867ffee57e4ac0edb003aebeaa8d0824"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::page_caret_starts (cognitive 26): DocumentCore::page_caret_starts has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 3 (13 pts), loops 4 (10 pts), if/else 1 (3 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"213cba2a900f6c4ce24b6df4a6677bbfed8f7905e19e6c2a4711eac54e09e779"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGlPresenter::replay_tiles (cognitive 26): NativeGlPresenter::replay_tiles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (7 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":"src/native_host/gpu_gl.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e09d769d3c42d7f4d01e706e3a5ed73c91b603df6792bd441da325b61c6ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeRuntime::try_recv (cognitive 26): NativeRuntime::try_recv has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/runtime.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fa13a1b647a2729f3030faef488208cdd2f2146bef888c71b3dcc8d29cf3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_matrix (cognitive 26): EqLayout::layout_matrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (9 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":"src/renderer/equation/layout/matrix_geometry.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac38ab90b09c1386768a11fbe8e9e19474840988794c780f97d13711ee2f4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_symbol (cognitive 26): EqLayout::layout_symbol has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5, 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":"src/renderer/equation/layout.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5e445fd0709c7285801ff0766a61f37ce2b45a20ffd769963357892805f226"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_math_symbol (cognitive 26): EqLayout::layout_math_symbol has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f54910c6075d7df823d02f8d54b06b04c7735c5bba79ad9871830431d3c8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ParagraphFloatPlacement::from_stored_overlay_guide_chain (cognitive 26): ParagraphFloatPlacement::from_stored_overlay_guide_chain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 9, 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":"src/renderer/float_placement/stored_empty_host_frame.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f61352c45bf457106e681b30f394eb1de6837948f728c04b816eed0475426d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_partial_paragraph_with_spacing_before (cognitive 26): LayoutEngine::layout_partial_paragraph_with_spacing_before has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, match/switch 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"995e30910c80153a32c44a10dd5b3b34df3fd99648d30b6f839acebc11e641f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_footnote_paragraph_with_number (cognitive 26): LayoutEngine::layout_footnote_paragraph_with_number has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabc04d5a5ee9c9a6a89c1ca5e7dbbeb0b555f483a43a35b161309a218d9b500"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::standalone_table_char_border_fill (cognitive 26): LayoutEngine::standalone_table_char_border_fill has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"14165ed48cec72420267690e0823409c1ed3a25a34622410d05e18b70bcb4120"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::trust_declared_row_heights (cognitive 26): LayoutEngine::trust_declared_row_heights has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2321233dbe053826ed46d6749ec9454bd18fa99668d55e7e6c6e5708897aa66e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::compute_tac_pic_x (cognitive 26): LayoutEngine::compute_tac_pic_x has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts), match/switch 3, 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":"src/renderer/layout.rs"},"region":{"startLine":17511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b10a79dd4bd08b850e6b4a7a5e27f1c7010a434865e73921a0656aa74a1b493"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::difftext::diff_lines (cognitive 26): rhwp::bin::rhwp-agent::difftext::diff_lines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (7 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea0310e9a1eae8df342cd69ec1afd357bcf162a375ed6f296be04e80f486dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::grepcmd::run_grep (cognitive 26): rhwp::bin::rhwp-agent::grepcmd::run_grep has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (4 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":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"df08c68e190956f3f1b9090621127b2b6cbe0b1a24ae6f51e1f50c76ef8c26b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::bin_data::run (cognitive 26): rhwp::bin::rhwp-q::kit::bin_data::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (6 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":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9259b923a87700c884e9a7b32b8630bc70399715e5a50ca9d60d6e322bc2bd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::batch_fill::run (cognitive 26): rhwp::cli::commands::batch_fill::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (9 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":"src/cli/commands/batch_fill.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"42323ee2cc9ab1d992fc03d90b6caed0b8d6106ae3eebe1edbd0829fac18f770"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_delete_paragraph (cognitive 26): rhwp::cli::commands::edit::document_text::edit_delete_paragraph has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_merge_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c20ffdf6c7ac8e8b37153f623c820e388e81325bf9ff5f3f9bb840da8cf4f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_merge_paragraph (cognitive 26): rhwp::cli::commands::edit::document_text::edit_merge_paragraph has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::document_text::edit_delete_paragraph) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"8526d5da087ed1ab8a4a55ad8411d2d11a287c607f5ae374ff104c21c6424c54"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_page_hide (cognitive 26): rhwp::cli::commands::edit::page::edit_set_page_hide has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (10 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb51371690b71c9162ff189f393b42e7b7f5964b4328d60e4539dbc2f4bf173"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::data_extraction::extract_data_command (cognitive 26): rhwp::cli::queries::data_extraction::extract_data_command has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 8 (10 pts), loops 3 (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":"src/cli/queries/data_extraction.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"674cd6c89858aedeecd2ee855cc4962a919ef249ef5c36ccd70367a2ad80b6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::armor_command (cognitive 26): rhwp::cli::queries::security_inspection::armor_command has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 6 (8 pts), loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c2a9cccd0cdbb203dc76b7b74e4248cac4ffcd36f9bce921a2538e5bd0adce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info (cognitive 26): rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info has cognitive complexity 26 (threshold 15). Drivers by points: loops 13 (16 pts), if/else 5 (10 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7312a2ed4c82785049cf58df190fb8dce6ba1eb4ece5faf5255f2ef3f0a2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::header_footer_ops::lower_header_footer_field_markers (cognitive 26): rhwp::document_core::commands::header_footer_ops::lower_header_footer_field_markers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f8aad1791d80bb03535d282442ffa40298b63421642acef0e4600e808279b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::text_editing::focused_cursor_local_geometry (cognitive 26): rhwp::document_core::commands::text_editing::focused_cursor_local_geometry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b93a06ac0bfd4e2f0363998b60e424e44b70282cb616582914ebae0027d0eae"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::diagnostics::check_paragraph (cognitive 26): rhwp::document_core::converters::diagnostics::check_paragraph has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (9 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":"src/document_core/converters/diagnostics.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff58dac59e49335bdf0ac77f0d90b73f4976657c55676826b024d545e777d46"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::chart_extract::collect_from_paragraph (cognitive 26): rhwp::document_core::queries::chart_extract::collect_from_paragraph has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (11 pts), match/switch 1 (2 pts), boolean chains 1 (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":"src/document_core/queries/chart_extract.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc130d6b5d0b6e4fc875aa4a5a51dd2d0433150990af3901308bb5af48773bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::injection_scan::scan_role_impersonation (cognitive 26): rhwp::document_core::queries::injection_scan::scan_role_impersonation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 7 (11 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":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350d3fac16a9fef9994634cb7b9a8e20ee6febaee252e9f7ca1d2c722bf83d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::pii_scan::scan_email (cognitive 26): rhwp::document_core::queries::pii_scan::scan_email has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 5 (6 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":"src/document_core/queries/pii_scan.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2262d80054f0c68aa43e0b6d908604db0a532f59a2874214841bc9e81ae72661"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::reclassify_cell_floating_stacks (cognitive 26): rhwp::document_core::queries::rendering::reclassify_cell_floating_stacks has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 4 (12 pts) (nesting depth added 18). 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7425a4781e6df392804205bf33a9332824b067d0c88523510fa9b37c354ebe6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::structure::clause_heading_allowed (cognitive 26): rhwp::document_core::queries::structure::clause_heading_allowed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/structure.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf3ef0bd0fbaebf98721d21fae6b800a67dcb5eab22a365381170528bd6859"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::emf::emfplus::stream::records (cognitive 26): rhwp::emf::emfplus::stream::records has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/emfplus/stream.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf7273456cb2bff1f27db76e5b595f9997e8ccc47b7e058a135e669b01acf89"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::hyperlink_format::collect (cognitive 26): rhwp::model::hyperlink_format::collect has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (9 pts), match/switch 1 (3 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":"src/model/hyperlink_format.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c68a30a5ccdae315fb4c21411906ef5670f2e24af8effbfb96362c15d98e07"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-671::probes::inspect_task671::main (cognitive 26): rhwp::mydocs::tech::investigations::issue-671::probes::inspect_task671::main has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (18 pts), if/else 2 (8 pts) (nesting depth added 19). 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":"mydocs/tech/investigations/issue-671/probes/inspect_task671.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"590fe8bf35b569fd0a6a05265de2076aa851d54468c38646a37ca692d875c34c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::fixup_hwp3_notes_in_controls (cognitive 26): rhwp::parser::hwp3::fixup_hwp3_notes_in_controls has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed65868acd399bac999a8187c757b8401142102f50547b1812fab7145e226e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::subtract (cognitive 26): rhwp::parser::pdf::table_paint::subtract has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 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":"src/parser/pdf/table_paint.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d1fbd5bd1a9c0fe2ed0f50f9420d07c267f8405f0e9067c40aad2dd6e276fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::anisotropic_sampling::rasterize (cognitive 26): rhwp::renderer::anisotropic_sampling::rasterize has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/anisotropic_sampling.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54178ce46e1f9251073bd9a782db66c66e77ec8b236a626b682b02f4978d17"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::try_synthesize_marker_paragraph (cognitive 26): rhwp::renderer::composer::composition::inc::try_synthesize_marker_paragraph has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 4 (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, 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e4e11c5d4999b262906be2bee8e2d8d12b14068033be8f39ea17a830d9f949"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::layout_picture_band_impl (cognitive 26): rhwp::renderer::composer::line_breaking::layout_picture_band_impl has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (11 pts), loops 2, 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d1ec4446c7b0124bb7ee82a893f72b3edf49245d93a2798e803946c4bc0b62"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::cubic_sampling::rasterize (cognitive 26): rhwp::renderer::cubic_sampling::rasterize has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/cubic_sampling.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a03942672c17ce3ad4bbd822f6c546da06c030b9b136451fcece4fcc9eb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layer_renderer::collect_glyph_outline_reject_reasons (cognitive 26): rhwp::renderer::layer_renderer::collect_glyph_outline_reject_reasons has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (8 pts), boolean chains 5 (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":"src/renderer/layer_renderer.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8e0af06e33fb0c328adfcb48e3e6ddd76f23b2b7684028b042ea21d1da62e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_partial::expand_fragment_cell_clip_for_owned_bottom_lines (cognitive 26): rhwp::renderer::layout::table_partial::expand_fragment_cell_clip_for_owned_bottom_lines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"266c136930c2b8e0088e87ae466f4a2a497f2b5d3a784d2d0478922f021e06e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::legacy_font_advances::select_native_programs (cognitive 26): rhwp::renderer::legacy_font_advances::select_native_programs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 5, match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/legacy_font_advances.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba858bf8fac986b09431de43c84dd299c259a9a7b65a8c76251872a3c99d76c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::page_layout::calculate_column_areas_with_storage (cognitive 26): rhwp::renderer::page_layout::calculate_column_areas_with_storage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (6 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":"src/renderer/page_layout.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"015d1021288b0d1ee2e5ed1a7b2c860cdac251b376e9a2f3389fc5adbaf88376"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::raster_stroke::raster_line_geometry (cognitive 26): rhwp::renderer::raster_stroke::raster_line_geometry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, boolean chains 11. 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":"src/renderer/raster_stroke.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b6af65ad6ed9c2ce24beef41ee7c793e1ae53c68570a00257ef3fd53409093"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage::visit_with_storage (cognitive 26): rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage::visit_with_storage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 pts), match/switch 1 (5 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. This shape REPEATS in the file: one other method here (rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage) 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":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dcbf5a26e5319afd4c4a8b7a79e15b4d3aba08489deea86537c8058d82d655"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_paragraph::explicit_instance_segment (cognitive 26): rhwp::renderer::shaping_paragraph::explicit_instance_segment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22 (23 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a611e9c58be22dae31dbc88b02bedec10506bf2251dfb0f839c54436bf197"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::try_resolve_single_border_style (cognitive 26): rhwp::renderer::style_resolver::try_resolve_single_border_style has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4, 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":"src/renderer/style_resolver.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c40091b3f2e3fcd5992e5ed6451082912aa681a19a934a4f26e5cca9a63e00"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::text_decoration::resolve_page_phases (cognitive 26): rhwp::renderer::text_decoration::resolve_page_phases has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/text_decoration.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8fe2917828f7cdd14a4ac4db38fd164605d6945f5a36dafc212b448a4b2ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::place_table_host_shape_with_storage (cognitive 26): rhwp::renderer::typeset::controls::place_table_host_shape_with_storage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, 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":"src/renderer/typeset/controls.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a40671495e386d341cc50d5862b3b5173230e970f203f46945848879e1a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::whole_fit::inspect (cognitive 26): rhwp::renderer::typeset::paragraph::whole_fit::inspect has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 20, 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":"src/renderer/typeset/paragraph/whole_fit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f93ff0c8ee463f24d3b6cd3e65fb62d4a82e87403e45a8680dced8c6e59d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::write_shape_detail (cognitive 26): rhwp::serializer::control::write_shape_detail has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (11 pts), match/switch 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":"src/serializer/control.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4c74732b7792ac63dc29bb627424c653e682e86ebd52f2b2979b1a86df8bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::serialize_shape_fill (cognitive 26): rhwp::serializer::control::serialize_shape_fill has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a8d5de07aa92842062d8b46eab8fef15ed010f5663976bc06bd006b712ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::doc_info::surgical_insert_font_all_langs (cognitive 26): rhwp::serializer::doc_info::surgical_insert_font_all_langs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (9 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":"src/serializer/doc_info.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7476c6129cd3f6744c550fae09de3dff3341c793980c7ac1df4ffdf1b06399"}},{"ruleId":"D2","level":"warning","message":{"text":"differential.find_twins_in (cognitive 26): differential.find_twins_in has cognitive complexity 26 (threshold 15). Drivers by points: error handling 6 (12 pts), if/else 3 (6 pts), loops 3 (4 pts), ternaries 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":"gym/tools/differential.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0ebdc59a79bc2dcb749cbb74b0aa76322c88aa2fdff1553d7515d7efe7cd67"}},{"ruleId":"D2","level":"warning","message":{"text":"release_gate.gate (cognitive 26): release_gate.gate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, ternaries 1 (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":"gym/tools/release_gate.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f71eaa0562389cf1d7c237de81f3a8448947b5aa3e49373c890a6cbf3bfa4db"}},{"ruleId":"D2","level":"warning","message":{"text":"robustness.validate_report (cognitive 26): robustness.validate_report has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 3 (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":"gym/tools/robustness.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eddd9108cbecb3632a5acc5c680bd35e2e67a6ac04d4f2c60ab7b636d1db98e"}},{"ruleId":"D2","level":"warning","message":{"text":"trajectory.audit (cognitive 26): trajectory.audit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, ternaries 2, 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":"gym/tools/trajectory.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bec08cbb3371f00a1c91561563f3bd1b26de7a3d04b915be809e616d216d3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"gym-labnote.main (cognitive 26): gym-labnote.main has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-3587/probes/gym-labnote.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb2e97c330c51a2ef3845f5d0e76dec87c473bbac21349122291a921438d91e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_native_border_sources.grid (cognitive 26): generate_native_border_sources.grid has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (18 pts), loops 2 (4 pts), if/else 2 (3 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":"pdf/issue7998/generate_native_border_sources.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbf3c6cd82758be9074880edfc0613a06393de3457b75da576de9bd9f6dc1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"claude.classifyClaudeError (cognitive 26): claude.classifyClaudeError has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 5 (10 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":"rhwp-studio/src/ai/provider/claude.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f5e168f45730072e5be50f15b2372fa4bb4ef3ea664c2d3a448477a1c92f3"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.compareSnapshots (cognitive 26): diff-engine.compareSnapshots has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 5 belong to 3 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9c9ebcc6f79d8716a8cdf6b25decdab311e7676f1d218618429f04c05ebabc"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.loadPreferredLocalFontBytes (cognitive 26): local-fonts.loadPreferredLocalFontBytes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7, error handling 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32aabec88bae007578394cbb46978e8ac90b438b6e80a0fba94b4069b78d3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"font-substitution.fontFamilyCandidatesForDisplayWithRules (cognitive 26): font-substitution.fontFamilyCandidatesForDisplayWithRules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 3 (5 pts), boolean chains 4, loops 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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff6fcf984d1cfd987576992f3a66e502bf3a88db806574df99658cab94fd373"}},{"ruleId":"D2","level":"warning","message":{"text":"nominal-text-replay.textRequiresComplexShaping (cognitive 26): nominal-text-replay.textRequiresComplexShaping has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 21, if/else 2 (4 pts), loops 1 (nesting depth added 2). 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":"rhwp-studio/src/view/canvaskit/nominal-text-replay.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"20750726ea03e512248e1d33d28d6d0ddbccd5e89e22408c0f2a15491f87e945"}},{"ruleId":"D2","level":"warning","message":{"text":"svg-image-header.parseSvgLength (cognitive 26): svg-image-header.parseSvgLength has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (21 pts), if/else 4, boolean chains 1 (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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b952e006bf4eef6597c4cac1ad7e18934eeadb6cc420881853ca6bca46a5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStaticSvgPathLayers (cognitive 26): CanvasKitLayerRenderer.drawStaticSvgPathLayers has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 5 (11 pts), 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b7725760ec8addcb8e8dcdbae6b07f787d125ece37dfcf146ec6f0af52ed3c"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.buildPrefetchRenderWork (cognitive 26): CanvasView.buildPrefetchRenderWork has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 7 (9 pts), boolean chains 4 (nesting depth added 7). None of this is in the body itself: all 26 points belong to 2 function literals inside it that branch (lines 826, 843). 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"46abf9a4db754a628d92a485728a37edd02c752ff8d8fa5c8b2770fc834383c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_native_ffi::session::rhwp_native_host_request (cognitive 25): rhwp_native_ffi::session::rhwp_native_host_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 6 (12 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":"bindings/Native/src/session.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9bcc98d703eb4080ceb0e6e81c63ae2c9775af60734aa32a6cc9c3f85e82bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_cell_border_fill_ids_native (cognitive 25): DocumentCore::apply_cell_border_fill_ids_native has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6, boolean chains 4, 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7574cd684488f4507d95818acbe682fb3dd44f09a4f375fcb38968d27b8793"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_page_overlay_images_native::write_overlay_image (cognitive 25): DocumentCore::get_page_overlay_images_native::write_overlay_image has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 4 (12 pts) (nesting depth added 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. This shape REPEATS in the file: one other method here (DocumentCore::get_page_overlay_images_native::collect) 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f2e584c5ba0833a53af4f94989b4d092dafed505f445ac2489aee69bc71b44"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::merge_from_with_storage (cognitive 25): Paragraph::merge_from_with_storage has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 7 (8 pts), boolean chains 5, 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":"src/model/paragraph.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4304d03340f8ed0e1d54b11f8af52366559c7360623d753490880fc4c9986"}},{"ruleId":"D2","level":"warning","message":{"text":"Font::set_props (cognitive 25): Font::set_props has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (7 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":"src/wmf/converter/svg/util.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"15942c420a8b266db3c4b293008b6114e74ee3370cdc173a8b3346501c326427"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_command_fallback (cognitive 25): EqParser::parse_command_fallback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, 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":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28991b5e7bb9dc701e7a1bad2e2272721335da8ed5e24e548ef96be62c6ac37"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::draw_text_positioned (cognitive 25): HtmlRenderer::draw_text_positioned has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 3 (6 pts), loops 1 (2 pts) (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":"src/renderer/html.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c88f8d2e7f51ac0d1b66700c31a510ab61a94f7d367b3209ee5ce554547cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_closes_original_restart_frame (cognitive 25): LayoutEngine::row_cut_closes_original_restart_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 8, 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":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cdb953ba92b6fba519af2490e69afefc436e563605a4b995e54e97f7c688f8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_inline_picture_preceding_row_frame (cognitive 25): LayoutEngine::stored_inline_picture_preceding_row_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), boolean chains 5 (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":"src/renderer/layout/table_layout/stored_inline_closing_frame.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e300c1140c92122e988f70ef739aa8cba52785c18f1a30cf40671ef270e324"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_mixed_opening_cell_frame (cognitive 25): LayoutEngine::stored_mixed_opening_cell_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, boolean chains 12. 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":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbe1e532bc44b46f157cb29020400eaa7aa63bd84b6bdf9a742581c46399ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_page_reset_cut_trailing_trim (cognitive 25): LayoutEngine::stored_page_reset_cut_trailing_trim has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 11. 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19308}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bcbec7243667f7d1cdb0933c1a2bb14a2444152f767d1f34a3bfcf03de58fa"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_spanning_frame_cut_trailing_spacing (cognitive 25): LayoutEngine::stored_spanning_frame_cut_trailing_spacing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19481}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4560d165f918fed50058dee92c6991b28b2596e60f1f89c9e7a0404fe59c7"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_footer (cognitive 25): LayoutEngine::build_footer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":6418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b2f171cc8c7950b461022b4111182fc6abf3d2001d1891d34f94a850756bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"CullingIndex::new (cognitive 25): CullingIndex::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (5 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":"src/renderer/skia/culling.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"02125bbb9f5bce1a6699f9c67e7f3f0db691772f160dd56afbc1b30648e12510"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::start_new_column_band (cognitive 25): TypesetEngine::start_new_column_band has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (3 pts), 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":"src/renderer/typeset/section/columns.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fe9ca1d3198d4665f5c2e022fd931d14dcaff5fbd4113cd710b87ecce5c919"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::update_click_here_props (cognitive 25): HwpDocument::update_click_here_props has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (7 pts), match/switch 1 (4 pts), boolean chains 2 (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. This shape REPEATS in the file: one other method here (HwpDocument::update_click_here_props::update_field_in_para) 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":"src/wasm_api.rs"},"region":{"startLine":6612}}}],"partialFingerprints":{"codehealthFindingId/v1":"32992cb797c7addd0bd68321bbe0c5884e6a1cae0e4a04e4288ae87601591c60"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::hf_edit_target::run (cognitive 25): rhwp::bin::rhwp-q::kit::hf_edit_target::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (9 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":"src/bin/rhwp-q/kit/hf_edit_target.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c393588e0555726ebad202e7437743606a497ff31e12a62b5dea5ec599defb5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::controls::edit_delete_control (cognitive 25): rhwp::cli::commands::edit::controls::edit_delete_control has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/controls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"44decb4547b0604542d3b2d29e3ca33e133607277104fa1828397d8bf48cb54f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_objects::edit_set_page_border_fill (cognitive 25): rhwp::cli::commands::edit::document_objects::edit_set_page_border_fill has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (11 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc2086de3de9e552236612eccecddac9ee51701d958a6b7d24cd6c9ad8b1e74"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::document_text::edit_split_paragraph (cognitive 25): rhwp::cli::commands::edit::document_text::edit_split_paragraph has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b523fe5222a11073c3871e8f9c8d1258bca91a15c91238ba57adabfd1fe8ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::equations::edit_delete_equation (cognitive 25): rhwp::cli::commands::edit::equations::edit_delete_equation has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa097f0b9f7c6e1cb15e293af55f01bbba6916e3a8c8a2d91237985f9d25da4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::media::edit_delete_picture (cognitive 25): rhwp::cli::commands::edit::media::edit_delete_picture has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b801a24940614150aa45421b5c89ad153304fe17a34e0355309d72aa6a979cf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_split_paragraph_in_footnote (cognitive 25): rhwp::cli::commands::edit::note_content::edit_split_paragraph_in_footnote has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). 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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a74fee492a20751421a2bbbfc591b486938d40cedf0d768232e52c84fc6d40"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_insert_footnote (cognitive 25): rhwp::cli::commands::edit::notes::edit_insert_footnote has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_endnote, rhwp::cli::commands::edit::notes::edit_delete_footnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfe9c10828d2e89656bbdf352cf859fb3410761540f8beb4f02f2985cc44bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_insert_endnote (cognitive 25): rhwp::cli::commands::edit::notes::edit_insert_endnote has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_footnote, rhwp::cli::commands::edit::notes::edit_delete_footnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"607c6f98e34653c69e9812f7001cd6313c9e8d3ae174fd8f66e726799d2c2f63"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::notes::edit_delete_footnote (cognitive 25): rhwp::cli::commands::edit::notes::edit_delete_footnote has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (rhwp::cli::commands::edit::notes::edit_insert_footnote, rhwp::cli::commands::edit::notes::edit_insert_endnote) 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":"src/cli/commands/edit/notes.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20afa78c53164877312085a8d183735a7bd5b7f19d8c9b1d220f395e876c23f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_page_def (cognitive 25): rhwp::cli::commands::edit::page::edit_set_page_def has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (11 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::page::edit_set_section_def) 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"464c9959152056aece2077a933b5b54b92dc43e0aaa4e3fcef8391bccee10e54"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::page::edit_set_section_def (cognitive 25): rhwp::cli::commands::edit::page::edit_set_section_def has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (11 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::page::edit_set_page_def) 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"502aad73f45584a8bb7690edc1f184d63106ae3cfeaab1a236054cabf2d8f6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_delete_shape (cognitive 25): rhwp::cli::commands::edit::shapes::edit_delete_shape has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::shapes::edit_ungroup_shape) 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"440fb92c9be9575134e3decfd061e1218a225f2dc8046266fbd4ecc9e6f999e4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::shapes::edit_ungroup_shape (cognitive 25): rhwp::cli::commands::edit::shapes::edit_ungroup_shape has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::shapes::edit_delete_shape) 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15c9d10022e1edf9a308b0d20e86465284a8a62030fce5f7e19fceda7ab52f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_transpose_table (cognitive 25): rhwp::cli::commands::edit::tables::structure::edit_transpose_table has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 5 (11 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646ecab09854dac19a84c407264e92eb5ea51c9ab7bb87ffcf2b236ddb82bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::format_layout_tac_hits (cognitive 25): rhwp::cli::queries::diagnostics::format_layout_tac_hits has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (7 pts), boolean chains 5 (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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f070d4c9a2aa95b85fb2d014fc12c4df80517f5d727b3725b2981423906b670"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_raw_records (cognitive 25): rhwp::cli::queries::diagnostics::dump_raw_records has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 9 (12 pts), if/else 6 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a69b7e67ac10ebcbd9877f1dd784c891e6adf8766071c0cb89272ee0b8686ee"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_cell_header_probe::scoped_indices (cognitive 25): rhwp::diagnostics::hwp5_cell_header_probe::scoped_indices has cognitive complexity 25 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), match/switch 3 (7 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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285bd7fbe2ab048d7445250410f7d8e7ad4708f4db3898dbe7374c37672b394"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::collect_object_border_fill_refs_from_paragraph (cognitive 25): rhwp::document_core::converters::hwpx_to_hwp::collect_object_border_fill_refs_from_paragraph has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 1 (3 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d41e7a72b7fa805582c2631f8943bdfdb7d666abe6fb12d6297cfef2a8fb16"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::inline_control::insert_slot (cognitive 25): rhwp::document_core::inline_control::insert_slot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5, 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":"src/document_core/inline_control.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8b4e6fc92bc3fa2afd32806e2e012d68646873103a787f3c35d16f2ba3b573"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::extract_data::try_amount (cognitive 25): rhwp::document_core::queries::extract_data::try_amount has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, 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":"src/document_core/queries/extract_data.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e64522f9528b1e3923703ea7975c797a9dc32ed4a5f389e7145d9189def3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::prune_incomplete_memos::scan (cognitive 25): rhwp::document_core::queries::memo_query::prune_incomplete_memos::scan has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (10 pts), match/switch 1 (3 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"489b629d39db9961d8ea80f3d2bb78fd88888bda6de27b20a2b8240894880cb4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::structure::build_structure (cognitive 25): rhwp::document_core::queries::structure::build_structure has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), loops 4 (8 pts), if/else 1 (4 pts) (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. 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":"src/document_core/queries/structure.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"853433c3d71e217fbc9674f27356bfdd68c9b93866dc243f0a0d1c48d7e2f45d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::table_calc::evaluator::collect_cells (cognitive 25): rhwp::document_core::table_calc::evaluator::collect_cells has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 15). 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":"src/document_core/table_calc/evaluator.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a31a71b92600956f9ec357697f4b8994ef4c7573bc28ea8996071b5bd04fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::text_security::visual_order (cognitive 25): rhwp::document_core::text_security::visual_order has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/text_security.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ab4fefaf9ba1d64dfafdb44ec3ba0df80217df74bc34ae6c0b85407dd4845d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::gen_table (cognitive 25): rhwp::gen_table has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (8 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3bc8b238126f4179a2188cc9a1cb62e02dffc229ad465bb14431e169ec4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1061::probes::dump_eqedit_raw::main (cognitive 25): rhwp::mydocs::tech::investigations::issue-1061::probes::dump_eqedit_raw::main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 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":"mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe7c978f66993f45f21657875aff3ce6b578291ae21c0170485f2d9febe07eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_color_layer_nodes (cognitive 25): rhwp::paint::json::write_color_layer_nodes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 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":"src/paint/json.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e73118d7e8cdb7d8a5fa4af81777b9679750b6a1e977b34d056f5f2af90fe3c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::shaping_glyph::lower_horizontal_shaping_page_sidecars::lower_node (cognitive 25): rhwp::paint::shaping_glyph::lower_horizontal_shaping_page_sidecars::lower_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (4 pts), 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":"src/paint/shaping_glyph.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3eadda942047b5fd2f39c0b7b1b58312e305032de0fc24552fc13206dca191"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::apply_bullet_fixup_recursive (cognitive 25): rhwp::parser::hwp3::apply_bullet_fixup_recursive has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 2 (7 pts), match/switch 2 (5 pts) (nesting depth added 17). 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48bdd0ac2d6f0df69fd12c98b05bc454d0302261f765e9db4454966d7030a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_switch_chart_or_ole (cognitive 25): rhwp::parser::hwpx::section::parse_switch_chart_or_ole has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (6 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7430}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b5575d6c0daeb787800d92cd64470a754973f3f056812fd476bf974d0761c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::cell_regions::observe (cognitive 25): rhwp::parser::pdf::table_detection::cell_regions::observe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 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":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a031e087cf2da17bf2ddae5ceed49364af33b3512e2561afedbb5d92f40ae710"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::inline_box_rows::normalized_host_with_table_height_with_storage (cognitive 25): rhwp::renderer::composer::inline_box_rows::normalized_host_with_table_height_with_storage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, 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":"src/renderer/composer/inline_box_rows.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b140d9c2acd331c758ef2198d1c38518a8f8e87ce2442358efa3e6daa13a788a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::inline_frame_input::project_with_storage (cognitive 25): rhwp::renderer::composer::line_breaking::inline_frame_input::project_with_storage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), boolean chains 2, 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":"src/renderer/composer/line_breaking/inline_frame_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025313a8874737ce3a1fc37c19ee2461b3c01f0d09c3479fc5d65aec4f10d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::hancom_glyphs::measure (cognitive 25): rhwp::renderer::equation::hancom_glyphs::measure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, 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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eca225e8838eea0264c1f628144b432e9cd60485cf3639dc50b8fe488be46e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_two_frame_successor_origin_hu (cognitive 25): rhwp::renderer::float_placement::stored_two_frame_successor_origin_hu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 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":"src/renderer/float_placement.rs"},"region":{"startLine":4608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3ed4693266c2104704321d50afa9ef8234e67c5bd34ca155e8143cd9704c72"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::kopub_char_advance_em (cognitive 25): rhwp::renderer::layout::text_measurement::kopub_char_advance_em has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c2a3be700cb899ef7b5bde08c66551a16aa1f8360c30ff277c007617c09a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::utils::expand_numbering_format (cognitive 25): rhwp::renderer::layout::utils::expand_numbering_format has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (5 pts), match/switch 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":"src/renderer/layout/utils.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff160420c4cfcefa78bd349f7f6fe866c5c9b37bfbfa2f4276afdaec37f24409"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::direct_pdf_validation::validate_tree (cognitive 25): rhwp::renderer::pdf::direct_pdf_validation::validate_tree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ec018b0a2ad722069dc46d77c0fcfa05caed3162f3bcd264eb4df4249dee44"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping::validate_shaping_request_with_face (cognitive 25): rhwp::renderer::shaping::validate_shaping_request_with_face has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, loops 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":"src/renderer/shaping.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"277b1414ab07e4e843df85c1a458df8d26fad65e0aed05b60f91f0404efbc9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::stored_page_origin::stored_inline_frame_restarts_page (cognitive 25): rhwp::renderer::stored_page_origin::stored_inline_frame_restarts_page has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 8, 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":"src/renderer/stored_page_origin.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493426ce447faf888e561e31ab210426804a13aff5c07b4b0fd399f69788fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::style_resolver::try_resolve_single_char_style (cognitive 25): rhwp::renderer::style_resolver::try_resolve_single_char_style has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 18, if/else 4 (6 pts), loops 1 (nesting depth added 2). 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":"src/renderer/style_resolver.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"777cc79297ab0257319ba6df18e663cd4a36c6a0ca69a6959527a45b6398b83b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::equation_only_tac_line_assignment_with_storage (cognitive 25): rhwp::renderer::typeset::equation_only_tac_line_assignment_with_storage has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (9 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":"src/renderer/typeset.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e25b7ae8bb7987fc53dcb4e9816f7d072304a2ea331f2a146960f1d7d8a09"}},{"ruleId":"D2","level":"warning","message":{"text":"ConversionConfig::validate (cognitive 25): ConversionConfig::validate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8 (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":"tools/batch-convert/src/config.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e83dce0abe0d5fafc95ae1fb7020a4ac8146a9f86370516ddd40a1f55cc0d54"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.pick_canonical_for_heading (cognitive 25): _gen_pack.pick_canonical_for_heading has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 10 (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":".claude/skills/rhwp-knowledge-map/references/_gen_pack.py"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e745fc01d1a1082b92b3a18350e4f03a131145e46aeea4f0cf27b5fa5863e"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.load_pack (cognitive 25): runner.load_pack has cognitive complexity 25 (threshold 15). Drivers by points: error handling 12 (16 pts), if/else 6 (8 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":"gym/core/runner.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"126f88ffdd435d10e79e715b70f65607ac0a3709cca43aa3196de6e5ff48edcc"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.score_pack (cognitive 25): runner.score_pack has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6 (8 pts), error handling 4 (6 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":"gym/core/runner.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd81326e747b3809ae5a19a4268929c358c9aa207553efd133ab1f024adcdd83"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.record_session (cognitive 25): agent_session.record_session has cognitive complexity 25 (threshold 15). Drivers by points: error handling 5 (10 pts), if/else 6 (8 pts), boolean chains 4, ternaries 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":"gym/tools/agent_session.py"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f40b2cd54aa1fb65310bcf7ced9fdb084210926032a11374cc5fe2d30a8edc1"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.discover_known_agents (cognitive 25): competitive_bench.discover_known_agents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 1 (4 pts), loops 2 (3 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":"gym/tools/competitive_bench.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6c903636adc640e2819590c7e160fdf57b843c9c46cdf979ce6070821de3b2"}},{"ruleId":"D2","level":"warning","message":{"text":"differential._values_equal (cognitive 25): differential._values_equal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11 (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":"gym/tools/differential.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eda408ff7f94101e95b98f8f9e6fa1c1e61d97e0748913115fb1be0e577c0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"discriminate.build_negative (cognitive 25): discriminate.build_negative has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (4 pts), loops 1 (3 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":"gym/tools/discriminate.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa876b44ad56df45ee39abda0b0a5e34328318729f3edafb92caf72412d4ca17"}},{"ruleId":"D2","level":"warning","message":{"text":"release_diff._values_equal (cognitive 25): release_diff._values_equal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11 (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":"gym/tools/release_diff.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aec16c2e895818af53ff467ab44862cd935c82891586e2b65e1338fd0c92d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"robustness.audit (cognitive 25): robustness.audit has cognitive complexity 25 (threshold 15). Drivers by points: error handling 6 (11 pts), if/else 3 (8 pts), boolean chains 3, 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":"gym/tools/robustness.py"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"db68e736070f551d48583c3b22d7cfc8f06a8e68fdc4716b1151bfd98714e137"}},{"ruleId":"D2","level":"warning","message":{"text":"message-render.parseMarkdown (cognitive 25): message-render.parseMarkdown has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 11). Of this number, 23 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":"rhwp-studio/src/ai/ui/message-render.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b41a03deec77b8d5310789b838408e706ae5d9b1a708483f546faed6b7b086e"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.scoreControlFallback (cognitive 25): diff-engine.scoreControlFallback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 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, 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63902ce463643657a415257d035f4978990aef0c6d0ada6ce4835039616fa55"}},{"ruleId":"D2","level":"warning","message":{"text":"raster-stroke.rasterLineGeometry (cognitive 25): raster-stroke.rasterLineGeometry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, boolean chains 11, 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":"rhwp-studio/src/view/canvaskit/raster-stroke.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9da7966b2741651cfe088c8dc5e5f0e3cf7683dc93f2139b521584e13260f6"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-mouse.handleResizeHover (cognitive 25): input-handler-mouse.handleResizeHover has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, error handling 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"84646f56cf5ec5685fed59935c221fd25d6680020f7fdad4a6b8a75cbde02c25"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.insertDroppedImageAtClientPoint (cognitive 25): InputHandler.insertDroppedImageAtClientPoint has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 6 (7 pts), error handling 2 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3f397615fe408ac2112b2033a02a5be24cfe10177f2ac9ef7b5a4dce82e4c9"}},{"ruleId":"D2","level":"warning","message":{"text":"selection-text.readSelectionText (cognitive 25): selection-text.readSelectionText has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 3 (6 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":"rhwp-studio/src/plugin/selection-text.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac1943f26fe37c754756804943a6b26a169dec4245d012a57474dd09f82de35"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareDialog.formatFieldValue (cognitive 25): CompareDialog.formatFieldValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6879de77d5e19cae4781912583f8f65f2f149c42d6467941ac469253f764bf"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryDialog.formatFieldValue (cognitive 25): HistoryDialog.formatFieldValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f6382a93a1db2272f1f6dcf4d6f6e2eb9b9f38176d33595bf93655b49471c"}},{"ruleId":"D2","level":"warning","message":{"text":"run (cognitive 25): run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (7 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdcaa5fbc0fa288243d7a1139bb9a95c0d0f11a684495c5a6d92626765026a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::merge_table_with_next_native (cognitive 24): DocumentCore::merge_table_with_next_native has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"91921c651810cc7e9f4939affed8e7c3b6fc133b4e2693b49646180f96789f57"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::declared_font_fallback_requests (cognitive 24): DocumentCore::declared_font_fallback_requests has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/host_font_environment.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f0b319c2847fa53525ff33e91a81348b0252b594ca733b531f353d0501f9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::scan_paragraph (cognitive 24): DocumentCore::scan_paragraph has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (9 pts), match/switch 1 (2 pts), boolean chains 1 (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":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9f1c20585569586e3b2a40c72d165721c91f46363efc685f7995b0e1e06da7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_page_def_native (cognitive 24): DocumentCore::set_page_def_native has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (19 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":3872}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5da197ec273cdf09519b25a798fc45ee91e25b60e557b47d852777511e3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::build_page_tree_with_header_footer_override (cognitive 24): DocumentCore::build_page_tree_with_header_footer_override has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 4 (7 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":8369}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d3d4310b9b05cb4beb3ab392852ccd62a66787083c2f3a42cb16d4919438e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Player::image (cognitive 24): Player::image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/emfplus/player.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d97184390ae1098b37a4f8dd2faddcf9144ea071a5a856e348867c675b8d83"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::merge_cells (cognitive 24): Table::merge_cells has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0dc516f0bc14a4ec1cee9304d3e0045830ec68f4316c809baec0c3c96d551"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_latex_env_eqalign (cognitive 24): EqParser::parse_latex_env_eqalign has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 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":"src/renderer/equation/parser_fractions.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98b018c4f49b42e4e13b809b8a2347f40c1b1803c48221e061b90e0bd58f575"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::native_first_line_restart_cut_closes_frame (cognitive 24): LayoutEngine::native_first_line_restart_cut_closes_frame has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 16, if/else 8. Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/renderer/layout/table_layout/stored_first_line_restart.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5dedbdb64a1941c8bde55b3c079b1cf064bc1aa03010301c3f2057634f357"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::declared_nested_opening_frame_reset (cognitive 24): LayoutEngine::declared_nested_opening_frame_reset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12499}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb11fe2f83f6605fa084fa8dace615b7d595d2a25f10e8e1175554d797c0bb"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutFrame::admit_stored_rows (cognitive 24): LayoutFrame::admit_stored_rows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (3 pts), boolean chains 2, 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":"src/renderer/layout_frame.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f168c49537fabb1f22e8ffc89bae8dd9f08437aacde9da2c9f1654c75745b04"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaLayerRenderer::draw_form_control (cognitive 24): SkiaLayerRenderer::draw_form_control has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 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":"src/renderer/skia/renderer.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"97768231298174b74810ca8d17434b5f9d286cd16c2cd2bbfeda8a8fee0259ef"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaLayerRenderer::prepare_text_shadow_fonts (cognitive 24): SkiaLayerRenderer::prepare_text_shadow_fonts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (3 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":"src/renderer/skia/text_shadow_fonts.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a12dc0af37ec42e396fd8c3095e692ffeb1113e2ae6789859f9a36fbe6c94c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::spill_page_tail_floats (cognitive 24): TypesetState::spill_page_tail_floats has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 2 (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":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe29e987faa9e1674f4f20e622c75b6af490bf0ff42376ad6f237b0529c736"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceFrameQuery::resolve (cognitive 24): SourceFrameQuery::resolve has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 23, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/source_frame.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ff9e9ea2bf464fc0a935fe048b8feb7860774bd8a5fc1713e9f59e8d3633d1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::typeset_inline_flow_with_storage (cognitive 24): TypesetEngine::typeset_inline_flow_with_storage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 8 (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":"src/renderer/typeset/inline_flow.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee56c8af945d247936ef50e4ce3705aa3be961660e72e7fef0dff045b684cab"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::coanchored_closed_first_fragment_row_end (cognitive 24): TypesetEngine::coanchored_closed_first_fragment_row_end has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 11, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aafc17b967c786001dd8c2870a33d16bbf558e2d0010a785c6040b9dd17ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_layer_node (cognitive 24): WebCanvasRenderer::render_layer_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), boolean chains 1, 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ad4c0c7df0a7793c250cc577a0a4e12ed749999ecc156c045d8a4e039a85b6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::inspect::run_page_window (cognitive 24): rhwp::bin::rhwp-agent::inspect::run_page_window has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aa4ed04ead5060f79af4a2bebc1c7d4f1c23315be8cba0145824c67e5243ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::planlint::run_plan_lint (cognitive 24): rhwp::bin::rhwp-agent::planlint::run_plan_lint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4, loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/planlint.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"693f15a139d373818ae2a1acaeaf9b34533cb5e9dce9d0f253456755a3add2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::canvaskit_preflight::run (cognitive 24): rhwp::bin::rhwp-q::kit::canvaskit_preflight::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 6 (11 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":"src/bin/rhwp-q/kit/canvaskit_preflight.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65f6a9f0fd0d35290cd18ae330627b1e37059d02301ec7af240429c18bbd74f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::field_by_id::run (cognitive 24): rhwp::bin::rhwp-q::kit::field_by_id::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (10 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":"src/bin/rhwp-q/kit/field_by_id.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a8c403eed3cf0e682218a0e3c207c175940b5bbe17f1d05384a38305838efc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::line_starts::run (cognitive 24): rhwp::bin::rhwp-q::kit::line_starts::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (11 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":"src/bin/rhwp-q/kit/line_starts.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac462f5ca419412f7aabe16f4fe8038b66c074518a84fb6fe60b0892e679d99"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::para_bounds::run (cognitive 24): rhwp::bin::rhwp-q::kit::para_bounds::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (11 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":"src/bin/rhwp-q/kit/para_bounds.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"42327d1a2afe1a6b8e41ef34035129d73acdc731e358dc0a20876683b4857e96"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_set_table_props (cognitive 24): rhwp::cli::commands::edit::tables::layout::edit_set_table_props has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 6 (11 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce11deb93d59a9b31c6ab0be513aed3c8f93a3eb9be9b30efb2bb715f2b17e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::apply_font_environment (cognitive 24): rhwp::cli::outputs::apply_font_environment has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (7 pts), boolean chains 1, match/switch 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":"src/cli/outputs/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2387345821edec218cbf17ede9e775193e33296c6026a48871e6f7c8c55afefb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::plan::condition::evaluate_step_condition (cognitive 24): rhwp::cli::protocol::plan::condition::evaluate_step_condition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/condition.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a58fd7335254ff564ecabadba70e83d007708cb33e2e2d25aee146d6a6c1dab"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::run_single (cognitive 24): rhwp::diagnostics::layout_anomaly::run_single has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 5 (9 pts), boolean chains 2, 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ef82c24e554dcb056c6ede0d560fd9ccd89afafe068f29009ffdaeb53e8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::run_batch (cognitive 24): rhwp::diagnostics::layout_anomaly::run_batch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5e7a32827e59c68a46d67931faa8f162e3d46e24ff885b03275a04bc366a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::import::resources::styles::prepare (cognitive 24): rhwp::document_core::commands::paragraph_block::import::resources::styles::prepare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (11 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":"src/document_core/commands/paragraph_block/import/resources/styles.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"85451e3585d6ba51f6273a1eaceef657878f52377001468e12a98198a2db6431"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::stego_scan::sanitize_stego (cognitive 24): rhwp::document_core::queries::stego_scan::sanitize_stego has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (8 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":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07dbbd3c054b5ea661d0045dfc8606918caa122d745a076da33651788645e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::threat_scan::scan_hwpx (cognitive 24): rhwp::document_core::queries::threat_scan::scan_hwpx has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/threat_scan.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e77cf20c6235fb965453914caa91a8f1c7ffd32fb71db34b83ed3de3bda2a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hml::reader::collect_doctype_entities (cognitive 24): rhwp::parser::hml::reader::collect_doctype_entities has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 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":"src/parser/hml/reader.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bd8d45c3126532c0fe1016f4890e311ea7746e29a0bc70afbd492302e8fed8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_font (cognitive 24): rhwp::parser::hwpx::header::parse_font has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 5 (9 pts), loops 2 (3 pts) (nesting depth added 13). 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":"src/parser/hwpx/header.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e328950fe21b9dd914081d1b2ce96bef63df2cf5d8f3d018820ef0ce6fc0092e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::header::parse_numbering (cognitive 24): rhwp::parser::hwpx::header::parse_numbering has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 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":"src/parser/hwpx/header.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ce6e4c9dcd824ea1b51f61d35b9c57c100cbcccca775202388be262b042dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_field_begin_attrs (cognitive 24): rhwp::parser::hwpx::section::parse_field_begin_attrs 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5598}}}],"partialFingerprints":{"codehealthFindingId/v1":"705600bb3726b602c833ddc2756a5e5dcb8eb326cccc411c7710cc098a3af7c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::inline_picture_metrics::refresh_picture_rows_with_storage (cognitive 24): rhwp::renderer::composer::inline_picture_metrics::refresh_picture_rows_with_storage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 2 (3 pts), match/switch 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":"src/renderer/composer/inline_picture_metrics.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ebcec6e7ce8d59885c9ecfb8debc8a8fc60d613fe1abd6b1288ff56b16fc49"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_row_projection::project_equation_rows_with_storage (cognitive 24): rhwp::renderer::composer::stored_row_projection::project_equation_rows_with_storage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_row_projection.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3901ccd08e994bb2cf1d0fce2c77ab964ebe1d46d9af747d31c932c29d082"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::pcx_bytes_to_png_bytes_uncached (cognitive 24): rhwp::renderer::image_resolver::pcx_bytes_to_png_bytes_uncached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (9 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":"src/renderer/image_resolver.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f10eac90dbfc1ff27f3651a8b039a80336aaf7b3815f50e85bb4600d5c37c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::mark_cell_span_interior_covered (cognitive 24): rhwp::renderer::layout::border_rendering::mark_cell_span_interior_covered has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (12 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"465374b94fa567a7f9bc4dab6b1cef46fc38a374e6d600e8db758cf0748541e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_vertical::prepare_bounded_vertical_glyph_publication_shadow (cognitive 24): rhwp::renderer::shaping_vertical::prepare_bounded_vertical_glyph_publication_shadow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, 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":"src/renderer/shaping_vertical.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13e10b44c2c82014ee16164656e632c6f3de4775eac2f758bc84430b8ca4e48"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::table_row_frame::project_first_rowspan_frame (cognitive 24): rhwp::renderer::table_row_frame::project_first_rowspan_frame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 10, 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":"src/renderer/table_row_frame.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9385050195dad611330b7c278869f5bea51335969a5b5c99828ac99af1450364"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::text_direction::resolve_page (cognitive 24): rhwp::renderer::text_direction::resolve_page has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 5, 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":"src/renderer/text_direction.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff85731f3594425c35e2f3e7ecb67d6162bd2787173209fd1985b4d5871450"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_existing_body_footnote_area_height (cognitive 24): rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_existing_body_footnote_area_height has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 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":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23ddb12984947720ec9d8446a48a5f7fb166cbb6a99c5b92c9100bec85dc7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage.commands_in_doc (cognitive 24): coverage.commands_in_doc has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 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":"gym/tools/coverage.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7437bc36662e7c6f74bf2c0ddc082442cc76764d40eb0180af925699cbccbd"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.exception_kind (cognitive 24): fuzz_corpus.exception_kind has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f5a7d92c4bfae94c895836f339f17ad5f2a881483b37a339d89eb04440307c"}},{"ruleId":"D2","level":"warning","message":{"text":"release_gate.fold_preflight (cognitive 24): release_gate.fold_preflight has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, ternaries 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":"gym/tools/release_gate.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d98c340d84841f6081f2a393b8fd3807c411fc8a048dfbf4045ea6c8501b1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_periodic_border_sources.grid (cognitive 24): generate_periodic_border_sources.grid has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 3 (7 pts), loops 2 (4 pts), boolean chains 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":"pdf/issue7998/generate_periodic_border_sources.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff394a3452f30b54593ab8c3668dd38de74e4893bb11afd68d7d9294c4b7e22"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuFramePresenter._drain (cognitive 24): CpuFramePresenter._drain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04b2c202670e4a21e9560c18b981d3e713ee961fc2acb3901d81403bffd302d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp.__wbg_get_imports (cognitive 24): rhwp.__wbg_get_imports has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 18 (19 pts), error handling 4, boolean chains 1 (nesting depth added 1). None of this is in the body itself: all 24 points belong to 15 function literals inside it that branch (lines 14108, 14134, 14140, \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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":14105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89773f190cd9f72d28e85738ff2769bd1ee0c2f03a75c8dd79d09ea74042351"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.pairAlignmentSlotControls (cognitive 24): diff-engine.pairAlignmentSlotControls has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"94254f33624d764ddae2aefefcfe7e15ef74f64be9b356d6bc8fa2a32be5a1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawStaticSvgTextLayer (cognitive 24): CanvasKitLayerRenderer.drawStaticSvgTextLayer has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 5 (9 pts), boolean chains 3, 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"269051924ad7676eaa014104ae7bd5edd8dee71a33b1f436348ded4e29673588"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.installEmbedRuntime::onMessage (cognitive 24): runtime.installEmbedRuntime::onMessage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, 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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aed6baaa6e4a7132eb609bd7ab41bed90a9a60ab4ebe0d5865897e0720ee2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpEditorProvider.resolveCustomEditor (cognitive 24): HwpEditorProvider.resolveCustomEditor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 96). 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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac6fd71314cb83b2da98fcd3b62b9001bb40488031ab44e3e5650683b50c81a"}},{"ruleId":"D2","level":"warning","message":{"text":"addToolCard (cognitive 24): addToolCard has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, loops 1 (2 pts), ternaries 2 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 3 belong to 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e5c8b27beaefdeb5f95458dfd59df31acbf9043bdc64b3b1d78f0bba66828f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 24): (anonymous) has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 7, ternaries 4 (5 pts), error handling 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":"rhwp-studio/public/theme-init.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d5bb697e49342ae37987f95d11f32d366de5028f8f3378bbd7419131ffae65"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_contracts::ontology::push_ir_nodes (cognitive 23): rhwp_contracts::ontology::push_ir_nodes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 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/rhwp-contracts/src/ontology.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"10541ce32caa410c3c437500366092abb1a9eebd0d493ce0e772a3a7fdb9bbfa"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paste_control_native (cognitive 23): DocumentCore::paste_control_native has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 4 (5 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbe3e50f89ad5838f9d7a90f114a33e5a01085f2de9c36508ee3a89ecc51089"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::recalculate_connector_routing (cognitive 23): DocumentCore::recalculate_connector_routing has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 7 (9 pts), boolean chains 5 (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":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d57f7bf043f48369d31e6dd22b0c7cdeae3b18719f7acc39ffaea2fef06432"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_shape_properties_native (cognitive 23): DocumentCore::get_shape_properties_native has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 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. This shape REPEATS in the file: one other method here (DocumentCore::format_shape_props_inner) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8fa7385472e5b3e584228722ec96a7c2ccdba4efd0d43384c90df3988cbf71"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::format_shape_props_inner (cognitive 23): DocumentCore::format_shape_props_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 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. This shape REPEATS in the file: one other method here (DocumentCore::get_shape_properties_native) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"357fcd919cf07820bc35b70fd27155ab579fefe3b7ff522923429f41b9acd107"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::group_shapes_native (cognitive 23): DocumentCore::group_shapes_native has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (7 pts), match/switch 4 (6 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d2b052b9aa419896015e1836431ab0efc36c9a5e47fea43dadfbe9230eaf8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::build_inline_table (cognitive 23): DocumentCore::build_inline_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a11a389988d55e637f7104c866562f0dcbdf327526304c5b9a11f60d57b45d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::update_neighbor_borders_for_sides (cognitive 23): DocumentCore::update_neighbor_borders_for_sides has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, match/switch 3 (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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6823590c9f59bfa7218199e5b11ba21c8ea735ab024fcdf28b268bf9b44c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resize_table_native (cognitive 23): DocumentCore::resize_table_native has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3946}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e26174e560accfba27b59d93a735c3914d4dc2a6a577d0144aeaea527f9a031"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::split_paragraph_native (cognitive 23): DocumentCore::split_paragraph_native has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9367c5da46fad4278768e8487134c04700c9b78f43e39b935894c8087ccada"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::rename_field_by_name (cognitive 23): DocumentCore::rename_field_by_name 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87dcc825e92c5a767a6494411472534c4db754de9800693290a67c91a3c1289"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::delete_column (cognitive 23): Table::delete_column has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 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":"src/model/table.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3238969d6ea1a03a8c5f90b36488bdf7320e80d61a2adf99801e2e544b98b"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::split_cell (cognitive 23): Table::split_cell has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 2 (3 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":"src/model/table.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e0aabad32c99ecae407c4adc1231abdce52b1938792503931147df2f6aa19"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDocumentSession::accessibility_snapshot (cognitive 23): NativeDocumentSession::accessibility_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (5 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":"src/native_host/accessibility.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7984340e90eaa539376ffed121b0b5214eb44300125df54d8e4c8a8550ead7"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShapeLowerer::lower_node (cognitive 23): TextShapeLowerer::lower_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 2 (3 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":"src/paint/text_shape.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"427c1d8df6baea24f604de26df061b761bf773bff5ff334d0210092e758e0be2"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_sqrt (cognitive 23): EqLayout::layout_sqrt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/fraction_geometry.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42aba516f96236befb15c86b65fc278be951978ff4fd3afe924c9e2614a3f14"}},{"ruleId":"D2","level":"warning","message":{"text":"Bounds::cubic (cognitive 23): Bounds::cubic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 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":"src/renderer/filled_path_bounds.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f43bf67b8e45347906ccb601b0108aea0c0b49bf849b38f515127fb48e55b8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_empty_row_frame_height (cognitive 23): LayoutEngine::stored_empty_row_frame_height has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 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":"src/renderer/layout/table_layout/stored_plain_row_frame.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9624967e3e619660f145874163c9d1cc6bf3b246b68ae2ec3cd136d0b48911"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::direct_hwpx_cell_has_progressing_source_frames (cognitive 23): LayoutEngine::direct_hwpx_cell_has_progressing_source_frames has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22124}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec7aa333da6057f8365fd667fb2ccc6c964088dc01561860c24eeffbf91135"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutFrame::try_absorb_whitespace_only_rows (cognitive 23): LayoutFrame::try_absorb_whitespace_only_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (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":"src/renderer/layout_frame.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cac8b39eda05215cf40f7823a54883a714b5c006657757ada696ccfa436b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"HorizontalShapingTransaction::shadow_measure_with_instance_request (cognitive 23): HorizontalShapingTransaction::shadow_measure_with_instance_request has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 5 (6 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":"src/renderer/shaping_context.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24dd06805b80dd671546f29c13da862e1c8fa64398bb4e4deab68b4f7c4447"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLines::shape (cognitive 23): TextLines::shape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), boolean chains 1, 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":"src/renderer/skia/text_replay/lines.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"68125ff4f7805a893b38bbd043840877ca74f551b9d4fe95978b0534a58ef475"}},{"ruleId":"D2","level":"warning","message":{"text":"TacFlowQuery::tac_table_line_index (cognitive 23): TacFlowQuery::tac_table_line_index has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7 (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":"src/renderer/typeset/controls/tac_flow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d2e4a5fd488647ca3e142547d5b3ce34dd47de1aad0c6fe16bb65961c0f62"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_char_overlap_combined (cognitive 23): WebCanvasRenderer::draw_char_overlap_combined has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (20 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, 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":"src/renderer/web_canvas.rs"},"region":{"startLine":4072}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4ca713bfa917408f0727dfa923288171fd7690f034580bdccb7a3647d674fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-control-layout::parse_cli (cognitive 23): rhwp::bin::rhwp-q::commands::rhwp-q-control-layout::parse_cli has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 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":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"71308416de371cc12b6a10afba54aaa5aacdf54be3649f777662cdb46e323950"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-markdown::parse_cli (cognitive 23): rhwp::bin::rhwp-q::commands::rhwp-q-markdown::parse_cli has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 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":"src/bin/rhwp-q/commands/rhwp-q-markdown.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a33862c74fc17d0c2dc0bb375e66387c8ba92ec8fac3a4bdabbec5fe6b21f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-page-images::parse_cli (cognitive 23): rhwp::bin::rhwp-q::commands::rhwp-q-page-images::parse_cli has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 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":"src/bin/rhwp-q/commands/rhwp-q-page-images.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53ff4a91fc161cb2a0d35944e3d58db54230fc8cf522c482de6838c89152592"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-text-layout::parse_cli (cognitive 23): rhwp::bin::rhwp-q::commands::rhwp-q-text-layout::parse_cli has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 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":"src/bin/rhwp-q/commands/rhwp-q-text-layout.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"099fa3f712cdddb578b9fcf9206d8972269f178b675cb498fdcccfa27bb01c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::caret_stops::run (cognitive 23): rhwp::bin::rhwp-q::kit::caret_stops::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (10 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":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df03786d013e129312a763a06a78798ec6c6730999563395f6a7052bdc3063f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::covering_pages::run (cognitive 23): rhwp::bin::rhwp-q::kit::covering_pages::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 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":"src/bin/rhwp-q/kit/covering_pages.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"848f5faa16ee884337051807570d64c1ff474269542549aa7a99965f4e27a27a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::source_image_bytes::run (cognitive 23): rhwp::bin::rhwp-q::kit::source_image_bytes::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (3 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":"src/bin/rhwp-q/kit/source_image_bytes.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf4b81f91ad9ce19a4a57d07747ccf70385913c13f3f9c885ba586124982dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::word_starts::run (cognitive 23): rhwp::bin::rhwp-q::kit::word_starts::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (10 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":"src/bin/rhwp-q/kit/word_starts.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2d73cafd4f58b2a579f8b9dca87937d1526ade47c7dc4b2a0c152798931d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::fields::edit_fill_fields (cognitive 23): rhwp::cli::commands::edit::fields::edit_fill_fields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 6 (10 pts), 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46022a304bea55552629af5cc96a75b289d57dc5b59452aea075c51eb893764"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::generation::run_scaffold (cognitive 23): rhwp::cli::commands::generation::run_scaffold has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 7 (8 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":"src/cli/commands/generation.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c076e9ac802daad2531b8f3361ad6dd8a7cdb7b22c25f1198f5e3131de8ed1b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::search::search_document (cognitive 23): rhwp::cli::queries::search::search_document has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 7 (9 pts), loops 2, boolean chains 1 (nesting depth added 7). 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":"src/cli/queries/search.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4813ef8aec458905e285774f3149462df8cba05e8fa8af7be035480e8eabdb93"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_char_shape_audit::parse_hwpx_signatures (cognitive 23): rhwp::diagnostics::hwp5_char_shape_audit::parse_hwpx_signatures has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5805b5d435301a852d12882532f66b9d86f683efa276b2588162fe34481bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_char_shape_audit::render_report (cognitive 23): rhwp::diagnostics::hwp5_char_shape_audit::render_report has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 6 (9 pts), loops 3, 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b296c89e3b31790737d4e83d60a79c846904de52eb45d6286775bf8f6e7a37"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::table_extract::collect_from_paragraph (cognitive 23): rhwp::document_core::queries::table_extract::collect_from_paragraph has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). 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":"src/document_core/queries/table_extract.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dabde04863e3ec634a6621961ef381200f5da01b9cc8bdfd1ead88a68061dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::session_set_cell (cognitive 23): rhwp::mcp_serve::session_set_cell has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 8, boolean chains 1, 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":"src/mcp_serve.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c583ce3fcf0a21cc346658ce74efcea36c530397b5c0a20f3dc9fd88b5764a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::session_fill_fields (cognitive 23): rhwp::mcp_serve::session_fill_fields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3, boolean chains 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":"src/mcp_serve.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"90378ad58a80d237e5a12eba9c500f4b1480babc613099345c133e1ecb2b3996"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::native_host::runtime::worker::execute (cognitive 23): rhwp::native_host::runtime::worker::execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 6 (10 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/runtime/worker.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bd6e3736c920d95272c165ca00d8e9d53f9b2c49b14f033667c9464c2a3c03"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::native_host::runtime::worker::worker_loop (cognitive 23): rhwp::native_host::runtime::worker::worker_loop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (4 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":"src/native_host/runtime/worker.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ed70ca751a1df45bbf5328d71da72046784272a2ff9bf308605b6f2741723b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_text_control_marks (cognitive 23): rhwp::paint::json::write_text_control_marks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5ad4d167abcb78f2a4a20dc8b5f6d3e931b30fbb1c136456983db1cb4d463a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow (cognitive 23): rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 4 (5 pts), boolean chains 2 (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":"src/paint/shaping_glyph.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"531f4e777c3f8c1b4831e95232ad105fea6f558c1a88ca93d87e0fd3b1b05a33"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::convert_ole_pictures_in_controls (cognitive 23): rhwp::parser::hwp3::convert_ole_pictures_in_controls has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5bb7a41a83465b7124d428a08be968abb3c8090a588056d4e45a1d7f531e18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables (cognitive 23): rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, match/switch 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fef3a90746f85ac119934444420abc6069af154e31367dd96bbed31e3758ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::stored_external_geometry::stored_rows_require_external_geometry (cognitive 23): rhwp::renderer::composer::line_breaking::stored_external_geometry::stored_rows_require_external_geometry has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 14, if/else 5 (8 pts), match/switch 1 (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":"src/renderer/composer/line_breaking/stored_external_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c796079f921297ea2376fc7910cbcf59019a598d7455ec3eb6e0f18082d0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host (cognitive 23): rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, loops 2, match/switch 1 (2 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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae39e61a8ace174a72c975e9f4c5c459d006bc9a42d11acc92517607a97df3c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::declared_row_col_x (cognitive 23): rhwp::renderer::layout::border_rendering::declared_row_col_x has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (9 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15f1eb68577358a152e0bfa2f5aa9cf414a9ed0c7641b56ecf3c16b87c5783f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::extend_clipped_cell_vertical_clip_to_nearby_nested_table_borders::scan_table_borders (cognitive 23): rhwp::renderer::layout::table_layout::extend_clipped_cell_vertical_clip_to_nearby_nested_table_borders::scan_table_borders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d4882c73756c9021e4d9b1a2c451cfc50cd843b490c853980850bf42229ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::calc_nested_split_rows (cognitive 23): rhwp::renderer::layout::table_layout::calc_nested_split_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fbb4e6d83dee3bbf9d3f429afeb951159a7d680157707ad7c94796a5065512"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::direct_pdf_validation::validate_gradient (cognitive 23): rhwp::renderer::pdf::direct_pdf_validation::validate_gradient has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 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":"src/renderer/pdf.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a432f586a7c4a96f3dff44baa850fb68cb356f71db6fc36e6b80cadec086de"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf_synthetic_bold::decide (cognitive 23): rhwp::renderer::pdf_synthetic_bold::decide has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 pts), match/switch 2 (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":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b106430e3e3cfd53e3a7960871819393e03f57ced7a29d3ce3566e7aa531f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::text_replay::decorations::draw_line_shape (cognitive 23): rhwp::renderer::skia::text_replay::decorations::draw_line_shape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), boolean chains 1, 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":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa6cd435b99440dc37fe2f29fbcba5234c366d97bf268bb6db4f3156d21de0c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::text_shaping::prepare_shaped_spans (cognitive 23): rhwp::renderer::skia::text_shaping::prepare_shaped_spans has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 9, 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":"src/renderer/skia/text_shaping.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"689df5f2b38efaf7a06c28f3d0d983c86686b75cd051670e511a488b0f8cbf32"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::content::stored_content_bottom (cognitive 23): rhwp::renderer::typeset::paragraph::content::stored_content_bottom has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, loops 1, 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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf998390744038400bf8d4a89fb31180eb96082745efdbe4e5eaa0901339e7b6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::header::write_bullet (cognitive 23): rhwp::serializer::hwpx::header::write_bullet has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 1 (3 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":"src/serializer/hwpx/header.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c3eb6230d896612c43ca7b11b3caa88f49eda9c81351aed4016e7e02aae2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.validate_scorecard (cognitive 23): runner.validate_scorecard has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 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":"gym/core/runner.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4cf87590618935b9165e033c11b0062c214262b05d6849672287909998a8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.validate_report (cognitive 23): audit.validate_report has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d865ba1966140be1735550c53f8c7dfd5930d38df3ecd32f6856db31e0c64"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.task_result_issues (cognitive 23): competitive_bench.task_result_issues has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (9 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":"gym/tools/competitive_bench.py"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9dbdf146b43bbb49a66f97087c0eab7e1833d1545b78af68ee1ff4d9f2da6c"}},{"ruleId":"D2","level":"warning","message":{"text":"action-runtime.evaluateFormAction.statement (cognitive 23): action-runtime.evaluateFormAction.statement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (2 pts), match/switch 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e044ea66635a6e478b39b00b79b157705b579876e045ebadac2eeda01781baf2"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.findLongestEqualSignatureRun (cognitive 23): diff-engine.findLongestEqualSignatureRun has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"19999066e2e83524ec66ae56379d94418f81201af0d6a9757d3c1f8ec84b7764"}},{"ruleId":"D2","level":"warning","message":{"text":"declared-font-environment.loadLocalProgram (cognitive 23): declared-font-environment.loadLocalProgram has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (3 pts), boolean chains 2, loops 2, ternaries 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd1fbfa2f23ff66bdf72373d2d0c33a120b231b142a2261826fe3def4cf6c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmBridge.prepareDeclaredFontEnvironment (cognitive 23): WasmBridge.prepareDeclaredFontEnvironment has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 8, if/else 8, ternaries 5 (6 pts), error handling 1 (nesting depth added 1). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"0879bb62e019dd1aeb4de211dcb5af1cab62d29f1617714f07778141acf16e89"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderClipNode (cognitive 23): CanvasKitLayerRenderer.renderClipNode has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 1986). 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa62380afd174f0cacce23df839ba0ff8a3999c465819e5c5efdbbbd968b94"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawTiledImage (cognitive 23): CanvasKitLayerRenderer.drawTiledImage has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 5, if/else 5, ternaries 2 (4 pts) (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd9c626d6653ff5628a111c91391708e0900d386797be8ac5eef3d1abbc83d"}},{"ruleId":"D2","level":"warning","message":{"text":"RendererSession.resolveUncached (cognitive 23): RendererSession.resolveUncached has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3 (5 pts), ternaries 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":"rhwp-studio/src/view/renderer-session.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb40af9bf0b1fb3523932ab92c5e25be87066ec9838582d29a768c851b43bba0"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentAgentController.applyTextCommand (cognitive 23): DocumentAgentController.applyTextCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (16 pts), error handling 3 (5 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 464). 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48bd8f14d2385dcdc1f714982103daca182e17c6db454031e6abb12742da575"}},{"ruleId":"D2","level":"warning","message":{"text":"DeleteTextCommand.mergeWith (cognitive 23): DeleteTextCommand.mergeWith has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d70e59b81706b5ab69e9f913342e25237ae024b100ce076ed098b143309382"}},{"ruleId":"D2","level":"warning","message":{"text":"TableResizeRenderer.hitTestBorder (cognitive 23): TableResizeRenderer.hitTestBorder has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, loops 2 (nesting depth added 6). Of this number, 22 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":"rhwp-studio/src/engine/table-resize-renderer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bf6afb7b956e1f71dac1a4451a72d5b3146592a4c8a9c2c276df2beb3a9704"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.constructor (cognitive 23): InputHandler.constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, boolean chains 5, ternaries 1. Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 772, 713, 738, \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d5177fa12caefeff192f4cdf46f5eee5ae8faf9df4df501808c06357d57b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"CharShapeDialog.populateFromProps (cognitive 23): CharShapeDialog.populateFromProps has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, if/else 4 (5 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9092697a8f0c7629a3e23a3bd9879345fafe69c373f9caebf4a7480464d180"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartDataDialog.menuItems (cognitive 23): ChartDataDialog.menuItems has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (14 pts), boolean chains 5, if/else 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4ab95b9d7498be8ed9cc067e34c8258366773077bea8ed5e209f5de328a06a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::clear_missing_lineseg_placeholders_in_control (cognitive 22): DocumentCore::clear_missing_lineseg_placeholders_in_control has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 2 (4 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. This shape REPEATS in the file: one other method here (DocumentCore::materialize_missing_lineseg_paragraphs_in_control) 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":"src/document_core/commands/document.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba19fefa3e836ac30803b0c85e4647b381a6fd5c0c3b6df9e73263fc98ce8623"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::materialize_missing_lineseg_paragraphs_in_control (cognitive 22): DocumentCore::materialize_missing_lineseg_paragraphs_in_control has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 2 (4 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. This shape REPEATS in the file: one other method here (DocumentCore::clear_missing_lineseg_placeholders_in_control) 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":"src/document_core/commands/document.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e8c20966632ba79e8af540e5c1b0ac3417ed317b66eedadcdb7b0c15f5bb63"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::refresh_footnote_numbers (cognitive 22): DocumentCore::refresh_footnote_numbers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 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":"src/document_core/commands/object_ops/footnote_shape.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"246eac2d60a21c2274cd9a53589477d4f3672176716cfb490206c716ddc08a51"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::move_inline_control_native (cognitive 22): DocumentCore::move_inline_control_native has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, loops 2 (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":"src/document_core/inline_control.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fcc2c0b58c75349d57e47f17818ae0fbacace3d9606e41c8308f00bfd587f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::pages_covering_paragraphs (cognitive 22): DocumentCore::pages_covering_paragraphs has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (6 pts), match/switch 1 (5 pts) (nesting depth added 14). 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":"src/document_core/queries/changed_pages.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f134cda4ff0c76af6d5c58724623534444f1a1c524c540e6c489693c20237844"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::collect_text_caret_stops (cognitive 22): DocumentCore::get_cursor_rect_native::collect_text_caret_stops has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 2 (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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::find_inline_flow_cursor_hit, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0ae993c6ada706bb8b1cc40a0f3415c816bcccfe99716f6cca3707c28c5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::shift_position_metadata_for_stream_insertion (cognitive 22): Paragraph::shift_position_metadata_for_stream_insertion has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"src/model/paragraph.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01de48f8fe157b2d45ce2fc5c96b808435ee52ef9a69b3a09973c0717a6c18c"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotWalk::selection_geometry (cognitive 22): SnapshotWalk::selection_geometry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, 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":"src/native_host/accessibility.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"328aa64ab8657fb1123d2c4cbfc9632c1ad5aef64c8a1f441e648c8dc33e3c24"}},{"ruleId":"D2","level":"warning","message":{"text":"Hwp3DrawingObject::read (cognitive 22): Hwp3DrawingObject::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, match/switch 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":"src/parser/hwp3/drawing.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa663817811e3f77655656beb7f2965dbf83395feb3551776b5515e3d7e401d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Hwp5BinResolver::resolved_len (cognitive 22): Hwp5BinResolver::resolved_len has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (7 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":"src/parser/mod.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd801ae13dd09b6a903688ec9052f5b8867f92db5a18d3f3fc50a527f143e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendOverrides::apply (cognitive 22): BackendOverrides::apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"src/parser/pdf/policy.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266ca81d1e3518b3d20156d0d1ad5b1fe4e7c940b11213c86af9afa5c986f08"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::finish_named_scripts (cognitive 22): EqParser::finish_named_scripts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (6 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":"src/renderer/equation/parser_left_scripts.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"13872273e5851f50306c17b5fea67206913b38415d525a0ef0598f83c4a6e54d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_block_cut_closes_original_text_frame (cognitive 22): LayoutEngine::row_block_cut_closes_original_text_frame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b99f2c21efc4d2d0df2c9a108ee93b6edea6372efc4c3a78605f7679d59136"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_inline_restart_row_end_frame (cognitive 22): LayoutEngine::stored_inline_restart_row_end_frame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, 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":"src/renderer/layout/table_layout/stored_inline_row_frame.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"411367c373f1dcb3072af5d4ce8a7d8691bd41928c35eb04f4f996496664a76e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::fresh_rowbreak_wrapper_safe_prefix_end_cut (cognitive 22): LayoutEngine::fresh_rowbreak_wrapper_safe_prefix_end_cut has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49f0142d21ee49347eb8f44644156991851be7c3e50ba946e88c66e21a19561"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::replace_composed_chars_with_display (cognitive 22): LayoutEngine::replace_composed_chars_with_display has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (7 pts), boolean chains 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":"src/renderer/layout.rs"},"region":{"startLine":5548}}}],"partialFingerprints":{"codehealthFindingId/v1":"73af8f474bde01de8cec9750f5b7d47ec42b6d4f89d4dffbeb9786cb0337ea3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::typeset_endnote_flow_tables (cognitive 22): TypesetEngine::typeset_endnote_flow_tables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, 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":"src/renderer/typeset/notes/endnotes/flow_table.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead7b6fb29ae9c295f6d42de1f6015a3cae61d9b6548330632946d3cf6be3da"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::judge_hwp3_variant_vpos_reset_break (cognitive 22): TypesetEngine::judge_hwp3_variant_vpos_reset_break has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (10 pts) (nesting depth added 5). 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":"src/renderer/typeset/section/boundary.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a475c4c5a07d6dd09c8eb25869dd2ca7a5b976204fc35390b3797d260ce2c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::harvest::run_table_csv (cognitive 22): rhwp::bin::rhwp-agent::harvest::run_table_csv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f92a0da0f77502c59d905d66dc82a4433e3ff4539a2714594ffd3ed6b20a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::batch_fill::parse_csv_records (cognitive 22): rhwp::cli::commands::batch_fill::parse_csv_records has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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":"src/cli/commands/batch_fill.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a0708db99f3cb579d4291f9179ff978b265af96be9760aa83d8c9b5374cc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::note_content::edit_apply_endnote_shape (cognitive 22): rhwp::cli::commands::edit::note_content::edit_apply_endnote_shape has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (10 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1778a7be28a91c1cfbe75147aee7a2fcec943751e93e37710370de6d95eb0a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::layout::edit_fit_table (cognitive 22): rhwp::cli::commands::edit::tables::layout::edit_fit_table has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (10 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98100afb35b46aff4dd04114513ed41e0ef077e76c70622da5b4f2132b77ae"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_merge_table (cognitive 22): rhwp::cli::commands::edit::tables::structure::edit_merge_table has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (10 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::structure::edit_delete_table) 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":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089e33672953279487bb8707bf16e0f257f2070f3a159ccb36e4fc300b343fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::tables::structure::edit_delete_table (cognitive 22): rhwp::cli::commands::edit::tables::structure::edit_delete_table has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (10 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (rhwp::cli::commands::edit::tables::structure::edit_merge_table) 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":"src/cli/commands/edit/tables/structure.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a494f215d32f0d89f2df8f556ef9baeb2de7c400b0546d6239e173914f613f21"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_paragraph_line_trace (cognitive 22): rhwp::cli::queries::diagnostics::dump_paragraph_line_trace has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (6 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbb6d924f877bc817fed32989d61d626dea1b36eb30f068598f654d603173aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::footnote_shape::apply_props (cognitive 22): rhwp::document_core::commands::object_ops::footnote_shape::apply_props has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20 (21 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":"src/document_core/commands/object_ops/footnote_shape.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8e7652bfb7885137065c0a395f9923ae71f4982cd55071868394ecd935dc68"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::template::select (cognitive 22): rhwp::document_core::commands::paragraph_block::template::select has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"src/document_core/commands/paragraph_block/template.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"10633a081c7148fc0fc55bbe5ce4f0b5a9c48bf09831ba3dfd31e39e610a8630"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::find_closing_tag_chars (cognitive 22): rhwp::document_core::helpers::find_closing_tag_chars has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 1 (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":"src/document_core/helpers.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e961f96345e6ebf10d0e99e2002af713d6a214a3a7c9d083f71f94d897a19"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::form_action::collect (cognitive 22): rhwp::document_core::queries::form_action::collect has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (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":"src/document_core/queries/form_action.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a493a5da522a98aac04f319bac5b3274ecd7e5e5683583d5066c6fb63d6f63"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::stego_scan::homoglyph_offsets (cognitive 22): rhwp::document_core::queries::stego_scan::homoglyph_offsets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 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":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92ca4821279186ab05a3b44bc373f18fec7f23ab2f7e2bfc796190488ebdd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::table_calc::evaluator::eval_function (cognitive 22): rhwp::document_core::table_calc::evaluator::eval_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (3 pts), boolean chains 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":"src/document_core/table_calc/evaluator.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51b50fca19054b5cd972ae3c79badfc0acea6c723b53a37b527eccc803def1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1835::probes::synth_1835::main (cognitive 22): rhwp::mydocs::tech::investigations::issue-1835::probes::synth_1835::main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (15 pts), loops 3 (6 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":"mydocs/tech/investigations/issue-1835/probes/synth_1835.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"322d799080d212071129c635ae5287c41549693cb86f6150331a51b80baf6528"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::ole_chart::preview_palette::apply_preview_palette (cognitive 22): rhwp::ole_chart::preview_palette::apply_preview_palette has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/preview_palette.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99cc6b1e5c9e48301cf39ef23e5f28e66a28e3fdd80e1c8e7878bd5a9d6ea48"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::builder::line_decoration_trim_target::scan (cognitive 22): rhwp::paint::builder::line_decoration_trim_target::scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), boolean chains 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":"src/paint/builder.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6818066c83050b9230b8bb6df1828b05c5c84fc62fab82135d4411f7d7973"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_text_legacy_visuals (cognitive 22): rhwp::paint::json::write_text_legacy_visuals has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 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":"src/paint/json.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f66b1b803d786c2d6630194aab5e5b40b3f9b7064a150ed7b6f5ac65673e51"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_v2_export::envelope_variants (cognitive 22): rhwp::paint::text_v2_export::envelope_variants has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 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":"src/paint/text_v2_export.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"861f0437b6e1767c5fc8e37caff6a2e3820b758bc43d355168b4774113c774de"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::content::collect_section_master_pages (cognitive 22): rhwp::parser::hwpx::content::collect_section_master_pages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 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":"src/parser/hwpx/content.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3e70e78eadc802cbaa2ddf3fb9354e4f9680ccf4f5dccb8085c323167156e6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::ole_container::emf_from_wmf_comment_chunks (cognitive 22): rhwp::parser::ole_container::emf_from_wmf_comment_chunks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 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":"src/parser/ole_container.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9ac6ec84b3cdcb93cbb1a2976fa0285aabff776004763d8897b9f584318db9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::text_analysis::reconstruct_line (cognitive 22): rhwp::parser::pdf::text_analysis::reconstruct_line has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (5 pts), boolean chains 4 (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":"src/parser/pdf/text_analysis.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"99849b36e41473e36cba92fbc9d2f789406207e61d4220ca992bb851a6a68cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvaskit_m07_pack_contract::op_from_matrix_row (cognitive 22): rhwp::renderer::canvaskit_m07_pack_contract::op_from_matrix_row has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (5 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":"src/renderer/canvaskit_m07_pack_contract.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"447d5fa956845683e7567216e1cece9f4d978d0f46ce44f6d26d323b6e3ed0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::form_drawing_replay_rejection (cognitive 22): rhwp::renderer::canvaskit_policy::form_drawing_replay_rejection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"187129344edf4ce2ac8c9c8976ca389a2eea9ee3a7a19cb89eb8b635aea3a8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::inline_control_projection::inc::try_insert_control_text_run (cognitive 22): rhwp::renderer::composer::inline_control_projection::inc::try_insert_control_text_run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/inline_control_projection.inc.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a39287dcc77ef8b403ef2e0d8b698d8d10ad3aff93c84d5dedf8e4410090f5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::punctuation_slots::try_resolve_run_slots (cognitive 22): rhwp::renderer::composer::punctuation_slots::try_resolve_run_slots has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 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":"src/renderer/composer/punctuation_slots.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb3e38bcca22787fb9daeffe5592134e43055baade4efebc65c8afaa5f3fa3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow (cognitive 22): rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, loops 2 (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":"src/renderer/float_placement.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8819fc8d02946eaed0026bed14d4e937fbcbec890b623f4136c03b37fbb6aca5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::native_hwp5_stored_reset_fragment_paint_geometry (cognitive 22): rhwp::renderer::float_placement::native_hwp5_stored_reset_fragment_paint_geometry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, 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":"src/renderer/float_placement.rs"},"region":{"startLine":9394}}}],"partialFingerprints":{"codehealthFindingId/v1":"026da35f7ed40618e3a10ef0f9a3d4b65ee162936938a2547f8e7814965768e5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::empty_successor::stored_empty_successor_geometry (cognitive 22): rhwp::renderer::float_placement::empty_successor::stored_empty_successor_geometry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 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":"src/renderer/float_placement/empty_successor.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"950dd42fcb5c4bf80cef5e8a97dcfce53e5428c05ba47a72bc19b2c9e7f94ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_alpha::carrier_colors (cognitive 22): rhwp::renderer::image_resolver::print_alpha::carrier_colors has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_alpha.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23e13231a81e591ec18a1598df95384cbbb8cdfbdc222ba699173f1fcad3df3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::inline_flow::plan_square_table_host (cognitive 22): rhwp::renderer::inline_flow::plan_square_table_host has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 9, match/switch 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":"src/renderer/inline_flow.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"178b022ce978e62335db9ef1a44b7d18f529e11242871442e4d381c9266b49b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::print_image_sampling_core::resample_opaque_rgba (cognitive 22): rhwp::renderer::print_image_sampling_core::resample_opaque_rgba has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (20 pts), boolean chains 1, if/else 1 (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/print_image_sampling_core.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c477ca3df3224e935934a964494ca52f747ddf7c1a1afda266f89a3e40c1111"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::prove_parent_closed_with_storage (cognitive 22): rhwp::renderer::render_normalization::stored_nested_text_frames::prove_parent_closed_with_storage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 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":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c06bb05e3334fda5f25968c4adc55f572f80e3127db6804f8bce172aa5cd6e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_text_metrics::nominal_height (cognitive 22): rhwp::renderer::render_normalization::stored_text_metrics::nominal_height has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, 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":"src/renderer/render_normalization/stored_text_metrics.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c948d34bd73aaa47a7876c8d80cd18cb90f710e4c06a67a053214a8b674ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::font_file_lookup::find_font_file (cognitive 22): rhwp::renderer::svg::font_file_lookup::find_font_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (9 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":"src/renderer/svg/font_file_lookup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4985bf3eb4d89dbfca5d94472e8aae070586d34c78e3886a91686399aa6f255b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::system_fonts::family_file_from_database_with_style (cognitive 22): rhwp::renderer::svg::system_fonts::family_file_from_database_with_style has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, 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":"src/renderer/svg/system_fonts.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"567c527a5d0ea0c8ced6a0a8882cfa190cad1359eec481938f6f3afe30d20ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row (cognitive 22): rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 16, 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":"src/renderer/typeset.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89117c71bb733498bcb292e61a0c13cf57e677ace8550cb1884f0884cc818de"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::endnotes::row_projection::project_equation_rows (cognitive 22): rhwp::renderer::typeset::notes::endnotes::row_projection::project_equation_rows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 6, 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":"src/renderer/typeset/notes/endnotes/row_projection.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef56c67998d7067f9355786e000b07cd48e3a235df1381bfdd56d3b81f10ef82"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::overflow::tail_overflow_candidate (cognitive 22): rhwp::renderer::typeset::paragraph::overflow::tail_overflow_candidate has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (9 pts), loops 2 (nesting depth added 4). 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":"src/renderer/typeset/paragraph/overflow.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8242b4a77b9c3c8398ee3546b1febd55b6a407f14b828b20de26e7a1bc5d01"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::table::block::unrestricted_float::atomic_external_children_fit_parent_frame (cognitive 22): rhwp::renderer::typeset::table::block::unrestricted_float::atomic_external_children_fit_parent_frame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 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":"src/renderer/typeset/table/block/unrestricted_float.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5405fe5a12ad5b97f61edd5fd792b7f77a31d4fb85cc0675a54548434824a5"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validate_profile (cognitive 22): schema.validate_profile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, loops 1, ternaries 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":"gym/core/schema.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf9964fb325dc1eb8aa449c02d73878c92d9609a30fc9f7b580f8baef3dd498"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.audit (cognitive 22): audit.audit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, error handling 2 (4 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b5c12188862a8b9ab53d8123ee20cd893396bc6df5d8a130b37249bbcfade7"}},{"ruleId":"D2","level":"warning","message":{"text":"build_baseline.process_pack (cognitive 22): build_baseline.process_pack has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (5 pts), 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":"gym/tools/build_baseline.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d3e12251bf7684232ee6113db4ba4d2d0e28140d0b482a7cb8b62dca1d2cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.payload_honesty_issues (cognitive 22): competitive_bench.payload_honesty_issues has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (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":"gym/tools/competitive_bench.py"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadb1f2ed39821c4a8cd4e266c1910687c89010e8b581f1e2365a73380538555"}},{"ruleId":"D2","level":"warning","message":{"text":"file.runPdfPrint (cognitive 22): file.runPdfPrint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). Of this number, 21 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"43815b2fb2d6f68291cd6837ab9cc390c061cf195bfcc48c6bfbfd5b29a7c8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasSupplementalMetricProvider.prepare (cognitive 22): CanvasSupplementalMetricProvider.prepare has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/supplemental-text-metrics.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"df16b14729215ed9448eb0785a18fdb6d9a0632a60ae2050d45634bd18015f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"font-decision-trace.canvas2dDecision (cognitive 22): font-decision-trace.canvas2dDecision has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, ternaries 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":"rhwp-studio/src/core/font-decision-trace.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"691ea857b5dc902c268b44a7f84f6d11d614e30d7cee752cb303c6fb66a96920"}},{"ruleId":"D2","level":"warning","message":{"text":"image-header.webpHasSingleFrame (cognitive 22): image-header.webpHasSingleFrame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ac1a0da4c15d071354a4037a4257387d6fcc26343dc35ce0fc128e2660068b"}},{"ruleId":"D2","level":"warning","message":{"text":"replay-fingerprint.replayFingerprint::visit (cognitive 22): replay-fingerprint.replayFingerprint::visit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"rhwp-studio/src/view/canvaskit/replay-fingerprint.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0299b4dc71d5430071cc622fed24171def3d9096961e61fd0342279ed861d8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderImage (cognitive 22): CanvasKitLayerRenderer.renderImage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, ternaries 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80df0861297f1c242230f59a97c94cbb420ef986064d9a43c6cfc4c862f58ab"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer.createOrReuseFlowImageLayer (cognitive 22): PageRenderer.createOrReuseFlowImageLayer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a9a981986a2b24b7c75a7adfc6d3cf3453e737a1c14d91f767976a0e1c6ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer.scheduleReRender (cognitive 22): PageRenderer.scheduleReRender has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (finish, a function literal at line 1191, a function literal at line 1202, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3483818b7d926c8f3accb0b7ad9c0839cdcb07bb8b3b04bb9b0d9ec23ada58"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.moveToCellByIndex (cognitive 22): CursorState.moveToCellByIndex has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 6 (8 pts), boolean chains 3 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 5 belong to 2 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b08469e458f1d197a100beafedd9f9c98508d4856ff168e7cdc8f6ef527a66b"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertTextCommand.execute (cognitive 22): InsertTextCommand.execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (4 pts), loops 1 (2 pts), ternaries 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91afebe13f08a04eeb1b9575a96f7603433c660c59ddc6631be942091cff21"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.calcResizedBboxRotated (cognitive 22): input-handler-picture.calcResizedBboxRotated has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (16 pts), if/else 5, 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc9820f4370d4a34f13ac73664c15b32086e8aa4a57fd7f635340f6a04c405e"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.clampCompensatedResizeDelta (cognitive 22): input-handler-table.clampCompensatedResizeDelta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35e5646225e6b5575a92c422cd4363a4acab9e1af9256b8f6bbb97935d78dce"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.cutSelectedObject (cognitive 22): InputHandler.cutSelectedObject has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 8, ternaries 4. Of this number, 15 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5764}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eb9b732045481fe3fe7719ffa994d4644657332a6e87cf659403bafaa1ef2a"}},{"ruleId":"D2","level":"warning","message":{"text":"StyleEditDialog.onConfirm::apply (cognitive 22): StyleEditDialog.onConfirm::apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab99977de99c98b39683e7e1c34663ca7a8c44e659e86d8b5c7b4755f9f82a"}},{"ruleId":"D2","level":"warning","message":{"text":"renderQueue (cognitive 22): renderQueue has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 4 (7 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da8a3255b981d351faf234d93196dbd659854265f2580a80a7ce0b3c95f7fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"renderProfiles (cognitive 22): renderProfiles has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (5 pts), error handling 1 (3 pts), loops 1, other 1 (nesting depth added 10). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 621, a function literal at line 612, mk, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e31273d52034718125dd8383c10c752c5cbb288fa05176d04e763509ea24bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveSettings (cognitive 22): resolveSettings has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), other 3, ternaries 2 (3 pts), error handling 1 (2 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":"rhwp-chrome/sw/settings-store.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"14853355fa2fb04d2fadb388bcec31695c870d388646bd900a155a3328db5a39"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::validate_linesegs (cognitive 21): DocumentCore::validate_linesegs has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 1 (4 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a54021ce47be2aea547029b6bedb6620d3f815e055c051c7feb823e43fe7e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_chart_edits (cognitive 21): DocumentCore::apply_chart_edits has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 9 (11 pts), if/else 8 (10 pts) (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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b825edc3a599359ef54556f4d8859ceaef78ea5c5deab94d2c5e088a2b4f42"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::replace_body_text_local_native (cognitive 21): DocumentCore::replace_body_text_local_native has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2, 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"064abdc5eee5dd7b9f642a64a2a4204c11030313eb5cb533d6590e16c754178c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_document_info (cognitive 21): DocumentCore::get_document_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (6 pts), match/switch 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":"src/document_core/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d455eb54234f7ce2b03fc1aa7ec08ac633a5d4d655830410a7d414cb92bf97"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::extract_page_markdown_with_images_native::table_cell_text (cognitive 21): DocumentCore::extract_page_markdown_with_images_native::table_cell_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (DocumentCore::extract_page_markdown_with_images_native::collect_markdown_items) 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":8907}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66f02c59f52679cf94533e0c6ff1941d38ca50bbbe4b7d0f46491a4ef9f9240"}},{"ruleId":"D2","level":"warning","message":{"text":"Record::read (cognitive 21): Record::read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, 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":"src/model/border_paint.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"871eaf8a076b3c61c4074b673145db88464e220a7ea57d6946fe399b3972037b"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfStroke::try_segment_rectangles (cognitive 21): PdfStroke::try_segment_rectangles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/pdf_stroke.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f26064c8ca1d23813b800fe88e292b7f6a3aa7cc621117622020f949c829bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::contradictory_column_boundaries_hu_with_storage (cognitive 21): Table::contradictory_column_boundaries_hu_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table/contradictory_grid.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3060f64a8ecbfcde80a5f481b1576c5dc2f2a447b10fd5cb3444cc8b63871e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility::project (cognitive 21): Visibility::project has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts), loops 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":"src/parser/hwpx/tracked_changes.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2622e87af71b3133c5d9697167315797064fe8ebde7ceca75130b50d63b5772"}},{"ruleId":"D2","level":"warning","message":{"text":"ObservedText::lines (cognitive 21): ObservedText::lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"src/parser/pdf/text_analysis.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2059e473979fb068c53048d060907e3e75545d8aad5625ed4c8192c61d00b1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::source (cognitive 21): Plan::source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/legacy_coordinate_plan.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ad05dbf588441513b14846a06bc048b1594a7b65b04befe48c738e1bcb1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_body_picture (cognitive 21): LayoutEngine::layout_body_picture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (6 pts), boolean chains 2 (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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f15fc5441c7ac17520f7c6adab764719b43d1a5a3426fe0b39b35e17867a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_block_source_rows (cognitive 21): LayoutEngine::stored_block_source_rows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148c7b251970594fd02cf44a0b07b400c13315e72feffa3ea832f39b8146fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::table_uses_stored_fragment_coordinates (cognitive 21): LayoutEngine::table_uses_stored_fragment_coordinates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, 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":"src/renderer/layout/table_layout/stored_text_frame_owner.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0be4e3362ee162f2df0dad454c86a6fa84f7fa13c156f538cedd542f6f4cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calc_nested_controls_bottom_height (cognitive 21): LayoutEngine::calc_nested_controls_bottom_height has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11755}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a1f4fb0f3e75abb3a89a578f033b6300f4037683cf95614291405afcb7b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_block_cut_uses_measured_height (cognitive 21): LayoutEngine::row_block_cut_uses_measured_height has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (8 pts), loops 1 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed44399f25daffac49d786cea8c876cd510be26ecf0fca3018474048fb9ff2f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::direct_hwpx_cell_has_declared_stored_frame (cognitive 21): LayoutEngine::direct_hwpx_cell_has_declared_stored_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22042}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d1dcfeeddbc2fe2088367cff7f9ed9b419ba50cbb407c639fe16b3ec3f798"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_stored_rewind_unit_indices (cognitive 21): LayoutEngine::row_stored_rewind_unit_indices has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 3, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8d9e631556dbf40ee93c35a457ffe95b790f65aba0216616c9aed7015c09ce"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::partial_table_page_contains_cell_position (cognitive 21): LayoutEngine::partial_table_page_contains_cell_position has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 10. 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b648c34f596b50f842005408f04f91ec159d49993cee1f7cb3b49920006a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::substitute_hf_field_markers (cognitive 21): LayoutEngine::substitute_hf_field_markers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 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":"src/renderer/layout.rs"},"region":{"startLine":5317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe83d14ee42d81faa5c8f17263b1a36484d015393f415119fa52b7e19cadc99"}},{"ruleId":"D2","level":"warning","message":{"text":"PageControlEvents::collect_with_storage (cognitive 21): PageControlEvents::collect_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/page_number.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf14d31e6eaec17b9aa54c6bebcbd46da2445072c37d38facf662b0d82d8e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderNormalizationOverlay::from_document_reusing_with_storage (cognitive 21): RenderNormalizationOverlay::from_document_reusing_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (6 pts), boolean chains 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":"src/renderer/render_normalization.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d135c59628e5e7594b274e945c4a325fd57395f4e38e12fabe3d4aa4f0dadf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::predict_current_column_para_y (cognitive 21): TypesetEngine::predict_current_column_para_y has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 2, 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":"src/renderer/typeset.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"84600904461d50a4d2aa945ea22897c5a77c5ebf9167718d0c628738a43d2341"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::apply_square_gradient_fill (cognitive 21): WebCanvasRenderer::apply_square_gradient_fill has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 3 (4 pts), boolean chains 3 (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":"src/renderer/web_canvas.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"36409c0e767f061fc7c1227a160700356c9fdaab944fd66ad1e76faadad6edbc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_armor (cognitive 21): rhwp::bin::rhwp-agent::safety::run_armor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 7 (8 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ac41c1318b0e8164cebb6fdb23547e976d9ad499c750551696db88ab0f66ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-font-layout-evidence::parse_args (cognitive 21): rhwp::bin::rhwp-q::commands::rhwp-q-font-layout-evidence::parse_args has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 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":"src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ee27a32d5086bc2d551ef6d027f5384f31db26ebec7e0d7a6643fbd3bfde0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::more::probe::collect_stats (cognitive 21): rhwp::bin::rhwp-q::more::probe::collect_stats has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (17 pts), match/switch 1 (4 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c5b32eb10ae3b721a832708a5d43e254b8327471e83290a99e06e85ba47ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::disclosure::cmd_disclose_verify (cognitive 21): rhwp::cli::protocol::exchange::disclosure::cmd_disclose_verify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"467e06a2605f34d86740107f3cea3c0ea67cfff76d2e1ee89868b894816f28c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::run_eqedit_blocks (cognitive 21): rhwp::doclang::run_eqedit_blocks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), match/switch 2 (6 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":"src/doclang/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6473aba6f982012590f62268c6c41cb4f8039cd7e13755da461775d9e4d127"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::builders::exam_paper::build_exam_paper (cognitive 21): rhwp::document_core::builders::exam_paper::build_exam_paper has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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":"src/document_core/builders/exam_paper.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"09143fe9e8c2fee992ec5c169190534fabddca6f2156b6a8058b1cdbdac40c58"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_bands::apply (cognitive 21): rhwp::document_core::commands::border_paint_bands::apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (7 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":"src/document_core/commands/border_paint_bands.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"212d9c02327acd5d04daa58df2def1fb90899b4d39f2330998d4f2f26069c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::clipboard::clip_paragraph_caret_range_for_clipboard (cognitive 21): rhwp::document_core::commands::clipboard::clip_paragraph_caret_range_for_clipboard has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab57c039706b03621f143e8969ff64984d7d596e74cebd4ef2a483e04bc2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::infer_series_mapping (cognitive 21): rhwp::document_core::commands::object_ops::chart::infer_series_mapping has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee0a26771c45f12158c0eab373a747decedc6c34e8b6b85429f00b9e8e93ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::validation::references::validate_paragraph (cognitive 21): rhwp::document_core::commands::paragraph_block::validation::references::validate_paragraph has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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":"src/document_core/commands/paragraph_block/validation/references.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c6e1ec502d12375d56cddb6bed4084be3d3dac6744135a0ec7567f16f9751a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::paragraph_block::validation::resources::collect (cognitive 21): rhwp::document_core::commands::paragraph_block::validation::resources::collect has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), 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":"src/document_core/commands/paragraph_block/validation/resources.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aac78a8cf21899dd6e027dedeca85b609ce90d6d832b8276e40e318d867fcda"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_css_border_shorthand (cognitive 21): rhwp::document_core::helpers::parse_css_border_shorthand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 3, 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":"src/document_core/helpers.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c462ee3c2dc3b2cb53d6ae6a38afaefbd6e8f672c45d0325c5ac9e22220ca40"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::find_field_ctrl_idx_in_para (cognitive 21): rhwp::document_core::queries::field_query::find_field_ctrl_idx_in_para has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2, 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"256d5da275ce803215b200db0f7474e12038f4216e05b4e043dbb82eed5892ad"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::font_metric_coverage::classification::classify_decision (cognitive 21): rhwp::document_core::queries::font_metric_coverage::classification::classify_decision has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, match/switch 2 (3 pts) (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":"src/document_core/queries/font_metric_coverage/classification.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af3aacf67a68322b19b7d9ccff159e4ce137cda4024151f534df50f956b8b43"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::text_security::compose_hangul (cognitive 21): rhwp::document_core::text_security::compose_hangul has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (18 pts), boolean chains 2, loops 1 (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":"src/document_core/text_security.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"090111327608f2fc0ed37c9c24545abc9824faa2c5b4333207b95320506b5be2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::identity::walk::walk (cognitive 21): rhwp::model::identity::walk::walk has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (9 pts), match/switch 3 (8 pts), if/else 1 (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":"src/model/identity/walk.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ff0afb086da17ee8f74feae2fccfc038ed61eb0ad8a6354abff9429b84c435"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-4969::probes::scratch_r6_head_probe::main (cognitive 21): rhwp::mydocs::tech::investigations::issue-4969::probes::scratch_r6_head_probe::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 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":"mydocs/tech/investigations/issue-4969/probes/scratch_r6_head_probe.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e3452dace8790eff8d5b34ec919f8ac5524949be39f53dd569040c7a30fd9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_visual_resources (cognitive 21): rhwp::paint::json::write_visual_resources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (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":"src/paint/json.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"414425f8e0adc4646ea7d030bfc879bfa248976a6a4c9ddefc9ecd81efd59854"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_print_coverage::apply (cognitive 21): rhwp::paint::metafile_print_coverage::apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 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":"src/paint/metafile_print_coverage.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e8e60c784f43246e62cca569f3760177115dd5109b9c222a7abb410305849d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::shape::parse_shape_component_full (cognitive 21): rhwp::parser::control::shape::parse_shape_component_full has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), loops 2, boolean chains 1 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"src/parser/control/shape.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"135aea1a4ce489036d4818686f2be251b1a9f5755909ee876a9f0074ed0c8fba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::note_line_positions::normalize_hwpx_note_line_vpos (cognitive 21): rhwp::parser::hwpx::note_line_positions::normalize_hwpx_note_line_vpos has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, 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":"src/parser/hwpx/note_line_positions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258554762962ab0060269d5728236da2392ee06f48c4ff24552eee0bf0d1e52"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_picture_img_rect (cognitive 21): rhwp::parser::hwpx::section::parse_picture_img_rect has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 2 (6 pts), loops 2 (5 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05191bcdd29fcd6df2c314f609b2a5da74a7cb8cc6664263f4f768ef24bfa25"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hp_ole_element (cognitive 21): rhwp::parser::hwpx::section::parse_hp_ole_element has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 6, 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4b97c22b05e6e13bdb9d7ca021830a8bd1c277a5d677a8bc4886a7e5d39db4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::grid_shared_edges (cognitive 21): rhwp::parser::pdf::table_detection::grid_shared_edges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99b050d6e093a9bb1eb26271996bcf7c5e5ea68f23eee78b4a51a05f0698bb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvas_cluster_fit (cognitive 21): rhwp::renderer::canvas_cluster_fit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9 (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":"src/renderer/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bca12891024fe0a9fed48031abc467961cf2778769ec3b7b3806ae101d4e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::bitmap_raster::transparent_area_downsample (cognitive 21): rhwp::renderer::bitmap_raster::transparent_area_downsample has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0afbc87c8ebc028d5ba26d99ed47a08259474f25cbf4ba9512a29e0e6f4346"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_lines_runs::inc::try_split_by_char_shapes (cognitive 21): rhwp::renderer::composer::stored_lines_runs::inc::try_split_by_char_shapes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"335051e52a68e65af827183a0d4dcbfe4b535270541f52611d6d040f86a8b735"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage (cognitive 21): rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 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":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9860c405cbc3445fa61eec3fedf32a2cf4c06e5b4b25e9c37da3134812aab04"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_group_next_page_placements (cognitive 21): rhwp::renderer::float_placement::stored_picture_group_next_page_placements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 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":"src/renderer/float_placement.rs"},"region":{"startLine":5536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1be547ad8efb769942e008798788c510fdab09a44f2883e3bc9700d0a6b0bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_row_grid::owns_fragment_outer_frame (cognitive 21): rhwp::renderer::float_placement::stored_row_grid::owns_fragment_outer_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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":"src/renderer/float_placement/stored_row_grid.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e270ff323a46153ed7090bb88d03939dd74ad823e28d8861232c3c0b3b78b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::hft_ascii_evidence::count_paragraph (cognitive 21): rhwp::renderer::hft_ascii_evidence::count_paragraph has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 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":"src/renderer/hft_ascii_evidence.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8552484384808c854bf11dced0743a0cf3c52a5825b057da114c52458aea6814"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::kerning::compute_kerning_pair_candidate (cognitive 21): rhwp::renderer::kerning::compute_kerning_pair_candidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, 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":"src/renderer/kerning.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b6c1b84c9e9e8855957ae491679ce1716eff0f94e43f9f231c22be792cdc8c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::create_wave_nodes (cognitive 21): rhwp::renderer::layout::border_rendering::create_wave_nodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea046dbf090a8bb745744cf1fdd5cb939a27f4f88949cac0ea8497322c052e23"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::justified_dash_restoration (cognitive 21): rhwp::renderer::layout::paragraph_layout::justified_dash_restoration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (6 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f219730b207535260a7983f3a9b9378a3a6774e590246f579ccc3a2bb609128"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::expand_page_fragment_clip_to_own_text_lines (cognitive 21): rhwp::renderer::layout::table_layout::expand_page_fragment_clip_to_own_text_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"73acfe453005647d9b87c41651aa221b8cbec7ea4c913da2f63af65c1de519ef"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::terminal_tracking::terminal_tracking_for_alignment (cognitive 21): rhwp::renderer::layout::terminal_tracking::terminal_tracking_for_alignment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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":"src/renderer/layout/terminal_tracking.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6b4e2309a44b03e5d936a0b67705b2bb5816eefbbee525d2936cbc3a49753c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::parse_image_dimensions (cognitive 21): rhwp::renderer::svg::parse_image_dimensions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"src/renderer/svg.rs"},"region":{"startLine":4526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93029ee61f9810dc0ea84eff7ad41dfb781f47ad9bbf2b5945158577839a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::text_font_presentation::ordinary_text_font_program (cognitive 21): rhwp::renderer::text_font_presentation::ordinary_text_font_program has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 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":"src/renderer/text_font_presentation.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1408f52fa2664b7491172dafab56a94c4d7611c2411eb0f7bae7ec8f364876fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::web_canvas::parse_image_dimensions_canvas (cognitive 21): rhwp::renderer::web_canvas::parse_image_dimensions_canvas has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"src/renderer/web_canvas.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"890477478df7b1d8fe32ad9e2617b07bd085ac64d3808adfcbeac17ca5528182"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::column_sizes::for_export_with_storage (cognitive 21): rhwp::serializer::column_sizes::for_export_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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":"src/serializer/column_sizes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bad0efb5425fece5cd3826fcf24a202571ef8c799db0c0e3d43e70929d6417"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_paragraph_parts_with_storage (cognitive 21): rhwp::serializer::hwpx::section::render_paragraph_parts_with_storage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5 (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":"src/serializer/hwpx/section.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121041f0d21274377d5e9044982f13a5d57ed6b21e790f87fcccf741fe5c704"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::tools::font_metric_gen::compute_axis_averages (cognitive 21): rhwp::tools::font_metric_gen::compute_axis_averages has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/font_metric_gen.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"10066551a3aed1c4702e0cf7858d57d4b670e7e926c1bd85d84db6f83e3fe89f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::tools::font_metric_gen::run (cognitive 21): rhwp::tools::font_metric_gen::run has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 2 (8 pts), if/else 5 (6 pts), loops 2 (6 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":"src/tools/font_metric_gen.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e8d98924afe9704df398b02e23039bed0b30dc3ac3bfd30d4c96f4f879884f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::wmf::converter::svg::source_rop_pair::compose (cognitive 21): rhwp::wmf::converter::svg::source_rop_pair::compose has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/source_rop_pair.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5177a9dfcf7fbc6a6ea7dd5dfbaeafbc3afbdbb662fba20c48de35d7476900ad"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchConverter::format_args (cognitive 21): BatchConverter::format_args has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/batch-convert/src/converter.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"464b4ce9dc86bc54f28b85e3694cf92104012a54142a5845a4e790a591c51536"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.write_fixtures (cognitive 21): _gen_pack.write_fixtures has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (18 pts), loops 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":".claude/skills/rhwp-visual-regression/references/_gen_pack.py"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58ff7dd88e17fcc350128bc2897bf76c88fa91b443930a6484b2e922fb28457"}},{"ruleId":"D2","level":"warning","message":{"text":"report.render_card (cognitive 21): report.render_card has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/report.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2533c48d03e772fc495ef6fe93e80a47672a0d059c7df7ac887e57dc23f586e"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_checks (cognitive 21): pack_health.scan_checks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 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":"gym/tools/pack_health.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"effbfe32ff500873b5a02aa35084d87d9ec32041fc0041683d7040f4ffc6101e"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.audit (cognitive 21): pack_health.audit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (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":"gym/tools/pack_health.py"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a937352adc77e1a5e5ba94ec34aeaa600e8ec1035c404ff97fc83b0361b4701"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeEditorViewState._key (cognitive 21): _NativeEditorViewState._key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"bindings/Flutter/lib/src/native_editor_view.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f065b2a8bdfb288c550dcf3e4c41f35584031a954742ed1d7c02cc019ea885c"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.classifyDocumentHref (cognitive 21): content-script.classifyDocumentHref has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (7 pts), boolean chains 2, error handling 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":"rhwp-chrome/content-script.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d87e14cd089943ce396bf38f3312630f5b992a23d14eb902365d0d9b6601f4"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.classifyDocumentHref (cognitive 21): content-script.classifyDocumentHref has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (7 pts), boolean chains 2, error handling 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":"rhwp-firefox/content-script.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5678fb68fbae9315fc48107a6fcda1ea33dafd4049d1cb037c7d975d2ecd7540"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.classifyDocumentHref (cognitive 21): content-script.classifyDocumentHref has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (7 pts), boolean chains 2, error handling 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":"rhwp-safari/src/content-script.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7712d9eea2eabb7b243898172d2bec265f6c978823514f8394ac5d741bd36ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"action-runtime.evaluateFormAction.assign (cognitive 21): action-runtime.evaluateFormAction.assign has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbdbdcbca2259fddb3d2cfaa512f35355c30a23ff68dcde6ad8622edac04996"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandErrorBoundary.fail (cognitive 21): CommandErrorBoundary.fail has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (6 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to one function literal inside it that branches (line 78). 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":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9e1c494f3bded6d3c414ec66c4d10efe56332c664a9e28eb53429b1d3b343"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.charEditOpsFullDp (cognitive 21): diff-engine.charEditOpsFullDp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 5 (6 pts), boolean chains 5, ternaries 1 (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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff90d699408e370443045c3ce59d46041435ffefdd6d4d9408f6847a391a5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.suppressPureReflowMoves (cognitive 21): diff-engine.suppressPureReflowMoves has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1497, 1481, 1482). 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5168c18f5763e306fc0b1c1a24e7ebefbb691196f3c07e81b558c5f4d52a4ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"glyph-outline-payload-status.hasSupportedColrv1GraphContract (cognitive 21): glyph-outline-payload-status.hasSupportedColrv1GraphContract has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), loops 1, match/switch 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (visit). 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef283ff9a652bcd2ba1d7df9b465de5e016225123c9581ce68149af23680396"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportManager.onWheel (cognitive 21): ViewportManager.onWheel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, ternaries 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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b5b42731cd833835d1577b0f39b3cafc9c3fff1d8fe3608a37057e59c8630"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.refreshInvalidatedPage (cognitive 21): CanvasView.refreshInvalidatedPage has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c4e3110fe94e8b44ba96a3aafcc570889b5dacc005b0c19e98a30d7c61aad1"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.updateRect (cognitive 21): CursorState.updateRect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, error handling 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2660046b4b797f29a2e808e0b7dc3c5813fa04affb567547f0b7881f487bf637"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.moveCellSelection (cognitive 21): CursorState.moveCellSelection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, error handling 1 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fdcae89d78b22fcc4a5f4a945b7b1327a677135742f6a998e0e8a7888972d8"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertTextCommand.mergeWith (cognitive 21): InsertTextCommand.mergeWith has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b7790be6b0d6f39660642dec923c519bc48ad244bb21701d487270164cd605"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-mouse.finishMouseUp (cognitive 21): input-handler-mouse.finishMouseUp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 4 (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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe75aa934a94f9ef85ef92df64a0387f088bd75da34646e1d30e307c399fe5d"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.startResizeDrag (cognitive 21): input-handler-table.startResizeDrag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1, ternaries 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4520c57b4a2441aa480327d36de4f5fe413c1e0f70760bbf2e6f74be21fdbd"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.restoreEditContextAfterHistory (cognitive 21): InputHandler.restoreEditContextAfterHistory has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9250149203018f2da1b031a2b44ffb700e65d7685f8a80553443c2869a995e30"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.executeFormActionPlan (cognitive 21): InputHandler.executeFormActionPlan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (nesting depth added 6). Of this number, 20 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051e8a69d7d785e8fe7d09929cb28ef69a48bb6c82aa5cf49c9f83085a13546"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuBar.setupKeyboardClose (cognitive 21): MenuBar.setupKeyboardClose has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). None of this is in the body itself: all 21 points belong to one function literal inside it that branches (line 114). 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":"rhwp-studio/src/ui/menu-bar.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bbdadf7573b5aa6e8a17cd95cbc75a564022d267d3851ffa2799aab099f510"}},{"ruleId":"D2","level":"warning","message":{"text":"#runObjectAction (cognitive 21): #runObjectAction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (3 pts), other 2 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 4 belong to 8 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe08512ced69ad24e5101fa406a87792b262afdf27849ebfaa2475f3f31803"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 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":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9820a4fd207b329aed55285b082bbdc6234070d167b643b217fc587647ac2a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pseudo (cognitive 20): Parser::parse_pseudo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 6 (9 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":"src/agent/dsel/parse.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9cb06c645b8be0eef870d0499580c4cc5be22f806312b6e9bd9364e7418171"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterPayload::write (cognitive 20): AdapterPayload::write has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (8 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de2b13e610eb519fe3d165080148cf5f76773215c46fbdb514b081d564b10fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::fit_hwpx_rowbreak_synthetic_cell_lines (cognitive 20): DocumentCore::fit_hwpx_rowbreak_synthetic_cell_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2b3552a223ee49b65bf0b52e18e9d0bf03a05023cfad9d88d5f14284e33edd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::normalize_xml_import_paragraphs (cognitive 20): DocumentCore::normalize_xml_import_paragraphs has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (process_para, compute_mask). 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":"src/document_core/commands/document.rs"},"region":{"startLine":3908}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba7879b009bfd7010d4a7d068ff88792137b74eb012642576908c141595c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paste_foreign_document_native (cognitive 20): DocumentCore::paste_foreign_document_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 4 (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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47de16faa7c3fcd92634cb14cf04f24249d13b59e7e074e4747660d1bca569b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_header_footer_list_native (cognitive 20): DocumentCore::get_header_footer_list_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"6644608666799b27fc573ec21d004cf6c059cd91625e5a1d964e7087cdb5d198"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_table_cell_bboxes_from_page (cognitive 20): DocumentCore::get_table_cell_bboxes_from_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"320f8acb659f4c305fa4d5695b8ccd03d934347a1725fbd82a0a82b30d7dc828"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::split_section_native (cognitive 20): DocumentCore::split_section_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 5 (6 pts), boolean chains 2 (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":"src/document_core/commands/section_ops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"321dc4b6195fd3727d7eb6f0271ea1ca9706f3fb9d39245600d8e6aca3c07ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_cell_resize_updates (cognitive 20): DocumentCore::apply_cell_resize_updates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f0743bc6d23a25d01e89e44850c95638a60d36ed128674f8e00d5ad2d1a902"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::find_text_scan_pages_for_paragraph (cognitive 20): DocumentCore::find_text_scan_pages_for_paragraph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), match/switch 1 (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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2997e65c9f34ddbf4a014ce92df5365528f89f2f366974b93f4c774660b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::delete_bookmark_native (cognitive 20): DocumentCore::delete_bookmark_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 5, boolean chains 2 (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":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3024fbac8572315dcd9406f602ce57a3c29cc50b762ac9e98b0946aed2602040"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::cursor_rect_in_cell_via_page_tree::find_table_cell_bbox (cognitive 20): DocumentCore::cursor_rect_in_cell_via_page_tree::find_table_cell_bbox has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), boolean chains 2 (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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"47adfe0fabd9ef759e2f71a92ba31da17ab607e85bb6a0951d053b8f4ce223cf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::cursor_rect_for_render_paragraph (cognitive 20): DocumentCore::cursor_rect_for_render_paragraph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 2 (nesting depth added 6). Of this number, 12 points are the body\u0027s own statements and 8 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6175}}}],"partialFingerprints":{"codehealthFindingId/v1":"664b07853079b2ab9843e11e00e8fcceaca6d0054d48019b9ea6ffab37dcc81b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_form_action_updates_native (cognitive 20): DocumentCore::apply_form_action_updates_native has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3, 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":"src/document_core/queries/form_action.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca15514cd4f1c0eb9a186d8322c3b9930fa8da124624dca32aa925bec00069a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::build_paragraph_page_index (cognitive 20): DocumentCore::build_paragraph_page_index has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (5 pts) (nesting depth added 14). 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":"src/document_core/queries/grep.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a005191046560c1c190641f0615ff1bfc8f05c643ab684cfcf55e0d7228d7c5"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hidden_text_page_index (cognitive 20): DocumentCore::hidden_text_page_index has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (5 pts) (nesting depth added 14). 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":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"00959afea8852faaa1950e0be86704bbe148c111d2f10391a007a21bbf2af61f"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::build_injection_page_index (cognitive 20): DocumentCore::build_injection_page_index has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), match/switch 1 (5 pts) (nesting depth added 14). 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":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e71a9ac4d08c23eb32a6b90b29e6a9cd3a18a0350783505e4c8d26b2be57cd"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePngExporter::render_page (cognitive 20): NativePngExporter::render_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 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":"src/document_core/queries/png_export.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3eab8873600c3ce812deb540f8f721f1f280a9d1e2bb3fce2c3c8599129c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::update_external_image_display_path (cognitive 20): Document::update_external_image_display_path has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 2 (9 pts), loops 3 (6 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 13). 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":"src/model/document.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2131d9f42ee064601cb992f45f91cd0bd514796c197180acbb4e442cb39e45"}},{"ruleId":"D2","level":"warning","message":{"text":"Cell::saved_reset_closes_initial_table_frame (cognitive 20): Cell::saved_reset_closes_initial_table_frame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, 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":"src/model/table.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"396e39772045323b8e5087f7c4eb6d747845078c7ede741ec13e580076759dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"Trial::width_for_cuts (cognitive 20): Trial::width_for_cuts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, 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":"src/parser/pdf/structured_lowering/wrap_width.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf019257c7c8b9e25a0b8ff70ffc021d1b6ceca096ec566d81b59f899918573"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_paren (cognitive 20): EqLayout::layout_paren has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 7. 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":"src/renderer/equation/layout/paren_geometry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23b32e07e172e8a848abdeb3467ef8df4a9949d06e8d6b43e1d7bd763bde50"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_legacy_paren (cognitive 20): EqLayout::layout_legacy_paren has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 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":"src/renderer/equation/layout/paren_geometry.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0ffc325d410e66d68b5b0d4c90624dc1d3d146de44389ea49796ff331096e6"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_text (cognitive 20): EqLayout::layout_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 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":"src/renderer/equation/layout.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dc18228d36b6ade1b6583f18a2074d95636e28cd13f1d6f2a4e9c1afb08201"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_latex_env_matrix (cognitive 20): EqParser::parse_latex_env_matrix has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"src/renderer/equation/parser_fractions.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ebad33789d92750601d1d472b68051f30918483ea3c4c5c0a0bb3e86285c9"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_sqrt (cognitive 20): EqParser::parse_sqrt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 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":"src/renderer/equation/parser_root.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d778d89b3c7ab46d6a66673a711b18c14b721cf60826e963a960e65ec956bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::read_number (cognitive 20): Tokenizer::read_number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 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":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bc5ff14ebbbcd6910a65784868cd11f018ad9cdedd8ab731b7a847978c3750"}},{"ruleId":"D2","level":"warning","message":{"text":"FontEnvironment::document_requests_with_slots (cognitive 20): FontEnvironment::document_requests_with_slots 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":"src/renderer/font_environment.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a819c90561815e1d983cb371eeabd3b77dacba2c70a4f82ec2336d104a097f91"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_blank_opening_frame_heights (cognitive 20): LayoutEngine::stored_blank_opening_frame_heights has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_page_unit_frames.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe61b14b1e9eba2aa41f6678bd32abad180103059d722d09efd3b7287c16ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::source_opening_cell_cut (cognitive 20): LayoutEngine::source_opening_cell_cut has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"src/renderer/layout/table_layout/stored_shared_cell_frame.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d267f2c1745daedc7a81e520e926301b56fb0318dad9f6eecb6a3df97893f71"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::calc_para_lines_height (cognitive 20): LayoutEngine::calc_para_lines_height has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f801b3d4e897cba9ce533da43d7c582a38d12e5e3a9de20ae74fe0c53739e3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"RasterFingerprint::from_rgba (cognitive 20): RasterFingerprint::from_rgba has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"src/renderer/pdf_raster_fidelity/fingerprint.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4283fc28b0297a8736bdf450378e89373ba06d21351420e3d1e63e9332ebf79"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderNode::write_json (cognitive 20): RenderNode::write_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_tree.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec8059cfc1f37c5d0ea0421bb58ad89985d7d3151778f9563baa2c8563094d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextFontCoverage::select (cognitive 20): TextFontCoverage::select has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 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":"src/renderer/text_font_coverage.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8381195a4085272422ed87a0d15b759b51b05b9086e08985e08be1ff93c7d7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::apply_visible_float_exclusions_absorbing (cognitive 20): TypesetState::apply_visible_float_exclusions_absorbing has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 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":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a33da70e34dde64f6961462a1b9ca90b7e6e3e2fc5492ce0b6a902d08c1bea"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::endnote_column_reclaims_saved_tail (cognitive 20): TypesetEngine::endnote_column_reclaims_saved_tail has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cd61f8f07458dd2846fbdf205dbb264ed747fa2d7740c5855f5d55ced38196"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::stored_partial_fragment_complete_extent (cognitive 20): TypesetEngine::stored_partial_fragment_complete_extent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1596e7f3238fbeee488c0d7094e067d79145a68b464c675fb386338324f261c"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::remap_style_ids (cognitive 20): HwpDocument::remap_style_ids has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 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":"src/wasm_api.rs"},"region":{"startLine":8391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9137722d3203990dc09b3ec4f1dad56db56326cab19fb76c13662288c6235"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::harvest::run_extract_data (cognitive 20): rhwp::bin::rhwp-agent::harvest::run_extract_data has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (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":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"160bcf3d710cb1b9b1cc92218066d13a5d0c8874b54af8c4df93af3f1cc2afe6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::tables::run_table_inspect (cognitive 20): rhwp::bin::rhwp-agent::tables::run_table_inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), loops 2 (3 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":"src/bin/rhwp-agent/tables.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e7290d016751f108155cb8ff93987062ffe26f7d3454bd68d78766bd4c53f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::runtime::finish_edit_write (cognitive 20): rhwp::cli::commands::edit::runtime::finish_edit_write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (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":"src/cli/commands/edit/runtime.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1301c62c5aa3bb602167e00393db229ddf8876d9852547ea0bc22aeb8208f75c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::tabular::export_tables (cognitive 20): rhwp::cli::outputs::tabular::export_tables has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (6 pts), loops 2, boolean chains 1 (nesting depth added 7). 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4701ac5cd696469dc179e6f9088a999acdb7111208e3ede25f3f1bdf2f662c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::trust::governance::cmd_recall_scope (cognitive 20): rhwp::cli::protocol::trust::governance::cmd_recall_scope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (7 pts), loops 2, 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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"921641cbb5c0f9c9b79e468ca00d1a0fbb1bfca97062400c3ef73a18d79b1484"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::info::print_control_inventory (cognitive 20): rhwp::cli::queries::info::print_control_inventory has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (14 pts), loops 3 (6 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":"src/cli/queries/info.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15fd92892b2516d5ab983738fd9e826622791340cac0a0947ac0b4c1123f8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::structure::export_structure (cognitive 20): rhwp::cli::queries::structure::export_structure has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 3 (5 pts), loops 1 (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":"src/cli/queries/structure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4815c868681672b59e6d727381a5ee0f4f396e14bae70ae6a2a09a7ddc7b7486"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_contract_probe::patch_doc_info (cognitive 20): rhwp::diagnostics::hwp5_contract_probe::patch_doc_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 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":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"de78af6d94d43ff3889955d0f9e2497262341634197b2e0e41721aa9068cb4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_roundtrip_batch::run (cognitive 20): rhwp::diagnostics::hwp5_roundtrip_batch::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdf3d3b77843132a94138cc7ef969fdcad2dd9c5e465484d3e1bd0b291a80d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwpx_roundtrip_batch::run (cognitive 20): rhwp::diagnostics::hwpx_roundtrip_batch::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwpx_roundtrip_batch.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"542b39dc0fef11cf1e047ab3bd7f2ebda1f58f290b207c7f44ea744c24798173"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::walk (cognitive 20): rhwp::diagnostics::layout_anomaly::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02c326a5e54877a1c5202855bdde94d05bc4e27bbc57decae437cea9a4d9157"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::render_geom_diff::run_batch (cognitive 20): rhwp::diagnostics::render_geom_diff::run_batch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (3 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":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cab147aa4b64b1062e1afc850cb9be8c7aecaf148441e6f3f68af381d8f8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::adapter::paragraph::interleave_ordinary (cognitive 20): rhwp::doclang::adapter::paragraph::interleave_ordinary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (6 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":"src/doclang/adapter/paragraph.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"10070d1174e982424e51f8df58346199be3738853740af4a2a9356a710f9a2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::border_paint_structure::grid (cognitive 20): rhwp::document_core::commands::border_paint_structure::grid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c560b3100c20a26cd985462daa90efcdf82cebc39c9ffd25971ffcb768ff9b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::inline_control::caret_slot (cognitive 20): rhwp::document_core::inline_control::caret_slot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/inline_control.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2acc1a0e554b176e34a021aeb9535a19aa0d661f61c949b99e32cf4a1bc4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::discard_widthless_rows_for_render (cognitive 20): rhwp::document_core::queries::rendering::discard_widthless_rows_for_render has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bd6460a710d70ec791174a625f0d08dc74ee574cb967709dc294fe49949908"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::search_query::find_in_text (cognitive 20): rhwp::document_core::queries::search_query::find_in_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ecd02a168d83136770f7306d57b6549bcb2286600053ad68787ee8272851d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::structure::select_auto_mode (cognitive 20): rhwp::document_core::queries::structure::select_auto_mode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 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":"src/document_core/queries/structure.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25d438f53993287083df92b1bd4398d8f358366df28ab244947d7bf361eb6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::table_calc::evaluator::collect_values (cognitive 20): rhwp::document_core::table_calc::evaluator::collect_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (5 pts), 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":"src/document_core/table_calc/evaluator.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b328af8078ee08c9dcf99561936b48328f76ee21b1d20a20a31f9029be984562"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::text_clip::collect (cognitive 20): rhwp::model::text_clip::collect has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 6 (8 pts), match/switch 1 (3 pts) (nesting depth added 9). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"src/model/text_clip.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6dffdc2e3fe2979d29f1b1fb3e71c1096c0082e659220a37c3c3dff3931c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::text_clip::decode (cognitive 20): rhwp::model::text_clip::decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 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":"src/model/text_clip.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ca93029c9132d6e4c3da946721d4ca4e65f696d2378e1ffb774394fcee1b05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1600::probes::vpos_reset_analyze::main (cognitive 20): rhwp::mydocs::tech::investigations::issue-1600::probes::vpos_reset_analyze::main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (8 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":"mydocs/tech/investigations/issue-1600/probes/vpos_reset_analyze.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9421628100827b22dae908ccadf2b114976f46c2f38070d2413bd69b546b44c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::scan_table (cognitive 20): rhwp::mydocs::tech::investigations::issue-705::probes::scan_cell_pagehide::scan_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 3 (6 pts), match/switch 1 (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":"mydocs/tech/investigations/issue-705/probes/scan_cell_pagehide.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b4478b7b52601e148b94a3a6e97f5bcd8d6dc30f054787ab0ba0165e15d50"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::control::parse_char_overlap (cognitive 20): rhwp::parser::control::parse_char_overlap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3, 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":"src/parser/control.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5b524dd1563dded0be091c309d1d7b46c42750f99b1f407244644b1921b340"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_dutmal (cognitive 20): rhwp::parser::hwpx::section::parse_dutmal has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 4 (8 pts), loops 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc8f79c488a12e0f426161149e9e7dd60bed2c89e2745a239a2a92dc709cd98"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::lowering::program_family (cognitive 20): rhwp::parser::pdf::lowering::program_family has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"628a459470bdb1ed8285e720a1feef316a0f833c2bcca0f8ba71eddd787a7baa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::tracked_viewtext::merge_paragraphs (cognitive 20): rhwp::parser::tracked_viewtext::merge_paragraphs has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 12). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"src/parser/tracked_viewtext.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdd1cff755080f60ce64147ba9b85ca61db5379b829ab15d365cf6098ca00c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::pdf::issue7998::cell-regions::generate_sources::main (cognitive 20): rhwp::pdf::issue7998::cell-regions::generate_sources::main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 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":"pdf/issue7998/cell-regions/generate_sources.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ee8728ce2f3ea99d3fc34c8bf50e07536f5306cd4811a69e77ecf7a2d7a13d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::rag::chunker::emit_segment (cognitive 20): rhwp::rag::chunker::emit_segment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"src/rag/chunker.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf0c5b9b06300b5e144fe9d03a6cedcf30774ef2fa666776547a1511982a24"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::bitmap_raster::opaque_area_downsample (cognitive 20): rhwp::renderer::bitmap_raster::opaque_area_downsample has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (20 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b6dcec69ec0789288c3fd9f362b8b79a8cdb315711da491983d3310b21a476"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::bitmap_raster::cropped_window::opaque_window_downsample (cognitive 20): rhwp::renderer::bitmap_raster::cropped_window::opaque_window_downsample has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (20 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster/cropped_window.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18d1dd5eb190a7dfd75b47d4a2b6972e301c7f3278700b879f93058300193ff"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported::visit (cognitive 20): rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported::visit has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 18, if/else 1, match/switch 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc260bb5cf1fdebb6980b70e94e551249dac386668c89a6932a121e11f93ed80"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::hancom_glyphs::semantic_fallback_glyph (cognitive 20): rhwp::renderer::equation::hancom_glyphs::semantic_fallback_glyph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6340465670524f0357b3fcffa1a38226f7d4928e72a7e5d2d5764e746f359241"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_next_page_placement (cognitive 20): rhwp::renderer::float_placement::stored_picture_next_page_placement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, 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":"src/renderer/float_placement.rs"},"region":{"startLine":5450}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386e97bd8f8b161cc1aa0dccca4f84c167bb748fc6cfb80d73543243cffc67c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_background_picture_next_page_placement (cognitive 20): rhwp::renderer::float_placement::stored_background_picture_next_page_placement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"src/renderer/float_placement.rs"},"region":{"startLine":5624}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edd62e3baa7fd09c8ffc0df41f6516ec90f1bf5d830ec53add887400ef6ac20"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_square_top_band::table_reserved_height_hu (cognitive 20): rhwp::renderer::float_placement::stored_square_top_band::table_reserved_height_hu has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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":"src/renderer/float_placement/stored_square_top_band.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0884cff1f1c15e809df1f28b0682ac5a0f68dc55b7d6565cabe2af88b21bc1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::detect_image_mime_type (cognitive 20): rhwp::renderer::image_resolver::detect_image_mime_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7 (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":"src/renderer/image_resolver.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f593ba8fbb2fee8f813f95496a169e158470b33ad55aca27ca4c06625bce0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::assign_numbering_markers::visit (cognitive 20): rhwp::renderer::layout::paragraph_layout::assign_numbering_markers::visit has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c084d4759538b963b15d9cdc4c03b85d5f98065ec4c829863f226657aed95c59"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_partial::rowspan_block_range (cognitive 20): rhwp::renderer::layout::table_partial::rowspan_block_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"9859a1a65fdef0ac6c4dea6dd7775632547d68c0f3bc162fad4754345dd775ca"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::utils::drawing_to_shape_style (cognitive 20): rhwp::renderer::layout::utils::drawing_to_shape_style has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 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":"src/renderer/layout/utils.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f32694a25c1f60c8728788e01715498f88e5d3014a9ebb1747f96d426ead103"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pagination::paragraph_endnote_refs_with_storage::walk_with_storage (cognitive 20): rhwp::renderer::pagination::paragraph_endnote_refs_with_storage::walk_with_storage has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 2 (7 pts), match/switch 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":"src/renderer/pagination.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf95ee5cc21fde7a57f49e72578607f28fa5b08a7515fe4ae6db62eca44229"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::webfont_subset::subset (cognitive 20): rhwp::renderer::svg::webfont_subset::subset has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 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":"src/renderer/svg/webfont_subset.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e855305f29c7e65cc840ff3585c40203e631ddfa271b55be6dae73d93ff3f3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::compute_body_wide_top_reserve_for_para (cognitive 20): rhwp::renderer::typeset::compute_body_wide_top_reserve_for_para has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"src/renderer/typeset.rs"},"region":{"startLine":6717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d17ccee1b6c0182fd19d57e04cea613b99eee1063ddaf2cc02a6e68225f064"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::paragraph_flow::try_place_reflowed_table_rows_with_storage (cognitive 20): rhwp::renderer::typeset::controls::paragraph_flow::try_place_reflowed_table_rows_with_storage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 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":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d294fe2755647271dd55bd2829af0b805daf8401d4b1db3071a12e8928a1acab"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::tac_reconcile::complete_stored_prefix_advance (cognitive 20): rhwp::renderer::typeset::controls::tac_reconcile::complete_stored_prefix_advance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed041b7c080b9ba360a00d447d7a78c973838e03d0e0407838dc9ccbc99d699b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_first_footnote_overlap_break_line (cognitive 20): rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_first_footnote_overlap_break_line has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), loops 2 (3 pts), 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":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"14815fb8fc3b07f15fd56d754371aa1af6605b0607d22f43a926f595e5e8be87"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::section::stored_reset::stored_segment_ladder_misses_content (cognitive 20): rhwp::renderer::typeset::section::stored_reset::stored_segment_ladder_misses_content has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb81cec26f78c9cc64d53ff9ad27dd5b93659b4ca01a610e36754e5ea22f40f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::body_text::try_shift_char_shapes_for_residues (cognitive 20): rhwp::serializer::body_text::try_shift_char_shapes_for_residues has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/body_text.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"778f1ce5aba7e77a187b89c9df89b52e2a1b5b50e7b519d692c3320f612a13d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::normalize_paragraph_like_hwpx_export (cognitive 20): rhwp::serializer::hwpx::roundtrip::normalize_paragraph_like_hwpx_export has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff199b918f71a6f4973ea2b21f863b0cd060189228824de89c3c7f729c50bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_shape_with_storage (cognitive 20): rhwp::serializer::hwpx::section::render_shape_with_storage has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 3, loops 1 (2 pts) (nesting depth added 7). 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd3001029559b61dc6b84b2857c4b111d6390082f5b171e477d9eb0ef48f7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.transcript_for (cognitive 20): _gen_pack.transcript_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 3 (4 pts), boolean chains 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":".claude/skills/rhwp-bulk-pipeline/references/_gen_pack.py"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d176f479eacaf19a9ba1cac2fac0f87361450829de2b0eb03a766694f9de0"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.eval_check (cognitive 20): runner.eval_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 6, ternaries 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":"gym/core/runner.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c6afa3b655f8ada00b2425f4e3b6e72b945ad193dbfa1fb21d22679fa90e66"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.score_all (cognitive 20): runner.score_all has cognitive complexity 20 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 4, 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":"gym/core/runner.py"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"7973f0dd223b65f3e57d4d71f4ae702f034d3e3be24a1b6027f1eac8017c7b75"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_hint (cognitive 20): pack_health.scan_hint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, 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":"gym/tools/pack_health.py"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd97aef7956ce78fe356940dbfa06502c69a8b9a4b9d2da08334da1f8bb9062"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_manifest (cognitive 20): pack_health.scan_manifest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, 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, 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":"gym/tools/pack_health.py"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f447ea2def879c801307d16737900088cffded76e595cc647daf75449d5abec"}},{"ruleId":"D2","level":"warning","message":{"text":"release_gate.exception_kind (cognitive 20): release_gate.exception_kind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_gate.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede3764275c7e267c0f88fc63927adc4bd995e2b9eecc8b7d0bedf12f289b967"}},{"ruleId":"D2","level":"warning","message":{"text":"_Plan.geometry (cognitive 20): _Plan.geometry has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 18, if/else 2. 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9605c5db564f76629d3a6383ea5cc0fd32d1c313268c1b0eed5c7b240b71b1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTextureController._closePlatform (cognitive 20): NativeTextureController._closePlatform has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 1 (2 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"115e4c845f46517876e5be7ec2348838010202f4c87a8cde1e52e581dbb0e52b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp.__wbg_load (cognitive 20): rhwp.__wbg_load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/public/rhwp.js"},"region":{"startLine":14877}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe30737444eb20159fcefd3cb963047509cb5885197e80baa8c47e9e33448a9"}},{"ruleId":"D2","level":"warning","message":{"text":"shortcut-map.matchShortcut (cognitive 20): shortcut-map.matchShortcut has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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":"rhwp-studio/src/command/shortcut-map.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e11c0b3ef4c2bd4de3e288925799410d78209db109882acd1d5cbe6aa1eb1db"}},{"ruleId":"D2","level":"warning","message":{"text":"chart-data-target.needsStructure (cognitive 20): chart-data-target.needsStructure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e719158f66b1fcd70148ece7cfc9f2fcc605517a4b29a7512a75ba819ebc74"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.prepareHostFonts (cognitive 20): CanvasKitLayerRenderer.prepareHostFonts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae291a3d731049c7449e5e6733742f47e3ebaa43c21a66a0a4cb0d729f8386bb"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderPage (cognitive 20): CanvasKitLayerRenderer.renderPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 2, loops 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, 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"91130d378885acf0eb1dca78a820eeb55b1b064de9e383c2695432296383902f"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderLeaf (cognitive 20): CanvasKitLayerRenderer.renderLeaf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 2 (4 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e09fb47f0760345f6fcadb55167ab0279152bcc5ff8af76269638a1198789f6"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderGlyphRun (cognitive 20): CanvasKitLayerRenderer.renderGlyphRun has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6553359ffca498142312418f9dfd15212c887f9734cae04d053fece891bd7d"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderGlyphOutline (cognitive 20): CanvasKitLayerRenderer.renderGlyphOutline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"49709082ed09b25d81bffbbb07f843d924db0601880aaa00aa7282de67f9af27"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawImageOp (cognitive 20): CanvasKitLayerRenderer.drawImageOp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 16, ternaries 7 (9 pts), error handling 1 (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. This shape REPEATS in the file: one other method here (CanvasKitLayerRenderer.drawImageOp::drawImage) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67c953127553ff4aa02a1f0cf61799014d7a74117199356c6139fa967e03ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawCachedGlyphs (cognitive 20): CanvasKitLayerRenderer.drawCachedGlyphs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (2 pts), ternaries 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cae9e837cfa24fb8f3755898b31a125cc9ce1d8a00ea46ed0c9ba01a68259b"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer.applyOverlays (cognitive 20): PageRenderer.applyOverlays has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, 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, 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"49eb1cc56a349ad9fda8fc2797899a1017a56e219c045f27bec827022e3524b9"}},{"ruleId":"D2","level":"warning","message":{"text":"render-surface-budget.planRenderSurfaceBudget (cognitive 20): render-surface-budget.planRenderSurfaceBudget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/render-surface-budget.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ea58b2b0dd69e22fe13d61bc9aca6726e8e33534f6e61516654d8073521078"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.trimOffscreenZoomSurfaces (cognitive 20): CanvasView.trimOffscreenZoomSurfaces has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9292222ef9108ed0c8b0a048744157d7fc536f51400cd48df9c5a3c55c68dfef"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasView.setPageViewSettings (cognitive 20): CanvasView.setPageViewSettings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, error handling 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d46aadf7964fa6a59c374918125282af171784fd6035e058da04b61190e9fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruler.drawVertical (cognitive 20): Ruler.drawVertical has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b075bc37d479ef84002a51fd960461b194cda679c70e20d1e74e6496ec367d91"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorState.moveHorizontalInCell (cognitive 20): CursorState.moveHorizontalInCell has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 6 belong to 5 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88b5e349369030e7c0a133e95a15f9026d8a01933dd31c93259176925929c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-text.onCompositionStart (cognitive 20): input-handler-text.onCompositionStart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c124b2bba6bcf5b9530fb7c5ec63365dafaf2dd4921d25af99d3e73f64b9ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.loadFromUrlParam (cognitive 20): main.loadFromUrlParam has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 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":"rhwp-studio/src/main.ts"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedda4e314259aacb7215415c554ad42089080dbc254d024c212ed091925ec44"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaDialog.onConfirm (cognitive 20): FormulaDialog.onConfirm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70f6e25ea51448c842d96c1ce0cf6cbd485dea2f6a7376e38ab7b332491074c"}},{"ruleId":"D2","level":"warning","message":{"text":"_handlePortMessage (cognitive 20): _handlePortMessage has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 4). 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":"npm/editor/transport.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba5dcaad756aaac7e1d5c82e62515c2d5b5ddf5f50558926ee9426a9ece0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::table_to_html_at_depth (cognitive 19): DocumentCore::table_to_html_at_depth has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d9a2261005780d4da6ea28997a84528b4ff3a2dcbc7f4996113d4afbce2a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::reflow_nested_native_empty_cell_paragraphs (cognitive 19): DocumentCore::reflow_nested_native_empty_cell_paragraphs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 4 (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":"src/document_core/commands/document.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7176ee085dd1fb9c2fb0507dd98d202f54ab538764625615c5395edc857704"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_char_format_in_header_footer_native (cognitive 19): DocumentCore::apply_char_format_in_header_footer_native has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"8115096599f492a91a4c59cd9de44f006c6127725cbd0f228640c10449591d60"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resolve_picture_control_ref (cognitive 19): DocumentCore::resolve_picture_control_ref has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 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. This shape REPEATS in the file: one other method here (DocumentCore::resolve_picture_control_mut) 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aab7e152226efd897142be7a9c3c1077c69cb3cbe896795c8a55f5c321b566"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resolve_picture_control_mut (cognitive 19): DocumentCore::resolve_picture_control_mut has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 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. This shape REPEATS in the file: one other method here (DocumentCore::resolve_picture_control_ref) 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c731bfb7fd236e37d51ed0223d625c1f3351e2392735ea20b5c3d0db7d71de06"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::relocate_floating_picture_native (cognitive 19): DocumentCore::relocate_floating_picture_native has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"19224ef4c0b8668cbab307f9e0a073981eea7cbaf4ccadc1f2db1348798787fa"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_shape_caption_props (cognitive 19): DocumentCore::apply_shape_caption_props has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c562b2e02fd1f16af81c3b4f04049523f4301f5df283c2dd094e33be90391cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paragraphs_touching_pages (cognitive 19): DocumentCore::paragraphs_touching_pages has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/page_extract.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3de8fa13f93d07619fde500bbbc3a669157ac5d67ff4503112425f88ba571b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_column_def_native (cognitive 19): DocumentCore::set_column_def_native has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1, 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77e41a17023849f707b3bcb71a069c3e606684557faba92d8e5a8f2c0ecaaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::validate_hyperlink_paragraph (cognitive 19): DocumentCore::validate_hyperlink_paragraph has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hyperlink.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5690f3582ef4a3da3043efaa8c0a04e84f2a811d6b6fa4a25d7e88b15fb784"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_by_path_with_hint::find_any_run (cognitive 19): DocumentCore::get_cursor_rect_by_path_with_hint::find_any_run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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. This shape REPEATS in the file: 2 other methods here (DocumentCore::get_cursor_rect_by_path_with_hint, DocumentCore::get_cursor_rect_by_path_with_hint::find_cursor_by_path) 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f0b9d8a03dfcba1b1386389393aef833e67e43d3dad196e8f81f37a72c0d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::line_snapshot_evidence (cognitive 19): DocumentCore::line_snapshot_evidence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 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":"src/document_core/queries/font_decision.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0c8c4ce3e4dd4f412de3eb9529bb90af1aa4f18fac455d9590b6cf5e94434"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::paragraph_runs (cognitive 19): DocumentCore::paragraph_runs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 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":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d2108332d01823a63c8c43011c263e9d420ed8e75614bfd8e40c7db601fb48"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::extract_page_markdown_with_images_native::collect_markdown_items (cognitive 19): DocumentCore::extract_page_markdown_with_images_native::collect_markdown_items has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DocumentCore::extract_page_markdown_with_images_native::table_cell_text) 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":9027}}}],"partialFingerprints":{"codehealthFindingId/v1":"6771db048d49ed727d13adde86de1b607d6115545d0395ff45ce12b2e1ccfa11"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::search_text_native (cognitive 19): DocumentCore::search_text_native has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7, match/switch 2 (4 pts) (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":"src/document_core/queries/search_query.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab3c4e627d002da0b46c5c5e06e811642a93e0e3ad95c5148a35238ff3911ff"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::tac_host_row_candidates (cognitive 19): DocumentCore::tac_host_row_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/tac_host_rows.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a04b5d02beed88b6c9043f22d4a004e2c8d75f0819d8be5e5c8e555c22dc13"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::sync_tac_host_row (cognitive 19): DocumentCore::sync_tac_host_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, 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":"src/document_core/tac_host_rows.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"453467539dd226522007279ae37b074be560febef69128815700615b9ee125eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::control_source_positions_with_storage (cognitive 19): Paragraph::control_source_positions_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 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":"src/model/paragraph/control_source.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"42baae76e1d443d93ecfbc7281553ac80593d1f25264529ba6ff1e2db9333801"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::declared_width_rows_exceeding_with_storage (cognitive 19): Table::declared_width_rows_exceeding_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8c81a49d2ec2a5065c6eaa9ba0ff3124061473f81d48bb7dd983826aafc39f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditor::ime_context (cognitive 19): NativeEditor::ime_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"src/native_host/commands.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85c907ff1aa9a0e4e2cef0129e4a3b9d9260dc8ca9ff53e0b37fd49251bdfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadState::warn_invalid_references (cognitive 19): ReadState::warn_invalid_references has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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":"src/parser/hml/reader.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17240cd251c46eb4953a55445bdc52edd8cc4bac5a0b133671461b4770bc443"}},{"ruleId":"D2","level":"warning","message":{"text":"Pool::compact_page::paragraphs (cognitive 19): Pool::compact_page::paragraphs has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (7 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/char_pool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a44cc77a26c13e8a36c0e1b73d5065e6676d874389c40ebd1c2535113f0420"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitReplayPlanBuilder::collect_leaf_required_font_families (cognitive 19): CanvasKitReplayPlanBuilder::collect_leaf_required_font_families has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 2 (6 pts), match/switch 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"058eccb76bc3b0f901f59668f12dfaf97c529f33a361a2f1c5cbbcc8d587cb07"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_cases (cognitive 19): EqParser::parse_cases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (7 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":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2814a6ff660b52f2e1bebceba80768ff28861052127b4964e059b7ab1e95a8"}},{"ruleId":"D2","level":"warning","message":{"text":"MeasuredTable::remaining_content_for_row (cognitive 19): MeasuredTable::remaining_content_for_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 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":"src/renderer/height_measurer.rs"},"region":{"startLine":6443}}}],"partialFingerprints":{"codehealthFindingId/v1":"50555dc5187dfd17f892ae91b2e5589c5ca816d76db4d4e6794c19551662f686"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::draw_image (cognitive 19): HtmlRenderer::draw_image has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 7 (nesting depth added 6). 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":"src/renderer/html.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ffe345699496aa8307d2cd7133713747a4db9ad89a6a02678b184784e13b5"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::order_cell_anchored_objects (cognitive 19): LayoutEngine::order_cell_anchored_objects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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":"src/renderer/layout/anchored_cell_paint.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"72adb8b833762632331d978070f340662dc8865367998715867c305900fdd0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::layout_cell_shape_with_parent_path (cognitive 19): LayoutEngine::layout_cell_shape_with_parent_path has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). 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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b386a60bb66f827e1c0a092acfac5fa6194101bdd62c66fe7a24d9e34881fb18"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_complete_terminal_row_frame (cognitive 19): LayoutEngine::stored_complete_terminal_row_frame has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), loops 1 (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":"src/renderer/layout/table_layout/stored_terminal_row_frame.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"24984d14fc04c1b6622326fe0870bb000f5d9d5f31d3a397d4205e5a9c4fb0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_zero_origin_text_frame_break_witness (cognitive 19): LayoutEngine::stored_zero_origin_text_frame_break_witness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 8. 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":"src/renderer/layout/table_layout/stored_zero_origin.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13399c17242d963deb0c12be68abc574167107dba824f06595b16440bc7835f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_object_frame_row_count (cognitive 19): LayoutEngine::stored_object_frame_row_count has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c2c215c1e88d9b2d290cfeb300efbb2702fcae0b6dabe2bb0ac0ac95b19db4"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::paragraph_tail_cut_for_row (cognitive 19): LayoutEngine::paragraph_tail_cut_for_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21037}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0782dce0a94c1b055c1bae678fe133cbd396c2b87868c7817780e8344ff9b88"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_plain_cut_closing_advance (cognitive 19): LayoutEngine::stored_plain_cut_closing_advance has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25355}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf538f6b902dd7bae7e6e3be5eb04d18ca55ce101273fdbf34cd63c521480a6"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintRasterFrame::rasterize (cognitive 19): PrintRasterFrame::rasterize has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4, boolean chains 3 (nesting depth added 6). 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":"src/renderer/print_raster.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab21fc373a9a5b26746b38f8c30bea43107f3bc2b4e4ead6de5e214cb62ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaLayerRenderer::render_tiled_region_with_provider_cancellable (cognitive 19): SkiaLayerRenderer::render_tiled_region_with_provider_cancellable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"src/renderer/skia/tiled_region.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0fbf4f15450022dc995cfb7c513a5a0efa386c474d8456ff32bfb4f1a061da"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::draw_char_overlap_combined (cognitive 19): SvgRenderer::draw_char_overlap_combined has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, 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":"src/renderer/svg.rs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc85de09d94199c5c167fe8cdb0a23f58d9db24a4e439b2e2dc3d47b34ce743"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::draw_line_shape (cognitive 19): SvgRenderer::draw_line_shape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c0dcdea9a0881307cabf07a8b196c9161505e36a52e028e8e4793c772063c2"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::draw_image (cognitive 19): SvgRenderer::draw_image has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 7 (nesting depth added 6). 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":"src/renderer/svg.rs"},"region":{"startLine":4233}}}],"partialFingerprints":{"codehealthFindingId/v1":"469e3e0277cad8313501d580a4444d143fbeacfcac4d09b0bc5488fab78fd029"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::predict_endnote_render_y (cognitive 19): TypesetEngine::predict_endnote_render_y has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2, 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":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41b76dbea49060332373ea166c18e7346f62b4fe078494a509e156dacb7a58"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::place_computed_split_host (cognitive 19): TypesetEngine::place_computed_split_host has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 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":"src/renderer/typeset/table/block/split_host.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f63acef8bad2aef0223b293a5bf8eb83ddadde3f7644804eaeab79e19fdc0"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::prepare_native_otf_fonts_wasm (cognitive 19): HwpDocument::prepare_native_otf_fonts_wasm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 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":"src/wasm_api.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"82610d4229f99a61698676e746400715c7a189dc7a816b957f03a0ad4a23ef92"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryRasterOperator::run (cognitive 19): TernaryRasterOperator::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 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":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fc7475e5b270fb8303f35788d65b394f5ad99011c272d6df395103e10a76d2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::layer_tree::run (cognitive 19): rhwp::bin::rhwp-q::kit::layer_tree::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (8 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":"src/bin/rhwp-q/kit/layer_tree.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fef00687d2cd57fdb8741c1a93c746194bcbe7711896b7335e639f28035a192"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::caption_validation::resolve_picture (cognitive 19): rhwp::cli::commands::caption_validation::resolve_picture has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 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":"src/cli/commands/caption_validation.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cffd976d6ea25bfb9da887965b365e3a5b57276766e3c9a8b1806b174e97763"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::tabular_import::validate_csv_table_records (cognitive 19): rhwp::cli::commands::tabular_import::validate_csv_table_records has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff014cd1aca8f2a3db10a7c80194182728f8680b14cd248f278d71109ad52c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::metadata::capabilities::show_capabilities (cognitive 19): rhwp::cli::metadata::capabilities::show_capabilities has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). 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":"src/cli/metadata/capabilities/mod.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eafffbd820b731b2f3e917a03b3fe5f71d62cc2e58c402b37d0b895b6c331e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::outputs::text::parse_export_markdown_args (cognitive 19): rhwp::cli::outputs::text::parse_export_markdown_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (6 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":"src/cli/outputs/text.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f641e3fa45235b01a8ca285e96cbf252ee2e72c1342073eb8363013fabe26f18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::harness::cmd_harness_init (cognitive 19): rhwp::cli::protocol::harness::cmd_harness_init has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/harness.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc41de509052bb9a60221635873dbed80346ea72f79fe2f0e030016d248817d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::trust::anchor::cmd_anchor_verify (cognitive 19): rhwp::cli::protocol::trust::anchor::cmd_anchor_verify has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6, boolean chains 3, loops 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":"src/cli/protocol/trust/anchor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5eef945f063095da58886e49358eadea52001a6ee171869ea6a6527a42fde"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_injection (cognitive 19): rhwp::cli::queries::security_inspection::inspect_injection has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (6 pts), loops 2 (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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f9f6cb5463364644610187d9c0a1b6f48134447042c633ae86ae2f83c9333"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_cell_header_probe::patch_section (cognitive 19): rhwp::diagnostics::hwp5_cell_header_probe::patch_section has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08a03fbab093d4b7c94c2870102412c4fc299e823aeae92e252dbfe6b13003"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::ir_field_sweep::strip_shape (cognitive 19): rhwp::diagnostics::ir_field_sweep::strip_shape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf00f8b7a81d302ad113f70428ff5ecea54359ea7399de9eb35c68aa2263475"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::validate_labels (cognitive 19): rhwp::document_core::commands::object_ops::chart::validate_labels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fff9b96be1bb46f5030072eae21ca12a191983006d9847bbe9e8f65a86bbb4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::materialize_hwp5_bin_data_order (cognitive 19): rhwp::document_core::converters::hwpx_to_hwp::materialize_hwp5_bin_data_order has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 7 (8 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30ccc5afe68ab0ca2106ac5fcd770c6da583200dfad68e6af2534bc80652be9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::fill (cognitive 19): rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::fill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp::walk_shape) 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae92c34b7c4cae88c87b7c9d4dc8c4a1ca48def8ca76a41c9ac8654e75c7e1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::css_color_to_hwp_bgr (cognitive 19): rhwp::document_core::helpers::css_color_to_hwp_bgr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"src/document_core/helpers.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"94864f355d19aaf12cbc13535b54f2d29934c118791409b41348ccf68eec0cde"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::cursor_rect::find_table_cell_bounds_in_node (cognitive 19): rhwp::document_core::queries::cursor_rect::find_table_cell_bounds_in_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9393a0ef6553ce94aa5bcf4fa93468994a5e3251613166b9900df468912e40e4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::field_info_at_in_para (cognitive 19): rhwp::document_core::queries::field_query::field_info_at_in_para has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"82648d8a51e0e301203cb7b79b253f2bf5bad0a543fef2b291658762652716ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::renumber_memos::update_ends (cognitive 19): rhwp::document_core::queries::memo_query::renumber_memos::update_ends has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (7 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21fe98a0583ae2d035eaf392a29515722ab0c7cf37f9a132ac1b251b8d08a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::delete_text_at_keeping_memos (cognitive 19): rhwp::document_core::queries::memo_query::delete_text_at_keeping_memos has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d40d7439d598f81b0750d09653c18610183239ab3f0ff5c4b2037c0bf74434"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::drop_memo_fields::walk (cognitive 19): rhwp::document_core::queries::memo_query::drop_memo_fields::walk has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2777178e3730d53006c9bd48facc1311d3a7bbb95832ceebf6a31634dbeb0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::memo_query::remove_memo_field_in_para (cognitive 19): rhwp::document_core::queries::memo_query::remove_memo_field_in_para has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 7, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b96d367f1fb7d02683706853c2cd0151495177e7696dfd91ae7f78928623a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::stego_scan::decode_bits (cognitive 19): rhwp::document_core::queries::stego_scan::decode_bits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418312384449ed36c6f657efb08b599556ad7d0e719bb4fd838a6e15b11c69b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::text_security::scan_identifier (cognitive 19): rhwp::document_core::text_security::scan_identifier has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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":"src/document_core/text_security.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b0f2e6dfc0797fd78e852bb75f9dbf61254e95ba52276a7f0b2567d9bae07e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::emf::parser::parse (cognitive 19): rhwp::emf::parser::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 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":"src/emf/parser/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17f23110ff38c189dd5a3b484159ecdb020d5ad346f00c305075587f72b5ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::eps::parse_gradients (cognitive 19): rhwp::eps::parse_gradients has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 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":"src/eps.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"227588ab383963a0f7a1192d42f631b27d15e24c7c8086f2fddb557442845801"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::section_tail::collect (cognitive 19): rhwp::model::section_tail::collect has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (collect, collect_shape_memos). 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":"src/model/section_tail.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24608d285a261e7989787475271105c0d08a3772ac66a034f8e6f9f0d9fcd26"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1064::probes::dump_table_ctrl_data::main (cognitive 19): rhwp::mydocs::tech::investigations::issue-1064::probes::dump_table_ctrl_data::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 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":"mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7105665cb9f157af9e1a87cc2b19cf6b5865034a88fdad235e61b70aee641bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1067::probes::dump_shape_para::main (cognitive 19): rhwp::mydocs::tech::investigations::issue-1067::probes::dump_shape_para::main has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 1 (5 pts), if/else 1 (4 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":"mydocs/tech/investigations/issue-1067/probes/dump_shape_para.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbf9270840da4c181848f57d50addc24377c0f708011db818fdcfaa04b8f3c2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::native_host::view::layout (cognitive 19): rhwp::native_host::view::layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 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":"src/native_host/view.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2838c337fc12c8bd5e76685a5f0a369fcd34b1e86a46ac958a15035299ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::color_glyph::decode_colrv0_color_layers_payload (cognitive 19): rhwp::paint::color_glyph::decode_colrv0_color_layers_payload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, 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":"src/paint/color_glyph.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9341013c72ba2db534aa7ff5a6195b0f2449b1c773907567f0fc46097043a9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::paint_bounds::glyph_outline_bounds (cognitive 19): rhwp::paint::paint_bounds::glyph_outline_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts), boolean chains 1, 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":"src/paint/paint_bounds.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e95bef7cd04ccba21a9d2d030f25b53cbd7c4a66ce57efb55dd77c5a7b492b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::parse_hwp_with_cfb (cognitive 19): rhwp::parser::parse_hwp_with_cfb has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cbbe846f9d2010f6d8dd40a491655b64776c304c6062aebda97cb3a0d5487c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::convert_para_shape_with_layout_contract (cognitive 19): rhwp::parser::hwp3::convert_para_shape_with_layout_contract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (5 pts), boolean chains 4, 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40ca968e23724537176a46697d79153a38117e4c295a95a1c12b4b6b30e117"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::strip_hwp3_note_number_suffix_literal (cognitive 19): rhwp::parser::hwp3::strip_hwp3_note_number_suffix_literal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4, boolean chains 2 (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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3332435b21a2cb69566139da5c91cd97e9143d51f10cc3c836786cfb34039f34"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_ctrl_footnote (cognitive 19): rhwp::parser::hwpx::section::parse_ctrl_footnote has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2, 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. This shape REPEATS in the file: one other method here (rhwp::parser::hwpx::section::parse_ctrl_endnote) 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":"src/parser/hwpx/section.rs"},"region":{"startLine":5802}}}],"partialFingerprints":{"codehealthFindingId/v1":"89edd71ae6f0f04699750478a1ee9e8d977879444435ccd9d8622755df66153b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_ctrl_endnote (cognitive 19): rhwp::parser::hwpx::section::parse_ctrl_endnote has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2, 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. This shape REPEATS in the file: one other method here (rhwp::parser::hwpx::section::parse_ctrl_footnote) 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":"src/parser/hwpx/section.rs"},"region":{"startLine":5874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48943e84664b7d1c89b017bafb8e74e39fa121225682ecc0303b549fc3c1ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hp_chart_element (cognitive 19): rhwp::parser::hwpx::section::parse_hp_chart_element has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 7, loops 1 (nesting depth added 7). 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7495}}}],"partialFingerprints":{"codehealthFindingId/v1":"61588f1599c06efdb6d4b64ca3e8adea3d1f72dc5af521d13bc6afa2f383b74c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::canvaskit_policy::image_transition_detail (cognitive 19): rhwp::renderer::canvaskit_policy::image_transition_detail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1f2fa9f98bbc02d474375528eb3ab83399e018965f89053182f0c72fda308a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::auto_number_projection::project_placeholder (cognitive 19): rhwp::renderer::composer::auto_number_projection::project_placeholder has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/auto_number_projection.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"814d2209f8794a65c85b87b09685545b896fffc9b3c942b17f56bb47621efbae"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::reflow_helpers::inc::no_ls_short_label_cell (cognitive 19): rhwp::renderer::composer::reflow_helpers::inc::no_ls_short_label_cell has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d122b27983586dbd6a8de8964e50cfd7473ca1fdc91d28b616ea8dc45b360d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::reflow_helpers::inc::stored_rows_underfill_inside_token_with_storage (cognitive 19): rhwp::renderer::composer::reflow_helpers::inc::stored_rows_underfill_inside_token_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282ef72c6765c974cdd3b32025dc8a4f3038e691042564c1f094b6574016ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_cell_reflow::inc::recompose_cell_lines_in_frame_with_storage (cognitive 19): rhwp::renderer::composer::stored_cell_reflow::inc::recompose_cell_lines_in_frame_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9 (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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b03049d6312aaa9e3ac94ee6394375769c41ddde40b2f07c2c5f71d71c401ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_lines_runs::inc::composed_tac_line_assignment_with_storage (cognitive 19): rhwp::renderer::composer::stored_lines_runs::inc::composed_tac_line_assignment_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62337afde71cba111da5d081d6fc19b7d8ea3364f911106753dd9b57ae591ec"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_word_tail::project_current_source_program_rows_with_storage (cognitive 19): rhwp::renderer::composer::stored_word_tail::project_current_source_program_rows_with_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 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":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e9ba390111334e5d8672bcdd326aaee5b25aafda5174f4f010565da47d784b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::round_stretch::source_commands (cognitive 19): rhwp::renderer::equation::round_stretch::source_commands has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, match/switch 1 (2 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":"src/renderer/equation/round_stretch.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4128f69441796df812c458080f6dec1bad6399f3b85bc1c5d89aeea569859b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::cell_no_overlap_square_stack (cognitive 19): rhwp::renderer::float_placement::cell_no_overlap_square_stack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 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":"src/renderer/float_placement.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949770addd19e4a6095ca940f857e68006d41549f0673990899b12591af7dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_frame_with_guides (cognitive 19): rhwp::renderer::float_placement::stored_table_frame_with_guides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, 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":"src/renderer/float_placement.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a053496a956c0dafb206b4ac0adf094e1dfa3ef0c8082ad21d2eef7ea8f23a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::empty_host_float_successor_absorbed_spacing_px (cognitive 19): rhwp::renderer::float_placement::empty_host_float_successor_absorbed_spacing_px has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 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":"src/renderer/float_placement.rs"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d456a5e48c36ae9201dfe4d9a76586de60abb9b06349c14a0cbb43ea2497c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::stored_square_picture_wrap_anchor_for_control (cognitive 19): rhwp::renderer::height_measurer::stored_square_picture_wrap_anchor_for_control has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, 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":"src/renderer/height_measurer.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5422dc61b4502fe38f97b40043310b711879bfa9e1307bcaf558a0b4174ab0a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::compute_tac_leading_width (cognitive 19): rhwp::renderer::layout::compute_tac_leading_width has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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":"src/renderer/layout.rs"},"region":{"startLine":17662}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7079904f34ece514d5fdbcaf530cbb0b401eba87c0e4b82a92033ee3ef1298"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::emitted_run_layout_positions (cognitive 19): rhwp::renderer::layout::paragraph_layout::emitted_run_layout_positions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, loops 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95cf33aa49e473b556129e3965626b4d7341584c8568c74fc678ede66fd652a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::tables_with_ladder_reserved_nested_overflow (cognitive 19): rhwp::renderer::layout::table_layout::tables_with_ladder_reserved_nested_overflow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d140354c413b16afc8634a6b5df382f1ebfa29418f906ff741bc34c5b3d15e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::stored_text_frame_owner::opening_text_frame_end_hu (cognitive 19): rhwp::renderer::layout::table_layout::stored_text_frame_owner::opening_text_frame_end_hu 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":"src/renderer/layout/table_layout/stored_text_frame_owner.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01fc193d467c0631c884d7adc0f55a744de5fc8c0ceb52d217cb9e78679fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::layer_trees_to_pdf_with_annotations (cognitive 19): rhwp::renderer::pdf::layer_trees_to_pdf_with_annotations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d04b994a73a1071e34e52af3d8142bf06a094cd7666fbe8e87ace41c9ec164"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::stored_line_ladder::stored_line_ladder_is_uniform_filler (cognitive 19): rhwp::renderer::stored_line_ladder::stored_line_ladder_is_uniform_filler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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":"src/renderer/stored_line_ladder.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe560cdc32c49fbac1c98bce753b9c55d54032393e6c12b50c91461f9471b282"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::wrap_match::classify (cognitive 19): rhwp::renderer::typeset::controls::wrap_match::classify has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts), match/switch 1 (2 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":"src/renderer/typeset/controls/wrap_match.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a25e88ac90675fd80062ff096a8e9a15231bf3e76f24fc7429cac4986f75f5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::split::refine_split_boundary (cognitive 19): rhwp::renderer::typeset::paragraph::split::refine_split_boundary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, match/switch 1 (2 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":"src/renderer/typeset/paragraph/split.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aba2a45e612f71f03ff92c283e9f4273894754b87d76cc2965047e987b5f62"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::wasm_api::collect_external_image_references (cognitive 19): rhwp::wasm_api::collect_external_image_references has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 2 (9 pts), loops 3 (6 pts), if/else 1 (4 pts) (nesting depth added 13). 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":"src/wasm_api.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"05836ba85d443c7baa405893763b79838169764ff1b0a16b70b8184da531f1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"discriminate.aggregate_rows (cognitive 19): discriminate.aggregate_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/discriminate.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e232dd3eb81494cc4dc96e46ae9ff3a9e159c0aac5459a05c2d0adf2de37fcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_discrimination (cognitive 19): evidence_report._validate_discrimination has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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":"gym/tools/evidence_report.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeee22f6894f94164178d2818ba227aa94d663ffd3d290efb13d827cbea2e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.main (cognitive 19): fuzz_corpus.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, error handling 2, 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"2765a6521a56efc16a5c1842d003fe6a85a473bc1a87cdc1686e48b52a6a66d7"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard.validate_fingerprint (cognitive 19): leaderboard.validate_fingerprint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, 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":"gym/tools/leaderboard.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"3130127e23b32e16b931ee745c74ead67035c18443525cb4b906c5816c5b6896"}},{"ruleId":"D2","level":"warning","message":{"text":"oracle_probe.render_human (cognitive 19): oracle_probe.render_human has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 5, ternaries 2 (4 pts), if/else 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":"gym/tools/oracle_probe.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af67670f711fa8f8e78899ccfea433373aa350a960e00f993fe93419fe0fef2"}},{"ruleId":"D2","level":"warning","message":{"text":"pack_health.scan_pack (cognitive 19): pack_health.scan_pack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, boolean chains 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":"gym/tools/pack_health.py"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e05172d498cc8580f437b58109dbfcd7f527399f2c6697bb72bb399a47dcf5"}},{"ruleId":"D2","level":"warning","message":{"text":"release_diff.observation_from_result (cognitive 19): release_diff.observation_from_result has cognitive complexity 19 (threshold 15). Drivers by points: error handling 6 (9 pts), ternaries 3 (5 pts), if/else 3, 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":"gym/tools/release_diff.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee7d3be2fe118c10eb606ad0d7204db0f850f3eaa77354919b038fc152f2d74"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeEditorViewState.build (cognitive 19): _NativeEditorViewState.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 4 (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":"bindings/Flutter/lib/src/native_editor_view.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"72be78aae1d70e69310184f522f69c72a93f27d4b37f2a92c26e87ea429ac096"}},{"ruleId":"D2","level":"warning","message":{"text":"background.openViewer (cognitive 19): background.openViewer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, ternaries 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":"rhwp-safari/src/background.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"882add64e14c313bd7a2c271569b5362996483840b77c922d93c5c1cd9e56c43"}},{"ruleId":"D2","level":"warning","message":{"text":"file-signature.hasHwpmlRoot (cognitive 19): file-signature.hasHwpmlRoot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/security/file-signature.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c42284d3badc424434b54cda71d74bd32a074159ecdf9e82e2738a4bf2a455"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareFormatText (cognitive 19): write-tools.prepareFormatText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3, boolean chains 1, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1120). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b96963b24335f32be35a11adc9ff3fe25a2c61a2fb276cfde9cea51f4687c46"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareFormatCell (cognitive 19): write-tools.prepareFormatCell has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 2 (nesting depth added 2). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1564, 1584). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d6a9bf9c74f62be2c664335bc356e8bf67321402105967008ce728352b303"}},{"ruleId":"D2","level":"warning","message":{"text":"http.readSse (cognitive 19): http.readSse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 function items 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/provider/http.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edf24617bfc8886311c61e1de2dba4ff5afbe812c01b4462cf40f9d4de68bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiProvider.streamTurn (cognitive 19): GeminiProvider.streamTurn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 321). 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b30ab1d8d01b93651b0112b3932443571d4872b556fdfc9ac7fb553a2ec2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"gemini.toGeminiSchema (cognitive 19): gemini.toGeminiSchema has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"398b71dd46c5921936742c945d25f193cbdd5a3351f69bc9bf31e39afab5db82"}},{"ruleId":"D2","level":"warning","message":{"text":"file.runPrintPreview (cognitive 19): file.runPrintPreview has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de46565ea7b153e1f1eb50e2fc5293e520d59999715f16e21715dcd3cb00c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildUniqueSigPairsInSlices (cognitive 19): diff-engine.buildUniqueSigPairsInSlices has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4, 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c134123ead024dc379420a037579bddf5509c250d6561b7f647d540389d4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.matchSegment (cognitive 19): diff-engine.matchSegment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1 (2 pts), ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1914). 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5947c87bbb82bab5bb2974a6f0498c9bd80f4114281ceca6b2c380e3c92e74df"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.preparePageResources (cognitive 19): CanvasKitLayerRenderer.preparePageResources has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (4 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"19666e9f1a9411ee89fdd0e8ecfcd8e2848042e819cd226d16154f9f456ec21f"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.recordImageFailure (cognitive 19): CanvasKitLayerRenderer.recordImageFailure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01f9ce1599ac3ee55d77c8ccb9f8d53bcd2974404722539d771f51f97b3482"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.updateSelection (cognitive 19): InputHandler.updateSelection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 3 (5 pts), boolean chains 3, ternaries 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d24704a5e5a2f4ae38feb2a35c386e8fb3147b37aa645e6f4cdb0ef433383e"}},{"ruleId":"D2","level":"warning","message":{"text":"numbering-dialog.formatNumber (cognitive 19): numbering-dialog.formatNumber has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 6, 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":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f12e7090c343a703580d2dc94ff9a3e3961f1b5c1c048df64b4d46b0768d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), loops 3 (5 pts), error handling 1, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 14 function items inside it that branch (label, label::find, check, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr8187/browser-api.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aed0b70a804c7dd83c63fbbdd0d68e5b1c479596173ea68b00b464c1ba1eb06"}},{"ruleId":"D2","level":"warning","message":{"text":"caretToCursor (cognitive 19): caretToCursor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"npm/hwpctrl-ocx/src/cursor-map.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f19d89ef9759a4a25051eb80d69b98b6e42b20c27b7324a3fe4f420da31859"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildState::picture (cognitive 18): BuildState::picture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, 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":"src/document_core/builders/exam_paper_images.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"902db29b24afb3068bc98f61fc5e5f75a2911d0b03527736369a236bdc730285"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::border_paint_restores (cognitive 18): DocumentCore::border_paint_restores 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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21113af81b3ff24d11825d3272b0bd67f79d9defa7223da6e811874e4d220b9"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_page_number_position_native (cognitive 18): DocumentCore::set_page_number_position_native has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (8 pts), if/else 6 (7 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e529075791c8c7b91695b208c690a8994567e4077c5178e967d972edffe966a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::sync_direct_owner_cell_for_picture (cognitive 18): DocumentCore::sync_direct_owner_cell_for_picture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4e1427ad9734d4374c61ee5f6ef0cb86d863b0e06a651d1730346b9d6940bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::compute_cell_page_offset::find_cell (cognitive 18): DocumentCore::compute_cell_page_offset::find_cell has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9283dcb92dbef29ea65a6b16fca85e338e434a1606605172929b060a4a513e1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::split_table_native (cognitive 18): DocumentCore::split_table_native has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4, boolean chains 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e280141fe0709af61d4a1a78c250108bb15f07fed4a942ca3b772171be1f937"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::split_paragraph_in_cell_by_path (cognitive 18): DocumentCore::split_paragraph_in_cell_by_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f829ab91e7ae54bda032a503de05eb36fb3ee09905893a615090613c7efe022"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::update_hyperlink_command (cognitive 18): DocumentCore::update_hyperlink_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 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":"src/document_core/hyperlink.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"03718201d3d8c4f6623f608feb87367c003cdc62893604934ff9797093805d23"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::navigate_to_para_start (cognitive 18): DocumentCore::navigate_to_para_start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts) (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. This shape REPEATS in the file: one other method here (DocumentCore::navigate_to_para_end) 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d50044bd255e28ef2e410c68533639ab4bfbb06c4c4f31d2ba378ad7f6ae4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::navigate_to_para_end (cognitive 18): DocumentCore::navigate_to_para_end has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts) (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. This shape REPEATS in the file: one other method here (DocumentCore::navigate_to_para_start) 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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd4b501f324727f60920c6d988b82d5d5dacbf0c003bd9aac4f767fb7c58d73"}},{"ruleId":"D2","level":"warning","message":{"text":"Record::write (cognitive 18): Record::write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, loops 3, 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":"src/model/border_paint.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c5bde48d83f0e17a4b39d5c7aca9b7729fae60783490d015a5466dd72d0dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::rebuild_char_offsets (cognitive 18): Paragraph::rebuild_char_offsets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 7, boolean chains 1, 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":"src/model/paragraph.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc004a36eecebd80c886a9f982e9875f4f439ab44327dabef813c3e6a4f0a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::closed_inline_grid_width_hu_with_storage (cognitive 18): Table::closed_inline_grid_width_hu_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 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":"src/model/table_inline_grid.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9e541e90db34443e88e8134a1db084f9d0bcbb068ad3a6496c43169fbf776b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditor::commit_ime_edit (cognitive 18): NativeEditor::commit_ime_edit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 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, 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":"src/native_host/ime_edit.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1a2e2cb939d341f42c9f17596f1aa935b165b13c8a62b2ec914373afe1c7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerBuilder::build_with_embedded_fonts (cognitive 18): LayerBuilder::build_with_embedded_fonts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/builder.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9776cc0477f438e18647601dbcb5c824582a697d16bb3527c1b8a886fb166b01"}},{"ruleId":"D2","level":"warning","message":{"text":"FontGlyphLowerer::try_svg (cognitive 18): FontGlyphLowerer::try_svg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 1 (2 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":"src/paint/font_glyph.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc3d2bbced21a1f4542c8ad18da96d005503d53c52ee46a5acf3c10aa871c5"}},{"ruleId":"D2","level":"warning","message":{"text":"MetafileFonts::coverage_fingerprint (cognitive 18): MetafileFonts::coverage_fingerprint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_fonts.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb1beb03fd3fe173d1ee2a90d52488265943b2605ffbb271431efba15040af0"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePaintContext::image_frame (cognitive 18): PagePaintContext::image_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 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":"src/paint/paper_viewport.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21de2fc5f128ec4feb41c3308396e8b30de161ce74dd6333eaf24c74ad5048f"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout_big_op (cognitive 18): EqLayout::layout_big_op has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/big_op_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b6beaf9d4d8d9c9176b11cb5f8153d69c7842b8c9c6bae0b87bca19d8c1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::parse_fraction_in_range (cognitive 18): EqParser::parse_fraction_in_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad071d71a420d9ce5292811c0f4033fa4e3e741ff6784606d1eb99b6762cd34"}},{"ruleId":"D2","level":"warning","message":{"text":"HftOutlineFonts::register (cognitive 18): HftOutlineFonts::register has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, 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":"src/renderer/hft_outline.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7108cac6c94bf269edb0e80bd953096efc1f558e3efcb3ea6096b7b1e8f09182"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceWindow::for_image (cognitive 18): SourceWindow::for_image 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":"src/renderer/image_resolver/print_window.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad6b478894ffdabff4056088a6c4b2cf27eb45a9d511722aba8192397ebd5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::footnote_paragraphs_content_height (cognitive 18): LayoutEngine::footnote_paragraphs_content_height has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a0a7c8036df7b91030455fc9e04b03c255c3842a01fc4f756819de7326a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::closed_nested_frame_owns_following_empty_line (cognitive 18): LayoutEngine::closed_nested_frame_owns_following_empty_line has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7, match/switch 1 (2 pts), loops 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/nested_empty_line_flow.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daea3b9c6ea2732d59e9b169dc8d4590c43378c71dd284f75accf2fc3db2d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_block_cell_frames_fit_in_height (cognitive 18): LayoutEngine::stored_block_cell_frames_fit_in_height has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7631aaffcff027779857db2ec25a1f5dea140c4cc31133183748cffc8b21e4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_wrapper_opening_frame (cognitive 18): LayoutEngine::stored_wrapper_opening_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. 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":"src/renderer/layout/table_layout/stored_wrapper_opening_frame.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba13f7f1c0f2c5b62a2d16bc84eb8269ebdd0af2f3177e8e029d67405560065"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_closed_paragraph_restart (cognitive 18): LayoutEngine::stored_closed_paragraph_restart has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19565}}}],"partialFingerprints":{"codehealthFindingId/v1":"100f9ff0a67764848a820d2e0127bf8eba25b53f57d86758f39c8272a1de01ec"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::saved_single_cell_opening_frame_height (cognitive 18): LayoutEngine::saved_single_cell_opening_frame_height has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21741}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fd732c1c9da83a261674f91053294ca2dd08dded26b26a0b63e72569d2783f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::rewind_rowbreak_orphan_before_hard_break (cognitive 18): LayoutEngine::rewind_rowbreak_orphan_before_hard_break has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24595}}}],"partialFingerprints":{"codehealthFindingId/v1":"886818499767e356fb1cc88cb4e63218ce887e5f1aca3b130b36ce3eb6432027"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::rewind_rowbreak_orphan_heading_before_recursive_block (cognitive 18): LayoutEngine::rewind_rowbreak_orphan_heading_before_recursive_block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24673}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd96638167f58be8428a49b23caef55d37780c9ed9037d6f5083cb940dd1175"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::build_render_tree::expand_clip (cognitive 18): LayoutEngine::build_render_tree::expand_clip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (5 pts), boolean chains 3 (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":"src/renderer/layout.rs"},"region":{"startLine":5013}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a07e50295f1b568ba708a22eb11377174b5babd4b58a05c217861cfe6f718"}},{"ruleId":"D2","level":"warning","message":{"text":"HorizontalShapingPageSidecars::attach (cognitive 18): HorizontalShapingPageSidecars::attach 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":"src/renderer/shaping_publication.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"091c8667cbe6121bbd829871c91305758e5884e2dfda40ba3e01714eb16bd84b"}},{"ruleId":"D2","level":"warning","message":{"text":"SkiaLayerRenderer::render_pixels_in_window (cognitive 18): SkiaLayerRenderer::render_pixels_in_window has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (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":"src/renderer/skia/renderer.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"843fdcfdd4de8cfbefb9d27eb1636f71bdc3fe002aa288edc9f21e298e32a749"}},{"ruleId":"D2","level":"warning","message":{"text":"SupplementalMetricStore::replace (cognitive 18): SupplementalMetricStore::replace has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/supplemental_metrics.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ebe43855716ef55f5e21dfd33f525d45370654220f77c2606d37636a7b5278"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::place_debug_label (cognitive 18): SvgRenderer::place_debug_label 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). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c281976888c1dab004c52bc18db71ded88146bd58c7a64257afd04028416c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::attach_pending_behind_absorptions (cognitive 18): TypesetState::attach_pending_behind_absorptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 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":"src/renderer/typeset/state/commands.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4f3e11d4faed0375fa59806a5ed2f7779e721e5495bdbfeafca6d78644631b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::judge_large_between_last_column_visual_split (cognitive 18): TypesetEngine::judge_large_between_last_column_visual_split has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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":"src/renderer/typeset/notes/endnotes/fit.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"59853cb099c6e914791a0b101ef360826302de836c601454405b5dafeeb4ff4b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::typeset_section_endnotes (cognitive 18): TypesetEngine::typeset_section_endnotes 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":"src/renderer/typeset/notes/endnotes.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d9d0057e21f958728b3ab2fe2b69732045610e529227bc520eff578edec6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_composed_overlap (cognitive 18): WebCanvasRenderer::render_composed_overlap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 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":"src/renderer/web_canvas/char_overlap.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf76cbb3b14a2a074fc19039c82190941816e223c92b577cb8a514c6e7fb01"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::find_effective_para_shape_for_style (cognitive 18): HwpDocument::find_effective_para_shape_for_style has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 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":"src/wasm_api.rs"},"region":{"startLine":8043}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c8d886fc75329d8fdff9f45b694e13431faeefa2809b70d8cab15e9d9878b"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGPlayer::device_independent_bitmap_stretch_blt (cognitive 18): SVGPlayer::device_independent_bitmap_stretch_blt 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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b02476f0721b72cb1e846c5ed9470580f0eb2651df4bc472b0b7943127a9237"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::agent::dsel::eval::reachable (cognitive 18): rhwp::agent::dsel::eval::reachable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 1, 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":"src/agent/dsel/eval.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fc1017f4f652a86a44cdebb8f79657d5bedb098c1a054dbda8cac4d2d84d05"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::agent::dsel::glob::compile_class (cognitive 18): rhwp::agent::dsel::glob::compile_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 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":"src/agent/dsel/glob.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"42254a51466bba184c288a53d77df16793d5354c01448c3e5caa0ddd6589a0dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::locate::run_para_page (cognitive 18): rhwp::bin::rhwp-agent::locate::run_para_page has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (5 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":"src/bin/rhwp-agent/locate.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"71806f7328790efda8ef093202cb37f276881f53ca6361be6fc9e7a84b3581fc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-page-items::parse_args (cognitive 18): rhwp::bin::rhwp-q::commands::rhwp-q-page-items::parse_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"src/bin/rhwp-q/commands/rhwp-q-page-items.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554fa92e8e011d29bff958fec60e99bca5070d7a11bbcc458397155a5874947"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::help::command_help (cognitive 18): rhwp::bin::rhwp-q::help::command_help has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 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":"src/bin/rhwp-q/help.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3584f08893afffd7cf49d0bd19b0813673db3299946c6c703e90c6a150e0fac"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::page_border_fill::run (cognitive 18): rhwp::bin::rhwp-q::kit::page_border_fill::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (8 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":"src/bin/rhwp-q/kit/page_border_fill.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"11908758c25b798871adc745793dd307fcf6e54303d456268913f399c172f9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::page_text::run (cognitive 18): rhwp::bin::rhwp-q::kit::page_text::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (8 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":"src/bin/rhwp-q/kit/page_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c244579e3b9fa797c8118629ed4095228d836cb636f2fe0e66f08485c22d0b50"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::settlement::cmd_settle_propose (cognitive 18): rhwp::cli::protocol::exchange::settlement::cmd_settle_propose has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 7 (8 pts), loops 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ea96c88f8508d6728d2a3149894e553b078b4711ac38e3a337ca0df00766b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::position_diagnostics::dump_anchors (cognitive 18): rhwp::cli::queries::position_diagnostics::dump_anchors has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), match/switch 2 (6 pts), if/else 2 (5 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":"src/cli/queries/position_diagnostics.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d3d03b24cea3a3f23dd20dd38e59752c50248fde30788665afffdd86769748"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::inspect_hidden_text (cognitive 18): rhwp::cli::queries::security_inspection::inspect_hidden_text has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (6 pts), loops 2, boolean chains 1 (nesting depth added 6). 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9019ac3e5c66c0c6bd86e3c6dea219a800538d4ec597828f87ac826378df01e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::security_inspection::threat_scan (cognitive 18): rhwp::cli::queries::security_inspection::threat_scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), match/switch 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f8c5c7acc512f07d12fd94e6d6a40ab87503a28c96051e19c82bb7bf91824f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_cell_header_probe::build_probe_file (cognitive 18): rhwp::diagnostics::hwp5_cell_header_probe::build_probe_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043adb30b85bf0c65c489b5649ac79e89315f6628a0333a0d9d91382ab4f766"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_cell_header_probe::lcs_pairs (cognitive 18): rhwp::diagnostics::hwp5_cell_header_probe::lcs_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 3 (4 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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb792c8e1f87cb9d5d2256b664e27ec0fa1b0add8317fd707971292d05845fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_char_shape_audit::collect_section_paragraphs (cognitive 18): rhwp::diagnostics::hwp5_char_shape_audit::collect_section_paragraphs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe93f3e7bf57250327964ac53cfb9ab29a34dc2341f9e64a21d781a652d1c89"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_contract_probe::lcs_pairs (cognitive 18): rhwp::diagnostics::hwp5_contract_probe::lcs_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 3 (4 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":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"881407a3a30c0e4b8a5dbbce39b335f1e3a971f51427b2b95502410f9c368747"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_inventory_diff::lcs_alignment_ops (cognitive 18): rhwp::diagnostics::hwp5_inventory_diff::lcs_alignment_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 3 (4 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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"17272e81e079e7e63dbe0ee60dfded43cf98699e051f03b5ab391fa2ac42cc10"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_mel_personnel_probe::build_probe_file (cognitive 18): rhwp::diagnostics::hwp5_mel_personnel_probe::build_probe_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"src/diagnostics/hwp5_mel_personnel_probe.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51527fac746379eb85c6e6ea1f9bcaa3639d259ad9c7688192d9b72d2304d27"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_mel_personnel_probe::lcs_pairs (cognitive 18): rhwp::diagnostics::hwp5_mel_personnel_probe::lcs_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 3 (4 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":"src/diagnostics/hwp5_mel_personnel_probe.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a35d7ff72747d5008f8ffac0ae801dcb0d0d2df95924211d315bf0bd86ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_table_probe::build_probe_file (cognitive 18): rhwp::diagnostics::hwp5_table_probe::build_probe_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"src/diagnostics/hwp5_table_probe.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d96f0160b133edbeb9f82b9ba69e8510bf99e0d4160294818377f1e01ffbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_table_probe::lcs_pairs (cognitive 18): rhwp::diagnostics::hwp5_table_probe::lcs_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 3 (4 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":"src/diagnostics/hwp5_table_probe.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65ab248ff1999fbaaa8f61f73261e5bb1bfff64374dbf76e4018f8e649e8111"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwpx_roundtrip_batch::roundtrip_one (cognitive 18): rhwp::diagnostics::hwpx_roundtrip_batch::roundtrip_one has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 6 (7 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":"src/diagnostics/hwpx_roundtrip_batch.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f71896cff76be3cea901e3521fe2e2cc3e7f94d764caf2c0f81c2c3de65681"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::layout_anomaly::deep_vertical_union_bbox (cognitive 18): rhwp::diagnostics::layout_anomaly::deep_vertical_union_bbox has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 5). None of this is in the body itself: all 18 points belong to 2 function items inside it that branch (horizontal_ink_extent, vertical_extent). 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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f261dd07483e6e9d7d6775ea1780025142304c4f38d3bcdc4df9679c8f7106"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::adapter::paragraph::assemble_section_with_threads (cognitive 18): rhwp::doclang::adapter::paragraph::assemble_section_with_threads has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1, 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":"src/doclang/adapter/paragraph.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e805f09364ef51f9dbfd032fd17f06ae47fcd19c797fbba09e9de26595d37a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::validate_values (cognitive 18): rhwp::document_core::commands::object_ops::chart::validate_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"362216f9cafb2940b584730529c40aee3d656c32279e31f9656a88a8da69ae82"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::object_ops::chart::rescan_matches (cognitive 18): rhwp::document_core::commands::object_ops::chart::rescan_matches 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df5bed27fa813eeff2a077fc92500e9c8fd37fd51a80ae0aed3924986d5b8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::table_formula::table_formulas (cognitive 18): rhwp::document_core::commands::table_formula::table_formulas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_formula.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c0617b03501f131db229feb6afdb91398f6b29c85301dcef30c2e54391010"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::compact_json (cognitive 18): rhwp::document_core::helpers::compact_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), 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":"src/document_core/helpers.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45c73cf4735fb1ba28791ae10e69a6fbc997b1f405f7a6a30117a0d463abeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::helpers::parse_html_attr_f64 (cognitive 18): rhwp::document_core::helpers::parse_html_attr_f64 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"src/document_core/helpers.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5b51af3e6f39c1a22bcaed4396a06d142e0ad0fb966d039e1248eb140311a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::font_decision::transform_steps (cognitive 18): rhwp::document_core::queries::font_decision::transform_steps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, 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":"src/document_core/queries/font_decision.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"de77de1213aeeeb3d1bb7aa4dae63566a4f0b3b17276bb7ea6a79c87b8cad9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::font_metric_coverage::walk_paragraphs (cognitive 18): rhwp::document_core::queries::font_metric_coverage::walk_paragraphs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), 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":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e149f00bb694054f1ce30011a34b5edef8f3c03c08377fa6adb4903612267f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering_metafile_fonts::with_document_fonts (cognitive 18): rhwp::document_core::queries::rendering_metafile_fonts::with_document_fonts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), 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":"src/document_core/queries/rendering_metafile_fonts.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b72df5a9716ba8118e25d6d81615fd8a5dfff250fcecac36f724946e9eac77"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::search_query::search_nested_controls (cognitive 18): rhwp::document_core::queries::search_query::search_nested_controls has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/search_query.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe7f49e7e15b3b8bab055c2489109aa07eb11051158d6f20d41102c8a00a04"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::threat_scan::scan_nested_ole (cognitive 18): rhwp::document_core::queries::threat_scan::scan_nested_ole has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 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":"src/document_core/queries/threat_scan.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde5cf82dd34e68695a09068bc9b5f0f964ad06eeda831c02bd3a6222bd56016"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mcp_serve::session_doc_text (cognitive 18): rhwp::mcp_serve::session_doc_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 6 (8 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":"src/mcp_serve.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"af598bab29198d8f9c813b361285f71c997e55ff76dc503e119d3571a0171c35"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::border_paint::walk (cognitive 18): rhwp::model::border_paint::walk has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 6, match/switch 1 (3 pts) (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"src/model/border_paint.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c759232a5f41bf8c0bb51b2a3c68a3514e1408d21e5d32b98c010e38d80a76"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::native_host::render_snapshot::account_inputs (cognitive 18): rhwp::native_host::render_snapshot::account_inputs has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/render_snapshot.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b01bbfde0640166ad1e40848f7c7ed701d29a753feb9023e71b620fcd3218a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_clamped_tab_leaders (cognitive 18): rhwp::paint::json::write_clamped_tab_leaders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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":"src/paint/json.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5901c8e3eb2817549ec6a708a9f9d2c5a62afa82719055f675e58e1a9d2c6842"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_masks::flatten_bitmap_masks (cognitive 18): rhwp::paint::metafile_masks::flatten_bitmap_masks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 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":"src/paint/metafile_masks.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d44b587b6983ee0dcbc83e198056885d9c968bd4976e70c8c7deb8d94026239"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_print::masks::flatten_bitmap_masks (cognitive 18): rhwp::paint::metafile_print::masks::flatten_bitmap_masks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 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":"src/paint/metafile_print/masks.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"091c287c6e8fe61f0fa6a3f9696348fd9c90b2a17fff1462e9d34b052b44a36e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::shaping_glyph::project_replay_geometry (cognitive 18): rhwp::paint::shaping_glyph::project_replay_geometry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, 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":"src/paint/shaping_glyph.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd58b81d4999396ca1d8d2ab9116f544454f88db6acdd0240b5ce11a00e10371"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::shaping_glyph_vertical::prepare_vertical_font_delta (cognitive 18): rhwp::paint::shaping_glyph_vertical::prepare_vertical_font_delta has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (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":"src/paint/shaping_glyph_vertical.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"05275a3f6741616f890cc0d809adbd99bf18cc7f6b7e59591786433f2b429ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::apply_hwp3_origin_fixup (cognitive 18): rhwp::parser::apply_hwp3_origin_fixup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 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":"src/parser/mod.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"461f5b647136ee825e7dc39c4e4a1bd301f50ca13aed64e5aa144ac6f466c364"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::collect_extra_streams (cognitive 18): rhwp::parser::collect_extra_streams has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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":"src/parser/mod.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fb308b3620bebbd323ff59e6a69d1d1b53dec8531a252fdbd0beb3924fc3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_rendering_info (cognitive 18): rhwp::parser::hwpx::section::parse_rendering_info has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 4 (6 pts), loops 5 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 7 belong to 4 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":"src/parser/hwpx/section.rs"},"region":{"startLine":4128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98605b48b53e2be09b8a97ae0dddfcfa482e8f3161788b75a0467e3dd27c633"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_ctrl_autonum (cognitive 18): rhwp::parser::hwpx::section::parse_ctrl_autonum has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (6 pts), loops 2 (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":"src/parser/hwpx/section.rs"},"region":{"startLine":6081}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9e8730a7af9716ff205a143dc8f6832fa9f57aa7a02b4774fa6248b9916246"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::native_borders::native_dot_coverage (cognitive 18): rhwp::parser::pdf::structured_lowering::native_borders::native_dot_coverage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 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":"src/parser/pdf/structured_lowering/native_borders.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"895f78f8c7fafe00de3ac48ecb69be06cbc5e75e178cb0afe46dfeb9b094837f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::wrap_width::fit (cognitive 18): rhwp::parser::pdf::structured_lowering::wrap_width::fit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 3, 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":"src/parser/pdf/structured_lowering/wrap_width.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f032bf0423f02e26527a350657f46e70ef4072f7de8460dff9c211fefc9637"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::tracked_viewtext::project_nodes (cognitive 18): rhwp::parser::tracked_viewtext::project_nodes 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":"src/parser/tracked_viewtext.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6c50038f87604ab0951007992eb3adc3ada59a44f82c16c8225c103f19aa99"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::format_hangul_number (cognitive 18): rhwp::renderer::format_hangul_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (rhwp::renderer::format_hanja_number) 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":"src/renderer/mod.rs"},"region":{"startLine":4162}}}],"partialFingerprints":{"codehealthFindingId/v1":"178cbed40e387cabce0a0967dfe34fa7f88151d7564e1b0c05456b2ffc22a471"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::format_hanja_number (cognitive 18): rhwp::renderer::format_hanja_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (rhwp::renderer::format_hangul_number) 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":"src/renderer/mod.rs"},"region":{"startLine":4206}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc16f5018b13fded33c7094088fbb27fc4c910f2342f357906779d0c2b05895"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::arabic_context::advances_with_storage (cognitive 18): rhwp::renderer::arabic_context::advances_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 2, 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":"src/renderer/arabic_context.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c5505a7b69c53c551ea702dd17ce672a17db28e294027177909a3b884650cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::conjoining_jamo::split_runs_with_storage (cognitive 18): rhwp::renderer::composer::conjoining_jamo::split_runs_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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":"src/renderer/composer/conjoining_jamo.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4332aefe97084213e1e6e3c612fcf14e88c2b9a69316c7f1f46c5126bf7ad96f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::compose_horizontal_shaping_handoff (cognitive 18): rhwp::renderer::composer::line_breaking::compose_horizontal_shaping_handoff 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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26d90775b50a49fd4804496bbf2f8afb97325fb47ffa05f875a4bf15568c73"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::lineseg_compare::format_report (cognitive 18): rhwp::renderer::composer::lineseg_compare::format_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (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":"src/renderer/composer/lineseg_compare.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce4a696388e9ffef0d9a0e22c08ca281138cd15d4e762556fd72a4f7cae494"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_lines_runs::inc::try_split_runs_by_lang (cognitive 18): rhwp::renderer::composer::stored_lines_runs::inc::try_split_runs_by_lang has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9af067a17741eabe3f94c883e1f39870ebc8dc8e80abe9fb201e65d2203f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::layout::legacy::parentheses (cognitive 18): rhwp::renderer::equation::layout::legacy::parentheses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 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":"src/renderer/equation/layout/legacy.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf45f0f024b2309a524f0f42b7f7bb03e1f958a43bed9b3e17c1e2be094b71f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_table_terminal_suffix_start (cognitive 18): rhwp::renderer::float_placement::stored_table_terminal_suffix_start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (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":"src/renderer/float_placement.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2380100268d3f982271b75303c7aeb28d76cbd5cfccb7bcd751c11d3e4a90ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_coincident_empty_cell_height (cognitive 18): rhwp::renderer::float_placement::stored_coincident_empty_cell_height has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, 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":"src/renderer/float_placement.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"706804b5f5e04a96a4c1cf1da460a29a120ef18cec56cc5c209dade520ac62d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_empty_picture_cell_frame (cognitive 18): rhwp::renderer::float_placement::stored_empty_picture_cell_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, 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":"src/renderer/float_placement.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6078aad41288fa7721c52dfdf456a13c297fb646799e3507ecf0c4851b7ceaa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::column_rowbreak_fragment_opens_outer_top (cognitive 18): rhwp::renderer::float_placement::column_rowbreak_fragment_opens_outer_top has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 17, if/else 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":"src/renderer/float_placement.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0091f2f1b6cfb1a8e230a46b4c3f15acefce01ae4d65087771569b3792bfce5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_successor_with_following_placement (cognitive 18): rhwp::renderer::float_placement::stored_picture_successor_with_following_placement has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8 (9 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":"src/renderer/float_placement.rs"},"region":{"startLine":4721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462524cd0d9c4c72f9b52b374fc2b62e8d889ed20479d06fb5c3826b76482a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::paper_or_page_float_carve_evidence_with_storage (cognitive 18): rhwp::renderer::float_placement::paper_or_page_float_carve_evidence_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (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":"src/renderer/float_placement.rs"},"region":{"startLine":7988}}}],"partialFingerprints":{"codehealthFindingId/v1":"affaca812036c37cfebfc258d2a323e18ca483942049994faec774cd50b7190f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_opening_row_frame::stored_plain_opening_row_frame (cognitive 18): rhwp::renderer::float_placement::stored_opening_row_frame::stored_plain_opening_row_frame has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_opening_row_frame.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"39806cfa59b589ce278aba68cd2a675eeeb67b685d80a3cfe13a5110519c4fed"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::inline_flow::separator_spaces::classify_with_storage (cognitive 18): rhwp::renderer::inline_flow::separator_spaces::classify_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 pts), loops 2, 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":"src/renderer/inline_flow/separator_spaces.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21e3c7d533e7eb2c79341c4a30436f19d532aab8e73475fc22007814ec22948"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::picture_footnote::footnote_composed_with_number (cognitive 18): rhwp::renderer::layout::picture_footnote::footnote_composed_with_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 3, 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d8bb5586f465ea36e3a24dfb0f5529149c9734fc5596132af0aeb1ee327a19"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::text_measurement::kopub_cjk_symbol_units (cognitive 18): rhwp::renderer::layout::text_measurement::kopub_cjk_symbol_units has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"beceea331574bb4f926bb6676482e4edc44b3b8434c06fc53f4e5c4bfce1b475"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::native_webfonts::source_url (cognitive 18): rhwp::renderer::native_webfonts::source_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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":"src/renderer/native_webfonts.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d28d6046ca604112e5f4f6293df9f21f68fd4c466fc6ee6b36941d511ee1f30"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::print_raster::weights (cognitive 18): rhwp::renderer::print_raster::weights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), 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":"src/renderer/print_raster.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae0cda846291b0d81f3028ea1087743524e6194915b487e3a93d1dfaa851ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_composition::map_horizontal_shaping_emitted_run (cognitive 18): rhwp::renderer::shaping_composition::map_horizontal_shaping_emitted_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 8. 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":"src/renderer/shaping_composition.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2afb2c67dca8cd56cb0a5424b8ff9f30a8710b921164ff11834e4147b14faa4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_context::build_clusters (cognitive 18): rhwp::renderer::shaping_context::build_clusters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2, 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":"src/renderer/shaping_context.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1508b3c5e1eccd967bd4f0540e7226ae352b7bb9aafdb185666c2d3b5f84fea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_paragraph::prepare_paragraph_with_budget (cognitive 18): rhwp::renderer::shaping_paragraph::prepare_paragraph_with_budget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), boolean chains 3, match/switch 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"030dfd70f156cdd27b963828a82a2d5b3872aedb8f35c8bf05c289ae1ae7a382"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::font_lookup::declared_family_candidates (cognitive 18): rhwp::renderer::skia::font_lookup::declared_family_candidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/font_lookup.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edbc0fccbaca80e77a37d26556a142f3be0d187c863b59bf9aff64f54eae680"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::glyph_replay::construct_glyph_font (cognitive 18): rhwp::renderer::skia::glyph_replay::construct_glyph_font has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"52672d1e97d5353cd2d925908577483aeff1b138c03eefc557ba2dd8a0d274c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::svg_cmap_terminal_missing_glyph (cognitive 18): rhwp::renderer::svg::svg_cmap_terminal_missing_glyph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 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":"src/renderer/svg.rs"},"region":{"startLine":4899}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f4d00e257b455dd094c36e71cb33dd0366d072d98a75951cf7ca96d32385bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::table_row_frame::declared_tail_row_height (cognitive 18): rhwp::renderer::table_row_frame::declared_tail_row_height has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, 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":"src/renderer/table_row_frame.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae40c38b8832ffea12079313e629ca3a4d3d66711103dd27000d7ce65dc4fea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage (cognitive 18): rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b619e3f2f18d61f58e0c28dc931072cf35e85201fb3cb2829a1d1acb79aa9305"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::stored_lines::stored_vpos_before_reconstructed_text (cognitive 18): rhwp::renderer::typeset::paragraph::stored_lines::stored_vpos_before_reconstructed_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7bd027d52625ac1ed9ffc492d0ff89b0b0a740b4201de9c21733c1fb7defc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::security_trailer::open_with_privkey (cognitive 18): rhwp::security_trailer::open_with_privkey has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10, if/else 7, boolean chains 1. 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":"src/security_trailer.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ccdb69298a16f6e898fe12673717294151c7fb04a7de76e83329c6ee345f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::body_text::try_serialize_paragraph_with_msb (cognitive 18): rhwp::serializer::body_text::try_serialize_paragraph_with_msb has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"src/serializer/body_text.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa10ac3bef9a086e59b222f5eea1e539bf929f8ed3a8d9cea428be8fd971fa28"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::doc_info::serialize_fill (cognitive 18): rhwp::serializer::doc_info::serialize_fill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (7 pts), match/switch 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/doc_info.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8016f56a2556414b6af0bfd2320179d9f6829a463185b096088a3a95e79582d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_equation_with_storage (cognitive 18): rhwp::serializer::hwpx::section::render_equation_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aca72586560e2e39ff0f159a1dc05101df2cd5d05392b2dd8a3eb37fed39f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_desk::engine::candidate_paths (cognitive 18): rhwp_desk::engine::candidate_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (8 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":"rhwp-desk/src/engine.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc5d314c2093bac39fb69c7cc28ec3e614147796dc3ab7f8bba5e736a14a79c"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack._fn_body (cognitive 18): _gen_pack._fn_body 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":".claude/skills/rhwp-agent-surface/references/_gen_pack.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf508b3c750fc8555e39da45bac9bf1dbe0ddf487bbfdd78ab2366d47621b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validate_task (cognitive 18): schema.validate_task has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2, 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":"gym/core/schema.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc66f3dcb93d5889f7c2484cf4b4504942295848a3a2a668fca04cda507b8cb"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.validate_trace_event (cognitive 18): agent_session.validate_trace_event has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 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":"gym/tools/agent_session.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"228aafa301ceaff96784b4a21b799298339debc7b2acd649cb165e5b8021e18d"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.classify_sequence (cognitive 18): agent_session.classify_sequence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, 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":"gym/tools/agent_session.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"4598b9cff260d1741097f12eaa2c1549da6bc50839dbae6798aa8f3df2ff1694"}},{"ruleId":"D2","level":"warning","message":{"text":"audit.classify_schema_message (cognitive 18): audit.classify_schema_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, 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":"gym/tools/audit.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"191238f3845fce875c3bb833153b9e374973f20313d69cd6b572cad602b1f892"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_metadata (cognitive 18): evidence_report._validate_metadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 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":"gym/tools/evidence_report.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b58c8c398d1077f331f04bf6b0a3ba33f6fdc4107eeec95690438aeabd3df27"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard.chain_walk (cognitive 18): leaderboard.chain_walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 4 (5 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":"gym/tools/leaderboard.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa1849cc3ca0e49c2ad4472d48b4f5bfe73a642152ce644c6f961723a9fb973"}},{"ruleId":"D2","level":"warning","message":{"text":"leaderboard._cmd_attest_body (cognitive 18): leaderboard._cmd_attest_body 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":"gym/tools/leaderboard.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789b677c7ad5b2326267580f1fbec8fb744ec8738f154facacf1d8fb7097d67"}},{"ruleId":"D2","level":"warning","message":{"text":"release_diff.compare_packs (cognitive 18): release_diff.compare_packs has cognitive complexity 18 (threshold 15). Drivers by points: error handling 2 (6 pts), loops 3 (6 pts), ternaries 1 (4 pts), if/else 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":"gym/tools/release_diff.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c780505a53084db38aea5df1ef295511775b1af79771bcc087071e0ece3919"}},{"ruleId":"D2","level":"warning","message":{"text":"release_gate.render_summary_lines (cognitive 18): release_gate.render_summary_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 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":"gym/tools/release_gate.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2454f4db6437ee9f20bab84f24b7b4ce13f273d8302361f23e2d226d32a8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorController._synchronize (cognitive 18): NativeEditorController._synchronize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 1 (4 pts), error handling 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":"bindings/Flutter/lib/src/native_editor_controller.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f4442642d619c81abeb7cc6d579918da7eab0b2d4ed1da29dc658ff823eb11"}},{"ruleId":"D2","level":"warning","message":{"text":"read-tools.pageTextFromLayout (cognitive 18): read-tools.pageTextFromLayout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/read-tools.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"915820b8ea7a661a6e786ac701e157977105d9f0795a1262338d56b9fe8eac15"}},{"ruleId":"D2","level":"warning","message":{"text":"block-calculation-plan.planBlockCalculation (cognitive 18): block-calculation-plan.planBlockCalculation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, 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":"rhwp-studio/src/command/block-calculation-plan.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b968efbc6659429ea8ec1f8d0584180dd27527b632826416bf9acaad2dbcd0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"print-pages.namespaceSvgIds (cognitive 18): print-pages.namespaceSvgIds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), ternaries 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":"rhwp-studio/src/command/print-pages.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778ac1c6676642cc08101a38208003dd86975cfd96cfafe5437912df7bfd67b"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.shouldPromoteEmptyTextEdit (cognitive 18): diff-engine.shouldPromoteEmptyTextEdit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"735f190509c4c1d2ca15efc88c22b49ff484cd06a0f900d0f97ed133af2ce7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"chart-data-target.matchesOne (cognitive 18): chart-data-target.matchesOne has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), loops 1 (2 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2b22ab0fd9e0632370e93a2581a47844582406ee633afa734a21ac1df72c10"}},{"ruleId":"D2","level":"warning","message":{"text":"font-substitution.resolveFontWithRules (cognitive 18): font-substitution.resolveFontWithRules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1de7ffdad93d391efebc01c999e702018e41e92ca627b3e6dab310f7f0cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"glyph-outline-payload-status.glyphOutlinePayloadStatus (cognitive 18): glyph-outline-payload-status.glyphOutlinePayloadStatus has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 5, if/else 3 (4 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab1bd03107d2590aa87a6cc57a7f732fe1a86555d81eb1324acc8b39ee44148"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.renderTabLeader::draw (cognitive 18): CanvasKitLayerRenderer.renderTabLeader::draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), boolean chains 3, 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d78a851ce5a8f8851bdbb7c2a28c2118c0d24a4c1833a42ba36cbfa9a98be8b"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-hyperlink.followHyperlinkClick (cognitive 18): input-handler-hyperlink.followHyperlinkClick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, ternaries 3 (4 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 85, 78, 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"994001754a8f176db84ae856d868bb80dbd1e25fb7d1e579ec861acb99d7b80e"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.updateTextSelectionDragFromPointer (cognitive 18): InputHandler.updateTextSelectionDragFromPointer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5 (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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b74584c9d2b8e9a834dba5bb5506312181163061b78a3bc3c2c4cedd661e50"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.applyToggleFormat (cognitive 18): InputHandler.applyToggleFormat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e675dd4e9dd81fd1b766bbdcf353e9d6154b6190fd0bcd2920ff3f3aee670331"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.clearSelectedCellBlock (cognitive 18): InputHandler.clearSelectedCellBlock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 2555). 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e657f49ae04e424fdcd8e621e339b753fe700a492492da1197b336d574c1aa9e"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.emitCursorFormatState (cognitive 18): InputHandler.emitCursorFormatState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), error handling 3, 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3bb342f243202b77a258a69381e7a01bfe5fec3e6b865f2bdfd9a37894a41c"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.bodyTableRectsInRange (cognitive 18): InputHandler.bodyTableRectsInRange has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, loops 3 (5 pts), if/else 2 (3 pts), error handling 1 (nesting depth added 3). Of this number, 9 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9684ed90938fedbdd884a9f8625b5c7c1268d7f57c17f66d7c605e1125f5c11"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.updateFieldMarkers (cognitive 18): InputHandler.updateFieldMarkers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ebf3896125fe8c7327cd8089d906c84facebc6a257c925859346d3e4b9ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setupFileInput (cognitive 18): main.setupFileInput has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 4). None of this is in the body itself: all 18 points belong to 2 function literals inside it that branch (lines 1094, 1066). 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25e72ec87a8d917c8b980cc98ef614ff8179bafec6203c9352d579525a463f1"}},{"ruleId":"D2","level":"warning","message":{"text":"CellBorderBgDialog.onConfirm (cognitive 18): CellBorderBgDialog.onConfirm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (5 pts), loops 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (buildTargets, applyDirect, a function literal at line 1081). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"839fbce9fd771afd56cd54f38c45b7eeed6c5fe9b23a02cb42867736390f8d36"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareResultWindow.formatInspectorText (cognitive 18): CompareResultWindow.formatInspectorText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edeb14a1074bbadedd9957bea4c86ae83fc73d3fd097622afaeaa9320f4690b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::renderer::render_scatter (cognitive 17): rhwp_ooxml_chart::renderer::render_scatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3983e0e8689bde6b841c8c4eb8e9a3776d571874e1bf81eccedea5b25b713b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_password_crypto::decrypt_hwpx_package (cognitive 17): rhwp_password_crypto::decrypt_hwpx_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), 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/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d19ae7d7219819d80e04315a464573643a3cc74b6963a347d4492578bf87ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_password_crypto::encrypt_hwpx_package (cognitive 17): rhwp_password_crypto::encrypt_hwpx_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), 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/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c4fb4ce5fd67b66817b6f49496f9b81ab24bd8adba115d64498e09fe06ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"Bands::cell_pens (cognitive 17): Bands::cell_pens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"src/document_core/commands/border_paint_bands.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3254e79e2a5ad186a9edfd5551f91fa08533592aa535397438ac83de76e91ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::hwpx_document_for_export (cognitive 17): DocumentCore::hwpx_document_for_export has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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":"src/document_core/commands/document.rs"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56daee45e60c3fb47025b45b2c3b725f23382653e9388c442411c0836c3f78"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::update_connector_subject_ids (cognitive 17): DocumentCore::update_connector_subject_ids has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (17 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":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a721aee6bb026533315260fc8f606507877a429a926a0c39b9f44ed8dc6ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resolve_shape_control_ref (cognitive 17): DocumentCore::resolve_shape_control_ref has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DocumentCore::resolve_shape_control_mut) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae604109d44a110136a14bd350b87b5b72d76258fd30ee3ed9cc7a52825c2355"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resolve_shape_control_mut (cognitive 17): DocumentCore::resolve_shape_control_mut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DocumentCore::resolve_shape_control_ref) 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"46566142eaa84f3988bd85ccbfe4ecd85673ee7965926cff80ca9f0d22695161"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::apply_endnote_shape_native (cognitive 17): DocumentCore::apply_endnote_shape_native has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4e3574fb8b36b038aec29fc20065d29ff16bc45f68d85c1656c330fa145f71"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cell_paragraph_mut (cognitive 17): DocumentCore::get_cell_paragraph_mut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54935d83367710c4d0aaf549357fdc330caf43c9cd7750031cbddee3917286"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::get_cursor_rect_native::collect_inline_bboxes (cognitive 17): DocumentCore::get_cursor_rect_native::collect_inline_bboxes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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. This shape REPEATS in the file: 5 other methods here (DocumentCore::get_cursor_rect_native, DocumentCore::get_cursor_rect_native::collect_inline_control_bboxes, DocumentCore::get_cursor_rect_native::collect_text_caret_stops, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1103a792805f75c6300d5c42691077a9fc709944d3dd96bc2b82b3176e47ca91"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::break_at_cursor (cognitive 17): DocumentCore::break_at_cursor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9d3c7006053cfd2b130991a76d42fb2097f6fa18f21d348a6ade26d1782454"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::read_string (cognitive 17): Lexer::read_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 2 (5 pts), match/switch 2 (5 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":"src/eps.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6043b46b661a150e815d1f45fe859e9def9d07d226d744d9f81002b2050d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::column_bounds (cognitive 17): Table::column_bounds has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (5 pts), match/switch 1 (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":"src/model/table_equal_size.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aecb52634595372bb73e800bd6b52972ec6113a624a0f5bfdba6003d5afed2"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditor::horizontal_target (cognitive 17): NativeEditor::horizontal_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/commands.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d47d37fabca481f1a47515e69db6c1593334576fda406996c433a372958d26"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShapeLowerer::evaluate_text_run (cognitive 17): TextShapeLowerer::evaluate_text_run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"src/paint/text_shape.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34e277b6da21b1051af4e78f18ee54527daaf2a21c819f6159a940924c39af2"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::compositions (cognitive 17): Ledger::compositions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0c6348bee5e1f76235fa1a8fca3ef38b097f412a28f8309d20d0dfeed8310"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceGraphemes::new (cognitive 17): SourceGraphemes::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (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":"src/renderer/emphasis.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6680b9329007820a626bdd731953b7ad08d233e3ddcb1a87f065498ded6ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"EqParser::try_consume_infix_over_atop (cognitive 17): EqParser::try_consume_infix_over_atop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (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":"src/renderer/equation/parser.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0171a6139ede95f2f3b83dafd0ffca49cc075611b4482b56cf0d5f96398e10"}},{"ruleId":"D2","level":"warning","message":{"text":"FontEnvironment::from_native_document_substitutions (cognitive 17): FontEnvironment::from_native_document_substitutions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_environment.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40c09f0388c74d1e8445968f7e73719e782f62ca1c509037b004d94ade17a10"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_inline_control_pen (cognitive 17): LayoutEngine::stored_inline_control_pen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"353b44e8795366cc50e3e5c9e5877694f5f1bf3bb7001ad438a922c7005376ee"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::empty_unit_owns_flow_line_box (cognitive 17): LayoutEngine::empty_unit_owns_flow_line_box has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. 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":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"171756db8271f0589cef62f425775f7dfb654e3b0f68be9c1ab7eaf6e4850d27"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_deferred_picture_frame_before (cognitive 17): LayoutEngine::stored_deferred_picture_frame_before has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, 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":"src/renderer/layout/table_layout/stored_deferred_picture_frame.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2254a2f585cdc3ba22a3bed4ad44eb79d24f81dca20bf4fa1a7c3b74b94f66e2"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_ordinary_closing_text_frame (cognitive 17): LayoutEngine::stored_ordinary_closing_text_frame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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":"src/renderer/layout/table_layout/stored_ordinary_row_frame.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"76de7873de6dbb3468f252ad342f8b06856dd5f7ec6b2bc8116fe86af89e445e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::span_source_row_restart (cognitive 17): LayoutEngine::span_source_row_restart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, 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":"src/renderer/layout/table_layout/stored_span_row_owner.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef03dcbf6b766847fda947bc3417b3005a62eb7cd1e927e7dafd0ebca515794"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_block_cut_physical_height (cognitive 17): LayoutEngine::row_block_cut_physical_height has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee6e3bb1436550936a83876f9cde6c24e35058cac0438e9774f0d33f9d59c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_picture_cut_frame (cognitive 17): LayoutEngine::stored_picture_cut_frame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13845}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c99e42491bb493de3e23479ad3ce9da2d1c59be37d6602d4f53363fbc65783"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::parallel_picture_row_opening_height (cognitive 17): LayoutEngine::parallel_picture_row_opening_height has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e8409f5e779884b940b05c027fc204cd6a3eb8f8cad3bb4b59ad40b61be01"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_block_cut_remaining_height (cognitive 17): LayoutEngine::row_block_cut_remaining_height has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3045ddfe36dbac1daa0dabc9d29feb4eb88ab7567eb7f4825281e397df286a22"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::process_multicolumn_break_with_storage (cognitive 17): Paginator::process_multicolumn_break_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f4db82cea65055e8dc4d8a592cb2086f3b5e07bfa5d2a8380f2d276b5d1da"}},{"ruleId":"D2","level":"warning","message":{"text":"Paginator::paginate_multicolumn_paragraph_with_storage (cognitive 17): Paginator::paginate_multicolumn_paragraph_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d31a7f29e1c06e0470853662ac14e5c02bda3e5fb88b63e8cf21fdb9a1c9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TypefaceCatalog::try_from_data (cognitive 17): TypefaceCatalog::try_from_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/font_catalog.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c78dbfc9f3183064ea9e6cf2c9e83a7683d65c4e6f5d23c802819ea33200d9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::place_mixed_host_line (cognitive 17): TypesetState::place_mixed_host_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, 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":"src/renderer/typeset/state/mixed_host_line.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ff0931b01ba33aa2b87458547370c66f98219b5b7b122d18c661bdeaa72f43"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceTailQuery::mirrored_correction (cognitive 17): SourceTailQuery::mirrored_correction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), match/switch 1 (2 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":"src/renderer/typeset/table/scan/source_tail/extension.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35af1a7762cfed76c40f1cae86d1aa870f532d17dc4609b0c9592a0af1ca70c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::endnote_column_has_reissued_rows (cognitive 17): TypesetEngine::endnote_column_has_reissued_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 1 (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":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568b3c63a2fbd6e4339112a29ad3da9c45c78e9b23766a4d5fc19971eba0326"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::apply_pattern_fill (cognitive 17): WebCanvasRenderer::apply_pattern_fill has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (10 pts), if/else 2 (5 pts), loops 1 (2 pts) (nesting depth added 6). 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"32716958d8efccfa1ab94da2ef41ca85d0df9aaf1c48a5ab0e32932dbe22530b"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_image_cropped (cognitive 17): WebCanvasRenderer::draw_image_cropped has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d76db0dba312ba723c3c70c95323773e6bf9f0de29f5b5964e58abd60325823"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenedDocument::export_text (cognitive 17): OpenedDocument::export_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/service/query.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68e98c8478b2dfe4e7971fe21d8120e6abb2ee8673571b95f82fdfb373c1e25"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::update_click_here_props::update_field_in_para (cognitive 17): HwpDocument::update_click_here_props::update_field_in_para has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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. This shape REPEATS in the file: one other method here (HwpDocument::update_click_here_props) 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":"src/wasm_api.rs"},"region":{"startLine":6625}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e62cc03c45823c9239601046a414bde89b799e1a25b7a6fccdccf4e6810045"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::safety::run_hidden_text (cognitive 17): rhwp::bin::rhwp-agent::safety::run_hidden_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (7 pts), 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"83be9da6498262c2b6bbaf1108afd280d4543dade29f95c8bf93f34ebbdd2173"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::structurecmd::run_structure (cognitive 17): rhwp::bin::rhwp-agent::structurecmd::run_structure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (4 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":"src/bin/rhwp-agent/structurecmd.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3806e94d0e895a504593c3b4801e97a49d911fea1e654309d46b53d8c259e521"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-page-def::parse_cli (cognitive 17): rhwp::bin::rhwp-q::commands::rhwp-q-page-def::parse_cli has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"src/bin/rhwp-q/commands/rhwp-q-page-def.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92e4f1ed186c955b79348479b5502262acf79c930cbf2c0dd6160db0ac36bc"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::envelope::walk_shape (cognitive 17): rhwp::bin::rhwp-q::kit::envelope::walk_shape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), 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":"src/bin/rhwp-q/kit/envelope.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9dc53848ba3b4c73bb91a520f4d2102d1e03fed9ad7cf4766dcf865be938eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::edit::text::parse_replace_text_args (cognitive 17): rhwp::cli::commands::edit::text::parse_replace_text_args has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 3 (5 pts), loops 1 (nesting depth added 7). 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":"src/cli/commands/edit/text.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f049c70aa50222352dda7a7e245d83adaff3030bf94ac10f76a9f34c5f40826"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::protocol::exchange::disclosure::cmd_disclose_restore (cognitive 17): rhwp::cli::protocol::exchange::disclosure::cmd_disclose_restore has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 4 (5 pts), boolean chains 2, 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":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e130432027a21c09e2b31523e8c4d597a162fe042ab9b6a157d3fc83a4a4226d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::diagnostics::dump_endnote_lines (cognitive 17): rhwp::cli::queries::diagnostics::dump_endnote_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 6 (7 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca88aabd1497f2b066617f85f31f225910faaf755541273d1fffa5e3b695696"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::ir_comparison::ir_diff_paragraph_scalars (cognitive 17): rhwp::cli::queries::ir_comparison::ir_diff_paragraph_scalars has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 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":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c943c89b6b302f539d197ba877d595b17ad685a1c4f934e5a798af50e95c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::queries::ir_comparison::compare_ir_sections (cognitive 17): rhwp::cli::queries::ir_comparison::compare_ir_sections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (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":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a00a4b23128609e472ce585fd612a97ee26746a6f53035fa754b14b2c060d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_anchor_trace::run (cognitive 17): rhwp::diagnostics::hwp5_anchor_trace::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7da887697814d23db26f72ae9f20ff9a4d92fcb0d8b73c62f114e2d98abe96"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_contract_probe::patch_missing_ctrl_data (cognitive 17): rhwp::diagnostics::hwp5_contract_probe::patch_missing_ctrl_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (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":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eb825a28b01aa726724f903a0709b4b6c121fec83bdb8c0a3376cb3d56b928"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::html_table_import::image_pixel_size (cognitive 17): rhwp::document_core::html_table_import::image_pixel_size has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 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":"src/document_core/html_table_import.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e0075e65df073459c8986eb828735707f468b990ffbab495c9becce32ed131"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::body_page_fields::fields (cognitive 17): rhwp::document_core::queries::body_page_fields::fields has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 1 (4 pts), if/else 1 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/body_page_fields.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3794bbe5131a136d4c6cc5bef83b9ed6aa929d145a57f4ef60002336bcc20245"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::body_page_fields::collect_owners (cognitive 17): rhwp::document_core::queries::body_page_fields::collect_owners has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (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":"src/document_core/queries/body_page_fields.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"33327f361a4077f76ffc6d08c51daeb8a1b72a2fe1e78dc12970967340445073"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::collect_shape_field_ids (cognitive 17): rhwp::document_core::queries::field_query::collect_shape_field_ids has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d3b041f5fe72675b03c14b589319a0e37201dbd01867a027416918df7b894"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::remove_field_control_in_para (cognitive 17): rhwp::document_core::queries::field_query::remove_field_control_in_para has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (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":"src/document_core/queries/field_query.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d896783ae034992eca9e1c782be4f90c956842eb624cc2b0e43e5c76e930e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::border_paint::walk_mut (cognitive 17): rhwp::model::border_paint::walk_mut has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5, match/switch 1 (3 pts) (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"src/model/border_paint.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff174f60d0eeccbf7614cacbbe63dee269b89bd22773864f66c1de0b39e85323"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::model::table_row_grid::decode (cognitive 17): rhwp::model::table_row_grid::decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, loops 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":"src/model/table_row_grid.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afde8f8e311d2f37c4a5707e58171eebf581ab3acfdf8f84bc57d01411ae927"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-1061::probes::dump_equation_records::dump_raw_records (cognitive 17): rhwp::mydocs::tech::investigations::issue-1061::probes::dump_equation_records::dump_raw_records has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1937c984f3841911e29c95f82d7acd3f21e0463912b75ee313ca94b1c07501eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::mydocs::tech::investigations::issue-5128::probes::diag_5128_page_map::first_text (cognitive 17): rhwp::mydocs::tech::investigations::issue-5128::probes::diag_5128_page_map::first_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"mydocs/tech/investigations/issue-5128/probes/diag_5128_page_map.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4966f2fbd03db6409a925c01f44335144a0c2d4fd6a92b01e59bc52bc8e7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::metafile_picture::lower (cognitive 17): rhwp::paint::metafile_picture::lower has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"src/paint/metafile_picture.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"96da009a50c1bcce60ae26f44f2d3a01e0b525a89b04218810ce95eff637391a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::paint_bounds::text_bounds (cognitive 17): rhwp::paint::paint_bounds::text_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, loops 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":"src/paint/paint_bounds.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7d00533fe455030ae57a5c1a47d7707b31db57eb6284f42329f0a957c9ca75"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_v2::glyph_run_font_proof_fallback_reason (cognitive 17): rhwp::paint::text_v2::glyph_run_font_proof_fallback_reason has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 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":"src/paint/text_v2.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"598c5da8a282cd4d8a4060da8d3a9f663fc96fe8a72d95bcc7225f15790623e0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::doc_info::parse_doc_info (cognitive 17): rhwp::parser::doc_info::parse_doc_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 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":"src/parser/doc_info.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecfebe4e4d20ab2cec444ad7623e3b7724fb99fac53645b52c3dac99baa43ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwp3::ole::extract_ole_payloads (cognitive 17): rhwp::parser::hwp3::ole::extract_ole_payloads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/ole.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"445e0a5803edc59d962a3aa83e8cd2d8e8e65e6b0a1d4cb0e1c6efbc4f938eea"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_object_element_attrs (cognitive 17): rhwp::parser::hwpx::section::parse_object_element_attrs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (14 pts), boolean chains 1, if/else 1, 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":"src/parser/hwpx/section.rs"},"region":{"startLine":3779}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8d4817802b443217ac00fa96243511d8fa1fa36ba47102bb07f28e5f5e0dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::component_groups (cognitive 17): rhwp::parser::pdf::table_detection::component_groups 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e318735c09520c2f8f42e5162f6789631071127e69ff0fb3a3a307454fd4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_detection::boundary_contributor (cognitive 17): rhwp::parser::pdf::table_detection::boundary_contributor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7ed67c3f6e2aa7de5e81aefe528e5df1a932e5abbcc62fbb67d0c05926283"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::unstored_empty_square_table_host_geometry_px (cognitive 17): rhwp::renderer::unstored_empty_square_table_host_geometry_px has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, match/switch 1 (2 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":"src/renderer/mod.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ce89e0c20d36bb6aa7ab0e4fa4d155cbb85aec5078a7a47b5c98973bddfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::supplemental_clusters::preserve_literal_spaces_with_storage (cognitive 17): rhwp::renderer::composer::supplemental_clusters::preserve_literal_spaces_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 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":"src/renderer/composer/supplemental_clusters.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeadd9e7a43f4238c1c3123eb15729a1eaea4ad8ab65b96b215936435333cf7"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::emphasis::geometry (cognitive 17): rhwp::renderer::emphasis::geometry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/emphasis.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9fa16390df8709a1e167ecfad8b5b0c1e4d47606df69c24fbb80e0b59037b5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::hancom_glyphs::glyph (cognitive 17): rhwp::renderer::equation::hancom_glyphs::glyph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (5 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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b631e08f93c76866b8da027f381382dd7e80f07eb1b90399fa93fd7271621cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::layout::source_font_text::layout (cognitive 17): rhwp::renderer::equation::layout::source_font_text::layout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts), 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":"src/renderer/equation/layout/source_font_text.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a43d18b084cc6c7ea30f669874fe3d0e9f7b1712284e2e0973e0e0f4b15c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::variable_outline::commands (cognitive 17): rhwp::renderer::equation::variable_outline::commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/variable_outline.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5204f4b310241c07104b4f8597cb817c788009f987965667d73b4be0fe5c1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_hwpx_no_adjust_cell_content_end (cognitive 17): rhwp::renderer::float_placement::stored_hwpx_no_adjust_cell_content_end has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (6 pts), loops 2 (3 pts) (nesting depth added 4). 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":"src/renderer/float_placement.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632b5947933a70e8e215fd0e556a8a53ce5998d7fd3b42f146b9b4242eadce3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_picture_group_frame_placement (cognitive 17): rhwp::renderer::float_placement::stored_picture_group_frame_placement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, 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":"src/renderer/float_placement.rs"},"region":{"startLine":4837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c55ab337fa6e2a481ddfd9350d6e4c46f6e8368ace6c329b36094102d543f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::stored_text_page_frame::source_frames (cognitive 17): rhwp::renderer::float_placement::stored_text_page_frame::source_frames has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 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":"src/renderer/float_placement/stored_text_page_frame.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e40156870642362958b70c92333846c3e44c84878d4c75ad8cc3475d7a2689"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::print_jpeg_encode::encode_print_jpeg (cognitive 17): rhwp::renderer::image_resolver::print_jpeg_encode::encode_print_jpeg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 1, match/switch 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":"src/renderer/image_resolver/print_jpeg_encode.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c2c213dabb7f77a49e14691e795da1189bef7f36fdcb5538a7e5c79b91f769"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::textless_host_ladder_line_advance (cognitive 17): rhwp::renderer::layout::textless_host_ladder_line_advance has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, 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":"src/renderer/layout.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d68ff720522398a5bfb29890081086136e9fb19b05d2eac9a2f3b40090cd7a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::shape_layout::measure_composed_text_range_width_with_storage (cognitive 17): rhwp::renderer::layout::shape_layout::measure_composed_text_range_width_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"85797fb054df5b0be6e40f830cb8d328530d005f9ae9b940320cf1989b1d6a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::shape_layout::curve_geometry::commands (cognitive 17): rhwp::renderer::layout::shape_layout::curve_geometry::commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 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":"src/renderer/layout/shape_layout/curve_geometry.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6b3b80db1a9e0a9f7e7064d961e32a317d55ee72bc7fc5c7b43a10873dcdce"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::stored_shape_host::preserves_line_origin (cognitive 17): rhwp::renderer::layout::stored_shape_host::preserves_line_origin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"src/renderer/layout/stored_shape_host.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad49dd023dca12dec29cbdd9efdf4cdb3038d77f3620993c4d04d5d5b864f9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::table_layout::empty_line_flow::closed_stored_empty_line_owns_advance (cognitive 17): rhwp::renderer::layout::table_layout::empty_line_flow::closed_stored_empty_line_owns_advance has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 8, match/switch 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":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a5432a4f8cb161eadc03491b39eaa9f7057f078bbe4b3cf3950e5977f5eb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf::remap_bfchar_block (cognitive 17): rhwp::renderer::pdf::remap_bfchar_block has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 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":"src/renderer/pdf.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"008e13e0b708baac6d8b04d6c0d948fad9d0ff9c3372686e4ce392652be5f6a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf_synthetic_bold::prepare_svg_with_synthetic_bold (cognitive 17): rhwp::renderer::pdf_synthetic_bold::prepare_svg_with_synthetic_bold has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, 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":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"63176a2184d383b872ad92d57881dfdbdbe60a393a0c848ca75139ab7c212d44"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::pdf_synthetic_italic::parse_svg_with_synthetic_italic (cognitive 17): rhwp::renderer::pdf_synthetic_italic::parse_svg_with_synthetic_italic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, match/switch 1 (2 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":"src/renderer/pdf_synthetic_italic.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"652f0163a5a345cdc2b2ec572fb09242819ab1ade1623f887f9b47390e3e8f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::math_table::normalize_with_storage (cognitive 17): rhwp::renderer::render_normalization::math_table::normalize_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 1 (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":"src/renderer/render_normalization/math_table.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"72756d0bcdf2f683b81f938aeab4b191b276f12e20672d90971d3166b13af699"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage (cognitive 17): rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 6 (15 pts), match/switch 1 (5 pts), boolean chains 2 (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. This shape REPEATS in the file: one other method here (rhwp::renderer::render_normalization::stored_nested_text_frames::collect_with_storage::visit_with_storage) 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":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5bcd1467a1e39722f9b7268e320803c4520222af1c1cd65c27a393107e6c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::shaping_vertical::finish_dormant_vertical_shaping_transaction (cognitive 17): rhwp::renderer::shaping_vertical::finish_dormant_vertical_shaping_transaction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_vertical.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e0d5d4d902b1c95a131b05fdc873ff66ae76e329341309392f112ffad861a2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::skia::font_catalog::supplied_style_rank (cognitive 17): rhwp::renderer::skia::font_catalog::supplied_style_rank 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, 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":"src/renderer/skia/font_catalog.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebb7e954745b95f5e383df1c41e37925a597138995c5d1eeafca59b08d21c85"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::flow::collect_own_line_notes (cognitive 17): rhwp::renderer::typeset::paragraph::flow::collect_own_line_notes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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":"src/renderer/typeset/paragraph/flow.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a439ad854ca66ee880c5200ced1bdec10de6d2454a9beaabff38ae47f60ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::paragraph::stored_lines::stored_page_boundary_invalidated_by_reflow (cognitive 17): rhwp::renderer::typeset::paragraph::stored_lines::stored_page_boundary_invalidated_by_reflow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, match/switch 1 (2 pts), 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":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe93003390c9dfcdcf708c85e4a912f3dcfa3dffa70b070d390597a3996382"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::resource_supervisor::pdf_confinement::linux::confine (cognitive 17): rhwp::resource_supervisor::pdf_confinement::linux::confine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), 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":"src/resource_supervisor/pdf_confinement.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"82505cddd6093056d878359cf1b117d9f8dc7aa6d5f724c3a3c4ca2ee08ed6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::column_sizes::normalized_with_storage (cognitive 17): rhwp::serializer::column_sizes::normalized_with_storage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/column_sizes.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdce92a666aa1294a2a401e71b699bfb2872948f7b82bf124fc91855e32c839"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::serialize_shape_control (cognitive 17): rhwp::serializer::control::serialize_shape_control has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (6 pts), loops 1 (2 pts) (nesting depth added 6). 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":"src/serializer/control.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"589664aa32c159550f7e3c51746e08aee25391583d123fa213b42b4ec5872b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::export_cache::project_paragraphs (cognitive 17): rhwp::serializer::hwpx::roundtrip::export_cache::project_paragraphs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip/export_cache.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"59da694b995f964423e95434242b293ad8f0901aeb5a69b513c20a84554c8713"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::section::render_hp_t_content_with_storage (cognitive 17): rhwp::serializer::hwpx::section::render_hp_t_content_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2b6784a11b430c070b6decc8719efb42f5cf2a18a3437ae338271a5958da69"}},{"ruleId":"D2","level":"warning","message":{"text":"_gen_pack.extract_profiles (cognitive 17): _gen_pack.extract_profiles has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (6 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":".claude/skills/rhwp-agent-surface/references/_gen_pack.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"55679d8ea005637e54b9c23b1dcb5d25b9d0b3d32a438c8d24329d43b9872290"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.find_bin (cognitive 17): runner.find_bin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/runner.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4445902cce5497f8684652ff6fc0d29ffdd16a416f7e12a8e3be7512183baa1b"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.resolve_placeholder (cognitive 17): runner.resolve_placeholder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, error handling 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":"gym/core/runner.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba404cf79e68e9a6313eb3f18980196ae0f90710ca7a742d5c24cbba8e7d6e92"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_session.render_score (cognitive 17): agent_session.render_score has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/agent_session.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ba74822a47bc1f25f5e6cf1c4d9b8314d668c83157af12a6d05f0b8057fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"competitive_bench.export_text_verdict (cognitive 17): competitive_bench.export_text_verdict has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, ternaries 5 (6 pts), if/else 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/competitive_bench.py"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fdc27c7bedee1637d6000426685a0b80dbf2d1eb8488ea4ff53264f17948a4"}},{"ruleId":"D2","level":"warning","message":{"text":"differential.compare_twins_detailed (cognitive 17): differential.compare_twins_detailed has cognitive complexity 17 (threshold 15). Drivers by points: error handling 5 (9 pts), if/else 2 (4 pts), loops 2 (3 pts), ternaries 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":"gym/tools/differential.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9926e4f403d71a64d5885a6759152d174bbf3ec7a06d2f447384a7761c481830"}},{"ruleId":"D2","level":"warning","message":{"text":"fuzz_corpus.mutant_family (cognitive 17): fuzz_corpus.mutant_family 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec795cebdb0ef4de47d3d362e2b52d30d534c4b4c6b3306eaa146d1631caebd"}},{"ruleId":"D2","level":"warning","message":{"text":"release_diff.build_probe_failed_report (cognitive 17): release_diff.build_probe_failed_report has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (6 pts), if/else 2 (nesting depth added 2). 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":"gym/tools/release_diff.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1676f4b7750fc8740cf2092ec0ce8cca7aa3e9f9e6db28f1f081cb40c9ed55"}},{"ruleId":"D2","level":"warning","message":{"text":"robustness.mutant_family (cognitive 17): robustness.mutant_family 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":"gym/tools/robustness.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1108beb0ab05f566eaef2cfc75ea53c6e97e52d2a73c3cf75e7b2e5a437b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeOwnerTransport._request (cognitive 17): NativeOwnerTransport._request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, ternaries 3 (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":"bindings/Flutter/lib/src/native_ffi.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ea16842ff781a4448cdb22fc4db3eeab927d44990f522e642d57b6a2c0e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTextureController._checkStatus (cognitive 17): NativeTextureController._checkStatus has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (6 pts), if/else 4 (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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"00badd2f488d316396cff26a1fd76b6a7d9865a19f7883ef84adf28dafa69a79"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfImportSession.importPdf (cognitive 17): PdfImportSession.importPdf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, error handling 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"945719cd6914ccdf2053546384c224caa5297b5adde99faa6618e87633fbecc0"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareReplace (cognitive 17): write-tools.prepareReplace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 887, 871). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"435086fe0db78811c834541bcc9aa42bc18c291346e1136f6e925c7ef7f2830e"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareTable (cognitive 17): write-tools.prepareTable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1226, 1245, 1260). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31c884e7863cd78873507178f4f37661faa6c01e4612e3be820dd04647504c7"}},{"ruleId":"D2","level":"warning","message":{"text":"write-tools.prepareCellSize (cognitive 17): write-tools.prepareCellSize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1720, 1743). 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e1caf7803d42724fc77a39f8496ecaaae2b217bd8a265339c7e3dd87937112"}},{"ruleId":"D2","level":"warning","message":{"text":"AiPanel.send (cognitive 17): AiPanel.send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (6 pts), boolean chains 2, 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafe84f09e6f1ec9d6a647222a545e6668c0a4938e404eccf137ae2a8aac6304"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.fillMissingParaAnchorsFromPageLayout (cognitive 17): diff-engine.fillMissingParaAnchorsFromPageLayout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), error handling 1 (2 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a3b1cc1e999bf811c22fe4febbb3fd8cd4aa360f5b6bdbe0848dd4c3953884"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.parseSfntNameTable (cognitive 17): local-fonts.parseSfntNameTable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba87747a6b54cbe838f90854b997c434e82d1f59f013c41adfb44b9d658464"}},{"ruleId":"D2","level":"warning","message":{"text":"font-substitution.parseCssFontFamilyList (cognitive 17): font-substitution.parseCssFontFamilyList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b365789bc6d49d7c03ee5d79261d419ebe3338f812c179d93be2cc7bf699cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"virtual-scroll.resolveAutoPageColumns (cognitive 17): virtual-scroll.resolveAutoPageColumns has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 5, if/else 4 (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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79ae74dc42ae251a85dee4b9d020862441f256e3a73228f02d24005910e447d"}},{"ruleId":"D2","level":"warning","message":{"text":"image-effect-pixels.applyLayerImageEffectPixels (cognitive 17): image-effect-pixels.applyLayerImageEffectPixels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/image-effect-pixels.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"892b217200034077c4d1d236005dd310bd977ac1ddb21da99969d6291f68a421"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.drawCachedText (cognitive 17): CanvasKitLayerRenderer.drawCachedText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, error handling 2 (4 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4565}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a09bdec7f2d3c8f08c66c50f1c130a010f27f50d83c63aa42ad61b3b6d68a7"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer.prefetchLayerImages (cognitive 17): PageRenderer.prefetchLayerImages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, error handling 3 (4 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 2). Of this number, 9 points are the body\u0027s own statements and 8 belong to 6 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8e890caacce73c70703535a6cfdd395bdc55d0009736f8da7ec7b664a88ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderScheduler.runVisibleSlice (cognitive 17): PageRenderScheduler.runVisibleSlice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 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":"rhwp-studio/src/view/page-render-scheduler.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adf4b0b8657d7d2a70209bb32b6619c79bf1f21a372d1c9a235293f60f88ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-hyperlink.hyperlinkAtPointer (cognitive 17): input-handler-hyperlink.hyperlinkAtPointer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1, 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa48fca602702ab658b1d8151c8f9b1a40f43017063af3e3bbb6ab3dca0ec35"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.handleHeaderFooterNavigationShortcut (cognitive 17): input-handler-keyboard.handleHeaderFooterNavigationShortcut has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), ternaries 1 (2 pts) (nesting depth added 2). 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6abf9a3889c9f13a0e07305da0a423a07a7aa0624cda49f467f83f8204aebfc"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.finishPictureMoveDrag (cognitive 17): input-handler-picture.finishPictureMoveDrag has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, if/else 4 (5 pts), ternaries 1 (4 pts), loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef024fa38cb4cf65bdb2fbeb25d0436436091e60bc09c09b942195b528564afe"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.showTextboxPlacementOverlay (cognitive 17): InputHandler.showTextboxPlacementOverlay has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f28fbce669c012a2c0e67ac45485cceab60a9f9b1b9a7fa2c3463f53abff58"}},{"ruleId":"D2","level":"warning","message":{"text":"EquationPropertiesDialog.handleOk (cognitive 17): EquationPropertiesDialog.handleOk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item 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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c3a7b2c24e26a1b3d0eb76df603c658b72f3477efe690d0f383ee2971877a4"}},{"ruleId":"D2","level":"warning","message":{"text":"classifyDownload (cognitive 17): classifyDownload has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. Of this number, 16 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. 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":"rhwp-shared/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2caff4525bc7819ac1b71db05ea2ecf2c6f824905f7b8f92448017a3155f15"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp_ooxml_chart::data::attr_value_span_in_tag (cognitive 16): rhwp_ooxml_chart::data::attr_value_span_in_tag has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 5, if/else 2 (5 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/rhwp-ooxml-chart/src/data.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de15a520c89b9a7d328596536ff66562e90d2a7a7e148c3baa0d88e1d41db26"}},{"ruleId":"D2","level":"warning","message":{"text":"RemapCtx::shape (cognitive 16): RemapCtx::shape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"067818b114ed84ca2ba2c40a1b63a172eb626d9623eb65938dfea3b546e6e52e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::para (cognitive 16): Scan::para has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/validation/support.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ef71955193f69eb4d0525fbffd7a9b23570256dac58bcc6f11d9ca2223192e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::control (cognitive 16): Scan::control has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, loops 1 (2 pts), 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":"src/document_core/commands/paragraph_block/validation/support.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3894615bc027273b6119f700889059c3ed6da0a7d6a83dd7f5568324fe7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::extract_page_range (cognitive 16): DocumentCore::extract_page_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"src/document_core/commands/page_extract.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a398cf490ec3b5ce7dd3b35e58324f6c8e6348d0be43536cd085ce18b6cf62"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::template_field_target_native (cognitive 16): DocumentCore::template_field_target_native has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template_select.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc090c7d425af65ac2acbd5d5c301f171a61c381a578e585e6e85e52477154"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::flush_cell_format_vpos (cognitive 16): DocumentCore::flush_cell_format_vpos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c298818eb17146d399b112406014b85305e3cb0810d205ecea883efd4486bc"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::merge_paragraph_in_cell_by_path (cognitive 16): DocumentCore::merge_paragraph_in_cell_by_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e2cd6ca80008687f242daaf6cc706f75fdc1e37e66535ce87b8aae9e541c16"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::set_cell_field_text (cognitive 16): DocumentCore::set_cell_field_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f8c242d326166bcb277bd9477973f3425b6d44e100959c0bcc22c468c3e83b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCore::resize_control_at (cognitive 16): DocumentCore::resize_control_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"32038fc1e78400a42ecce97ff43354a97fd17656b0dd183772cbcfa07c937b77"}},{"ruleId":"D2","level":"warning","message":{"text":"LegendLayout::new (cognitive 16): LegendLayout::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 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":"src/ole_chart/legacy_legend_layout.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9cefd29b075b4d0d9dbcd65c71fae1a90c48369402d84422fd174fe43f3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"MetafileFonts::register (cognitive 16): MetafileFonts::register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_fonts.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba209ce9f755a3ab6252398783e4fb07099c0c229485f77d402808378e1941f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadState::warn_if_unsupported (cognitive 16): ReadState::warn_if_unsupported has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 1 (3 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":"src/parser/hml/reader.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c6f1e3dd006bac70b43a721b509ee0e5e2431b0c2076f3ecec7f2088134592"}},{"ruleId":"D2","level":"warning","message":{"text":"Hwp5BinResolver::resolve_limited (cognitive 16): Hwp5BinResolver::resolve_limited has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (7 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":"src/parser/mod.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"2165b155e1fe143787c44573d018e9bae5af1dd014a12285995ff6136eec8e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasRenderer::render_layer_node (cognitive 16): CanvasRenderer::render_layer_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"259062ba98d391df35d8e55062764b7a060f9631ba37b46bebfdd8a2d00284b9"}},{"ruleId":"D2","level":"warning","message":{"text":"EqLayout::layout (cognitive 16): EqLayout::layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 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, 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":"src/renderer/equation/layout.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc92856d88c33dc18d18bf0de1653139c8030c5e04ecb94d697d5e4cff65066"}},{"ruleId":"D2","level":"warning","message":{"text":"HeightMeasurer::estimate_footnote_area_height (cognitive 16): HeightMeasurer::estimate_footnote_area_height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 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":"src/renderer/height_measurer.rs"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc37c41344a5242d1068c798648703e944bbf58cc94b11262459db424f1dac3e"}},{"ruleId":"D2","level":"warning","message":{"text":"KerningParagraphBreakSession::find_fitting_end (cognitive 16): KerningParagraphBreakSession::find_fitting_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 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":"src/renderer/kerning.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"7848baf6b57d2291b857bedc955e57363701db16becbeb6f50aa13b87e555e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::row_cut_first_source_frame_height (cognitive 16): LayoutEngine::row_cut_first_source_frame_height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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":"src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f513263e7982fa8b107715d0d854da503aa1e24b3f196e3c889601a1d1863a01"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_overlay_text_cell_origin (cognitive 16): LayoutEngine::stored_overlay_text_cell_origin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, 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":"src/renderer/layout/table_layout/stored_overlay_text_frame.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e70e6203c2fd9bb29f5f15eea478705ee5daaf04c5a1d1bc6e3437a67036d3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_shared_span_cut_owner (cognitive 16): LayoutEngine::stored_shared_span_cut_owner 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":"src/renderer/layout/table_layout/stored_shared_cell_frame.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af2d92e6b7d7e3b5739c6f573c03de178f9148e4001e8718103cc9289f54cda"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_initial_plain_text_frame_height (cognitive 16): LayoutEngine::stored_initial_plain_text_frame_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eaffc0a4f8b61f0fd5f4d460e199ea12de1bf3e03cdc4331c4e30fa741a790"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutEngine::stored_plain_nested_frame (cognitive 16): LayoutEngine::stored_plain_nested_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23319d15e5537bec93e5de60b8859f7b7ffb960a7dced69f1c0aa70e91059a6"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderNormalizationOverlay::register_rebased_source_frames_with_storage (cognitive 16): RenderNormalizationOverlay::register_rebased_source_frames_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a4890f89bf86d7ba46ba3ada6f213b2d595e8fb3588d8ca8f91a34ae88f52b"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgRenderer::ensure_arrow_marker (cognitive 16): SvgRenderer::ensure_arrow_marker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 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":"src/renderer/svg.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e39ad04f242f27426219feb60b566a150ce52dfa1f54776b992a229e42a9bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"TextFontCoverage::register (cognitive 16): TextFontCoverage::register has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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":"src/renderer/text_font_coverage.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"940aae0f5e4ba68b960b5f9b1341d4fb17887e9d0affb7a7d4787fecd91bec26"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetState::resolve_computed_float_first_line (cognitive 16): TypesetState::resolve_computed_float_first_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"src/renderer/typeset/state/computed_float_line.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f42cbb02c8416a78e060a5ece5ab139803a8a9daafe5a47771a7d43a4f16455"}},{"ruleId":"D2","level":"warning","message":{"text":"RowBlockQuery::candidate (cognitive 16): RowBlockQuery::candidate has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 4. 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":"src/renderer/typeset/table/scan.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3885964e69257192dcf0a5c273b43fbf0d2951af7e94618b49e3081dc23fd037"}},{"ruleId":"D2","level":"warning","message":{"text":"RowBlockQuery::row_offsets_for_cut (cognitive 16): RowBlockQuery::row_offsets_for_cut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"src/renderer/typeset/table/scan.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ec668244c0eeee40bcc73ca73b1cb9effcc59afdb36dd711cfd4753aa429e5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::replay_endnote_column_extent (cognitive 16): TypesetEngine::replay_endnote_column_extent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1, 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":"src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d034f8dd867b113543d4516c9493a237863323a0ed543ab3c8944b4f3afb5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypesetEngine::keep_heading_with_following_block_with_storage (cognitive 16): TypesetEngine::keep_heading_with_following_block_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, 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":"src/renderer/typeset/section/heading.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfd19e41c058220c7f3fb44e6d0628f7a04069f88a71daad8e781a425052e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::draw_line_with_resolved_width (cognitive 16): WebCanvasRenderer::draw_line_with_resolved_width has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f493f86360ef08499f06e6ded9320beb4785995d4986956d0faa493e790794b"}},{"ruleId":"D2","level":"warning","message":{"text":"WebCanvasRenderer::render_form_object (cognitive 16): WebCanvasRenderer::render_form_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e969b0a31b71a3f7ce6c5580079b1e8b2f8f445be039a30c72a2079bbbb00"}},{"ruleId":"D2","level":"warning","message":{"text":"HwpDocument::group_shapes (cognitive 16): HwpDocument::group_shapes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 pts) (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":"src/wasm_api.rs"},"region":{"startLine":5295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b713392e88ca5cfd5aec30164d4cc4c43c781de661b7948e140ff8ae3e1c37b"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGPlayer::generate (cognitive 16): SVGPlayer::generate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f318f790d2583542638bc7848f02c8cadae11d8e2bbb008bc94a4fc1078567"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::doctor::run (cognitive 16): rhwp::bin::rhwp-agent::doctor::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 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":"src/bin/rhwp-agent/doctor.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ba18395727acad22256cc460efbb144f045ef74c8e97c5f92866decade362e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::lookups::run_digest (cognitive 16): rhwp::bin::rhwp-agent::lookups::run_digest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"64af0aa5efa43d364a6bc3288f99bc8374cfc294be70d794e9317c62786ed823"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-agent::stats::run_hangul_ratio (cognitive 16): rhwp::bin::rhwp-agent::stats::run_hangul_ratio has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 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":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c69d0dbd381d4b16ada4b8c1b2deaf02f2133d5c1f8446e4ed4d017ee189ead"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::commands::rhwp-q-font-trace::parse_args (cognitive 16): rhwp::bin::rhwp-q::commands::rhwp-q-font-trace::parse_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2011598d48a2c33a75853ab57b3264e1242e5595a8b01c9e6efd728b0db40dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::bin::rhwp-q::kit::search_all::run (cognitive 16): rhwp::bin::rhwp-q::kit::search_all::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (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":"src/bin/rhwp-q/kit/search_all.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5a3a1a1c73a8e3a4eb0dd7d92002204907f18a5983e7dd8e28089c4f8f8da4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::batch_convert::record (cognitive 16): rhwp::cli::commands::batch_convert::record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 5 (6 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":"src/cli/commands/batch_convert.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd673832093dd31b7acf1cfdbe825c79336bb06bf25720392c91898160e77544"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::cli::commands::pdf_import::execute (cognitive 16): rhwp::cli::commands::pdf_import::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, 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":"src/cli/commands/pdf_import.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a4032ed6bc345e2a8191994da4da4571ad10717f0d7ae9551a6ee15055c27"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_inventory_diff::run (cognitive 16): rhwp::diagnostics::hwp5_inventory_diff::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"722d93a94ae203a2a97a611fc37978b8917867285c83b5e7ea0209d377972b39"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::hwp5_inventory_diff::table_probe_axes (cognitive 16): rhwp::diagnostics::hwp5_inventory_diff::table_probe_axes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96c1c6346092b7ba81767187d2245fb0064a6bec725b1ebea511d1e95e428f6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::diagnostics::ir_field_sweep::split_top_level (cognitive 16): rhwp::diagnostics::ir_field_sweep::split_top_level has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7b67578b54908099d072f78d028d3472a71c6e261960b0a1c9d944212e6c30"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::doclang::adapter::paragraph::convert_paragraph_prov (cognitive 16): rhwp::doclang::adapter::paragraph::convert_paragraph_prov has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), loops 1 (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":"src/doclang/adapter/paragraph.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6923b06db12ba5067bf95421dac2278400e37787d3f024fda4026c76fbe909a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::commands::foreign_paste::collect_max_field_id_from_shape (cognitive 16): rhwp::document_core::commands::foreign_paste::collect_max_field_id_from_shape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8741a533485028ef8b4fd0a9e66855a65621d55a01793c70529c80832ef9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::content_fonts::shape (cognitive 16): rhwp::document_core::queries::content_fonts::shape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"src/document_core/queries/content_fonts.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd54423c04946fdc08677aa57e71e916357659e023bbdbf9bdf4d48ba91152"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::field_query::field_content_start (cognitive 16): rhwp::document_core::queries::field_query::field_content_start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993a0f0bc304755f7b4be772a23b63a7f908e0fe8f551655b605d0852d6331e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::injection_scan::scan_instruction_override (cognitive 16): rhwp::document_core::queries::injection_scan::scan_instruction_override has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 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":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c2ac390219f96ddd5baf1b8b6ba8dadf78f0ebc6473d72d140aee805372d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::document_core::queries::rendering::floating_image_stack_extents (cognitive 16): rhwp::document_core::queries::rendering::floating_image_stack_extents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 2, loops 1 (nesting depth added 4). Of this number, 14 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9acf0288d79d679f82c78837c0d7652e19af62e66df219ac018ca62fe876e2"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::native_host::clipboard::clipboard_selection_size (cognitive 16): rhwp::native_host::clipboard::clipboard_selection_size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"src/native_host/clipboard.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"41798f59d0bf9dd281a5e986fe0150dcad2c7a3ab2ca9b21f2c2224f086199fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::ole_chart::preview_palette::preview_image (cognitive 16): rhwp::ole_chart::preview_palette::preview_image 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":"src/ole_chart/preview_palette.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db95c7d52afa272abf6587fdfa7b5626f892494610730c7a11bed0ebc82bcad"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::equation_paren_json::delimiter (cognitive 16): rhwp::paint::equation_paren_json::delimiter 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":"src/paint/equation_paren_json.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ca75328df401554bb63d36bbfc4c86a7d1239cf0c84f0dacfc4bc5a469b457"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::font_glyph::decode_font_bitmap_glyph_payload (cognitive 16): rhwp::paint::font_glyph::decode_font_bitmap_glyph_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, 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":"src/paint/font_glyph.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef31701637ff3b3599b2a0a2a17d61d8d147f90996715e3f5eea5843a48b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_font_resources (cognitive 16): rhwp::paint::json::write_font_resources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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":"src/paint/json.rs"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"da248f6f05df0fe58ced78bb33555b9fc8781bb1589a9d71c941c420a9e219dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::json::write_glyph_clusters (cognitive 16): rhwp::paint::json::write_glyph_clusters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), 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":"src/paint/json.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4d9bd29f2f565bc64ad3fbb62aabb0592d16d09320a7dabaeb46ccd9236d18"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::paint::text_v2::line_break_risk_for_run (cognitive 16): rhwp::paint::text_v2::line_break_risk_for_run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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":"src/paint/text_v2.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f17ac4bb602b59ce64d42c867ab63b5794064f67495987e5190b59ff9160e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::parse_hwp_with_lenient (cognitive 16): rhwp::parser::parse_hwp_with_lenient has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 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":"src/parser/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77748de7ea3f9c9c8d93d638ac6f20d0f082f366f65a95729a2eccb79af2aaf"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::body_text::drawing_text_structure::validate (cognitive 16): rhwp::parser::body_text::drawing_text_structure::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text/drawing_text_structure.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad4fff6368d5714faf3de2f3fe522519695b48e9e319ec00b74f0074c06462"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::section::parse_hwpx_line_width (cognitive 16): rhwp::parser::hwpx::section::parse_hwpx_line_width has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e65894087a803b59d879e06e221ea90392a593280afae4c191f234fa850fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::hwpx::tracked_changes::project_lists (cognitive 16): rhwp::parser::hwpx::tracked_changes::project_lists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, 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":"src/parser/hwpx/tracked_changes.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"341f9dc2cd797210d58f9a3576b3ab7188e7ba61a7319b9acc9d3ddd9235440e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::ole_container::extract_dib_as_bmp (cognitive 16): rhwp::parser::ole_container::extract_dib_as_bmp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"src/parser/ole_container.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"73915787d73d58bb4862028e031c04656462182c414ddcad277815045c0b3153"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::editable::restack_columns (cognitive 16): rhwp::parser::pdf::editable::restack_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), 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":"src/parser/pdf/editable.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdfdd65eb1492a0e1f5d2b7cb0ee3eed06bf47deb7314e33bd6897838fa2039"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::structured_lowering::materialize_positioning_tabs (cognitive 16): rhwp::parser::pdf::structured_lowering::materialize_positioning_tabs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c93ac8cfe54081f1b7c1cd0980ecb850b348295a11e9aabc8229de1a2d8b55"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::parser::pdf::table_paint::fragment (cognitive 16): rhwp::parser::pdf::table_paint::fragment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (5 pts), boolean chains 3 (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":"src/parser/pdf/table_paint.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e3bd35a2ad829f32c333ea10880199c3465029e5746857d3e512f8dc08c440"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composed_line_tac_object_height_px (cognitive 16): rhwp::renderer::composed_line_tac_object_height_px has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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":"src/renderer/mod.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d1402e2a77f9eeae7bb519a96fa47cf399747f73877684c8d42a6489a5e420"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::no_lineseg_square_table_host_band (cognitive 16): rhwp::renderer::no_lineseg_square_table_host_band has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4, 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, 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":"src/renderer/mod.rs"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0aa9a32cacfc2038b3364bfb2707f7b5fac3c0bcf9a6516ec3afebaa81790e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::arabic_context::neighbor_kind (cognitive 16): rhwp::renderer::arabic_context::neighbor_kind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"src/renderer/arabic_context.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3909a515a6e87d6433fb3622411e6fdf4d67cc91c8acc8388aa7a36333ea00c5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::composition::inc::tac_next_line_full_spacing (cognitive 16): rhwp::renderer::composer::composition::inc::tac_next_line_full_spacing has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 14, if/else 2. 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9e8d8dd5af2a2070d1d8c0c67a953ac192662ed4d72826cdaa3d12ebd4fdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::line_breaking::try_measure_token_chars (cognitive 16): rhwp::renderer::composer::line_breaking::try_measure_token_chars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c0ac0cc16b43ea2c8cb5ae4002d03efb761dc1dc4aa7e9f5508abcfabb95f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_marker_frames::project_with_storage (cognitive 16): rhwp::renderer::composer::stored_marker_frames::project_with_storage 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":"src/renderer/composer/stored_marker_frames.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66de8b825ba5c89b0f21f18ed413f4aff3b832dcbd95485a44cd24ee3164724"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::composer::stored_tac_display::inc::caption_height_px_in_context_with_storage (cognitive 16): rhwp::renderer::composer::stored_tac_display::inc::caption_height_px_in_context_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33163be564af117fb123150cdfaf1de602850a350538b263a89073d06aad160"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::document_script::tokenize_with_display (cognitive 16): rhwp::renderer::equation::document_script::tokenize_with_display has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 1 (2 pts), 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":"src/renderer/equation/document_script.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39c2213bdbc10d6ae2ea25f6712d12719d4aa3559b921031e6d1ae65245e4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::fraction_sup_frame::line_extension (cognitive 16): rhwp::renderer::equation::fraction_sup_frame::line_extension has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"src/renderer/equation/fraction_sup_frame.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"950584fdfc80518f9bf6a68469b84e863733aab661de56853946c6c0dfd56300"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation::layout::estimate_text_width (cognitive 16): rhwp::renderer::equation::layout::estimate_text_width has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), 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":"src/renderer/equation/layout.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669e0360bfa4bc5e4386b0f29a2cd3832225868044cd61bfde0034dedba7e69"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::equation_tac_flow::compute_equation_only_tac_line_flow_with_storage (cognitive 16): rhwp::renderer::equation_tac_flow::compute_equation_only_tac_line_flow_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, 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":"src/renderer/equation_tac_flow.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3002a994070dadc0c8402800dba8737aff047fff8733d64520f5f3a74eeb193b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::float_placement::resolve_float_exclusion (cognitive 16): rhwp::renderer::float_placement::resolve_float_exclusion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":8096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed76c0cea71ce90769c332835593219cac13da9ee8cd56d9792ad279b9d55f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::height_measurer::fit_measured_table_nested_tail_to_declared_height_with_storage (cognitive 16): rhwp::renderer::height_measurer::fit_measured_table_nested_tail_to_declared_height_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), loops 1, match/switch 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a1782d99c7db92c7b44cf3e5d54db2919ad007f998dfc6c6e2ba0cece4d758"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::image_resolver::jpeg_is_four_component (cognitive 16): rhwp::renderer::image_resolver::jpeg_is_four_component has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 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":"src/renderer/image_resolver.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a8af272b1fa5a83d03aba88166e99631c4e6cfb15fda5658bfd2cb7cb331e4"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::inline_flow::stored_host::plan_stored_empty_square_host (cognitive 16): rhwp::renderer::inline_flow::stored_host::plan_stored_empty_square_host has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, match/switch 1 (2 pts), loops 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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cbf80ec8d413f287ef8ec17316e25a3f87e9be0bb961e35a368d422306996e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::kerning::apply_pair_candidate (cognitive 16): rhwp::renderer::kerning::apply_pair_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/kerning.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8287205ae7e24957caf0a0aea914f98708064c5cc0d6934bb871b324ef6e2b73"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::collect_top_level_table_spans (cognitive 16): rhwp::renderer::layout::collect_top_level_table_spans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 pts) (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"f096c3041a7d3297cca4f586473011bb8143f4ef31042ce8af65135167747867"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::merge_edge_slot (cognitive 16): rhwp::renderer::layout::border_rendering::merge_edge_slot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c2b14768fcdc418f4a5f56a44e17e03e39f6d13199c9ef399251b6c9fdf94"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::border_rendering::collect_cell_borders (cognitive 16): rhwp::renderer::layout::border_rendering::collect_cell_borders has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 4 (8 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be75fea48f874e608ce113d25305949ef49e028ec9b3e8297c05f4865be6193"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::note_separator::append (cognitive 16): rhwp::renderer::layout::note_separator::append has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (4 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":"src/renderer/layout/note_separator.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f3367c7cc1a4847a59a0d369b69239e4bd4e274f16ef82f5f4db9a3ed1f9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::layout::paragraph_layout::collect_shape_marker_labels (cognitive 16): rhwp::renderer::layout::paragraph_layout::collect_shape_marker_labels has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 4 (5 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eafb03051bd969d01f797bb89b1d10572db5b30f85e1c594c6848c4a7c89f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::print_image_sampling_core::weights (cognitive 16): rhwp::renderer::print_image_sampling_core::weights has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/print_image_sampling_core.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"de24b2b4e15420ffefd37156bcd36659002461f37734c181955ae75908e9d9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::svg::svg_selected_font_data (cognitive 16): rhwp::renderer::svg::svg_selected_font_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":4970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6adfe37add75e6d6e9d7ee976dd1c373ae3545ea831c530e8157f162ee7e297"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::native_hwp5_figure_table_overlay_guide_empty (cognitive 16): rhwp::renderer::typeset::native_hwp5_figure_table_overlay_guide_empty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, 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":"src/renderer/typeset.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e427fdee5871860e068e3b8f0a4208ac9f1d6c87900ec7b4a87ce9343ec36e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::tac_control_indices_for_line_with_storage (cognitive 16): rhwp::renderer::typeset::tac_control_indices_for_line_with_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"26af2c3ddd3a7171e9c17f2880fee69647e22bc9283c3435188e5602d80be49e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::controls::flow_table::place (cognitive 16): rhwp::renderer::typeset::controls::flow_table::place has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"src/renderer/typeset/controls/flow_table.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3df5dd83a550516757a393e3899f7e588bea020263469b29e372b758eea339"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::renderer::typeset::notes::endnotes::debug::debug_print_endnote_line_segments (cognitive 16): rhwp::renderer::typeset::notes::endnotes::debug::debug_print_endnote_line_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"src/renderer/typeset/notes/endnotes/debug.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bf7e1f88470c091dcda4fac11ce407f5fd4024bae68de54152ee3280389a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::scaffold::validate_outline_numbering (cognitive 16): rhwp::scaffold::validate_outline_numbering has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), match/switch 1 (3 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":"src/scaffold/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"beccb22ed38e5fb4f3efce3f37ec4e977380496e698914470077267870ee6fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::control::ole_drawing_with_shape_component_contract (cognitive 16): rhwp::serializer::control::ole_drawing_with_shape_component_contract 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":"src/serializer/control.rs"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6140e669628813fce52588360bc7b8ca1ba434e286c980091167426d4150f5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::content::write_content_hpf_with_scripts (cognitive 16): rhwp::serializer::hwpx::content::write_content_hpf_with_scripts has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (9 pts), if/else 5 (7 pts) (nesting depth added 3). 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":"src/serializer/hwpx/content.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24f1599272e7b9888e7d319d48cbe43aaa363d6a1809fcb42f5e5734dcccf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"rhwp::serializer::hwpx::roundtrip::diff_documents (cognitive 16): rhwp::serializer::hwpx::roundtrip::diff_documents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 3 (4 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ef5d5c3bfc51393ad6c8f0b43e3641eb497e4fbf0ed7e7bdb007a916f751e6"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.score_task (cognitive 16): runner.score_task has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), error handling 2 (4 pts), if/else 4, 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":"gym/core/runner.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a7feb631b2d4bb36df919064353cc2bfe32ab9b023e3ed29be65c320cb3ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_audit (cognitive 16): evidence_report._validate_audit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, 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":"gym/tools/evidence_report.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a5b28d11789449937dd7bdc912619b9d3d030b1bf1bd80cde255190308c34f"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_authority (cognitive 16): evidence_report._validate_authority has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, 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":"gym/tools/evidence_report.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a68f403dc3e347f8246430aa0c35bbfd780081b282ec996b060a88ee7a0b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_report._validate_process_sidecars (cognitive 16): evidence_report._validate_process_sidecars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (3 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":"gym/tools/evidence_report.py"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac0fa354fd7fd685dba17107f6550e2aa940968b8c31b63947a98ce68429002"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTransport._handleResponse (cognitive 16): EditorTransport._handleResponse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (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":"npm/editor/transport.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8e55b88f4ff4df5f786c56b1efa6439169f3b88c2cf97b08a73a131476f601"}},{"ruleId":"D2","level":"warning","message":{"text":"document-url-resolver.classifyGithubDocumentUrl (cognitive 16): document-url-resolver.classifyGithubDocumentUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"576a4e5ded60eabc92235c18d10069477ee9c494a1dc5e364eeda4030d6b9c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"download-interceptor-common.classifyDownload (cognitive 16): download-interceptor-common.classifyDownload has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b00bb7d799adebd1cca1367a245e7b6640e86b7d85301a52137a3e449fc756d"}},{"ruleId":"D2","level":"warning","message":{"text":"document-url-resolver.classifyGithubDocumentUrl (cognitive 16): document-url-resolver.classifyGithubDocumentUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11d10f080dce425c1a14b1a95893e7ce0327ad8a8acd0affd0239a145e573bd"}},{"ruleId":"D2","level":"warning","message":{"text":"download-interceptor-common.classifyDownload (cognitive 16): download-interceptor-common.classifyDownload has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. 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":"rhwp-firefox/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c99c2bccefc5a6f90d48aa9414695f654310357cb5aab8eafb61cc945725a41"}},{"ruleId":"D2","level":"warning","message":{"text":"document-url-resolver.classifyGithubDocumentUrl (cognitive 16): document-url-resolver.classifyGithubDocumentUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a8d71fa4491acf5d223edc23571012ae8e73f81ce57c5bd74d98c39245eb81"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.toOpenAiInput (cognitive 16): openai.toOpenAiInput has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (7 pts), loops 2 (4 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/provider/openai.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec8c5877d317f0846b132bb792706714a2e3b53480466839d7c263ee62dea16"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.buildAnchorPairs (cognitive 16): diff-engine.buildAnchorPairs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afa11318e22f5a318d86556f64d76ab442486ae76456116f3a67ea04c0371d8"}},{"ruleId":"D2","level":"warning","message":{"text":"diff-engine.textSimilarity (cognitive 16): diff-engine.textSimilarity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, ternaries 4, loops 1 (2 pts) (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06c0d99e4f2c1df70c55ed71ff4d8482fd9306e734b22f1ea4b6e782fb1ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"chart-data-target.hasAnyEdit (cognitive 16): chart-data-target.hasAnyEdit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff742ec78301a5db5446121a9caf2cd9dc650d6ebd90481aef956ba43233dc49"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.detectLocalFonts (cognitive 16): local-fonts.detectLocalFonts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (2 pts), 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"7588b221599c68bfe3f829873a3d6f7515cf1f1833f4b4e6ab4f360c2fcba857"}},{"ruleId":"D2","level":"warning","message":{"text":"local-fonts.resolveRendererLocalFont (cognitive 16): local-fonts.resolveRendererLocalFont has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c09db44262f0ff016150ab092ef69fe028a715d690eb6657e839bb7078e246"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePuaFontSession.records (cognitive 16): NativePuaFontSession.records has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 2 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfabb6a410c8608056899008c6faf43c6bcb380654359590482bb481da16c20"}},{"ruleId":"D2","level":"warning","message":{"text":"sfnt-face.canvasKitSfntGlyphCount (cognitive 16): sfnt-face.canvasKitSfntGlyphCount has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 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":"rhwp-studio/src/view/canvaskit/sfnt-face.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb33bd5d73728b0cacc5c5a4fc986aa81179179ef93e2f4b015060118bdfdcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"static-svg-path-layers.hasStaticSvgUnsupportedMarkup (cognitive 16): static-svg-path-layers.hasStaticSvgUnsupportedMarkup 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"922374a1afa322a4228a942777743442f57821e59ea3288af6e73beab1620819"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasKitLayerRenderer.selectTextVariants (cognitive 16): CanvasKitLayerRenderer.selectTextVariants has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6cff677ab5eb43af6d0541efd2b1deb7f6657480924e5785c601022d218aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"cursor.findWordAt (cognitive 16): cursor.findWordAt has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 5, if/else 3 (nesting depth added 4). 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b9449aaf667059c02fd9e0663948be40ac72b6299a33cda9e714aba3bf07d8"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-connector.findNearestConnectionPoint (cognitive 16): input-handler-connector.findNearestConnectionPoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc380a49cdb631c8d5f56536dcec518197ed2da59d0b9fe3ed634f7227169a6"}},{"ruleId":"D2","level":"warning","message":{"text":"office-clipboard-images.inlineOfficeClipboardImages (cognitive 16): office-clipboard-images.inlineOfficeClipboardImages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 4). Of this number, 14 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876ad3bb3fd1a8d12a2a0feeb649f686e2d74f96611bc2d79d578ccda099349"}},{"ruleId":"D2","level":"warning","message":{"text":"office-clipboard-images.liftImagesToBlockLevel (cognitive 16): office-clipboard-images.liftImagesToBlockLevel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 4). Of this number, 14 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfcdd70e3ead5ccd840eb07a132d3e20d0b6a3c5ae78d569880a2d82e380320"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-keyboard.onCut (cognitive 16): input-handler-keyboard.onCut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece40484dcfc5c4d9950879fd7ecccb8a0b9a17a5a94ed659ace040fd578925e"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-picture.relocatePictureToDropPage (cognitive 16): input-handler-picture.relocatePictureToDropPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, error handling 2 (3 pts), ternaries 2 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf86500cd334ec82da85e025320fa47d9f88d076d09af27ac7bcb740bb53c0"}},{"ruleId":"D2","level":"warning","message":{"text":"input-handler-table.resizeTableProportional (cognitive 16): input-handler-table.resizeTableProportional has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, ternaries 3, error handling 1, loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b760c3bd43c195e773da669361f32fcad7aa9cad9294635eb8e41876eca79e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"TableObjectRenderer.renderMultiPage (cognitive 16): TableObjectRenderer.renderMultiPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), ternaries 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":"rhwp-studio/src/engine/table-object-renderer.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c89a259ade33165158204f797708b3fa4269b74552ca6ccf947384cac96d5"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.applyCharFormatToCellBlock (cognitive 16): InputHandler.applyCharFormatToCellBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), error handling 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 2259). 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4efa3061df62a5d0be80d8d18661122ddfd4f410d71c507c1cbf0478cdae61"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.findGuideTextRect (cognitive 16): InputHandler.findGuideTextRect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (visit). 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0357f7e0d698e397a6f6cab2a8e695d9bcfa80ebd3663b2aabf2a1de3b2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.renderRecentSubmenu (cognitive 16): main.renderRecentSubmenu has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"09265fd8bb979ea8e83dfd279746dcc22a06a3553fdf4ed8814535a9ae008059"}},{"ruleId":"D2","level":"warning","message":{"text":"recent-store.addRecentDoc (cognitive 16): recent-store.addRecentDoc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4, error handling 2 (3 pts), ternaries 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 156, 178). 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":"rhwp-studio/src/recent/recent-store.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b25fef0abe9b9f7b970e6db454e78a63ec1fdad6ca048d0fb19c6fcbc50b6"}},{"ruleId":"D2","level":"warning","message":{"text":"CellBorderBgDialog.updateDiagonalButtons (cognitive 16): CellBorderBgDialog.updateDiagonalButtons has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (4 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443175cf0b384684d5141aa4111d7e22f1a98db55cc5a21f4050e9146f426d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CellBorderBgDialog.updateDiagonalPreview (cognitive 16): CellBorderBgDialog.updateDiagonalPreview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1. Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7efc0875fe346e0d40aeab2b373fd4043d8d96c343a722b709dfeedda656a7"}},{"ruleId":"D2","level":"warning","message":{"text":"CharShapeDialog.saveLangFields (cognitive 16): CharShapeDialog.saveLangFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f6a063677b4ae0656210c5e73fdf3cd295983be6f23381089395322123720f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartDataDialog.onConfirm (cognitive 16): ChartDataDialog.onConfirm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 2, boolean chains 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87056487278a6a560e94cae8eff535076357c2f885242edfe100853267992c"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareResultWindow.renderSidePage (cognitive 16): CompareResultWindow.renderSidePage has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (6 pts), error handling 2 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 6 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"97247364d2203cffcd4d928105cb8730939dc4193c85cf2cb6cee0536300350d"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenu.show (cognitive 16): ContextMenu.show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 3 belong to 4 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":"rhwp-studio/src/ui/context-menu.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b8b2ca2ce6178e08e535b8623d31d6dee81c613a03d5b9fe3a98e8a79142e"}},{"ruleId":"D2","level":"warning","message":{"text":"#deleteRange (cognitive 16): #deleteRange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5, other 5, ternaries 2 (4 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e3fafd454011a8316112262454de666de1272362e4b0fad44f4990ea964156"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (4 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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/performance.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dd672bcbf7aae3abb5d6e6b92414ad9de19d0c3de7601f9d88a362d498056c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/table_layout.rs: FileTooLong \u2014 19660 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: LayoutEngine (2588-28765), declaring 52 free functions. The bar is 500 significant lines; this is 19160 over it, 39.32\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d1a98d3d0afdf8c0d7c0e4d0a36b9f23b29a312dc977d73d8fa3a6a2dce05c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentCore: TooManyMethods \u2014 1079 methods, declared across 85 files: queries/rendering.rs (136), commands/text_editing.rs (87), commands/document.rs (81), commands/table_ops.rs (65), \u002B81 more file(s). The bar is 30 methods; this is 1049 over it, 35.97\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f8b5807957987d3cfc88304d4f188dcfc1c1bc31b4ca98d3264624e1cf42dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.cell_units_uncached: MethodTooLong \u2014 cell_units_uncached runs 2446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2346 over it, 24.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14973}}}],"partialFingerprints":{"codehealthFindingId/v1":"f962d40f6ea03da133fe18c4f5275476bee69b2a1fb6b223092ac13d24dfa31e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayoutEngine: TooManyMethods \u2014 732 methods, declared across 72 files: layout/table_layout.rs (276), renderer/layout.rs (127), layout/paragraph_layout.rs (25), layout/shape_layout.rs (22), \u002B68 more file(s). The bar is 30 methods; this is 702 over it, 24.40\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":"src/renderer/layout.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95b946f9fe956ff39704fc86516c6064d7520fd6f9012048d032f726dedeed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/layout.rs: FileTooLong \u2014 11985 significant 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 102 free functions. The bar is 500 significant lines; this is 11485 over it, 23.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de05635d2852df5613a78da3023794ec801fceeef4530cd2a60048816e9106"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_horizontal_cell_paragraphs: MethodTooLong \u2014 layout_horizontal_cell_paragraphs runs 2080 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1980 over it, 20.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eccc62daf3251d3c099f73e816d353106a5f5d4e1766b78d354e9553c6392c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_composed_paragraph_in_frame: MethodTooLong \u2014 layout_composed_paragraph_in_frame runs 2057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1957 over it, 20.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8dfa1593246ad85f14f69e4924c5560a3ad3e7efd840f328d7e960d9e86471"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HwpDocument: TooManyMethods \u2014 582 methods, declared across 10 files: src/wasm_api.rs (536), wasm_api/layer_export.rs (21), wasm_api/host_font_environment.rs (6), wasm_api/hyperlink.rs (6), \u002B6 more file(s). The bar is 30 methods; this is 552 over it, 19.40\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":"src/wasm_api.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c685530e1d0859d8a44751c99b23aa02276641579aa9fd555af2f17c47fbeb1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.emit_table_fragment: MethodTooLong \u2014 emit_table_fragment runs 1919 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1819 over it, 19.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":"src/renderer/typeset/table/continuation/fragment/emit.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e2774cd6edb0b656d4a824b702eece0cbfc546079cdd0282d6dcb9259409ae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HwpDocument: TooManyMethods \u2014 565 methods. The bar is 30 methods; this is 535 over it, 18.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/public/rhwp.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff898d0f1c384d9d68be5217056f9af617152cda9a54b2533f8885a89ef411"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.prepare_block_table_entry: MethodTooLong \u2014 prepare_block_table_entry runs 1867 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1767 over it, 18.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":"src/renderer/typeset/table/block/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abdac60d273bc54e997be2b715bfe27d1f98d07dc9cc1b4a5aed6d59eed403a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HwpDocument: ClassTooLong \u2014 7330 significant lines (blank, comment-only and punctuation-only lines excluded), 565 methods. The bar is 400 significant lines; this is 6930 over it, 18.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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0079d2d3864aaa081ff28a5c42a40c906f68f646adabe815bd2011790972d4b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.typeset_endnote_paragraphs: MethodTooLong \u2014 typeset_endnote_paragraphs runs 1760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1660 over it, 17.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e17f6bfd4a54e5d38aa2c4bbb31677b803ef239c1bcc55491907a86a307f0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/paragraph_layout.rs: FileTooLong \u2014 8426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: LayoutEngine (2989-11934), declaring 76 free functions. The bar is 500 significant lines; this is 7926 over it, 16.85\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf6735159c0f6eca12f351a93e3848a81cd99c0c25a0753b7e900f86503073"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: public/rhwp.js: FileTooLong \u2014 8370 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: HwpDocument (73-13416). The bar is 500 significant lines; this is 7870 over it, 16.74\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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f275809c7df86270935d925dfcb8ec1a02d5c271309b414c1f5c44b50c599"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeightCursor.vpos_adjust: MethodTooLong \u2014 vpos_adjust runs 1674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1574 over it, 16.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":"src/renderer/height_cursor.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa499c2398949f40cd4d2920f9e0f003d935dca0c3156670017dc7b74a9f2b4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HwpDocument: ClassTooLong \u2014 6644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 582 methods, 7 blocks, lines 433-10370. The bar is 400 significant lines; this is 6244 over it, 16.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba62124bc2b3aa5472d14a2daee6c11b79d55c9d9c1670861bc124b8385875e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeightMeasurer.measure_table_impl_with_storage: MethodTooLong \u2014 measure_table_impl_with_storage runs 1610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1510 over it, 16.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":"src/renderer/height_measurer.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c10ceec162fb457b5f9de0c5cc8e973191e5a5740a9457d57baad783b5b99a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_partial_table_resolved: MethodTooLong \u2014 layout_partial_table_resolved runs 1605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1505 over it, 16.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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":6003}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb623bc851a79837a0fde67b43e6a71e58bedb2dd7531d62f57ffbf493a446ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.scan_ordinary_row_step: MethodTooLong \u2014 scan_ordinary_row_step runs 1424 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1324 over it, 14.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":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07dc9db013303f61bce97707430f302a670f854bac634d158e6120ad47772d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wasm_api.rs: FileTooLong \u2014 7108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: HwpDocument (7 blocks, 433-10370). The bar is 500 significant lines; this is 6608 over it, 14.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e5f147a3872907097b33b5b0c4e4b521d73a76a4f4914a28e7c0f6d616b137"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.prepare_table_fragment_budget: MethodTooLong \u2014 prepare_table_fragment_budget runs 1414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1314 over it, 14.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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff07ba4bfd69d59683e7508fad7c3a1cbf2e5b349cd099001494ab08b5f69b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/float_placement.rs: FileTooLong \u2014 6812 significant 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 185 free functions. The bar is 500 significant lines; this is 6312 over it, 13.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b3b255b1f745a47d84234368c4a7eaab055f729f48320e601914a86cb111c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/rendering.rs: FileTooLong \u2014 6740 significant 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 38 free functions. The bar is 500 significant lines; this is 6240 over it, 13.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fd1b28361b924f827e04f3b29bc5295643057127f47c07fc2ad97cd38c968"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmBridge: TooManyMethods \u2014 393 methods. The bar is 30 methods; this is 363 over it, 13.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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"36859f7a4736b2a3d8e5d9e0c050f07c4eb31514682a21689652c282b04a13aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.emit_line_runs: MethodTooLong \u2014 emit_line_runs runs 1283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1183 over it, 12.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":8880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e6552334feee98c3179daaa30ac79b327dabb19588388a6ee4cfa29cf5a2aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.prepare_block_table_continuation: MethodTooLong \u2014 prepare_block_table_continuation runs 1214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1114 over it, 12.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":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3c573cbdfa215a29af15c4ef251154de548c1136fdfae0f41b385826411c2e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CanvasKitReadinessBlocker: ClassTooLong \u2014 4824 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 4424 over it, 12.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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964a44ee5094ddd5ccc036f83ad1e85a935342312c8fcc7002454b03d49b476"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/table_partial.rs: FileTooLong \u2014 5716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: LayoutEngine (734-8395). The bar is 500 significant lines; this is 5216 over it, 11.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65369f402b94e4776a34f1ba15d15a1387187bca40335bf5c538261917dabf07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/canvaskit-renderer.ts: FileTooLong \u2014 5255 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: CanvasKitReadinessBlocker (376-6216). The bar is 500 significant lines; this is 4755 over it, 10.51\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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"340a8f06913d4c5f9f64a1f36c3dcdc0cfae870d4fe8c5c8f39b17223708f3bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InputHandler: ClassTooLong \u2014 4188 significant lines (blank, comment-only and punctuation-only lines excluded), 294 methods. The bar is 400 significant lines; this is 3788 over it, 10.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"20511765e050886893e640714a73ab558820846361f7f871d2a1b95361cd953e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_shape_object_with_group_origin: MethodTooLong \u2014 layout_shape_object_with_group_origin runs 1047 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 947 over it, 10.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ef2ceb6e57fcd1d81123bc2ead707e9794eb0e97901213feb35f38b569a69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/section.rs: FileTooLong \u2014 5096 significant 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 129 free functions. The bar is 500 significant lines; this is 4596 over it, 10.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":"src/parser/hwpx/section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8ab529fc27b931bbb13ec868b6ca27a725fd9d71bf641e9fb1b382ad6cf3f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypesetState: TooManyMethods \u2014 305 methods, declared across 11 files: state/commands.rs (120), typeset/state.rs (107), state/transition.rs (35), state/notes.rs (22), \u002B7 more file(s). The bar is 30 methods; this is 275 over it, 10.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":"src/renderer/typeset/state.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20dec69ea5e3587cbcde53e61b00832e12f187c6212d07b8fedfc759c91cd58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkiaLayerRenderer.render_node: MethodTooLong \u2014 render_node runs 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 905 over it, 10.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":"src/renderer/skia/renderer.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8af80b4f63a99e9252cfb9efe2ac216d6342ebeefeaf6aadd2ad38f1f05ab8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_textbox_content: MethodTooLong \u2014 layout_textbox_content runs 991 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 891 over it, 9.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e73f9f71bdc38260226f5b23b8d68557fc2f4b624f3ba20bdaf8baa354ea238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/text_editing.rs: FileTooLong \u2014 4942 significant 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: DocumentCore (3 blocks, 806-6885), declaring 40 free functions. The bar is 500 significant lines; this is 4442 over it, 9.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c17437c7bf57a8e5aa6744a968472f9e1196b0ac599f3eadde1b6b2efe1f3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InputHandler: TooManyMethods \u2014 294 methods. The bar is 30 methods; this is 264 over it, 9.80\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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf171cdf8e48c7b3c3c4e5421f9f7b0c29fcc44f16353e2001833df723fb56c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/cursor_rect.rs: FileTooLong \u2014 4740 significant 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 4240 over it, 9.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f012e66813da5fb52f4480621345ebcfcab305fb6511539d26b4c4da3890f0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/height_measurer.rs: FileTooLong \u2014 4717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: HeightMeasurer (3 blocks, 1819-7033), declaring 47 free functions. The bar is 500 significant lines; this is 4217 over it, 9.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81af4c10c6f6ebbe9682e03ef7dd933e9fd216499206c9938af7fef26f33da2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.query_tail_fit: MethodTooLong \u2014 query_tail_fit runs 917 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 817 over it, 9.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":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d469854eb3fede11e6bf38373ec75aa1eeaeb91a2702c3b2184448cca18cb35c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/typeset.rs: FileTooLong \u2014 4459 significant 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 124 free functions. The bar is 500 significant lines; this is 3959 over it, 8.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66852856b50090b440f11111398e8dd55e032e4488b386b51b8a51eba456dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler.ts: FileTooLong \u2014 4450 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: InputHandler (333-6643). The bar is 500 significant lines; this is 3950 over it, 8.90\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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a3730bf652ba2e9fc0bbf87c28ad20c1e2d8e18d9bae57da6bcc0b2e90166"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.place_table_with_text: MethodTooLong \u2014 place_table_with_text runs 884 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 784 over it, 8.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":"src/renderer/typeset.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"9457d3707797527a6fc43bdd737ce83d1e27c90fe6a90c53d9b75ff519b18e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_table_with_wrapper_margin: MethodTooLong \u2014 layout_table_with_wrapper_margin runs 873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 773 over it, 8.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a4ce09c16a2ecd7ea1e349033008a536aec819aab450b316f8fc70ebe94d58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkiaTextReplay.draw_text: MethodTooLong \u2014 draw_text runs 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 756 over it, 8.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":"src/renderer/skia/text_replay.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad976a11d95ffc127b673969f824e65f6319e8658bb4d436a4e148576bcf81b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HeightMeasurer: ClassTooLong \u2014 3163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 3 blocks, lines 1819-7033. The bar is 400 significant lines; this is 2763 over it, 7.91\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":"src/renderer/height_measurer.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2989a4f01b1a90ccc1e4a7788744f2e13e54538657294d8740b42a2fb46be889"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-mouse.onClick: FunctionTooLong \u2014 onClick runs 776 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 676 over it, 7.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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4011a2a90c417afd88719daf2b74fd31280a7056f2636c6030209f12d40748a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/shape_layout.rs: FileTooLong \u2014 3858 significant 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: LayoutEngine (737-5365). The bar is 500 significant lines; this is 3358 over it, 7.72\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab65ca14d6774fc8f5f48bc1a3111e3678f5bbd5dc1462238eac22104909d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.scan_table_fragment: MethodTooLong \u2014 scan_table_fragment runs 763 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 663 over it, 7.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":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccaaa887383ea5df432c50897962f7f67b335fe9274a4e2fe098351747aebbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/svg.rs: FileTooLong \u2014 3746 significant 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 75% of them inside a single declaration: SvgRenderer (3 blocks, 96-4280), declaring 31 free functions. The bar is 500 significant lines; this is 3246 over it, 7.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e698ade4ed093b6372a6bdc779b2d699fb05ec26a7e634d24c80a95d393b343"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebCanvasRenderer: ClassTooLong \u2014 2984 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 61 methods, 6 blocks, lines 413-4530. The bar is 400 significant lines; this is 2584 over it, 7.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5272ee8cfd6230aa9563391cec36260020d4c054541d5919c08dd73d6d9f7005"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_inline_table_paragraph: MethodTooLong \u2014 layout_inline_table_paragraph runs 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 625 over it, 7.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ce293e39e73f3e5b4fd75f0959ab9c7a6a79b802763b446bf273670cec9570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/section.rs: FileTooLong \u2014 3618 significant 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 150 free functions. The bar is 500 significant lines; this is 3118 over it, 7.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"646fdfafc29dfd1be5428610363b2f8149a00fc1d97df7f35d94c0825b4607e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwp3/mod.rs: FileTooLong \u2014 3579 significant 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 87 free functions. The bar is 500 significant lines; this is 3079 over it, 7.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":"src/parser/hwp3/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c244b9c322fdc89ef85f3095ed142fadb3774cf472333ee94384301400cf62c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SvgRenderer: ClassTooLong \u2014 2807 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 62 methods, 3 blocks, lines 96-4280. The bar is 400 significant lines; this is 2407 over it, 7.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0643108d1d2ee455e4a1f20a19441c192e06758d81b273a1eabbd2a37298759c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::read::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::read::extend runs 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 585 over it, 6.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":"src/cli/metadata/mcp/read.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad3fd72c29c9ec1a57c7908f1b3bd0f029425709e7194f790e5ae94b990f96b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.paginate_with_measured_context_with_storage: MethodTooLong \u2014 paginate_with_measured_context_with_storage runs 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a2c09f0dfd966d33f40dcb8cdc4ebd630e414ab6ec61177b3ea70446119a32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_hwp3_object_dispatch: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_hwp3_object_dispatch runs 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 571 over it, 6.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d014ca18a67cb951d2347d582750555b9699251b0ef550e333370b8d5a5a06f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_paragraph_list_inner: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_paragraph_list_inner runs 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 565 over it, 6.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":"src/parser/hwp3/mod.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15690db8eac2cf44ff9b15debf08f6d133717020bd66e10a5c63d78029f56a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/web_canvas.rs: FileTooLong \u2014 3291 significant 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 91% of them inside a single declaration: WebCanvasRenderer (6 blocks, 413-4530). The bar is 500 significant lines; this is 2791 over it, 6.58\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":"src/renderer/web_canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9351fa539250e045fa321f992d8067593cf1c6c129d7f97231a0db33bb2ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::edit_content::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::edit_content::extend runs 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 546 over it, 6.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":"src/cli/metadata/mcp/edit_content.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afefed1336cbc02dd2826da98e87a2565f9b990a748a4233b08187536f31356"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::edit_structure::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::edit_structure::extend runs 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 537 over it, 6.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":"src/cli/metadata/mcp/edit_structure.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5497d288c2d7b95719d4b59e5a1a9350913cd09a1b736d82524814e7a491a50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.get_selection_rects_for_target_native: MethodTooLong \u2014 get_selection_rects_for_target_native runs 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 522 over it, 6.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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0aadffbdbacf8275deb2ed3f6f8dcf533b2c8c994a999202b8a1e1783768fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-keyboard.onKeyDown: FunctionTooLong \u2014 onKeyDown runs 618 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 518 over it, 6.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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc1af51ae9853333898d4deb43e999a0c8e8eaf1dfbc26dcbcc7295e85a1487"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasmBridge: ClassTooLong \u2014 2455 significant lines (blank, comment-only and punctuation-only lines excluded), 393 methods. The bar is 400 significant lines; this is 2055 over it, 6.14\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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c425e9a19459901f6d85e07d32472ef2467978f5ff7c9cd1f62a2a8e569cefa3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypesetEngine: TooManyMethods \u2014 182 methods, declared across 51 files: renderer/typeset.rs (42), endnotes/fit.rs (26), paragraph/reflow_fit.rs (12), endnotes/measure.rs (8), \u002B47 more file(s). The bar is 30 methods; this is 152 over it, 6.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":"src/renderer/typeset.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e58040a5b08905b469effc6e26607db570126c91088056c2f3b8107c8f503e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaintOp.write_json: MethodTooLong \u2014 write_json runs 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 503 over it, 6.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":"src/paint/json.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fb13aa4106291173d7522e457e6c8183d9ffbcf77f22ec207060bd8fb27179"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/table_ops.rs: FileTooLong \u2014 2945 significant 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: DocumentCore (45-4162). The bar is 500 significant lines; this is 2445 over it, 5.89\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135a18714f5e735190f2bd9c99cc2e126402af1639b7270fcd7fa859067a4568"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_paint::partition: FunctionTooLong \u2014 rhwp::parser::pdf::table_paint::partition runs 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 488 over it, 5.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"16785c4eb6da4a7dd8e4ef6057d7ae298bbeb04791c89290a666b8019247078b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/json.rs: FileTooLong \u2014 2904 significant 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 95 free functions. The bar is 500 significant lines; this is 2404 over it, 5.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7729b80fa17dc58ada383ee8c6aa69fd67f19ce8540a308ff65061198f791bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::capabilities::extended::extend: FunctionTooLong \u2014 rhwp::cli::metadata::capabilities::extended::extend runs 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) in one body. The bar is 100 significant lines; this is 475 over it, 5.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":"src/cli/metadata/capabilities/extended.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"41713ee3f23a13220fb0c621ab0f402d72bfedfcf6f37344ae48ed7b0e28c847"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypesetEngine: ClassTooLong \u2014 2299 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 182 methods, 2 blocks, lines 371-6707. The bar is 400 significant lines; this is 1899 over it, 5.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3f26ff568b460b991d410db68c2f0a79a8134309fe3c6716708877c5079ad8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::skia::image_conv::draw_image_bytes: FunctionTooLong \u2014 rhwp::renderer::skia::image_conv::draw_image_bytes runs 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 454 over it, 5.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":"src/renderer/skia/image_conv.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f5a53796a7da7c1f63141224cf8984c3a7d55007a3ec468c02e9dce691c96c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::advanced::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::advanced::extend runs 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 449 over it, 5.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/metadata/mcp/advanced.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"28340c26e42c8e531f39ee72b50798aa2c3dc9304d0caaebe0e3195b9bc988a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking: FunctionTooLong \u2014 rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking runs 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 445 over it, 5.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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2119f94c1206fbb67e6a7b1895717fd5917abce55f148746a9972589d66c50d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::structured_lowering::lower: FunctionTooLong \u2014 rhwp::parser::pdf::structured_lowering::lower runs 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 440 over it, 5.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"029675249e25a3f6b6be2b525732706bb7535477c2309c4bb710d5cf4272d9b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/wasm-bridge.ts: FileTooLong \u2014 2692 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: WasmBridge (339-4165). The bar is 500 significant lines; this is 2192 over it, 5.38\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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb80cdcd4ba70b82f74315d8260e915df5464f84a529b87b17aadf15161aa56a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/mod.rs: FileTooLong \u2014 2685 significant 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 109 free functions. The bar is 500 significant lines; this is 2185 over it, 5.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c712c641ef3533130be814fdadfdb8816b2828e288bc2d1bfd015d7ead9040"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Paragraph: ClassTooLong \u2014 2127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 87 methods, 3 blocks, lines 38-3932. The bar is 400 significant lines; this is 1727 over it, 5.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":"src/model/paragraph.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c4787cd11d87fa95451287d543d1c2664121e4843f9e18a355370a8f5bfd79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.reflow_zero_height_paragraphs: MethodTooLong \u2014 reflow_zero_height_paragraphs runs 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) in one body. The bar is 100 significant lines; this is 426 over it, 5.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":"src/document_core/commands/document.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b9b7b771c88123cc10a48f574970d3ddbbb09158cc2ce17ea1d11170ee3556"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage runs 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) in one body. The bar is 100 significant lines; this is 425 over it, 5.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":"src/serializer/hwpx/section.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fcb1d5a10afce3af08f1e194b6d98ffc6a7b0bad67e08671ec1d6e3a57ad73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.typeset_tac_table: MethodTooLong \u2014 typeset_tac_table 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":"src/renderer/typeset.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"04086c04766f44020c8639db2647d17e4e9c23d646c84e4510bfd26129e99345"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableBuilder.build_inner: MethodTooLong \u2014 build_inner runs 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) in one body. The bar is 100 significant lines; this is 416 over it, 5.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c22013b21086c47621a9917547e58b6c339089ef7bfe3f10593fcc988e30a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_shape_item: MethodTooLong \u2014 layout_shape_item runs 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) in one body. The bar is 100 significant lines; this is 413 over it, 5.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":"src/renderer/layout/shape_item.inc.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"de76ff7ad0e4118ebb6594981772e52e2177abeee8eb747eecfd6fc6363fa345"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/document.rs: FileTooLong \u2014 2529 significant 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: DocumentCore (152-3999). The bar is 500 significant lines; this is 2029 over it, 5.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":"src/document_core/commands/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"823eed87db96c0b788e48547f888d24af329d5134381a450fdabe8a4865213f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_embedded_table: MethodTooLong \u2014 layout_embedded_table runs 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) in one body. The bar is 100 significant lines; this is 403 over it, 5.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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e5e45e4901dda86d26e2753cf2834e3b1bec51b80d5336aefa8a4f9a84ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.place_paragraph_controls_with_storage: MethodTooLong \u2014 place_paragraph_controls_with_storage runs 496 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 396 over it, 4.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"487fd0123c10cc8972c2e3a10573eead39f36d33463c264fc72b615395ecc8a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.renderTextRun: MethodTooLong \u2014 renderTextRun runs 494 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 394 over it, 4.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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"611401309966d643be005556589f1de8b8d6e1f77c7e672dd0284cf1d08e1f87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.query_initial_fit: MethodTooLong \u2014 query_initial_fit runs 491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 391 over it, 4.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df8fb6d06cda6d3ec529856bd4b7d4d234fb3ed9df333083bcfd4c8b4d81d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.draw_text_positioned: MethodTooLong \u2014 draw_text_positioned runs 484 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 384 over it, 4.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":"src/renderer/svg.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d4b6994a7078f5a2d5b1bb691028299de26cc32e67e96159ef3ff11b04e955"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PicturePropsDialog: ClassTooLong \u2014 1932 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 1532 over it, 4.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fb9d53d0364bbafa7a0e42ab8835657e9723d894face8302738e50a11e9c75"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HeightCursor: ClassTooLong \u2014 1929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 186-2916. The bar is 400 significant lines; this is 1529 over it, 4.82\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":"src/renderer/height_cursor.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de9071c19e2de7c73ea74668fd4479fd1ef0697cf62bb15c0e0d95ab0e20a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.render_node: MethodTooLong \u2014 render_node runs 473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 373 over it, 4.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":"src/renderer/svg.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f1647d07f01258b3af15e8a6b816ac2ac40df7c133a6a0bb799c6284a0cb82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::skia::equation_conv::render_box: FunctionTooLong \u2014 rhwp::renderer::skia::equation_conv::render_box runs 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) in one body. The bar is 100 significant lines; this is 371 over it, 4.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cfe81fc9ee87da27a91c1e341492a8f6c6b0950c0a3237d8f210f5dbf2c17d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serializer/control.rs: FileTooLong \u2014 2348 significant 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 108 free functions. The bar is 500 significant lines; this is 1848 over it, 4.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e1f98a072997003a7437a68dc50b692430949985ee38f58034dc7df54c39be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/structured_lowering.rs: FileTooLong \u2014 2324 significant 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 1824 over it, 4.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4228ace975ba6a93bb699b1c1b1713fe9b5f060ffd1935ee8debabb867ead70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/paragraph.rs: FileTooLong \u2014 2319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Paragraph (3 blocks, 38-3932). The bar is 500 significant lines; this is 1819 over it, 4.64\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":"src/model/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b680bbf47ad7f398beae39565301dff8aab06aa8c16aae48ea8247a11e0791e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pagination/engine.rs: FileTooLong \u2014 2315 significant 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: Paginator (226-3248). The bar is 500 significant lines; this is 1815 over it, 4.63\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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee253ba80aa87f455d21818667d662002e2efcd89632a5c5114396673c6957"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasKitLayerRenderer: TooManyMethods \u2014 138 methods. The bar is 30 methods; this is 108 over it, 4.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03918896e5cccc8c30b25b464cc9d9925c0461e36dee35e2427a745e7255626"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.parse_table_html: MethodTooLong \u2014 parse_table_html runs 455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 355 over it, 4.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":"src/document_core/html_table_import.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff387c7db6ce4ca9fe22a5cdcb5ce9b229585bbb96183f4e5c0e1f20701a2bb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::lowering::lower: FunctionTooLong \u2014 rhwp::parser::pdf::lowering::lower runs 455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 355 over it, 4.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":"src/parser/pdf/lowering.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"51264f23bdd3a116251e8d74245204aee8e0a007ae34f5b62be16b50d0c00b22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.prepare_endnote_emit: MethodTooLong \u2014 prepare_endnote_emit runs 455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 355 over it, 4.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":"src/renderer/typeset/notes/endnotes/prepare.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79ed96111c2a751f6afde785d5031968178dcde48e5a2cdabbbbba32af1e488"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp.__wbg_get_imports: FunctionTooLong \u2014 __wbg_get_imports runs 454 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 354 over it, 4.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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":14105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1aeb49587300cd7f529aeb45a728f7c6549f7b15bd3fda791a82d160d2544e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.advance_row_cut_inner: MethodTooLong \u2014 advance_row_cut_inner runs 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 354 over it, 4.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08aab1c3b7c3808e3bdae16ac85b0b6db9fdedb88ba41b2a4a0a7440721995"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page-scroll-probe.installPageScrollProbe: FunctionTooLong \u2014 installPageScrollProbe runs 445 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 345 over it, 4.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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7414bff7366b13f8e8c74062a642e979f36f742ef1efeb619ed1f541c26198cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.nested_table_mixed_fragment_heights: MethodTooLong \u2014 nested_table_mixed_fragment_heights runs 442 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 342 over it, 4.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fae15a13adbd7034cd1ceb975a26c7229a95c418569687394e0453579f8aae7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StateView: TooManyFields \u2014 132 stored fields. The bar is 30 stored fields; this is 102 over it, 4.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/state/data.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da390314d6772a2de7440fc7713d3f5cc4cfaf89b4bfc5a6c13d5d5a717f9040"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_vertical_cell_text: MethodTooLong \u2014 layout_vertical_cell_text 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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e25c111d301fea0d7c660c7e2bbf404e8d2b8c084a82ad293cb66a66959f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CanvasView: ClassTooLong \u2014 1718 significant lines (blank, comment-only and punctuation-only lines excluded), 99 methods. The bar is 400 significant lines; this is 1318 over it, 4.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f252fead6ff5931ba6d2e947110e031f789975cce74424ff5fdbe49f8348dca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SVGPlayer: ClassTooLong \u2014 1687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 26-2446. The bar is 400 significant lines; this is 1287 over it, 4.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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce6c5ad7cc47259ad35db78fc8d60f46643b7a779ca4365538d1aada2e17a0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.mjs: FileTooLong \u2014 2098 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 73% of them inside a single declaration: HwpCtrl (980-3720). The bar is 500 significant lines; this is 1598 over it, 4.20\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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49399e42918455191ec92c54cc1f03c7e2e12501996615e0eef72f69b8b7a269"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::empty_float::prepare: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::empty_float::prepare runs 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 318 over it, 4.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":"src/renderer/typeset/controls/empty_float.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c283e2ef845f2a896c2408e59132a658d47f626e5e036cbe4b4e74976d2ad2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.query_new_note_fit: MethodTooLong \u2014 query_new_note_fit runs 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) in one body. The bar is 100 significant lines; this is 316 over it, 4.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":"src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b776c0b280c9aecb2dc22f77ac2add450c172102e6681fe77b280139715b8b4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CursorState: ClassTooLong \u2014 1656 significant lines (blank, comment-only and punctuation-only lines excluded), 121 methods. The bar is 400 significant lines; this is 1256 over it, 4.14\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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"783063d633145e534356c97717df8aa5bf7f5e4e474e1ca772835663c73a2faf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/formatting.rs: FileTooLong \u2014 2070 significant 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 95% of them inside a single declaration: DocumentCore (152-2872). The bar is 500 significant lines; this is 1570 over it, 4.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":"src/document_core/commands/formatting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532b28c437e3f66c45289d9811d06b1405c24798dbe88f28a0e030870d2696c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::inline_flow::plan_with_storage: FunctionTooLong \u2014 rhwp::renderer::inline_flow::plan_with_storage runs 410 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 310 over it, 4.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":"src/renderer/inline_flow.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2f62e0adf7901d266ce03829226fb73e7e1033a52809dc597ac83b6b7b2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/height_cursor.rs: FileTooLong \u2014 2048 significant 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: HeightCursor (2 blocks, 186-2916). The bar is 500 significant lines; this is 1548 over it, 4.10\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":"src/renderer/height_cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c0c878ba6e08c8eab38f39d315b8643955f5eb7bedb38d5509c32c0574a2dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HwpEditorProvider.getHtml: MethodTooLong \u2014 getHtml runs 406 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 306 over it, 4.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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"312b3151fe7b6ec2686f1ba01e9c0bef29236b3478b975a131dc83874743de71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::capabilities::core::extend: FunctionTooLong \u2014 rhwp::cli::metadata::capabilities::core::extend runs 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 306 over it, 4.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":"src/cli/metadata/capabilities/core.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7501bf0e3582aaf8b1db1101a8d394428595416e1f6233f20f1cba151b0d3ea3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compare/diff-engine.ts: FileTooLong \u2014 2027 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1527 over it, 4.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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5732c2f3bed739dc015b2c25e35872ece22502280c0f4e07dbb6e0151869290"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CursorState: TooManyMethods \u2014 121 methods. The bar is 30 methods; this is 91 over it, 4.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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb593c9bb141d043aee4de144975b055173b2fcfcb88b9706f2c6aefdf76b60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/renderer.rs: FileTooLong \u2014 2013 significant 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 79% of them inside a single declaration: SkiaLayerRenderer (4 blocks, 496-2610). The bar is 500 significant lines; this is 1513 over it, 4.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":"src/renderer/skia/renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bac3562afbba1ac3bfc6017aa8363713537d180b6716cc18f21fe2a6b9760b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_text_positioned: MethodTooLong \u2014 draw_text_positioned runs 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 302 over it, 4.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":"src/renderer/web_canvas.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25220bc8992772bc36428368f32158ae30d850910dece26b64b243b17a942b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/command.ts: FileTooLong \u2014 1994 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1494 over it, 3.99\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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"212f55c9ca6f9372f43f8059a748640924e0086314988b1624ecbcd875b1604f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fragment/emit.rs: FileTooLong \u2014 1992 significant 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 100% of them inside a single declaration: TypesetEngine (12-2724). The bar is 500 significant lines; this is 1492 over it, 3.98\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":"src/renderer/typeset/table/continuation/fragment/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d799976736c7448a38dfac22cbd3e0fd0c15992b0a5d1ae25fc7b8629e9a5467"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/text_measurement.rs: FileTooLong \u2014 1978 significant 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 64 free functions. The bar is 500 significant lines; this is 1478 over it, 3.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d090e3ab5fe149937a77a0845a85b676a71c0771d17a6df6049ceff42c8f101"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkiaLayerRenderer: ClassTooLong \u2014 1582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 4 blocks, lines 496-2610. The bar is 400 significant lines; this is 1182 over it, 3.96\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":"src/renderer/skia/renderer.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffe7332e866211c69b420d9af27f87584b17b225f46520f77872f780f8e7ce6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/picture-props-dialog.ts: FileTooLong \u2014 1972 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PicturePropsDialog (83-2664). The bar is 500 significant lines; this is 1472 over it, 3.94\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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32db249837be0147d2a7da89c7152b03be0e13f434e0ee3a8c80242f013d47c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_hwp3_inner: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_hwp3_inner runs 392 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 292 over it, 3.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efcc53ec42a668b6c30fb249b7f902c90ea5f3af23d18cdef2e9f506c9914ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/cursor_nav.rs: FileTooLong \u2014 1959 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: DocumentCore (154-2669). The bar is 500 significant lines; this is 1459 over it, 3.92\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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71dd96cfdd4a1069893a4073db32ef166a5004bd99f65c9a09aad2b3d3ca4c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/shape.rs: FileTooLong \u2014 1936 significant 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 100% of them inside a single declaration: DocumentCore (14-2797). The bar is 500 significant lines; this is 1436 over it, 3.87\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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce060613e900c4dffcad8316a7bf99401b76b9657d190b2cd93a29f17396a1cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.mixed_nested_split_from_cut: MethodTooLong \u2014 mixed_nested_split_from_cut runs 387 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 287 over it, 3.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25962}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ed28f83b885e05488ccacb2555db3a8afd1f39edd67dbeeddc369acfef860"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerBuilder.build_node: MethodTooLong \u2014 build_node runs 386 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 286 over it, 3.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/builder.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b10a532773a339d9b9f340f560a11cd1c790d9bbb33ea4991a51dcd76252a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HwpCtrl: ClassTooLong \u2014 1524 significant lines (blank, comment-only and punctuation-only lines excluded), 104 methods. The bar is 400 significant lines; this is 1124 over it, 3.81\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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca6eb6339da3b9df906e129072c8e1e5f63e003bb4c801e329c0e47159204d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/canvaskit_policy.rs: FileTooLong \u2014 1890 significant 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 1390 over it, 3.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a19f67d5f71543d6c2dbf2841426cb635cdf2f03bd3dfb739cdd28b66fab5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::recognition::recognize_page: FunctionTooLong \u2014 rhwp::parser::pdf::recognition::recognize_page runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72e204d7de92e7aed7d30d5a49c0be1241ec507ddbba6505cd6950e1520f3cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::equation::svg_render::render_box: FunctionTooLong \u2014 rhwp::renderer::equation::svg_render::render_box runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.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":"src/renderer/equation/svg_render.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fa02a0f9ed641f7093a52486c9dfddfdaaccf8ab0a81a9d18e7cf7fb84a068"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: block/entry.rs: FileTooLong \u2014 1876 significant 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 100% of them inside a single declaration: TypesetEngine (14-2823). The bar is 500 significant lines; this is 1376 over it, 3.75\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":"src/renderer/typeset/table/block/entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25f3302bc43088c074df409cefcf3053e4cff25c078acf5a74d24ba10e75058"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_paragraph_body: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_paragraph_body 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":"src/parser/hwpx/section.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b9d253a1ae3180bc397f7cef70f3010395d17b3aa0199d8d2b4f14d4516f76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/field_query.rs: FileTooLong \u2014 1845 significant 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 36 free functions. The bar is 500 significant lines; this is 1345 over it, 3.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed064164ebab42da4ba44a372cdd4ae368973babe98f18a6a7e790cf6a2ca25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_header_footer_paragraphs: MethodTooLong \u2014 layout_header_footer_paragraphs 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":"src/renderer/layout/header_footer_layout.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c746c57db4d0f0dad42f507ce25da6c0eae7716c34553d438669d862621a4f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/canvas-view.ts: FileTooLong \u2014 1815 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: CanvasView (111-2502). The bar is 500 significant lines; this is 1315 over it, 3.63\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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979303b516b068e859fa9183e381a328b8d8203aec5564b19649325c606173a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.place_paragraph_flow_with_storage: MethodTooLong \u2014 place_paragraph_flow_with_storage runs 361 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 261 over it, 3.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":"src/renderer/typeset/section/flow.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"71982dcb4dd56204bd69e75def4f01cdfbc55652e2301d6bcc25e3e45f3de226"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::editable::reflow: FunctionTooLong \u2014 rhwp::parser::pdf::editable::reflow runs 360 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 260 over it, 3.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/editable.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de310eead9eb9d98ad7e21ebd6e3eab125c9684c9f7b4b8a79ef610cbdb186"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: endnotes/paragraph.rs: FileTooLong \u2014 1791 significant 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 98% of them inside a single declaration: TypesetEngine (38-2197). The bar is 500 significant lines; this is 1291 over it, 3.58\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":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d894d32debf0a51c0322eff4c6ec13d89a36305ce93b1194eb6749edae428e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/pack_health.py: FileTooLong \u2014 1782 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1282 over it, 3.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/pack_health.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade1e504a14a01e651b8986f8eb038ec37cf7166f636c1046f68bcd2954fa101"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/kerning.rs: FileTooLong \u2014 1775 significant 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 1275 over it, 3.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/kerning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e90695759e0ee49f5ef45bf50af445b281e2a2114a06d5a398f4c8de11d150"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.run_section_with_storage: MethodTooLong \u2014 run_section_with_storage runs 355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 255 over it, 3.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":"src/renderer/typeset/section.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b138f62c44ff83d307a81cd84ca154ae7e8e827b1c10270a1f31a15b0588aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: converters/hwpx_to_hwp.rs: FileTooLong \u2014 1767 significant 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 74 free functions. The bar is 500 significant lines; this is 1267 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7f21a2541981dc4d4e5d44aa2e15aa07f3790b038c1cc7e0afa1ed354689e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/cursor.ts: FileTooLong \u2014 1757 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: CursorState (50-2602). The bar is 500 significant lines; this is 1257 over it, 3.51\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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f776a40791e4bdf89c43e31cfec0f10046f880181b40e3d22e24aeda306b153"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/pdf.rs: FileTooLong \u2014 1757 significant 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 43 free functions. The bar is 500 significant lines; this is 1257 over it, 3.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":"src/renderer/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8cda82dd119ad385b920cba9c0a094f64343f9e2ca7f1326df7091df4387c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.create_shape_control_native: MethodTooLong \u2014 create_shape_control_native runs 351 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 251 over it, 3.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf91e4a3a1b0a6cda5dde3c06391000af1cf6be95aa2f6c7a981ee53eda5713d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.resolve_row_heights_with_common_fit: MethodTooLong \u2014 resolve_row_heights_with_common_fit runs 348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 248 over it, 3.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"7164cfaea3c97e18db78e4a9d5aa623ab50dbd3b09fbf05d34e7c01876917c39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan: FunctionTooLong \u2014 rhwp::renderer::layout::paragraph_layout::compute_line_extra_spacing_with_dash_plan runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e4850f01b157074a727605ea2551b9f9a9d9ef5bc6fb5c25a5d07dd0c4374"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg/mod.rs: FileTooLong \u2014 1734 significant 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: SVGPlayer (3 blocks, 26-2446). The bar is 500 significant lines; this is 1234 over it, 3.47\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0766732ce42dffbfad93ed06bffe7dcca93ac5669ef0fc88d129afc25107f990"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HwpCtrl: TooManyMethods \u2014 104 methods. The bar is 30 methods; this is 74 over it, 3.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8728a4379d84da93524b089dfc3a37fd9c7366e054e8ee689095ccb276e7b4c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/picture_footnote.rs: FileTooLong \u2014 1730 significant 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: LayoutEngine (362-2296). The bar is 500 significant lines; this is 1230 over it, 3.46\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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265b01f8883992753519f67da45bf49ace9fad804e5648389f2fd616a5894fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::protocol::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::protocol::extend runs 346 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 246 over it, 3.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":"src/cli/metadata/mcp/protocol.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e30b471b3a98f6418d8304da96b8ddde01db1b5b579e5f907e820fe88b0ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/renderer.rs: FileTooLong \u2014 1723 significant 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 50 free functions. The bar is 500 significant lines; this is 1223 over it, 3.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a77f642014a19244544dac741bcdac37a5796709c683735732d54d5ddf59b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_inventory_diff.rs: FileTooLong \u2014 1714 significant 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 57 free functions. The bar is 500 significant lines; this is 1214 over it, 3.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34562283a7b9563aa095eecea5777138a088ab8e656e0c5baea6bf3d38f4bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::path_paint::lower: FunctionTooLong \u2014 rhwp::parser::pdf::path_paint::lower runs 339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 239 over it, 3.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":"src/parser/pdf/path_paint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b3425859dc387204d785c52cae2a3d1c8ad14f42e3914f376b2ea3e9b5c86b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_click_here_and_bookmark_markers: MethodTooLong \u2014 layout_click_here_and_bookmark_markers runs 339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 239 over it, 3.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":10668}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8b906b384af5ad428972c4ba1c287b119e0d4706a94af5d2daf4a168482e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_inline_flow_plan: MethodTooLong \u2014 layout_inline_flow_plan runs 337 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 237 over it, 3.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"3925e2fcb1aeebdf31686e44557b21d04c5a191478f349bd264cf1cf376d0ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_detection::detect_ruled_tables: FunctionTooLong \u2014 rhwp::parser::pdf::table_detection::detect_ruled_tables runs 336 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 236 over it, 3.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a48d353c6acf1d5c769bbaba3758fca9cd8fa02aec635e92fd452c914cc68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler-keyboard.ts: FileTooLong \u2014 1675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1175 over it, 3.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"469f5b3a0ada55b982d4b472c707c379d0352a4c0759d5670a57a9fdbbe1fe29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.split_table_rows_with_storage: MethodTooLong \u2014 split_table_rows_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2677}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b23790cd0d8a2c02df5c2cdab7e3ca2c689c012a2ee88ad20b48af0ca661072"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::equation::canvas_render::render_box: FunctionTooLong \u2014 rhwp::renderer::equation::canvas_render::render_box runs 332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 232 over it, 3.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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6911f80ce643da9a6b6203996d867a1a2f483f6e72c167bc2ce9c0fab2ba836"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasView: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3531e107cca1a87563f2447248c5b050f254fa4e93e33553eaa8132b32448440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp_serve.rs: FileTooLong \u2014 1646 significant 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 52 free functions. The bar is 500 significant lines; this is 1146 over it, 3.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":"src/mcp_serve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd28b5adf21c991bbdc02a3e063b4d8f8067f9a5740512e8b243a65c0174f884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/header.rs: FileTooLong \u2014 1643 significant 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 52 free functions. The bar is 500 significant lines; this is 1143 over it, 3.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":"src/parser/hwpx/header.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"381f049238350da5e774eb50de59fc87e2f1db413a3cdd23692ea7acbb28a138"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::flow::place_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::flow::place_with_storage runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/flow.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ce0496aa448aaffecd51bdad16cd4f8cf812490a2103c4e50c607d0565abd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/write-tools.ts: FileTooLong \u2014 1617 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1117 over it, 3.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f108bf5863f82104b48c81a321c2a3fba49c2f5f3a797601f1495ffa21ee07d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::parser::handle_start: FunctionTooLong \u2014 rhwp_ooxml_chart::parser::handle_start runs 323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 223 over it, 3.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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc954e9b2f9c0fb24e891014dcb5d6fff5df3397ab9f278372e9288ae2abd113"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_cell_properties_native: MethodTooLong \u2014 set_cell_properties_native runs 323 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 223 over it, 3.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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc4decafb40f805685637b22ce74257c9a05a27d1f4d714af3f045372e8e96f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1112 over it, 3.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-recipes/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77725fa0e02d84d9eec61c695f54f53bda1cd6405d45a8651f013ef3bc4edf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1110 over it, 3.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-work-receipt/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52383d1773a2a5d7289fcd85cbb76e1d7d53757118c94454ab0976adb3ab948e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::help::public::print: FunctionTooLong \u2014 rhwp::cli::metadata::help::public::print runs 322 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 222 over it, 3.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":"src/cli/metadata/help/public.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"845b9ceb46afac297abd6fad19cb4accef169aadbd5cdae9044d7480680583ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.ts: FileTooLong \u2014 1599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1099 over it, 3.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":"rhwp-studio/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e57c1641ec078a4648dad8e74a54966cbe7a27eca63a0e895d320812c5c3075"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::extract::extract: FunctionTooLong \u2014 rhwp::parser::pdf::extract::extract runs 319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 219 over it, 3.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":"src/parser/pdf/extract.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10e2910ccb5fd19c6ada8daa72574a8c3a947db994793dca480e2fdec7644cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::stored_tac::prepare: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::stored_tac::prepare runs 319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 219 over it, 3.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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e96b5ed45c179370df8e02193f19e4ed8a76d8dc50360b0ccf95500363a359"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WMFConverter.run: MethodTooLong \u2014 run runs 319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 219 over it, 3.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":"src/wmf/converter/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb774e0b9bc2aabc03c4985398fe22cbc93738f3d0282559619fa7fc1391433"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_table_properties_native: MethodTooLong \u2014 set_table_properties_native runs 317 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 217 over it, 3.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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3e99412754745395497c0dca4ac5a71eb15249a92e519dd36be01e46ba90b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.replay_endnote_column: MethodTooLong \u2014 replay_endnote_column runs 317 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 217 over it, 3.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":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b061cc332420cf00abaeba792debcd7e85fe586b094615fcde26032fc7682a46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/hwpctrl_sets.rs: FileTooLong \u2014 1578 significant 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 1078 over it, 3.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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cd7f289afc551445ee53be2513a4f6d01157c9003fd0f71f926080bdbcb3fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::native_host::runtime::worker::execute: FunctionTooLong \u2014 rhwp::native_host::runtime::worker::execute runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/runtime/worker.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e4501f37cd388af7b1563388d80532f9e3527fc0627c0653bdd1ff51dd6254"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage runs 314 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 214 over it, 3.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec376b2d77338db590725a1e452eb10df050ebb1fb0ea02518e62d3626dd1295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/paint_op.rs: FileTooLong \u2014 1567 significant 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 35 free functions. The bar is 500 significant lines; this is 1067 over it, 3.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":"src/paint/paint_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2f168aa96402ce024fb672a5ea81083324fe3cb7eb63e96f3ede29198af035"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.create_table_with_options_native: MethodTooLong \u2014 create_table_with_options_native 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ce198afba34cabe5933b8c7f77bfb13bda3ec6608db4243883567f07993955"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler-mouse.ts: FileTooLong \u2014 1556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1056 over it, 3.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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87d9ef9e1fc216ea7ca4988d9703be4b48c76327b54f2b9e5c1f25b0c54f56f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Table: ClassTooLong \u2014 1244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 62 methods, 2 blocks, lines 44-2638. The bar is 400 significant lines; this is 844 over it, 3.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de0bec7ff0d1dc7e9dbdd31819d460591c2a03a47b0940decd57f771787c11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.body: MethodTooLong \u2014 body runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.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":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c2c7926d8f1699bed65840fc801db4b17ec2a22414e482428d0d7ccee49961"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"427f50610d5ac981a71185d40a18cc7cb19dc73ea4e5372872b5a1a8d9e02d76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_shape: MethodTooLong \u2014 layout_shape 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fded44dd77e0a684bcc6be1c8995661f119efeb8df4d2fd7a51f3f972814a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.absorb_section_tail_with_storage: MethodTooLong \u2014 absorb_section_tail_with_storage 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":"src/renderer/typeset/section/tail.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f95c9b26e59acc1ad6b38e8e50547c8e9a94870eb65f840c69b652592ab3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/table.rs: FileTooLong \u2014 1517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Table (2 blocks, 44-2638). The bar is 500 significant lines; this is 1017 over it, 3.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":"src/model/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28919458f96c4577c2fdf9060817b9f58c6bb267d6858901471ef21987690ae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/types.ts: FileTooLong \u2014 1515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1015 over it, 3.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":"rhwp-studio/src/core/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd308f94b407d940f74c4b053d5f401ca947ca5f87faa1d014925df10a7acfbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::parse_hwpx_with_reservation: FunctionTooLong \u2014 rhwp::parser::hwpx::parse_hwpx_with_reservation runs 303 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 203 over it, 3.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":"src/parser/hwpx/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c254881216345e1fadc519b3add2267def36b9275b2936987d0f3481da6e351"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paragraph.split_at: MethodTooLong \u2014 split_at runs 302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 202 over it, 3.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":"src/model/paragraph.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"9307c3f2f983616ae3c74cf3faa8df70f097b50ed01dc06beeed8736b3038923"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.apply_stored_paragraph_boundary_with_storage: MethodTooLong \u2014 apply_stored_paragraph_boundary_with_storage runs 302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 202 over it, 3.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":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"868c66db2c5245f9fc762b55cbf53383e207244eb1c9caccaa9a2bc7308017e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/render_tree.rs: FileTooLong \u2014 1498 significant 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 998 over it, 3.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f7cf6ee2f194fa1a5e9d1accc3c74e2bf017fb8b9096ed9cb32eeadf10c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::skia::glyph_replay::prepare_glyph_outline: FunctionTooLong \u2014 rhwp::renderer::skia::glyph_replay::prepare_glyph_outline runs 297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 197 over it, 2.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fba6c783530543a7d768f7b17d23a54d0760f9bfe63c2cceb82c287706275c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_tac_picture_item: MethodTooLong \u2014 layout_tac_picture_item runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/tac_picture_item.inc.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"38baa46f65d610cd3b6356c8e2e30a5c71bd79ce4e67b1cee48c090c2a01732e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.register_body_footnote: MethodTooLong \u2014 register_body_footnote runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/footnotes/body.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd46f8f9313c108ce2e577b7a438686869febce81daafcf45e1785e13cd175e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1476 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 976 over it, 2.95\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":".claude/skills/rhwp-explore/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373034bb66e01cdc87d537b3cd4133a709fd3fbbcab9410430c29ad4d6bd2272"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: char_shape_tables/same_id_corpus.rs: FileTooLong \u2014 1473 significant 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 973 over it, 2.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/char_shape_tables/same_id_corpus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5519ec3747e30888ed95d0346ada11d1de1d2fe43f2cb080e3a34ecd25d50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/clipboard.rs: FileTooLong \u2014 1471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: DocumentCore (379-2196). The bar is 500 significant lines; this is 971 over it, 2.94\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3727aa9f30ea2fb3af4b8a993e6b82243f86f038ed5bdb92bd4d2717532fee03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::structured_lowering::paragraph: FunctionTooLong \u2014 rhwp::parser::pdf::structured_lowering::paragraph 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"446c3c26f3082463bb1bda3e06967502ced1b86c67655fd6fccc90b3ac9b1ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Paragraph: TooManyMethods \u2014 87 methods, declared across 2 files: model/paragraph.rs (85), paragraph/control_source.rs (2). 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":"src/model/paragraph.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"128335b9aef7b562eb9a3535e7c9b326414d62c71bce928032e0f1f6fd53465c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/row_step.rs: FileTooLong \u2014 1447 significant 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 98% of them inside a single declaration: TypesetEngine (14-2096). The bar is 500 significant lines; this is 947 over it, 2.89\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a8fa828b846ea5361fc11c1e02567995a379d8a24726e9523ba4a72936116"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableCellPropsDialog: ClassTooLong \u2014 1156 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 756 over it, 2.89\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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"70abdc363ad7f1bd13f937f6815184d596e58eed044507d8bea8b80973d60ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.grep_with_context: MethodTooLong \u2014 grep_with_context 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":"src/document_core/queries/grep.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d898d734d56cc6d696e45b07d95f40ed700560e38bb3c39056f1bc7e413af1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fragment/budget.rs: FileTooLong \u2014 1424 significant 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: TypesetEngine (15-2065). The bar is 500 significant lines; this is 924 over it, 2.85\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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4e362a4cf4faa3877e6dcf3480c27991efd66b6f9c425688f8558267db169"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/table.rs: FileTooLong \u2014 1420 significant 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: DocumentCore (83-1970). The bar is 500 significant lines; this is 920 over it, 2.84\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"783869fa879f206f41aaf84369937a10a031f915121a96ac66156e7d2b5dbc53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.finish_paragraph_anchor_state: MethodTooLong \u2014 finish_paragraph_anchor_state runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/post_flow.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61411a5d87ecf3f713a2bffa267ef747448bc0c1de36a3f48da4e568b0d092"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.scan_rowspan_block_step: MethodTooLong \u2014 scan_rowspan_block_step runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/block_step.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6153ab2d3bd715fe6a52d8b656800eb1d8e995632b51e519d528a66a3ecc380e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/competitive_bench.py: FileTooLong \u2014 1409 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 909 over it, 2.82\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":"gym/tools/competitive_bench.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33ee099ef75d5db05c07a08cc3d52ce08111aa3ed8d727a13b37f139b79399"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/memo_query.rs: FileTooLong \u2014 1408 significant 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 908 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121612ef85c75bfd2b308c360f60181604f2b41c092510fdc689fe2f01763fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::serialize_hwpx_into: FunctionTooLong \u2014 rhwp::serializer::hwpx::serialize_hwpx_into runs 281 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34e75fba2ad66eafe6dd64469af9854c81601178a5db73ae7a732d55b841da5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::structured_lowering::native_borders::plan: FunctionTooLong \u2014 rhwp::parser::pdf::structured_lowering::native_borders::plan 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":"src/parser/pdf/structured_lowering/native_borders.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"75045c4f5f53f329a48c1ddf68a0abcc9798c714fdc3a57e4a0ec0378ed46962"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_picture: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_picture runs 279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 179 over it, 2.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":"src/parser/hwpx/section.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd05dc0f63dfb1ad1965e6c0143d62ff042a26135b1c18d0902fb5e220737b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/picture.rs: FileTooLong \u2014 1385 significant 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: DocumentCore (57-2030). The bar is 500 significant lines; this is 885 over it, 2.77\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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5924f8976f25b793f7658739fc0d1897c1ead05a3e350200876f6622b047f461"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::body_text::try_serialize_para_text_with_slots: FunctionTooLong \u2014 rhwp::serializer::body_text::try_serialize_para_text_with_slots runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.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":"src/serializer/body_text.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"736165e06d75b5d7e0ba69ec45c50b0ddb1e720506c50bf48ca7534e7a0de0f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.get_font_decision_trace_from_tree: MethodTooLong \u2014 get_font_decision_trace_from_tree runs 276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 176 over it, 2.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":"src/document_core/queries/font_decision.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7046d57a7364279ccfa5d3dbeb355cd58cf9524796a4c48df7c6a95a7d4981e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.initialize: FunctionTooLong \u2014 initialize runs 275 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/main.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b831f1733f1373b135530880b06bbe1f9edf5dc989bb2ef855b087870907883c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/pagination.rs: FileTooLong \u2014 1370 significant 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 870 over it, 2.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aad0fba9bfd3eb780867079d89a7076b97b6d39c401077217b170f0d114320a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::native_webfonts::prepare: FunctionTooLong \u2014 rhwp::renderer::native_webfonts::prepare runs 272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/native_webfonts.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6831fdbd90f78daa9a4a626072d786a46a7ab1c4def5dde6dfa7a2dc1d1de5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::tac_reconcile::measure: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::tac_reconcile::measure runs 271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a0ea629a90ba4ba51af3add6297cad39f08456b2d9ac3010a9a5676b65f4ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::edit_format::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::edit_format::extend runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/metadata/mcp/edit_format.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a340d5723ae0b171d525cd4e5aebe8c1d13afc9f30609b69fde14ac0d82b24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.replace_text_in_cell_field_impl: MethodTooLong \u2014 replace_text_in_cell_field_impl runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab2f3ff0bb5481ded1d8083769cce879a21610ee695de8bec1a49cc1b465d57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.navigate_next_editable: MethodTooLong \u2014 navigate_next_editable runs 268 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b95638044de750abdd40089a07ad54f4613ed08fcde83f2b280abaa2b2146"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/border_rendering.rs: FileTooLong \u2014 1324 significant 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 824 over it, 2.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"619656c1ce959c5e18786e45ae35a2705dbcc8333fbed3a301c26801083483be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1322 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 822 over it, 2.64\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":".claude/skills/rhwp-cli/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2707407b1915e58c12315841ed9c2bf70d7b8165e062a0359d5041047867cdd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.renderEquationBox: MethodTooLong \u2014 renderEquationBox runs 264 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 164 over it, 2.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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"91559b572f3ad2c5432e024bd844bd24692b2af41fdd86fb321d2608a412db4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/eps.rs: FileTooLong \u2014 1317 significant 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 817 over it, 2.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d89c324fbf7ab1c6e464cd10b692b5a52f657c2effd5ff715281dd2a689d6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Interp.op: MethodTooLong \u2014 op runs 262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a5e910806c4bb4103425aea6f56cac549273d7e34c3925dec2fd7361534a3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hml/reader.rs: FileTooLong \u2014 1308 significant 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 69% of them inside a single declaration: ReadState (2 blocks, 193-1434). The bar is 500 significant lines; this is 808 over it, 2.62\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":"src/parser/hml/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53563940ca1be7a67a7929ca84ec3b2cf64ebf775074c9ddb805952f7d220c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::mcp::exchange::extend: FunctionTooLong \u2014 rhwp::cli::metadata::mcp::exchange::extend runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.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":"src/cli/metadata/mcp/exchange.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4fcd2b07edec5850f55c2683bfab66af1f584d4d499e8042b7871c9fea5021"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/mod.rs: FileTooLong \u2014 1301 significant 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 47 free functions. The bar is 500 significant lines; this is 801 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e7701bf9cfdede42c388ea09550f98a3bc7c3803552c6e35a13357e44dca17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object: FunctionTooLong \u2014 rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.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":"src/parser/hwp3/drawing/shape_mapping.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11ef46f54abd3b25683f2b6b7f7a69b0b87fa646b31109e76eb2a209a89099"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_shape_object: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_shape_object runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.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":"src/parser/hwpx/section.rs"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b9d13223e06e3dcd43542fe673a7275216052cdf3feaba6985122f60b38155"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.query_whole_table_fit: MethodTooLong \u2014 query_whole_table_fit runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.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":"src/renderer/typeset/table/block/whole_fit.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eacc02759dc6c603ba0be707381c13e506d7d4d2ffc7ac402e6e738cf74c77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.prepare_table_rows: MethodTooLong \u2014 prepare_table_rows runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"src/document_core/commands/paragraph_block/template_rows.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d862903518e516604c005eac2d9edfa9b908cf62ee24887abde484f1e96f09dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontGlyphLowerer.lower_portable_glyph_run: MethodTooLong \u2014 lower_portable_glyph_run runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"src/paint/font_glyph.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b5719ecc04b3c558dd9076049f42faabea16fc87a1e958eb177c4e4c179616"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.query_rewind_tail: MethodTooLong \u2014 query_rewind_tail runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"src/renderer/typeset/notes/endnotes/paragraph/rewind_tail.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4050c8fb2c5b8b76c39ef847cb1b11ef79031303426d91a3c0c884c2387b0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TextStyle: TooManyFields \u2014 76 stored fields beside 12 methods. The bar is 30 stored fields; this is 46 over it, 2.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":"src/renderer/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db294981711d2468d365c77191b27b247c06a7393b60bc701caae2bb16ca0c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeightMeasurer.measure_paragraph_with_storage: MethodTooLong \u2014 measure_paragraph_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5acb6646f79a6badf2f685a276be436d07dd346586965e57d2068c69546e0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.delete_text_in_cell_native_impl: MethodTooLong \u2014 delete_text_in_cell_native_impl runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e484a1d3ba6f25e9a24e14b89d021510c8fb51c2653ff7ecee9bab80e1706bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_empty_runs_line: MethodTooLong \u2014 layout_empty_runs_line runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11445}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ab20a5c059d13f3969cdf4fcf62b566a93b67e795108a5117662de9f257a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage: FunctionTooLong \u2014 rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/cfb_writer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e184e1d7cc1e6dbae55a22c5485e9833a4ac7ef134356dd595bba4f139133c72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/shape.rs: FileTooLong \u2014 1245 significant 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 73 free functions. The bar is 500 significant lines; this is 745 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a076d94cf6baac765f8837e7859d618b3faaa550199d5ce4bb62249fafdc491"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 740 over it, 2.48\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":".claude/skills/rhwp-form-fill/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87abb08e3c23e89fd9e4246350b55daeea15bbc12f4302d8e7827f9f4547512"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width: FunctionTooLong \u2014 rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width 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":"src/renderer/composer/cell_line_breaking.inc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7607d298352252bbde46d3f6feae83d12bfcf49b0ef12b5a44b650c2d862ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/style_resolver.rs: FileTooLong \u2014 1232 significant 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 46 free functions. The bar is 500 significant lines; this is 732 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/style_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"812e0c4609deecf98b962cbe76a41146bb6d9ba284b767d7c71fd3619e24807c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.paginate_table_control_with_storage: MethodTooLong \u2014 paginate_table_control_with_storage runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"093c0ef85e491de7125086c3dc926faf687bcf3c970196b759b75d1cd7b87098"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036d81d175e541fdebf54b5a91959202925aa8e6c075b1c0db57fb92b1978de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: block/prepare.rs: FileTooLong \u2014 1226 significant 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: TypesetEngine (17-1774). The bar is 500 significant lines; this is 726 over it, 2.45\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":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8cba920c58d6547f35cace811c8315ce0e5996566a5a08f710368d24a3e13c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: endnotes/fit.rs: FileTooLong \u2014 1225 significant 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: TypesetEngine (18-1423). The bar is 500 significant lines; this is 725 over it, 2.45\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":"src/renderer/typeset/notes/endnotes/fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63975bd4b42059cb4930a2a67dec0327d1427688648e25e1c98475888947ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_form_object: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_form_object runs 244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 144 over it, 2.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":"src/parser/hwpx/section.rs"},"region":{"startLine":7070}}}],"partialFingerprints":{"codehealthFindingId/v1":"44897ae911cf667e385b02127a7a8c3f2d3d5dfe88c75deafa88dd7ab886190a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypesetState: ClassTooLong \u2014 974 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 305 methods, 4 blocks, lines 36-1471. The bar is 400 significant lines; this is 574 over it, 2.44\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":"src/renderer/typeset/state.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1412165dc6d247320dc079065110ee855e23a9013d3f541e08bfe91acd4b8d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EqParser: TooManyMethods \u2014 73 methods, declared across 13 files: equation/parser.rs (24), equation/parser_fractions.rs (11), equation/parser_groups.rs (8), equation/parser_structures.rs (6), \u002B9 more file(s). The bar is 30 methods; this is 43 over it, 2.43\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":"src/renderer/equation/parser.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec2b4147d9d920fc9b6437a4bf9b3de5a59b37950fd114b0a90b4cc8ebeb38b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_object_control_char: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_object_control_char runs 241 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 141 over it, 2.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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e202b182d17bb44c0662b8631ded6f95a52c1a924e5800b70cf5bc19a75943"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PageRenderer: ClassTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 557 over it, 2.39\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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f4a42eb44187acf238253822a7b7250ed1e77e94bb0ad49ece1b3077a6f869"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-mouse.onMouseMove: FunctionTooLong \u2014 onMouseMove runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a108c878359c19b412e5fa20351a3af8c4a9b61cb30c1156abcc3c36d687bd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::json::write_equation_layout_kind: FunctionTooLong \u2014 rhwp::paint::json::write_equation_layout_kind runs 238 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 138 over it, 2.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":"src/paint/json.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5bd6c24c90383acf1ef2231b50223128b2a12894f0a26bdc2659c1c6469fcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_footnote_area: MethodTooLong \u2014 layout_footnote_area runs 237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 137 over it, 2.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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c452a034b2ca64b609862055126ccf042651f98f734d05c58c29302cc3225ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: para-shape-tab-builders.buildTabSettingsTab: FunctionTooLong \u2014 buildTabSettingsTab runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"260706d6c345748e4b1b8202cb00288fcad180b4c273e069e7ab2dda78ed8385"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.replay_endnote_column_extent: MethodTooLong \u2014 replay_endnote_column_extent 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":"src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8833ffe6a30132e56182ce6b996142b3adc61ea25d5f4c18c932fda1cfe506"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/table-cell-props-dialog.ts: FileTooLong \u2014 1179 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TableCellPropsDialog (42-1588). The bar is 500 significant lines; this is 679 over it, 2.36\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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fb2973359eede70c1c195e7df18eba8a7b1138040352b8f363e0c99578e948"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1172 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 672 over it, 2.34\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":".claude/skills/rhwp-fde/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b09cd537b83255d91e65850b1ce2356036dbfe9d2aeec094b07a0a127285114"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typeset/paragraph.rs: FileTooLong \u2014 1172 significant 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 672 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e300f6dbcb06d3b49beefd9cac26b8e50d77395d007f9ba883f9de03ad4ce228"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::structured_lowering::observed_line_text: FunctionTooLong \u2014 rhwp::parser::pdf::structured_lowering::observed_line_text runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2982794c6b4efc16705144f4485edbc23dd3704f3b31e725c96009638429bd50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_wrap_around_paras: MethodTooLong \u2014 layout_wrap_around_paras runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"src/renderer/layout/square_host_flow.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee4191a3c3a7df7f239ab2c1cd208de0909391ee4fc55d012f70c06299415a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/roundtrip.rs: FileTooLong \u2014 1168 significant 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 668 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5d60e0556f8c97da7b6cdd7c0089d89f852dad962a193a0f45a22c20fb823f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LayoutEngine: TooManyFields \u2014 70 stored fields beside 732 methods. The bar is 30 stored fields; this is 40 over it, 2.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":"src/renderer/layout.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6cb19fdfaa72ff773a7e63ea3f4f3f4d4b91b8f9ccc30352512cddf2539739"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1165 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 665 over it, 2.33\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":".claude/skills/rhwp-exam-ingest/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bdcee6bff663dc7fe2a4a70d071d6d3bc75ae5eb7102f34d75f9eaf0a0bd70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::queries::font_metric_coverage::analyze_paragraph: FunctionTooLong \u2014 rhwp::document_core::queries::font_metric_coverage::analyze_paragraph runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"100c73d66b61f98d58a23a87f31b5e7a647f1c987b56ea5611079629ba1ac2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.native_saved_reset_cut_trailing_trim: MethodTooLong \u2014 native_saved_reset_cut_trailing_trim runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e8812ebfa5928df3657e8b063354bb3f991dac213c25e1c1eef492bc04cd9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/header.rs: FileTooLong \u2014 1158 significant 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 55 free functions. The bar is 500 significant lines; this is 658 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/header.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c06e9a61e7ecb9b89872d023953b04b28978079c93c090df4abe1dd856fb54f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: para-shape-tab-builders.buildBorderTab: FunctionTooLong \u2014 buildBorderTab runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83031f53a0d68e8fc4fa668a7bdd408d9e2fcc28996f829280d5ac2875bff4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.writeback_reflowed_table_frames_with_storage: MethodTooLong \u2014 writeback_reflowed_table_frames_with_storage 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":"src/document_core/commands/document.rs"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecc935d946de14ef671bd8a06d6d35b179abdb17f791d7f2b9a37bee1348737"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TailFitInput: TooManyFields \u2014 69 stored fields. The bar is 30 stored fields; this is 39 over it, 2.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c5d1a7f826df3554bf00e340db38d4f908473642c52ebd288d8022970f2fef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/fuzz_corpus.py: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 649 over it, 2.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d0b271a90db6962885cad4afc80d3c241dc05629435427aca54d32e748c560"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::batch::run: FunctionTooLong \u2014 rhwp::cli::batch::run 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":"src/cli/batch/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b88f23dc500d6d5cb082f2f648fc30e8285d219840c8789ee60cc900349bca5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_first_para_control_probe.rs: FileTooLong \u2014 1140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 640 over it, 2.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_first_para_control_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e78b99ce9f1fbf948f9976a162dfd386c15ae3cb5aec63445f2f05616beda1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::equation_line_metrics::try_refresh_rows: FunctionTooLong \u2014 rhwp::renderer::composer::equation_line_metrics::try_refresh_rows runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.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":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbd91846350fdb14a4f009b56903a316aa6bb81bdff93b192f4042920db5681"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/layout_anomaly.rs: FileTooLong \u2014 1137 significant 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 55 free functions. The bar is 500 significant lines; this is 637 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"033ac8ef04ed5260f0b8776aec8aae2aed6c3ef67b445a2cfd5c07a73ea5748e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadState: ClassTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 2 blocks, lines 193-1434. The bar is 400 significant lines; this is 509 over it, 2.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":"src/parser/hml/reader.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cba1bf64cdb92db37573648d8894da9c12f243a3722e3f1ff932d9694f48340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/page-renderer.ts: FileTooLong \u2014 1133 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PageRenderer (93-1492). The bar is 500 significant lines; this is 633 over it, 2.27\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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fc8e6c9fad05eb18f6af7c1c3a5c15b2a09b0e37a7ce1416281cd93b7ed7af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive: FunctionTooLong \u2014 rhwp::parser::pdf::table_detection::cell_regions::local_axes::derive runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.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":"src/parser/pdf/table_detection/cell_regions/local_axes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca4b6885c3063fef41a2f4c17929a55a681a0571a54c56ffc603038fbc0206"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::pdf::direct_pdf_validation::validate_op: FunctionTooLong \u2014 rhwp::renderer::pdf::direct_pdf_validation::validate_op runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.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":"src/renderer/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497f3879bd597ae8a7f272ef6bc5d5aa0142db8454882be8b8f01f9a1f528d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/font_metric_gen.rs: FileTooLong \u2014 1126 significant 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 43 free functions. The bar is 500 significant lines; this is 626 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/font_metric_gen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d110670d65c0be784c6e00a7ee8cf2c69e9817590829ecd692d646e7624dc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines: FunctionTooLong \u2014 rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c73101e4d95571cf2498ad639fc1717524766ee8fea57a467127921e543568"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9880443534436e3b5b6d4e65383806c7fd1e9cd9f50e6aadaca736d64f92167"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/header_footer_ops.rs: FileTooLong \u2014 1119 significant 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: DocumentCore (32-1456). The bar is 500 significant lines; this is 619 over it, 2.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9671ba0eed601ca40187d90947cf74befa52adc5fc3e0c030e8b46a4f2f18d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::trust::governance::cmd_conformance: FunctionTooLong \u2014 rhwp::cli::protocol::trust::governance::cmd_conformance runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9850e2395dda97a2796067b4af575af86cf968c8bb0e3a956373fc33c167646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage: FunctionTooLong \u2014 rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.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":"src/renderer/render_normalization/stored_word_tail.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d554281fe4f56116eb0bd1afb48eb15e3f1205ff3b6fbfcee3f5651266bd45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::format::format_paragraph_for_flow_with_storage runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5669d9636a4cd09dc5546c04abc839584a900b94b0b70cc2d0f8937fd8f8ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::media::edit_insert_image: FunctionTooLong \u2014 rhwp::cli::commands::edit::media::edit_insert_image runs 221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"src/cli/commands/edit/media.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c36db4c21cc9183337920a8d05fa8e976f57a207d41482dc00f55dbf726ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document_core/helpers.rs: FileTooLong \u2014 1104 significant 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 75 free functions. The bar is 500 significant lines; this is 604 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75623d8aee645b5420746c64f618910a9f11894f80307764c946066547d769a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/table_cell_content.rs: FileTooLong \u2014 1104 significant 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: LayoutEngine (54-1506). The bar is 500 significant lines; this is 604 over it, 2.21\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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c91b1e4472dba0ad287398016a0c0120fa24a837a88f6066a843d1de59a78f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EqLayout: TooManyMethods \u2014 66 methods, declared across 24 files: equation/layout.rs (14), layout/matrix_geometry.rs (7), layout/script_geometry.rs (7), layout/legacy_original_geometry.rs (6), \u002B20 more file(s). The bar is 30 methods; this is 36 over it, 2.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":"src/renderer/equation/layout.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1995efc43147890b23ec30a481fc02fe10dd61bc805630f7626f209810a86060"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildPicturePanel: MethodTooLong \u2014 buildPicturePanel runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"928129fc3425f6ba136bc478af8c06baf2dce4c816d300754a1296e71ca008f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.place_empty_line_inline_equations: MethodTooLong \u2014 place_empty_line_inline_equations runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d701d41983f64b34f6886113af18d2c5e93078dc77b91b90a0d1fbfcec5726"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::formatting::edit_apply_char_format_in_cell runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6994c64e7f521d2aaa7454cad725ab784b17f4bd0459c47ca6c4f7c7c56ab269"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::pdf::parse_export_pdf_args: FunctionTooLong \u2014 rhwp::cli::outputs::pdf::parse_export_pdf_args runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.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":"src/cli/outputs/pdf.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e329b79b5f8491f5494f8f1a5787fd70779cf10eb942a25a0d2468a3dc02682"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/shaping_paragraph.rs: FileTooLong \u2014 1087 significant 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 587 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7448311d83574192c3bcd27895d9a6568356a75d6e4c8b4cce7404e93f442d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkiaTextReplay: ClassTooLong \u2014 868 significant 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 28-1150. The bar is 400 significant lines; this is 468 over it, 2.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":"src/renderer/skia/text_replay.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72067a20d2429e4ab1c174803fb121aef18632867ad28d822f709fae6c22ad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::media::edit_insert_picture: FunctionTooLong \u2014 rhwp::cli::commands::edit::media::edit_insert_picture runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.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":"src/cli/commands/edit/media.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f37df2f412731f5c63b11f8784ead3080b681028251604ef77654b9fe1feb9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColorPaintGraphPayload.has_colrv1_supported_graph_contract: MethodTooLong \u2014 has_colrv1_supported_graph_contract runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.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":"src/paint/paint_op.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"756078dc9515f8302bf4f7367e072dec7152262151d57d8a6039d520439c2fea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::auto_numbers::assign_auto_numbers_in_controls: FunctionTooLong \u2014 rhwp::parser::auto_numbers::assign_auto_numbers_in_controls runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.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":"src/parser/auto_numbers.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eadb4ecfe2e5bc504b8d13d47729ed650774d8f4aca5797d3520ff102ac5e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitReplayPlanBuilder.item_for_op: MethodTooLong \u2014 item_for_op runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d4236dffd6a04f1ad29ed6dd90ca613fa614bc2b8be3a5072790e2f60e9fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify: FunctionTooLong \u2014 rhwp::cli::protocol::exchange::bundle::cmd_bundle_verify runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f93944351a27b810064994c16833e7192e84588cdfc6c357fc24b13a1c942f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.insert_picture_native_anchored: MethodTooLong \u2014 insert_picture_native_anchored runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"20af9c106477ac2fdde88a754502dea9838dfb89fa300710a1e00693004de892"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::parse_pdf_with_request_and_progress: FunctionTooLong \u2014 rhwp::parser::pdf::parse_pdf_with_request_and_progress runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5604eba3c1add9bd8577e8e54e5e8a029bb579e7847d8e8253c656ee4dd832c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_vertical_textbox_text_with_paras: MethodTooLong \u2014 layout_vertical_textbox_text_with_paras runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4714}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ed9d46a94c2bfa2c1ce43c31c6f99bed17a2ff26d3ae5ffac4da33c7cf9011"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.delete_range_internal: MethodTooLong \u2014 delete_range_internal 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b4e1a2a9d5f1a679ac6cf7027ce03c705dad86ac9db6cf0a88861ccb8ac660"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_bars: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_bars 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc534385d776d692ed3b45db9c444a576eb551e9834775a3e8e86cac6417e41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeEditor: TooManyMethods \u2014 63 methods, declared across 4 files: native_host/editor.rs (45), native_host/commands.rs (8), native_host/ime_edit.rs (6), native_host/clipboard.rs (4). The bar is 30 methods; this is 33 over it, 2.10\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":"src/native_host/editor.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824c2dac964df5fe4c9ad208d6079f270e28231641f23be9b267dfb35aaab61"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HeightMeasurer: TooManyMethods \u2014 63 methods, declared across 2 files: renderer/height_measurer.rs (59), height_measurer/reflow_cell_frames.rs (4). The bar is 30 methods; this is 33 over it, 2.10\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":"src/renderer/height_measurer.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"adba8f2d284a66c810d71f649a5926ec07f4838b559a28303a68ade9f44e7543"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HwpCtrl.Run: MethodTooLong \u2014 Run runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b560f3bc3013e1cc7ffd69c85b702c48ab92c50c8018c011447c74013b4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/shaping_glyph.rs: FileTooLong \u2014 1046 significant 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 546 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ac51c8d99d63b46973aa09b8bcbfa3a903a0d4e5106e03487f1ccbb192e3af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1045 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 545 over it, 2.09\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":".claude/skills/rhwp-strategist/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d040c1c42b6ea6cd01e54850a2613bfab1ad14d715f8f8bfd1b5a8dc7b84eb59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/evidence_report.py: FileTooLong \u2014 1045 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 545 over it, 2.09\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":"gym/tools/evidence_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6844c81bd6553ea72cc4834bb148fc5ce3501d04f3b0fe9b5d5b51be8e130f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: css-color.parseSupportedCssColor: FunctionTooLong \u2014 parseSupportedCssColor runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b1305e750ea4db9e03171738ecdbf58b092f4101dac56ee515f1a5886de84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_picture_full: MethodTooLong \u2014 layout_picture_full 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ddc47bce44f095210e844537bf1d5383d03e1aecf880d4e269254d1097d2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.prepare_paragraph_boundary_with_storage: MethodTooLong \u2014 prepare_paragraph_boundary_with_storage 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":"src/renderer/typeset/section/entry.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c397f464c66704184f9054a446adbcfe6ed77f1506b2f25ae96dcf292c52d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.stored_fragment_row_plan: MethodTooLong \u2014 stored_fragment_row_plan 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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac858383038c7b50c32c55b9381b5f424e087d04709c6643c2cf514d860dec00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/recognition.rs: FileTooLong \u2014 1044 significant 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 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f787ac3a83d71af949e19cb1bbd46d5fe50897c918fc23707cef47563d1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::control::serialize_group_child_records: FunctionTooLong \u2014 rhwp::serializer::control::serialize_group_child_records runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.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":"src/serializer/control.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"be23105963feb1144cbdb24841ba1c533dbc7eb28afb132262a8d469b81a275b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::border_paint_structure::prepare: FunctionTooLong \u2014 rhwp::document_core::commands::border_paint_structure::prepare runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fbf59962c0243ed4a9df3db6e57a38a0275d22daf1c6a485611aab1237be1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp: FunctionTooLong \u2014 rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c960ffca4e0bedbc757eda6f5886ff302ca3cecc09c2edfde156dfa1c3d743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentEvent.to_json: MethodTooLong \u2014 to_json runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.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":"src/model/event.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea42afc8206d661af64a4c9ae994fcd1fac50b74677eec3f2b85e8842f6115"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Table: TooManyMethods \u2014 62 methods, declared across 5 files: model/table.rs (51), table/contradictory_grid.rs (4), model/table_inline_grid.rs (3), table/row_frames.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 32 over it, 2.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":"src/model/table.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"65864857ff07c5e9755f2d392146437eb955833ace45ab9e921dc7f2b59c4a63"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SvgRenderer: TooManyMethods \u2014 62 methods, declared across 3 files: renderer/svg.rs (58), svg/char_overlap.rs (3), svg/pua_glyph.rs (1). The bar is 30 methods; this is 32 over it, 2.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":"src/renderer/svg.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53014a3b2f4f750ff73d1577b2442da01dd219ef68c30f029de42b2942ddbe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/inline_flow.rs: FileTooLong \u2014 1031 significant 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 531 over it, 2.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":"src/renderer/inline_flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a220e28e7a0030802b452e9f060b352188c5245b3d210a23e6b104d77ece5f46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typeset/state.rs: FileTooLong \u2014 1026 significant 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 95% of them inside a single declaration: TypesetState (4 blocks, 36-1471). The bar is 500 significant lines; this is 526 over it, 2.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":"src/renderer/typeset/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16210673f7d882efd2c19961355c1698beb63e48f71193f642353f4a3159d95e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::tabular_import::csv_to_table: FunctionTooLong \u2014 rhwp::cli::commands::tabular_import::csv_to_table 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d053a40fd0832e5b51d7538d81de539ea95283566df53b1372b0d77f49f8d7b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::static_svg::normalize_static_svg: FunctionTooLong \u2014 rhwp::renderer::static_svg::normalize_static_svg 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":"src/renderer/static_svg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26ce137c8174152546580364b444f3bd4145a518f4795bbe427735fdbe838f4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CellBorderBgDialog: ClassTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 417 over it, 2.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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a598e11a6b310e174d12087b32eff58db7bdc988165649101a3b45f69a9345"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.insert_footnote_native: MethodTooLong \u2014 insert_footnote_native 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":"src/document_core/commands/object_ops/note.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"050286d41b73e0d181a54116f562df76e607f4d597efcade7992be07e8d2c407"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.estimate_line_run_widths: MethodTooLong \u2014 estimate_line_run_widths 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11155}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c1f84dbb58201833b2a93b861152e6fd8b4725a6e7393561d0eaa4260f517e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.paginate_text_lines_with_storage: MethodTooLong \u2014 paginate_text_lines_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cb0322f7ccd797bebe2e28889d016ce32abdea90d5ed6852f6da1fc2172dbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serializer/body_text.rs: FileTooLong \u2014 1019 significant 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 43 free functions. The bar is 500 significant lines; this is 519 over it, 2.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":"src/serializer/body_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40b63cd2ee62e4db5cccf29ae0986fba8cc0f7b5c138d2648b2d192ecfc92d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DocumentCore: TooManyFields \u2014 61 stored fields beside 1079 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":"src/document_core/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"889e06c6488112db8cd1c8c41139ee533a5f7ae665ded1a008d9a85371730053"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebCanvasRenderer: TooManyMethods \u2014 61 methods, declared across 5 files: renderer/web_canvas.rs (56), web_canvas/text_italic.rs (2), web_canvas/char_overlap.rs (1), web_canvas/hft_outline.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 31 over it, 2.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":"src/renderer/web_canvas.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"86057c2e1fa8e050cc8ac05163583d48b415833f71fa41e43acc4a3bba90fab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paragraph/tail_fit.rs: FileTooLong \u2014 1015 significant 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: TypesetEngine (109-1091). The bar is 500 significant lines; this is 515 over it, 2.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":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88fb3c893071418ea94a43d629598d4e46052dbf27fd12e87a3b631214b2fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildBasicPanel: MethodTooLong \u2014 buildBasicPanel runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7c182ab5f4f0d352721062636d07e241976a8579cc81b8882c79f9d1dd09b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::skia::renderer::prepare_native_glyph_run: FunctionTooLong \u2014 rhwp::renderer::skia::renderer::prepare_native_glyph_run 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":"src/renderer/skia/renderer.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f98ede43ab4dee7239b06c2aa93eee5d79df9e84a9c98f69bf7f76058c9625a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.process_multicolumn_break: MethodTooLong \u2014 process_multicolumn_break 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":"src/renderer/typeset/section/columns.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eea803a8b2e9e624ba5642bf25eca4ca17aa927306748a15af0a36baed3eb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::render_control_slot_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::render_control_slot_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"44905241be939d70b436778c6f4fc5fa357c35a63e15af3cab0da2319c47dceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 513 over it, 2.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":".claude/skills/rhwp-mcp-session/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6127902f3a843179a089bf293a8001b26ae03fb57e8e9e1febf62a7e8add81f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/runner.py: FileTooLong \u2014 1012 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 512 over it, 2.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":"gym/core/runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6fbe7236a3eeeef452603a457cfb1530e0728ffcd4e442a47975c65d6b53d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pack/inventory.rs: FileTooLong \u2014 1012 significant 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 54 free functions. The bar is 500 significant lines; this is 512 over it, 2.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":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8998e1f6c5f8b0b43d4b1e0e8dd4267277a1c80d0bcad7a6e3c2a44bf8edcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.renderCharOverlap: MethodTooLong \u2014 renderCharOverlap runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ff0c397c253281133fe4fdbf4f72eeea2c628b7333f23c51c396cd80131930"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::tabular_import::csv_to_chart: FunctionTooLong \u2014 rhwp::cli::commands::tabular_import::csv_to_chart runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/tabular_import.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c370c3715361145dfd134639e4c8f850dc3a592240d75866e0b6c40a343506"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::style_resolver::try_resolve_single_char_style: FunctionTooLong \u2014 rhwp::renderer::style_resolver::try_resolve_single_char_style runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/style_resolver.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"758586dc68286317be1f3394f3c7684dd9ac7144b6a5ff85da933317f0cd00d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/table_detection.rs: FileTooLong \u2014 1005 significant 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 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e2314e4f9ebf119f62debfb115f6c2d65cd1e072932b72dc6ec062ed3ad99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::plan::execution::run_plan_engine: FunctionTooLong \u2014 rhwp::cli::protocol::plan::execution::run_plan_engine 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"051218795612bb66e399b1d003e83e0eae38ad8dedd713668bccdcd861a7d6dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/shaping_vertical.rs: FileTooLong \u2014 1001 significant 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 501 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_vertical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b033643f5155e1d46933fe28e03bda5b4d15bab39fe608ccf12cee0e44bf4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/audit.py: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 488 over it, 1.98\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":"gym/tools/audit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2df4b229466743937c291b16187346efeee5e08a7027e43c16ae343d799257"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/image_resolver.rs: FileTooLong \u2014 987 significant 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 45 free functions. The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f6cb9a3815683b5101eed9fefc1b2d4b9fcd0991a0bdf70230c38a071948b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 986 significant 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 486 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051fac64e936f7c1865babf7d506a8673f918fe3a29b7d5daf1e9c85ef2e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::header::parse_char_shape: FunctionTooLong \u2014 rhwp::parser::hwpx::header::parse_char_shape runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0703d3fb3026d40b70eccb887bfaf5949e44718ebb667d0ecaedefd7369f44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_detection::cell_regions::select: FunctionTooLong \u2014 rhwp::parser::pdf::table_detection::cell_regions::select runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"94039b82f2a82277b1ace57fce3335ad85084a4ee367a795655b4ba44652452d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.compute_table_y_position: MethodTooLong \u2014 compute_table_y_position runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c61e2afbafcd0eeb033e97039b4698d8ed4af9cd324c3e620cbf13894fd8aff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/image_conv.rs: FileTooLong \u2014 984 significant 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 484 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_conv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e0ec011ddd0f606224ab857a2c7ebe0033257cf828fc5eaadeceb9f70dff1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadState: 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":"src/parser/hml/reader.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30faf54b774354e6ed6ff5eace1a93c06acd6b103ecc61f98c3b00e4603e180"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/font_decision.rs: FileTooLong \u2014 982 significant 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 482 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_decision.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df25d74ed1e144ad44414e345f455e9c9b7bcad24bf6c6ba693827efbfcc6cbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rhwp-chief/_gen_pack.py: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 480 over it, 1.96\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":".claude/skills/rhwp-chief/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c62c876a61f9a1a827c4eb9748c60b09de632488af551219e141f1abc5112b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::data::scan_chart_values: FunctionTooLong \u2014 rhwp_ooxml_chart::data::scan_chart_values runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/data.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f7bb894519b03cad8076bc60295f82138ff6f1c883a0d515651ae9f2eff460"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage: FunctionTooLong \u2014 rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b0cd34afdb27ef1eb509e6b46241d0d18d91d871ad8c0b69833966c2be989c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.render_image_node_with_sampling: MethodTooLong \u2014 render_image_node_with_sampling runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82d870604fc4db5d33fdf62577a44e1d2842c250cc25d90ea8772c7cc219fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/static-svg-path-layers.ts: FileTooLong \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 477 over it, 1.95\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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25df78888237d32b77f19b28bed0507c2f8a66522c257d8cc4cef98387aa17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/agent_session.py: FileTooLong \u2014 973 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 473 over it, 1.95\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":"gym/tools/agent_session.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6c9de9a2704c1036df04d58a46cb30b03100408f4ccc1bfb4da6061b80148a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: more/inventory.rs: FileTooLong \u2014 972 significant 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 53 free functions. The bar is 500 significant lines; this is 472 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22aef1e4868f157c6fb72a928cab1b674e4b5894b44106efde2699234aeed1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/local-fonts.ts: FileTooLong \u2014 970 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 470 over it, 1.94\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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646f5ca24ad2799b9916d7670dc10ef2137401c162d83778af4105a9216b991"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::digest::digest_document: FunctionTooLong \u2014 rhwp::cli::queries::digest::digest_document 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":"src/cli/queries/digest.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c5d641c50b685166c0e64da0cabc410b5cd804384f184d830671730c817fe7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::mini_cfb::build_cfb_with_storage: FunctionTooLong \u2014 rhwp::serializer::mini_cfb::build_cfb_with_storage 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":"src/serializer/mini_cfb.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d468d58ec71fd95d54c12d98a5dbe8bbba4c77d4990a0811f129518f8ec729e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.populateFromProps: MethodTooLong \u2014 populateFromProps runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99810837b8ba6b0147c96875a8a0fa2b5c822d5efd01f45f882550deb41833a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.apply_picture_props_inner: MethodTooLong \u2014 apply_picture_props_inner 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"a431a411bee384d25b778f7439db9364c65913821033af099accbc2ca2c573ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.split_paragraph_native: MethodTooLong \u2014 split_paragraph_native runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffee84a5f8aee33bdddb6cfcea3c595d0e610569159df57a158a8179099d436a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 958 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 458 over it, 1.92\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":".claude/skills/rhwp-bulk-pipeline/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c659642259c58765eae1ec847530520737afcff2c354bc7b8eb48f267698e69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 457 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/bug-hunter/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9707b52f3f36a99e87d487656168889155020a459bddf528ebc4b7e63c79d2ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cells::edit_set_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::cells::edit_set_cell runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ca2ec6161114016655ff3e166f6ddb91e2ff3d269df037ad8e957ae1db1bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_simple_control_char: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_simple_control_char runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29a1cfcc24f44d21d0ecbfec4f808508b843a26c884ce78f19afa8a2f3d9858"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildFillPanel: MethodTooLong \u2014 buildFillPanel runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bc774fc8e89b097425ef409611418e5a49313d747e3c381ed95063ffd76aba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webview/viewer.ts: FileTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 449 over it, 1.90\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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4c1c63f374140cd20331c01d7255ae1b507643bb3e0668867459229f2baf8e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CharShapeDialog: ClassTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 355 over it, 1.89\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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75d756a883fe06e888cc041b39471a1a12f34b4bc34c8b46a5861a7d0329109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/table_paint.rs: FileTooLong \u2014 942 significant 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 442 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acd788c4c60a282ee08b424624c742d450170df0aae9cdd0a84a71481b13b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::capsule::replay::cmd_replay: FunctionTooLong \u2014 rhwp::cli::protocol::capsule::replay::cmd_replay runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/replay.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a0119785587c7f2027eb28b652961a5e38772c58aee70977a6bf34b65045ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.find_cursor_hit_at_x_on_line: MethodTooLong \u2014 find_cursor_hit_at_x_on_line runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"15960542172b0d889f144d1f50fc80eeba1ae76bf87ff3764a084240ca8fa825"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/doc_tree_nav.rs: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: DocumentCore (273-1440). The bar is 500 significant lines; this is 438 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d85ed9ca486b37cde37d0ebc93a4e01922b428f1f8b9b5c5ccb83298c909d02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::metadata::help::edit::print: FunctionTooLong \u2014 rhwp::cli::metadata::help::edit::print 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":"src/cli/metadata/help/edit.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda32edc8c1852730f8b997d5a8306c0781cc4b2df2548998c771f9619b2ef41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaginationResult.copy_converged_pages: MethodTooLong \u2014 copy_converged_pages 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":"src/renderer/pagination.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3ee6c81551a7b484fcea019d1deef9402fee9ebd67940709844428d62e4cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::control::shape::parse_gso_control: FunctionTooLong \u2014 rhwp::parser::control::shape::parse_gso_control runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a4756165efcfc492a67078c88b3ca91ffbaae035bfe7099c18f814a2998d71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_mixed_opening_frame: MethodTooLong \u2014 stored_mixed_opening_frame runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e92a70ae8b47be7653c166860a3c7072789268f14a876d95ec03061718d46b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::tables::insert::edit_insert_table: FunctionTooLong \u2014 rhwp::cli::commands::edit::tables::insert::edit_insert_table 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":"src/cli/commands/edit/tables/insert.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"789eaff84a7ad0df2c74036c46808e3bb804e17db678b5f055052bb50f9c081d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.from_parsed_document_with_storage: MethodTooLong \u2014 from_parsed_document_with_storage 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":"src/document_core/commands/document.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"df921eb22e7f86de5d2ac9bf58018153cd6aa51e74151fce1ff9947b25d48fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::style_resolver::resolve_styles_with_environment: FunctionTooLong \u2014 rhwp::renderer::style_resolver::resolve_styles_with_environment 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":"src/renderer/style_resolver.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95243f72e6f77c77a031f8277263e0396dc3af878b4637db51be4375752501e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage: FunctionTooLong \u2014 rhwp::serializer::cfb_writer::write_hwp_cfb_with_storage 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98f1803632088dc9448b8b6753ade8085478ba2a061d123b3045576f8564203"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/border_paint.rs: FileTooLong \u2014 921 significant 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 421 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"452bc57b56d00a83ff2b1a6e865d8ccd724453b630a002ce68725d75ba1f1f13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::header::parse_border_fill: FunctionTooLong \u2014 rhwp::parser::hwpx::header::parse_border_fill runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"db849acd12df129df00ee702b7f587caaa6abc0439900e4af7289cb0d7b50dea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.advance_row_block_cut: MethodTooLong \u2014 advance_row_block_cut runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092515af88c9fda7e57ea3edb7bd0024983b1406f09df028568cbd495ae0265"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NewNoteFitInput: TooManyFields \u2014 55 stored fields. The bar is 30 stored fields; this is 25 over it, 1.83\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":"src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a468d08549ffe3286c194f8e2d6c3e31d534cf6a17357afc61d3b9acd9de715"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::raster::export_png: FunctionTooLong \u2014 rhwp::cli::outputs::raster::export_png runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ea8edea8a3902631a31a840c084cc8985b147067d54b634aa8f50d4b871a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::diagnostics::dump_extents: FunctionTooLong \u2014 rhwp::cli::queries::diagnostics::dump_extents runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/diagnostics.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da1b7111866e8f7cc4016b0045e1d9c5df157ad5913404b0e1cca53290ff594"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paragraph.insert_text_at_caret: MethodTooLong \u2014 insert_text_at_caret runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f5508b9862d6df08a5e49834338f751c1387881c2cedeccde305c49775695"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/font_glyph.rs: FileTooLong \u2014 912 significant 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 412 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/font_glyph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6c85e3c0425b978f0be4c2ab259179ba33af82251ca71776a135e679e43e19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::object_ops::chart::validate_structure: FunctionTooLong \u2014 rhwp::document_core::commands::object_ops::chart::validate_structure runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee905e8c9e2ed1735bc48a3c2717ecf263e313f55e5c27eaca27621cd839ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontEnvironment.from_document_lookup: MethodTooLong \u2014 from_document_lookup runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_environment.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fe679a2e5a0e14ab69f2446e8ae045c8cfcbae503ef13ae2673bfdf7edee82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/chart.rs: FileTooLong \u2014 901 significant 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 401 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf84de2132721d8ff4c9cc9a23da2b09191bc613696e5817b4df54cc722601c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.paste_html_at_caret_native: MethodTooLong \u2014 paste_html_at_caret_native 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dffcb546e4a719c12d173cdfcccf6d8c0f277b4b40c7f57c3b7662237baa3e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_table: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_table 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b87b4dd37825d5fd1d79a3a2339942bd628d24fa0139af1856ffcfef4184e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeightMeasurer.cell_nested_controls_bottom_with_storage: MethodTooLong \u2014 cell_nested_controls_bottom_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e362b37459f90aa2746db4de4017d2f2d1eada0e60d23883b67f225d669d84d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler-picture.ts: FileTooLong \u2014 894 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 394 over it, 1.79\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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b972fa749f650a0f9c152f005c351e51d906d80d72d1580a1ae9f54117f8d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/catalog.rs: FileTooLong \u2014 894 significant 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 394 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3754a7a396399a5ebb0f37088773cf6bf3174e65ac5025485162fdcfe452c79a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/build_baseline.py: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 392 over it, 1.78\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":"gym/tools/build_baseline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fed376d0aa4f4bea65192df9b869cb5b72538afeb1c2ec1baa3648cc5c93a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/table.ts: FileTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 391 over it, 1.78\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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3775805ccea682925e541c11f83265cec582966b87f6fcb24637036171df6a48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow: FunctionTooLong \u2014 rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"src/paint/shaping_glyph.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ba4f9048d47007c4ad337768176ab09b03c639e9b77df6130203e4bcc384b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::control::shape::parse_container_children: FunctionTooLong \u2014 rhwp::parser::control::shape::parse_container_children runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"src/parser/control/shape.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"4772b459deb515721c09b9c67d6f258fe017904b07b55ad05c549f2d52909a1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/text_replay.rs: FileTooLong \u2014 889 significant 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 98% of them inside a single declaration: SkiaTextReplay (2 blocks, 28-1150). The bar is 500 significant lines; this is 389 over it, 1.78\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":"src/renderer/skia/text_replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7871c4d4a7ec7fc9a64a8ecfbd00d7a48769818fe0d3ef013814e237213deff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::stored_tac::prepare_computed: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::stored_tac::prepare_computed 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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6120bce0ee76077cda39c62324a8f382a70cd9a7b85ece37333c9bdaa68d0b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/cell-border-bg-dialog.ts: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: CellBorderBgDialog (85-1152). The bar is 500 significant lines; this is 380 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb093ac4cf1b4b70e6e9a3e958c468f2f55eda73143df42e6103fdb737893d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::vector::parse_export_svg_args: FunctionTooLong \u2014 rhwp::cli::outputs::vector::parse_export_svg_args runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/vector.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8464a58159621c3dfb554d28b404e67bc248c85884dab5244b053acb7770f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::doclang::eqedit::latex::command_for_exact: FunctionTooLong \u2014 rhwp::doclang::eqedit::latex::command_for_exact runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/eqedit/latex.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f8ee2d757d846d998ab81f744878c9e6df0c49d734e033d7c79450b8bb5792"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/shaping_context.rs: FileTooLong \u2014 878 significant 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 378 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"546e17c391049314088c031d8850d0057098ee283d0e3f85684820bbf52f875f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/transition.rs: FileTooLong \u2014 875 significant 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: TypesetState (8-1213). The bar is 500 significant lines; this is 375 over it, 1.75\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":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab9ac03fd3ee7e6450d7a97366879b752f5021c668b503b95d9b01533d09f09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.parse_html_to_paragraphs_at_depth: MethodTooLong \u2014 parse_html_to_paragraphs_at_depth 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":"src/document_core/commands/html_import.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0dc5795e54e0ae7228955e66211b7afb885b5c99a496a04717b37c046c33d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_host/gpu_gl.rs: FileTooLong \u2014 870 significant 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 75% of them inside a single declaration: NativeGlPresenter (3 blocks, 243-1084). The bar is 500 significant lines; this is 370 over it, 1.74\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":"src/native_host/gpu_gl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86c57fb7f7f31e267b0d9901233afd09fd236400ae9a1e82a6a0a3c650b53f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.renderTextDecoration: MethodTooLong \u2014 renderTextDecoration runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eadbbf594cfd707e97a10636dd995970a0cefe26501be27d87549faa4594f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::verification::run: FunctionTooLong \u2014 rhwp::cli::queries::verification::run 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":"src/cli/queries/verification.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13632fd9f27c3ce05e757b189c86e2d155369ba605d180723d5e79a4b83b3bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EndnoteShapeDialog: 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":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"861daad946a7340eeb1fee243ffd4a02938b44838e894732a9049bd08fce3935"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.group_shapes_native: MethodTooLong \u2014 group_shapes_native runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdfbfe44e21fd31c0bb5ff2ffa1697250dfbaf2947d17e3c83d0558a850a663"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::header::parse_para_shape_switch: FunctionTooLong \u2014 rhwp::parser::hwpx::header::parse_para_shape_switch runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.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":"src/parser/hwpx/header.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8da380b334e713ef7b13b89bf8eb263e61639ce1663116e99da1495cbacde5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.rowbreak_straddle_cut_units: MethodTooLong \u2014 rowbreak_straddle_cut_units runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.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":"src/renderer/layout/table_layout/stored_span_content.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8017ec04728307a1904149b45d263989fb099878a74a99699f8d5168ac5d44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 362 over it, 1.72\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":".claude/skills/rhwp-agent-surface/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3138c774729e522f70f218ccfd8e3f556b5adb5bb2decd479ef552d2148d3e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resources.prepare: MethodTooLong \u2014 prepare runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import/resources.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7713d70fe536e6bce6dd0beef2459329ff0a591dfb2775e613a27bfb6a81a9ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/header_footer_content.rs: FileTooLong \u2014 859 significant 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 359 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b4576820ca7a0db884c8c31101d046d4e79a0443ab9fa25bbad99ee6962653"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::verify::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::verify::run runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/verify.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"611b48d3baea5574674602e672e16c2f62a856b6c3d99095a290271f40ad90c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::security_inspection::inspect_watermark: FunctionTooLong \u2014 rhwp::cli::queries::security_inspection::inspect_watermark 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce02ac1cb24e054a838c88aecc7250af9c99d7c67336bddf73073e4c1662e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/document_text.rs: FileTooLong \u2014 847 significant 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 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc90d9e837f5b54b34106edbb52644bdccd5314a2e8f1ae5fc0dd3d7cb6c28b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_group_child_affine: MethodTooLong \u2014 layout_group_child_affine 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ef38e702715797180e5cb870454c1dd95707dbdc18b06830b4f76b8d211b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::pdf::svgs_to_pdf_annotations_impl: FunctionTooLong \u2014 rhwp::renderer::pdf::svgs_to_pdf_annotations_impl 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":"src/renderer/pdf.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de4fb3fa4eae232baa31cc45ef89360101c64ff9df254732a6daa381ff65c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage: FunctionTooLong \u2014 rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage 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":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa656c79a6dfacaaf6da1f5f653ca631a1c18ed0d11ebd43b1f24384a5b7f7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::render_shape_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::render_shape_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf5d81d186538eaf426e7c73e234b1cc520a3e92b705f64fcb8bd1b0ca7dafe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Interp: ClassTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 828-1773. The bar is 400 significant lines; this is 275 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2fd666a4f73e8b76b2dc5c4a1409eedaa936707a95483614463c1a5723aeb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-text.onInput: FunctionTooLong \u2014 onInput runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc00d849d20aec7c89f1675c6885bf0dc67a54419f4083d63c2d9787a43f179f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_footnote_paragraph_with_number: MethodTooLong \u2014 layout_footnote_paragraph_with_number runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c2947d84fb31c517c79ce2699617b6d937ab8cd74d97a1b9b9ca63d0408786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.mixed_nested_flow_extra_for_height: MethodTooLong \u2014 mixed_nested_flow_extra_for_height runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27215}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fdee9a8bbc02329fc073589d7aade352982ec7e7b0718bb754f5684d2d7ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/font_metrics_overlays.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metrics_overlays.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89c9cfc0f241ec6b6f2ae8ede66d9f2b551da5c5771a5aa9b4fe0e7af37148c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/commands.rs: FileTooLong \u2014 837 significant 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 100% of them inside a single declaration: TypesetState (4 blocks, 8-1168). The bar is 500 significant lines; this is 337 over it, 1.67\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":"src/renderer/typeset/state/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff773ae984c06fa542d5e2d13e2e64afa31c52f52a4352caa0ff09ecd5b360c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::mcp_serve::served_tools: FunctionTooLong \u2014 rhwp::mcp_serve::served_tools runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.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":"src/mcp_serve.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"128faad385fdeda93abf287aa40bb305f93f3b5892cbbeaf3cd1aa5a0f7ed516"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.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":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09f61cffc1e5b3a6b62684385c8b00fd8de6b77bd5ef8d865e0960eff10edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::whole_fit::inspect: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::whole_fit::inspect runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.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":"src/renderer/typeset/paragraph/whole_fit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f295dc11ae9c768e29aa56731532e617282ffa25f5919d160785f7d71ca6c2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes: FunctionTooLong \u2014 rhwp::serializer::hwpx::roundtrip::diff_paragraph_char_shapes runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0931631bba5b93b934f54de0d54c77ea7748c3931ac917fe7e0bf629e9b17e8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bitmap.from: MethodTooLong \u2014 from runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.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":"src/wmf/converter/bitmap.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4501fe267c2efae702a5b515c704dd8e217035f4f11f86915561b611181168a4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageRenderer: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2defa7e107fc5c81dbead3663459594bab267586600a368c58db38857f085db0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/editable.rs: FileTooLong \u2014 831 significant 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 331 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/editable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a66922b5ba6f16da224124404095ae0b348ba7a0838e7be0388609edc544c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp-dev.initRhwpDev: FunctionTooLong \u2014 initRhwpDev runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"17014d264f706592bb52f4e92007b14731bbebfbb872789ee6345a6464a5694a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::main: FunctionTooLong \u2014 rhwp::main 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":"src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d2e72de8844aeab538195b5da9b1e174d7b71f859c50dcc024d745129ff398"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::harness::cmd_harness_wrap: FunctionTooLong \u2014 rhwp::cli::protocol::harness::cmd_harness_wrap 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":"src/cli/protocol/harness.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bc40ade5f974a33af2460eb1577087e1f57930edb43494920528d687591d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_body_picture: MethodTooLong \u2014 layout_body_picture 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb00d0bf17ef7cd9c5ef022d748857cd62e99251439546f8b0e61d0ff0ee7cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::scan::scan_lines: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::scan::scan_lines 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":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dbc53f24e6ac55ef8a9a359762121798ca7a37cb0eddd0311416dabea00144"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ledger: ClassTooLong \u2014 656 significant 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 50-920. The bar is 400 significant lines; this is 256 over it, 1.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_inference.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb80d0698133942b14e4315d7e8c71870aef850fa0ed2a15a7ad754b3eac78b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/layer_renderer.rs: FileTooLong \u2014 820 significant 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 320 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layer_renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d2249f60dd81ce0c2c325dad3e04ecd67edbb5cdc0ab1e8aacad9516e6aaef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::evidence::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::evidence::run 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":"src/bin/rhwp-agent/evidence.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19f49c58112d0228ee34e2c45596d076f5a2143c8cdb6533cd11737fa204bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.build_char_properties_json: MethodTooLong \u2014 build_char_properties_json 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9164e8130e6c9987642aed94ac07d30b3496d29f010b9cea3d23d23edccce05d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.equalize_cell_block: MethodTooLong \u2014 equalize_cell_block 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":"src/model/table_equal_size.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f46606c789bea039fb751ec413fbad555fc68838c0a477652e71dc53f03429"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.render_layer_paint_op_untransformed: MethodTooLong \u2014 render_layer_paint_op_untransformed 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":"src/renderer/svg.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0608605374e4ef1053770b6a938a783177d350b714c490796c1cef7455d86cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/char-shape-dialog.ts: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: CharShapeDialog (105-1147). The bar is 500 significant lines; this is 319 over it, 1.64\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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"888ea1615cb455ffea49a28c0629f08fd593ea96fb4e3c0e537b1f8fd99c22b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::capsule::lineage::trace_lineage: FunctionTooLong \u2014 rhwp::cli::protocol::capsule::lineage::trace_lineage 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":"src/cli/protocol/capsule/lineage.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35c129b56e2223aea2b63198775a105b978dfbb67f5e93b5257c01f97e7728e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SVGPlayer.ext_text_out: MethodTooLong \u2014 ext_text_out 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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cee86c2249ce6b216b37e562dec9a5ed71799ba126fe570a4790d8f4783615"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/robustness.py: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63\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":"gym/tools/robustness.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68412fd348dd50e79a7c937177cb6b22ebb90a8fbba3ecfdc47fb8cf1ff9bb40"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeGlPresenter: ClassTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 243-1084. The bar is 400 significant lines; this is 249 over it, 1.62\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":"src/native_host/gpu_gl.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e92833ba7d3f94d6f9fd676351d4c813c1a194f507d4a8133d80cb42dae4d04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::security_inspection::inspect_unicode: FunctionTooLong \u2014 rhwp::cli::queries::security_inspection::inspect_unicode runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2566eb80152cdca891a192504db455f78041c93330129e97544baa67990b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.compute_cell_line_ranges: MethodTooLong \u2014 compute_cell_line_ranges runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12025}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f599987b980a0b06c644b7f3e37b1edb79a4ba86863a71a396c2c9f24f1127"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/leaderboard.py: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 309 over it, 1.62\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":"gym/tools/leaderboard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20272ec4d34fa2ec4051494ac6531ac90b932552d4b3a5e863fb0c87769e48d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_texture_view.dart: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: NativeTextureController (187-956). The bar is 500 significant lines; this is 309 over it, 1.62\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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba2f8abde65fbd281437df67abc7515391e5428f41c3b9d84895720d04491c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serializer/doc_info.rs: FileTooLong \u2014 806 significant 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 36 free functions. The bar is 500 significant lines; this is 306 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/doc_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f310765b2f1e81433d6cd2c633a36584da817b41f5904566cc2f6e7ea0389f00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.build_inline_table: MethodTooLong \u2014 build_inline_table 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"70396c006f8ac7d1a71f733a08cc1a01da5414d4c4b209e673304799851db2af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParagraphMachine.feed: MethodTooLong \u2014 feed 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40476b9f1302a2a8409ad90e21b770483e336bae9944f788d0c524bcd87c30f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.process_controls_with_storage: MethodTooLong \u2014 process_controls_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"d986b3ce9adbddfd8efb9ef0508dac2109fb0a483ae14724e265a941dd42a9ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HorizontalShapingTransaction.shadow_measure_with_instance_request: MethodTooLong \u2014 shadow_measure_with_instance_request 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":"src/renderer/shaping_context.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"930f21f0a2b7d5a271dce3d858a832acf4762afe88e0d01a74d5c370b3130efa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/injection_scan.rs: FileTooLong \u2014 801 significant 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 301 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bf6323c1c8f73f0e30e15a5b67b94e46807e374fe9fa6a862fd7d98a28393b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Allocation: ClassTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 3 blocks, lines 9-917. The bar is 400 significant lines; this is 240 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8337733babbbd75b4eec5b5f12685171e8fe92fbf55152dd150ea578d158eac5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableCellPropsDialog.buildBorderTab: MethodTooLong \u2014 buildBorderTab runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c1a1f5b27e5bf44c283540a6b772ae6bd7c158498fac73cf0c7421c7e1e17e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.build_para_properties_json: MethodTooLong \u2014 build_para_properties_json runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3ee201b262854999eccba010844924eb375437eea7ce696e7b463243217e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_shape_properties_native: MethodTooLong \u2014 set_shape_properties_native runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c7e59af1498516ebd6a90ddb9662960d5e6da9647aec61464e6599fa17643"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/render_geom_diff.rs: FileTooLong \u2014 798 significant 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 298 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca771aa63097a3dc9936b37661a016eec80cf9b16ffc1fb8aaa5f02e7f41f24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Toolbar: ClassTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 237 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b222d1d12a002bbcc3f4e606d688e7537ab64c115f463119c05fa4457e8cf8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::document_text::edit_insert_text: FunctionTooLong \u2014 rhwp::cli::commands::edit::document_text::edit_insert_text 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51e0f065688751bf886c6a09029bf19cb2888da6f7aa0495792b5383791106"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/body_text.rs: FileTooLong \u2014 793 significant 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 293 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eccf097e5e61dd7fa8f03bf01048b68b6b8714785f8545af0c2e89d4d419ce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PagePaintContext: ClassTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 26-931. The bar is 400 significant lines; this is 233 over it, 1.58\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":"src/paint/paper_viewport.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c3c4dae87ad8de8541179f3785d96b51528635047c86952d4fb04fc57b21ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::mixed_host_line::prepare: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::mixed_host_line::prepare 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":"src/renderer/typeset/controls/mixed_host_line.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a2e0d9fdb4d87f077b4659864015b2175503a440b73be84cb882b879945b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::table::host_spacing::resolve: FunctionTooLong \u2014 rhwp::renderer::typeset::table::host_spacing::resolve 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":"src/renderer/typeset/table/host_spacing.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c10e30d4dce76c8d75207b041b594428ea76b885d6f2746723c645455fa9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::resource_supervisor::pdf_confinement::linux::syscall_filter: FunctionTooLong \u2014 rhwp::resource_supervisor::pdf_confinement::linux::syscall_filter 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":"src/resource_supervisor/pdf_confinement.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"898d1f8da5f71349b0476da1d7f1a9956f22a0c76406b5b6a18d624f124deb94"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::doc_info::try_serialize_doc_info: FunctionTooLong \u2014 rhwp::serializer::doc_info::try_serialize_doc_info 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":"src/serializer/doc_info.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0a200a7da6af12d74c579187f6858bddbd50bc3abc9c91b293d2ca78574e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 789 significant 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 36 free functions. The bar is 500 significant lines; this is 289 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81f266724da9340b96b0260ab88ba859180f3b6196053f8405b1e1b184efdf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/main.js: FileTooLong \u2014 788 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). The bar is 500 significant lines; this is 288 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeab72c7fb844d359edd8137802ff52310b027ad178cf5362df270fc75d6df2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_contract_analyze.rs: FileTooLong \u2014 788 significant 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 35 free functions. The bar is 500 significant lines; this is 288 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae7e1e00079cc7ddb79654965abf5af847769cfc48a129d29ee5085831e257"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitGlyphRunFontCache.replayStatus: MethodTooLong \u2014 replayStatus runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3aba2111d31d88baf106b49a426755a0d7fdc285e9571d95f60f700be80edc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.row_cut_height: MethodTooLong \u2014 row_cut_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e83c3e23b518ef4f9ae722797c4c0f63daa5709d876c08ed67f70d920ac269"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParaShapeDialog: ClassTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 226 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a76bee714b699e935e3e886b2a061ce49ec1795254f3ca02cac3708b8b6765d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/font_metric_coverage.rs: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 280 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c213fb8741442d7c65b7c0d0db76742484b3e5b4433a47cf36853c85d0ab749"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::vector::export_svg: FunctionTooLong \u2014 rhwp::cli::outputs::vector::export_svg 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":"src/cli/outputs/vector.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f60ab55b6cd7bec218739a2157536a4413524f0194a8c1a03fe5f9f01cd9a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::exchange::bundle::cmd_bundle_export: FunctionTooLong \u2014 rhwp::cli::protocol::exchange::bundle::cmd_bundle_export 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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f1c864e1667332b94cc94d990ade70cf45ab838dac6ee98f7f53f123b32b93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_mixed_opening_cell_frame: MethodTooLong \u2014 stored_mixed_opening_cell_frame 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":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f200bebd68a2e851af286a931a96a899b7f4148fb5dce30cec733710b0d04cb1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.register_queued_table_footnotes: MethodTooLong \u2014 register_queued_table_footnotes 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":"src/renderer/typeset/table/footnotes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03b9ab2673e7607b9a69d18cdbcdd742858e5c174e480df1dbd11dc442565a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fragment/scan.rs: FileTooLong \u2014 778 significant 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 98% of them inside a single declaration: TypesetEngine (25-1030). The bar is 500 significant lines; this is 278 over it, 1.56\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":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"310b2795198529ef6c234237f6f445bfd06aaa0095e9aaeedc3722d7f7a6fc1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/cfb_reader.rs: FileTooLong \u2014 777 significant 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 277 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bc5fc3d65214019155c661201ab6b2629ce4dd4f587ee46257d03779f43f85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_host/presentation.rs: FileTooLong \u2014 776 significant 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 276 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/presentation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5163e78fea0f418c9cd289f80eb5bbdb2bd06f459ef32140d8f4f96e741d0aaa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FontEnvironment: ClassTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 17-965. The bar is 400 significant lines; this is 220 over it, 1.55\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":"src/renderer/font_environment.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"99858caaa02e9af5ead3a14e64e96c506d15c2ebad35a599a5cff6316abdbbcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::scan::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::scan::run 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":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fc0b318bb2bdd33e648dcb7b0dd8fa495d4932c1020863a6f6ccb53b275ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::raster::parse_export_png_args: FunctionTooLong \u2014 rhwp::cli::outputs::raster::parse_export_png_args 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":"src/cli/outputs/raster.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab850ef08b71770dadf201e5f398c31c5c94112cc57ffeedae4feb82bab93d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::trust::governance::cmd_audit_report: FunctionTooLong \u2014 rhwp::cli::protocol::trust::governance::cmd_audit_report 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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0df93eb115ae4854b55d838dad9dbb00d23753212f08cfc691ac9ed07974ca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParagraphFloatPlacement: ClassTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 3878-6816. The bar is 400 significant lines; this is 218 over it, 1.55\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":"src/renderer/float_placement.rs"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b8c469e0148ca6dde76ca029bbbba6c7a6731d09c07a99a160949342e8e1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/diagnostics.rs: FileTooLong \u2014 772 significant 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 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7e16b7b41b4fa2cf107a5a7995bb3df467f2b0293dbfb23908714bdc627a7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/formatting.rs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 271 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05a8ce9a963236c86ce92fae28bac7aaa869e882a35f60e60f9fbbbf30627a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpjson/body.rs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da90dfe2c9ced85ab3dba6b3100800c03fa74125d89d8cffe852bfd3e76076"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::plan::execution::validate_plan_steps: FunctionTooLong \u2014 rhwp::cli::protocol::plan::execution::validate_plan_steps 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"400650e830a6971cdd94b2c7a823b94a8fb187f9035db36a49c1d03c6b3b597a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ResolvedCharStyle: TooManyFields \u2014 46 stored fields beside 16 methods. 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":"src/renderer/style_resolver/resolved.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd693a551fc72820d5e38bda14cb0292ce190ed2d82bb974fc0de6988d9e0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controls/stored_tac.rs: FileTooLong \u2014 766 significant 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 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c4fa96fac9fee6822a789e6a02f40238fe212eea3c2a9a1d1a7e6435616392"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::place_fitted_paragraph_with_storage 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b1d63403fe042b98cac50ede4fe5a3b4a28ebd1fbba7f775bbb4780214ae11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.step_block_table_fragment: MethodTooLong \u2014 step_block_table_fragment 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":"src/renderer/typeset/table/continuation/fragment.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaa234c2d553f782876bdbe3a45e8c56ae90a4cb433bf74cc243bf0c6f0e0c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializeContext.try_collect_from_document: MethodTooLong \u2014 try_collect_from_document 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":"src/serializer/hwpx/context.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9109e2cf2453c90ae368109278d13f9450a3d052ecac0c6fd343df1e23aec8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayerBuilder: ClassTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 37-860. The bar is 400 significant lines; this is 208 over it, 1.52\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":"src/paint/builder.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feabd6b7b8202881763492eb34caae84eb5445eefbf8739d5e0c70191e102c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.build_char_properties_json_by_id: MethodTooLong \u2014 build_char_properties_json_by_id 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e56ad73ab8169889e5a81bc7ba4f9fb7061d16a089acb815188c943921ebda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paragraph.merge_from_with_storage: MethodTooLong \u2014 merge_from_with_storage 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":"src/model/paragraph.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ee37753a45aa99444902a80b896ab7d05dc0ce8ddf9e49f0faf3aff8757cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paragraph.replace_text_keeping_slots: MethodTooLong \u2014 replace_text_keeping_slots 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":"src/model/paragraph.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb8b9cc5e07d914220b01c3e9af9dae81719e597fb1aa726049544a5fbcdf63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LenientCfbReader.open: MethodTooLong \u2014 open 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":"src/parser/cfb_reader.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d517718fbca6ee2c9827793eb2beba2234066a50925d2ed3d5170004ff88ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 758 significant 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 258 over it, 1.52\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":"bindings/Native/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5005137b0dc54245240884aa256e71e2fd4e8e9df653e0af2c672581ce7305a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_chart_svg_with_text_measure 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a460cb0691d5692fbd0d3fd7dab45f204fcab1bd05f825fb7b02cdfd963985"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::text_measurement::try_char_style_to_text_style: FunctionTooLong \u2014 rhwp::renderer::layout::text_measurement::try_char_style_to_text_style 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"bead342b4298c4cb0d4b4fecc0f62ff337f86fbee401da7f43fc146d8d79b0e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_image_with_fill_mode: MethodTooLong \u2014 draw_image_with_fill_mode 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":"src/renderer/web_canvas.rs"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aacb1083f8a99618e8dccbeb6c8f653e01420968052d96088d42667939153d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::content::write_content_hpf_with_scripts: FunctionTooLong \u2014 rhwp::serializer::hwpx::content::write_content_hpf_with_scripts 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":"src/serializer/hwpx/content.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e063337c67eb573d8c7d77a3afeb03c21ae71b0421ae3c1403834bd4f56c600"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document_core/html_table_import.rs: FileTooLong \u2014 753 significant 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: DocumentCore (9-1076). The bar is 500 significant lines; this is 253 over it, 1.51\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":"src/document_core/html_table_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04087ecf9b0bde09bb4df8def342adcf9c866a206a40344c7f3b0b6d1339ee22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control/shape.rs: FileTooLong \u2014 753 significant 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 253 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":"src/parser/control/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dcedc24e9151dace709d74af8c7394cd84973c591e80509ff4085f4c946acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/glyph_replay.rs: FileTooLong \u2014 753 significant 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 253 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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40a6cee22a763d121fdfd984eeb87ce6cdb0844673ba83dd16af0c18bf3ba11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/table_inference.rs: FileTooLong \u2014 752 significant 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: Ledger (2 blocks, 50-920). The bar is 500 significant lines; this is 252 over it, 1.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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd760b60178c11be1390fc7e3db15bfae734ce4dfb5f365b221e1c111095fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/release_gate.py: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 over it, 1.50\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":"gym/tools/release_gate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"591287f7e7935ba09a0a852605363cb172629ab2e76b6ff82eef1e79dfe53e90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.setupEventListeners: FunctionTooLong \u2014 setupEventListeners runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efc78d98b0be1ef22f2d2a45ea51eab5061b65def56e4b077339462c9520a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::tabular::chart_to_csv: FunctionTooLong \u2014 rhwp::cli::outputs::tabular::chart_to_csv 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"591b83698e5ab433a3253195a1100b5a18ecf420227a647b6d44e15163e91558"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::metafile_print::replay::rasterize: FunctionTooLong \u2014 rhwp::paint::metafile_print::replay::rasterize 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":"src/paint/metafile_print/replay.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"836908c7bb0f86833ad17d2422e69cdee0f7e66891b25386804ce2ce7309f1f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ledger.observe: MethodTooLong \u2014 observe 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cc4ca51fc58348d10a1dfcd24fd2933ae9efbab07546b5dc2be7244c9f9fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame: FunctionTooLong \u2014 rhwp::renderer::layout::table_layout::repair_clipped_nested_table_fragment_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f7270dda3fcc8c95a130002c590bb94d71ca67197a8d4e95f7fe5b7e07b20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/border_paint_structure.rs: FileTooLong \u2014 749 significant 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 249 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaa8c04aed6e63cf9966da3ae4964deb73722f24fee600825e74681f47086c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeTextureController: ClassTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 199 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbdbf106b725e8fbaedd72b7f95afa2da289f871960d7fb931e92f670152d46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/builder.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: LayerBuilder (2 blocks, 37-860). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f47b311b4ca480b6a446063c5eb26291c99d9ffa8a3beec7c2b32baf8684d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.split_table_native: MethodTooLong \u2014 split_table_native runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5989f40117a5dead8c10711bc3ab1a2971e2888567b06f9e3dc3aa574ddfc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.split_cell_into: MethodTooLong \u2014 split_cell_into runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d4d1d7fd1b1403b6b6fea67ef5b115e3889834b69edad832f70493723976c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::metafile_print::text::prepare: FunctionTooLong \u2014 rhwp::paint::metafile_print::text::prepare runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_print/text.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81ce6de989d7a2105aceaa2692b1f150b528fe75848fab64baf30dc651c00e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.typeset_section_endnotes: MethodTooLong \u2014 typeset_section_endnotes runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"16deb8ad6d909a406ee0d71f2b37a995f5d07314ec02564ae1d9345e3411a059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/differential.py: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 242 over it, 1.48\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":"gym/tools/differential.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddd1a6eca5149509540ef484dc4d60b1d234270fc8c81e5e88877685be5e6fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_host/runtime.rs: FileTooLong \u2014 742 significant 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 242 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fcb0b0160928d65bd30f11020e4fa3af6621718be196ac682e8ecd8d12eb7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main: FunctionTooLong \u2014 rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595::main 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":"mydocs/tech/investigations/issue-595/probes/inspect_595.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d47617ab7cc1ffce95f2858b1e0aa13dee3d06fa8fbfcc67bb4ba3824b3034c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::text::export_markdown: FunctionTooLong \u2014 rhwp::cli::outputs::text::export_markdown 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":"src/cli/outputs/text.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5a4e65d415a7d23e1547f893c01bfbd4610a1897c92898c73b92eb5ef0f4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::trust::gate::cmd_gate: FunctionTooLong \u2014 rhwp::cli::protocol::trust::gate::cmd_gate 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":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a135aa8cadfa51e2b1181bdc6bb3036c1d06df5b1d0caa963bc788a52af53b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images: FunctionTooLong \u2014 rhwp::document_core::builders::exam_paper_images::build_exam_paper_with_images 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":"src/document_core/builders/exam_paper_images.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f59547654b9a0f754c4e14d66671e437ca60affe5e335d3b1fc2b01c0f30a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_table_cell_formula: MethodTooLong \u2014 set_table_cell_formula 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":"src/document_core/commands/table_formula.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da3184b7e46fc9e1df04a3ed002afb9bbb71ec3c152e9888af60def8e3cb17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::body_text::parse_para_text: FunctionTooLong \u2014 rhwp::parser::body_text::parse_para_text 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":"src/parser/body_text.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"002b9dd582dc4fec52e15c4cd5e459f394a9b37ad4e81bcee3b57fb766d32f57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_nested_row_frames_with_storage: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_nested_row_frames_with_storage 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":"src/renderer/float_placement.rs"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb63f7031191c279b1e45c2b5d61de94640119a4feb9a34ffe52b8faea6581f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.advance_row_block_cut_with_row_offsets: MethodTooLong \u2014 advance_row_block_cut_with_row_offsets 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":"src/renderer/layout/table_layout/row_block_cut.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5214391c098680906995b8dcadc1c90401c17efee7f218bb1b02c91f9d4a0bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.typeset_endnote_flow_tables: MethodTooLong \u2014 typeset_endnote_flow_tables 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":"src/renderer/typeset/notes/endnotes/flow_table.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfda44651fa7142e7c52af650ac77ce2a51eea7d7809250f5515dc4cdec3151"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/release_diff.py: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 238 over it, 1.48\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":"gym/tools/release_diff.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a77b2563586be02bd9606260644e7f08bad575bdeac9c19e9aacae8b076e8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::diagnostics::hwp5_first_para_control_probe::record_patches_for_kind: FunctionTooLong \u2014 rhwp::diagnostics::hwp5_first_para_control_probe::record_patches_for_kind 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":"src/diagnostics/hwp5_first_para_control_probe.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1df630c5eeb0d169e04afc93e77d6635af627ab84348a88663ad24227ae08b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::border_paint_edit::plan: FunctionTooLong \u2014 rhwp::document_core::commands::border_paint_edit::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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"75935cb26d4ce485fde514d2d81f9ed68bd9528bfef650b20ac83abc65b555ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_table_cell: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_table_cell 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":"src/parser/hwpx/section.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d16c3f8b3b9b840cc4afd3b4d7a801205a769ade47d333e43c982e17e71262"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::kerning::measure_kerning_paragraph_segments: FunctionTooLong \u2014 rhwp::renderer::kerning::measure_kerning_paragraph_segments 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":"src/renderer/kerning.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cd69f99ad9a852d617338b2d5802cf3cddf6a7ebe544ba02e41e747b860833"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::shaping_paragraph::run_horizontal_shaping_line_transaction_with_policy: FunctionTooLong \u2014 rhwp::renderer::shaping_paragraph::run_horizontal_shaping_line_transaction_with_policy 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38f4798ed5370ec9079eff630f688dba748dc477f98c503b316986e01ca93b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: META_ESCAPE: TooManyMethods \u2014 44 methods, declared across 44 files: escape/abort_doc.rs (1), escape/begin_path.rs (1), escape/check_jpeg_format.rs (1), escape/check_png_format.rs (1), \u002B40 more file(s). 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":"src/wmf/parser/records/escape/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c74d9413b7f3cdd77a37bd1700a174e67ab9dd87b6e0fe40244082eabe7b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/security_inspection.rs: FileTooLong \u2014 731 significant 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 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"447643bdf42a5233262e0f7c9430f33a3b3e665e3a56b7c521fc9bf2d069efdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/media.rs: FileTooLong \u2014 730 significant 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 230 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f41a99583fc3d5ce5005f912b4e2463c4f1958b672deb9233302c6d95e1990"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.replace_matches_native: MethodTooLong \u2014 replace_matches_native 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05c6f432060642e622257f32e872e21349434805c13689bb8f48c1317085545"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::parse_hwp_with_lenient: FunctionTooLong \u2014 rhwp::parser::parse_hwp_with_lenient 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":"src/parser/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d7e3d0971b0eeda1c0c8f53368df1092a6f09fa8375c55ccd9c87f48823fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ledger.reconcile: MethodTooLong \u2014 reconcile 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1305ea52e81e844a949db7e2419f1a52e44f9588a4480174882c2ad44b121f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharShapeDialog.buildExtendedPanel: MethodTooLong \u2014 buildExtendedPanel runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb2467ceaf213ba667c1d2f024e6701c948a0cebcb552ff5e236da28b849f83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::text::edit_replace_text: FunctionTooLong \u2014 rhwp::cli::commands::edit::text::edit_replace_text 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":"src/cli/commands/edit/text.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71a85cacf57fab08546bd3c4deda5994e02e72920429d48de2134a0dd456871"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EqParser.parse_command_inner: MethodTooLong \u2014 parse_command_inner 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":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"52135dcd92d3f1c7f91610047413f3628a6cd128a313e198cbf3205a9b9c420c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.scan_block_table_split_rows: MethodTooLong \u2014 scan_block_table_split_rows 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":"src/renderer/typeset/table/scan/runner.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebd10fac5ea47376f8fb114ac67373e964a0bfa8af54f3b0b4ba09631f5130d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::control::serialize_control: FunctionTooLong \u2014 rhwp::serializer::control::serialize_control 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":"src/serializer/control.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eae46a58edc02c06d2140d706ac0ec86c45b2aa01246926c3f644071c29dbe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/html_import.rs: FileTooLong \u2014 724 significant 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: DocumentCore (140-1066). The bar is 500 significant lines; this is 224 over it, 1.45\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":"src/document_core/commands/html_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea525b1ad3e7219f5d5f6a7773d8452ee22d2094cd188375ac64f998871191d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/paint_bounds.rs: FileTooLong \u2014 723 significant 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 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_bounds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89707a44f137dfb51efe865641edbca0a14b628bbdc833b0b010487a0a3d09e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::privacy::edit_sanitize: FunctionTooLong \u2014 rhwp::cli::commands::edit::privacy::edit_sanitize 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1dced5d9a0c65c3ff41e6fb9b575bd156d0bb6c90dc3b9fb74f84e436fb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::plan::execution::execute_plan_steps: FunctionTooLong \u2014 rhwp::cli::protocol::plan::execution::execute_plan_steps 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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"649135ebc30756bca074618f0ffc8f3ae16a4714af9f53364fffe281ce62c7b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_empty_control_table_frame: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_empty_control_table_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba775de92c45a13dde317e8e7b783ae1c1c66467dd7522c1cac3c1e0cb1ce5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlRenderer.render_node: MethodTooLong \u2014 render_node 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":"src/renderer/html.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a842c75e5cb1935e3f53f7dc777a53f6a234fe78ed4cd23595f53a119318a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/trajectory.py: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 219 over it, 1.44\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":"gym/tools/trajectory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d62862bb960b91fc977a4b4da6ce20ee87a5933df55b08c836249890aba1be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equation/layout.rs: FileTooLong \u2014 719 significant 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 76% of them inside a single declaration: EqLayout (2 blocks, 51-867). The bar is 500 significant lines; this is 219 over it, 1.44\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":"src/renderer/equation/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40f56811fd82e1e314e4fe1634c1c725fd24672242fc5957c16e28cb5d15ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/ir_comparison.rs: FileTooLong \u2014 718 significant 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 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ab493bb60d29dc8363024f1b7c1b96fb73babf464f9f231fc6ce1843b2932"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.exit_control: MethodTooLong \u2014 exit_control runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6ed77212a89d3eeaacbc689e2e68d452d856e23d527ccd412aff959ca1fe10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_note_pr_children: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_note_pr_children runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fd5854a370672fba6d7b30aaf9d18ce4526f2cc2552ffafa077b26ab53f8d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_paint::compound::plan: FunctionTooLong \u2014 rhwp::parser::pdf::table_paint::compound::plan runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint/compound.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380df843ac3df8be7824417579224050c6d7b07cb4ebfd58dd080cd2841670f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage: FunctionTooLong \u2014 rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/nested_table_frames.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6a79e80ecf29173208788a729837c608409827a6e5f93898acaed57d5df1c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/allocation.rs: FileTooLong \u2014 711 significant 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: Allocation (3 blocks, 9-917). The bar is 500 significant lines; this is 211 over it, 1.42\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":"src/parser/pdf/allocation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55679b62dcca01aaac860e75ab4861b84f9dfbdc403bff006df82931ac343b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeDocument._complete: MethodTooLong \u2014 _complete runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd9f2e8368de6d6505ed43e7dfd92c8d316a612fb65066187e06529da4e90d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PagePaintContext.publish_glyph_geometry: MethodTooLong \u2014 publish_glyph_geometry 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":"src/paint/paper_viewport.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22a735c2a813cf59eb2c38258cc0125a50630fb2c53a6b4a377eb8cff0236da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.reflow_recursive_run_extra: MethodTooLong \u2014 reflow_recursive_run_extra 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26991}}}],"partialFingerprints":{"codehealthFindingId/v1":"5753bb2d77f35204dd52f48d30e60a001fe3bee0e59e8453795db74c636c003c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetState.new: MethodTooLong \u2014 new 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":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef02119f20372ba19880849e263bb37df3a8638e1d9666a4355a4623165bf4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IrDifference.fmt: MethodTooLong \u2014 fmt 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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1304f5ba4f5cede17ee3388affeaa41ce09848074cb98bef2c1645800bb813"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/font_environment.rs: FileTooLong \u2014 705 significant 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: FontEnvironment (2 blocks, 17-965). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3653c4118664d4e213439646fddff7616d1aca73a68bad5d4d8661f4f952392b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InputHandler.constructor: MethodTooLong \u2014 constructor runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9f6b68bcef72edf0a1189be328bf6b5511c75aa572c7fe1ddb90416bb1538a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.paste_control_native: MethodTooLong \u2014 paste_control_native 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"407013e5f744b79ba70f5508f24585f5b0a113cbff1be3372468791ae58b1e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.create_table_in_cell_by_path_native: MethodTooLong \u2014 create_table_in_cell_by_path_native 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"86584b4c7c21e1e62cd15a351249f38c185ab285f7de5fa861c266ecf2b4c9ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::inline_flow::plan_square_table_host: FunctionTooLong \u2014 rhwp::renderer::inline_flow::plan_square_table_host 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":"src/renderer/inline_flow.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"478c3a40c624178604ceaecd4bf1249e825ba8b3fe6e144b050318adf4cdf6b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::shaping::validate_shaping_request_with_face: FunctionTooLong \u2014 rhwp::renderer::shaping::validate_shaping_request_with_face 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":"src/renderer/shaping.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c7249f058e77e2feb063cd632745bcfe3c89fdf90795f256133a3877858e52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::svg::generate_font_style: FunctionTooLong \u2014 rhwp::renderer::svg::generate_font_style 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":"src/renderer/svg.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0db313e245ea5c3653b515175c31b962bab75b7bd52fc9036553058bcb0d918"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ruler: ClassTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 161 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"653fe38178913b14dd8f3ad6d33daf4e21a951f224b1849a1c6279da9c2d555c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/schema.py: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37aac70b652a8f0445ce4c79a2f0d0b063dfe2baf27929574ca8974996aa192"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageBorderDialog: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeaf0ac80915a02efb5bc10a847dd914fcfc60a03e0aa978dd1e57dfa7f88bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_cell_header_probe.rs: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d525499ee60febeb80e99ca3836a6396ac7a49f6be5bcd5e50c740e99fb4ebe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.apply_shape_props_inner: MethodTooLong \u2014 apply_shape_props_inner 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"654caf67ffdc40271df626e339591695a5f628601d3ecd6790d76750c020b104"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::mcp_serve::run: FunctionTooLong \u2014 rhwp::mcp_serve::run 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":"src/mcp_serve.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8fb4d86dd6a52190ecbeb6dcced723c027a5692b6eed448391e50542c12457"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::stored_lines_runs::inc::try_split_by_char_shapes: FunctionTooLong \u2014 rhwp::renderer::composer::stored_lines_runs::inc::try_split_by_char_shapes 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bbe96cb764cfc4f5fbe8c967238ef95169621ae9abbf846d12d4f0daa40f47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmbeddedTextMeasurer.estimate_text_width_exact_with_storage: MethodTooLong \u2014 estimate_text_width_exact_with_storage 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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1028d7fbfbfd4cff7e4cb81abef0aebee7c583407d00f724768c9d02f828a6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::order::for_paragraph_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::order::for_paragraph_with_storage 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":"src/renderer/typeset/controls/order.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8810bfa499fe83020ee174d25da3096264c09cb16406acdc44fe68b13da08ea7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.compute_endnote_metrics: MethodTooLong \u2014 compute_endnote_metrics 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":"src/renderer/typeset/notes/endnotes/metrics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb78f8392b63e40098b17fed3b078edf0b2a7091042b0163e6154c056e7e0351"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::write_section_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::write_section_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"06341b3e84614eee01f67120b30dcdaf8059ccc154f4aa2d51b52fb5a8c00ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.paste_foreign_document_native: MethodTooLong \u2014 paste_foreign_document_native 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e154d6b5df6a38759722d3df514fcd63ceb14f409510de78502d8e71e0d3da3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::shaping_glyph::build_variable_outline_shadow: FunctionTooLong \u2014 rhwp::paint::shaping_glyph::build_variable_outline_shadow 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":"src/paint/shaping_glyph.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"44289041fabbdc72e6d64427cdbb160673769c21ee325bceb1acfaa5c96174c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/cells.rs: FileTooLong \u2014 694 significant 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 194 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"365f30f6326dca3cba3c554dc0860392950b39a5759958e81663a1ce600db401"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/shaping.rs: FileTooLong \u2014 692 significant 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 192 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ec84166ecf26388bd6e50f70c34cfbe5ae1085849362ac77ffd76a43cc245d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/font_metric_contextual_scripts.rs: FileTooLong \u2014 691 significant 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 191 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_contextual_scripts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a5f1eafbdd5e9c4dc0fd19270af3ce0fb3d3a049224424da873f43e9a6c08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typeset/controls.rs: FileTooLong \u2014 691 significant 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 191 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc273c20d3f78c9e39ac7f5efa2825b1fff8db7084c11fbfbcecbea6f07f057"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeGlPresenter.replay_tiles: MethodTooLong \u2014 replay_tiles 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":"src/native_host/gpu_gl.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b38599a689270ec1bfb2ef66d250d2209182f6d76bd29e853f9fa011fb5ae26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::tac_fit::prepare: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::tac_fit::prepare 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":"src/renderer/typeset/controls/tac_fit.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f36636dd3eba8786785e4066ed7dd9c57519948b8edf93f4f145344afdf900"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::render_common_shape_xml_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::render_common_shape_xml_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4009164a2e7012ed2ab9ac9840af058cf70e3054326a14c9a1790eedaa680"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/read.rs: FileTooLong \u2014 688 significant 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 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/metadata/mcp/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c06ae5d3e2e5f0cc2d8087a010991a82e0c5c8157ed8b6fa40cd84f0f40d7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EndnoteShapeDialog: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 150 over it, 1.38\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":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b21f2c1229ecfde809e09d3adf583b7fb6df5ad5aee4f5e60265a2da1d5474"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EqLayout: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 2 blocks, lines 51-867. The bar is 400 significant lines; this is 149 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":"src/renderer/equation/layout.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2123f74091c7c82a16ef2ff727c228e7e3ab69ab6f2b8f6ac1b4f5ecbd95aec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document-agent/controller.ts: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: DocumentAgentController (318-890). The bar is 500 significant lines; this is 186 over it, 1.37\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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e80611eeb8a98eb896fd4cc375c0efdda5d421c04111246b0540ecdc6c115e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler-table.ts: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ef86f5b4023e69d17a8d8e46c601276d5d5dedc2874d16f53faec884cffcb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/patch.rs: FileTooLong \u2014 685 significant 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 64% of them inside a single declaration: Planner (2 blocks, 367-995). The bar is 500 significant lines; this is 185 over it, 1.37\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/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbab69338d4f46826dab9e2c998834c6ff63ccc66f5d2181d668dfd0bb3da48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d 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/rhwp-ooxml-chart/src/renderer/chart_3d.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17fe58ddd28f3bf6f184d0c5f23ff2e83b814d5b212754999a3542ae5a34dcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Palette.pick: MethodTooLong \u2014 pick runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d5d3eac5ca8f12d5b63e751e70970fa0d5ee4f8f70bf9f040a0c10fa013c47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentAgentController.applyTextCommand: MethodTooLong \u2014 applyTextCommand runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e37d3a333c488a8cce628b2a25751d2a01c0e0cb56299255623ac9a76a9db45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::conversion::convert_hwp: FunctionTooLong \u2014 rhwp::cli::commands::conversion::convert_hwp 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":"src/cli/commands/conversion.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da6b9755ec090c0752017b9f3e71e8c46d15fb2a1048fc5023f5c5adc1350b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::privacy::execute_redact: FunctionTooLong \u2014 rhwp::cli::commands::edit::privacy::execute_redact 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"741490e132a8a31d33b2a8c6a325102c42cb297eed1fbfcae9a70e6afcb6a4d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::parse_hwp_with_cfb: FunctionTooLong \u2014 rhwp::parser::parse_hwp_with_cfb 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":"src/parser/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6975508cd47887888d11bbb960ae7f75cfae792b18bd83246b8dbc6b77c91fc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EqLayout.layout_ladder: MethodTooLong \u2014 layout_ladder 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":"src/renderer/equation/layout/ladder_geometry.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12890495e4a8cda78694514c7caffc4867422f8013129000fd93aa920008a94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.native_multirow_saved_reset_frame_cut: MethodTooLong \u2014 native_multirow_saved_reset_frame_cut 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18850}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ffa8d2d8bdc2056ca8362492156d06b196cb8c54c1023e26749597a92d16cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/file.ts: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a81a3a15ae90379675b7ef5caf3c00966aafe905fb92055dcfd06b758edc2c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Allocation: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a8431583971adadc040549c55ee3fa5e150b4a19376386535b85c99dacf42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AdapterReport: 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":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5edabd7fa741d48ca002c09c00474a25116e0bccc0957db6b55e19d233bae4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TableBuilder: ClassTooLong \u2014 544 significant 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 1380-2118. The bar is 400 significant lines; this is 144 over it, 1.36\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d089267e1394cfd25995071629da339e49582ab0e29f66cd511d53d1ab824"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.renderPage: MethodTooLong \u2014 renderPage 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7913741af40b7bc4da06ba5fb6796efa72e73bea831e528f972f7502b8602ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::conversion::export_hwpx: FunctionTooLong \u2014 rhwp::cli::commands::conversion::export_hwpx 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":"src/cli/commands/conversion.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dd499098119e7b2aa51c580b4bcaee341ae87b24aa05da23aca391a433a1be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::shapes::edit_insert_shape: FunctionTooLong \u2014 rhwp::cli::commands::edit::shapes::edit_insert_shape 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b47f795202e7a37a6d079ad9ae98329aeff4af842f6eca5020cf3849632c397"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_table_next_page_placement: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_table_next_page_placement 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":"src/renderer/float_placement.rs"},"region":{"startLine":5724}}}],"partialFingerprints":{"codehealthFindingId/v1":"1772482ce06e47f4c426aacbc3b54dbeccbe25f2f7a0aaf9da6f3955b87b12ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage: FunctionTooLong \u2014 rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage 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":"src/renderer/float_placement/reflow_block_cell.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec25c8e56e95cde80b47db2836fb7a73f5e837fe0ab3bbc8ddf88f65deb67b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::shaping_paragraph::eligible_segments: FunctionTooLong \u2014 rhwp::renderer::shaping_paragraph::eligible_segments 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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd9fa038600d29c8a85e05a6aaf0b23ac2cca5ac8efdaaae5e74cbd68b684fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourceFrameQuery.resolve: MethodTooLong \u2014 resolve 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":"src/renderer/typeset/table/scan/source_frame.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2321de9f6c236c44a6c31ff28fd0259db4a3b37082db42ada3ec13ca84d81142"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/style.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"828ca2792a9a78146eb1c7f42d84ca1c1ff0a2fe822d060310ddc2c36359ae5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_document.dart: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: NativeDocument (119-792). The bar is 500 significant lines; this is 175 over it, 1.35\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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1b92cfa634c179418d58b0851c9ca79df280dd7f52fb16a62e5755a2487df8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::chunkplan::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::chunkplan::run 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":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f7be82a8a23c894e3355e0e564b0b30c6f85a88dc63a0ed46fbd353569f6e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/discriminate.py: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/discriminate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aa5cb6a26bda0d558f5aa33e2735e0f729a970108d5459f74ec600ad0608cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composer/stored_cell_reflow.inc.rs: FileTooLong \u2014 671 significant 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 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d486fe3a6ae36d115d10809025b5a0f7152dd3c493cef0ce7e760ea2db728"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/control.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac2868b0f58c0a457cfa1914dd4283feceec8944e5dd81375bd6bef2b92e09b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ruler.drawHorizontal: MethodTooLong \u2014 drawHorizontal runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15a24497bd3b8c3c8a5503d5778bcc76c60251368ecf55b8b425a1fc029d68b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.ungroup_shape_native: MethodTooLong \u2014 ungroup_shape_native 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":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4619a591044d68b5331668f4145ed78ca12db30670a8e1e0fe084f63482266"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.compute_table_x_position: MethodTooLong \u2014 compute_table_x_position 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6752}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7444d28da0f98e381ede0c70bf0a6fcdec4e71e654660e7d9dd99578e0d7279"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Paragraph: TooManyFields \u2014 40 stored fields beside 87 methods. The bar is 30 stored fields; this is 10 over it, 1.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":"src/model/paragraph.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0d04c8173d504e6797851cb7f82c54013665d8c16298560e2cecee66428844"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RhwpNative: TooManyMethods \u2014 102 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/csharp/RhwpNative.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef17d32a5556c65787f4a92dc13f89fd5b5a6914cf7c9bcba005ddf78ecfa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/lowering.rs: FileTooLong \u2014 665 significant 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 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da16cd2a1e3df05d5887202ad11b3de6c9475869fdfa9c8ef3e75b40ffd7934b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentAgentController.revertTextCommand: MethodTooLong \u2014 revertTextCommand runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"df71c10b7ef21911e85a10b95c2bd76e58e075b513538f8a7ea2a2727f8de497"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::piiscan::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::piiscan::run 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":"src/bin/rhwp-agent/piiscan.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ec0ae7afdf3a70b2c288261c22e1407502ce7674ad26073ec53027a45bd628"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::queries::memo_query::prune_incomplete_memos: FunctionTooLong \u2014 rhwp::document_core::queries::memo_query::prune_incomplete_memos 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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d36c0658dd4984b9263dc7f31442a4e85a117cb9878f9d23e13f378a7f92bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_partial_paragraph_with_spacing_before: MethodTooLong \u2014 layout_partial_paragraph_with_spacing_before 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"6466293918b0319f15de0bf0df139eef758e32cc16836a73f9f1b9479abfff82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::shape_layout::normalized_single_line_inline_textbox_host_with_storage: FunctionTooLong \u2014 rhwp::renderer::layout::shape_layout::normalized_single_line_inline_textbox_host_with_storage 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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf4f1cefd7e25bd4397addb75d93c2416a41253b79c58817ba181566c795565"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.calc_visible_content_height_from_ranges_with_offset: MethodTooLong \u2014 calc_visible_content_height_from_ranges_with_offset 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28583}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a1b5f561b56cad45d334145aac2e41bc443679984220701e3ba4f1e3f27583"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/para-shape-dialog.ts: FileTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ParaShapeDialog (94-965). The bar is 500 significant lines; this is 163 over it, 1.33\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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"349b86a11377f64fe6189208a7e9c907fd4b0e5fa3e7f340618172fa7c3cecef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ole_chart/legacy_presentation.rs: FileTooLong \u2014 663 significant 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 65% of them inside a single declaration: Reader (2 blocks, 186-756). The bar is 500 significant lines; this is 163 over it, 1.33\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":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"233371f9d116062695988a6c570319916122e1b223718adfd9cceb674ef19f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::text::export_text: FunctionTooLong \u2014 rhwp::cli::outputs::text::export_text 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":"src/cli/outputs/text.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025c126347eba04dfe76e7b51aebbc32def250cd595a4943b10dad261d6328f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_ctrl: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_ctrl 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":"src/parser/hwpx/section.rs"},"region":{"startLine":5213}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bd3140b77297866d73df616786fb6857742e9aa19e113148eeaaed06a1092f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::inline_control_projection::inc::try_inject_char_overlap_text: FunctionTooLong \u2014 rhwp::renderer::composer::inline_control_projection::inc::try_inject_char_overlap_text 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":"src/renderer/composer/inline_control_projection.inc.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb56f4173d436ef1f3d1fe388f134d8245b3275bb6c1051d6aacdb981f1d2ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::flow_table::place: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::flow_table::place 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":"src/renderer/typeset/controls/flow_table.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b220cdaf8f5a84845ee8a3f316cf0a56e37de341e488d5efb33a6ac795b37e49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composer/reflow_helpers.inc.rs: FileTooLong \u2014 659 significant 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 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57028ff271703f5666c9553b08f3b86279033b147abd5e12568838ec98ebb4d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/toolbar.ts: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Toolbar (29-955). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bf5b34227632b84b78cfc5b57b72402317ac1cc57b12613a498642dd7eb879"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CellSplitDialog.build: MethodTooLong \u2014 build 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":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1254d0bc755acc11d140ed562dbaa789ad6d4d5c1e4f5b85f3d8fdcc7693002"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.drawImageOp: MethodTooLong \u2014 drawImageOp 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c027fc2b2fd9e67a7d66a8a0d2130ea00a26255339943a79cab23c7a90c38ddb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::vector::export_render_tree: FunctionTooLong \u2014 rhwp::cli::outputs::vector::export_render_tree 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":"src/cli/outputs/vector.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e433291f349b1a8a14b5a49b87b52d55e9448bd88149a90bca58389836c99f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::try_place_stored_tac_paragraph: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::try_place_stored_tac_paragraph 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":"src/renderer/typeset/controls.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"97feae268c2ac89f096a3b5e4d4c792be0b8c7441f8e76e9d2f14428cb3bcf1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/shape.rs: FileTooLong \u2014 653 significant 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 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0282da85cc205594fc0223355ad2431e4e1f56bccaafce7f93f55b2f8c4cf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: endnotes/measure.rs: FileTooLong \u2014 653 significant 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 98% of them inside a single declaration: TypesetEngine (22-856). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb91ca66d120ba87649af7718fdd3c2ad977f7126abb8a315e27365cb6f8612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_contract_probe.rs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c808f171b8ac58775f563e56f72173b9efb7ebd5b21908253db3a63524c1fdec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PicturePropsDialog: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e5c6ee8eef135a1f51959e68d9bdde41934b679e4f2c58845a425ab16e3757"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/grid.rs: FileTooLong \u2014 650 significant 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 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7782ec1c0b434768c683e6b6f078a02f0cac4bed4cfbf3aa272d4c83bf4ef18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_field_parameters: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_field_parameters 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6346}}}],"partialFingerprints":{"codehealthFindingId/v1":"469b5ea971b442bbca08aef140486d6fe3084fbd1c115f5996eb1cfe9f5db278"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::structured_lowering::body::lower: FunctionTooLong \u2014 rhwp::parser::pdf::structured_lowering::body::lower 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":"src/parser/pdf/structured_lowering/body.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcc8260f333fcf245b36c7603f9ee314bb5e9ee0abb99d0a287f2fbc5ab9a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::equation::logical_font_frame::frame_with_style: FunctionTooLong \u2014 rhwp::renderer::equation::logical_font_frame::frame_with_style 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":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b5bac86a8f276e3011b8101a4a55acce1019f67acb0ecd3ad330c6170638df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.predict_current_column_para_y: MethodTooLong \u2014 predict_current_column_para_y 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":"src/renderer/typeset.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f1aef85e7a02083509585e1d0ce9bf6e1feeda38570a640df2242030382b7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line: FunctionTooLong \u2014 rhwp::renderer::typeset::controls::stored_tac::prepare_coanchored_first_line 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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a48b78f586f6a11331d298dbefefc2d0c414f5e02909212459b8b5d2ee293d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BlockTableContinuationPreparedState: TooManyFields \u2014 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a36f024d8ea63d248a0bdf74b1881c492d63b21bcab79f6a705781043f4b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeDocument: ClassTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 119 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4502981052ed0f2f1659566979ead53236e167fe210b9365f80ba9065058db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/paper_viewport.rs: FileTooLong \u2014 648 significant 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 98% of them inside a single declaration: PagePaintContext (2 blocks, 26-931). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paper_viewport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7920564138198eea0be08963aaa701ba2cab8488509c11e596631bf9f8d97a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/edit_content.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":"src/cli/metadata/mcp/edit_content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0f572f38046581aad7aec87f6c68c1e5000a2ef4305cd9093ceaefdd64716"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/doc_info.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":"src/parser/doc_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c437c6e3809629b408f018db9ad26f044fa021705cebddbb368b4c629343bdee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CanvasKitReplayPlanBuilder: ClassTooLong \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), 14 methods, 2 blocks, lines 1329-1987. The bar is 400 significant lines; this is 117 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d9eddc9cc780323d82ce953ee5639febb420afa62dc6451c091624ecd802e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Planner.clone_series: MethodTooLong \u2014 clone_series 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/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee560b6b0ba8739e5fe91ebbe75952c438ffbbac580fe7627d81b19ca7084da8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParaShapeDialog.buildBasicPanel: MethodTooLong \u2014 buildBasicPanel runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0519b37e4e4da43a59b1c002b7fcb0491b0d645241a3fbac4ed52a8565d6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cells::edit_insert_text_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::cells::edit_insert_text_in_cell 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a62d28e75fd00709f8cc71dbafa906c57a0dc4094d6ebf331e43690f825a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::generation::build_from_ingest: FunctionTooLong \u2014 rhwp::cli::commands::generation::build_from_ingest 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":"src/cli/commands/generation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d992a1453c5288aac6fb87804ada4d446fb83c2200dc8221f75d7abc4b69728"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Proof.add: MethodTooLong \u2014 add 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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e1b8f9885984eedaad37eab038129143f9eee4fdf3b3bfe60d71fcf975ba0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables: FunctionTooLong \u2014 rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49eaa37db40c57bcb8e23ddaf80aa74cbdd8c5574bcced55f55cdd968b29d8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Player: ClassTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 17-787. The bar is 400 significant lines; this is 114 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/converter/player.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f182ffe17987c3685bf5f06f26c950816518ef96e247561bef7951d34e269"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: trust/governance.rs: FileTooLong \u2014 642 significant 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 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e9c8fe56db595f3ae414a563159f5eaf0c0de583d8fd1692fc2ad680d0585"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document_core/inline_control.rs: FileTooLong \u2014 642 significant 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 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/inline_control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f200c9215a829ae74b5fc33f23e67364c7e5b602933290b55f3fe60600ec462"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HwpEditorProvider: ClassTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 113 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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca1d84bc3b8d995677b876d66da245c354643f9230b2b02f3e683d8ff36fcb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cells::edit_delete_text_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::cells::edit_delete_text_in_cell 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"f899048fdee562eb3f910e9748179ce07da1cd3722dc6ddd0c311042f21256dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::harness::cmd_harness_status: FunctionTooLong \u2014 rhwp::cli::protocol::harness::cmd_harness_status 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":"src/cli/protocol/harness.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88e2ac95b33211a72da9403ff9bda9928bb82f3d3e2371ec50daaeb21eac413"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.reflow_linesegs_on_demand: MethodTooLong \u2014 reflow_linesegs_on_demand 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":"src/document_core/commands/document.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a647686c0ab9ddf2c16b8a512b53ff37cf7d34ea578d40bc04af434d16e9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::json::write_text_export_metadata: FunctionTooLong \u2014 rhwp::paint::json::write_text_export_metadata 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":"src/paint/json.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5f077b74e866c74dac99fa30ecff8dd7bec5c6d13caac5f394f0fa5d0f59a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::kerning::compute_kerning_pair_candidate: FunctionTooLong \u2014 rhwp::renderer::kerning::compute_kerning_pair_candidate 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":"src/renderer/kerning.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c46f1fa911cf26e44b5808bccd64881ff453c0c71a893c822c331c2c230554"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.sequential_nested_cell_layout: MethodTooLong \u2014 sequential_nested_cell_layout 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc6bac7cce1eafeef0ae04665ee2e4c868ce8e44bce5937e78c7cccaf996b50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_image: MethodTooLong \u2014 draw_image 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac7fb563e08e979a01fb93008e38a52e189d57245073d1df9cb9ce3402ed5f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/endnote-shape-dialog.ts: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: EndnoteShapeDialog (115-830). The bar is 500 significant lines; this is 139 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22533d7c6637b07e9ca535411acc744562bd3cf94dc08be54c8895d0e701f49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/edit_structure.rs: FileTooLong \u2014 638 significant 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 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/metadata/mcp/edit_structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe04229fa638832d474761cd5022b5eadc245d9de8b54c797e0cc316ddfc091"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::fingerprint::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::fingerprint::run 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":"src/bin/rhwp-agent/fingerprint.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cbddaa6df9428706361c87d2d142c7caff1a14ea5362ef83626a675fccd4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::kitty::export_kitty: FunctionTooLong \u2014 rhwp::cli::outputs::kitty::export_kitty 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":"src/cli/outputs/kitty.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"77728579b7ae7e8e13cd429fd631c019a0abed2c6e4fdcea5224b01a6caa6695"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported: FunctionTooLong \u2014 rhwp::renderer::canvaskit_policy::canvaskit_equation_layout_is_supported 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":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"8155e2d0404aa65fe5da66a850245041aed59fd7ad8f6057336d32a12036b5ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_page_reset_cut_trailing_trim: MethodTooLong \u2014 stored_page_reset_cut_trailing_trim 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d2304a6e3e5ae771f808f736573acfc6e90166878cc4e14aef1cb67136e4b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.resolve_span_content_requirements: MethodTooLong \u2014 resolve_span_content_requirements 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":"src/renderer/layout/table_layout/plain_cell_flow.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2521b907c51cb91665fff345788020db1a904d0951d7a7830940c7dc215a405a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_text_with_effects: MethodTooLong \u2014 draw_text_with_effects 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f9b5fba6e1c6df7142e88446eaf443bdcfd38dbbd66cf4bc87d45f2f8e1283"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VirtualScroll: TooManyMethods \u2014 38 methods. The bar is 30 methods; 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a47931abb62c3ad37f646bc150a8ea2ce9f41044d50751261c8b20c20c95d1f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeDocumentSession: TooManyMethods \u2014 38 methods, declared across 6 files: native_host/mod.rs (19), native_host/save.rs (8), native_host/region_cache.rs (6), native_host/fonts.rs (2), \u002B2 more file(s). The bar is 30 methods; this is 8 over it, 1.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":"src/native_host/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4660a577aebdcc3ee5fbfe494f31e9436083b7531058e23115ad89132bcb82bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Hwp3DocInfo: TooManyFields \u2014 38 stored fields beside 1 method. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/records.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19813ac0322cf36b5cd85bd79930ce871082af9c5c8fb9af8646896be4ea022"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InitialFitInput: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cc953020a5dbf2ec00627b0de640f7e9c3e172ece015e0502acd811f755101"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/text_v2.rs: FileTooLong \u2014 632 significant 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 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/text_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f348330b490f291a63b30ae1edee5657a1b6086e9c7534e78ea78e64d3796907"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skia/equation_conv.rs: FileTooLong \u2014 631 significant 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 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5996d9c7294c5d3446fec7ef1b2e1dac2ed8f322158be9ac89b7fe0a5e8f7fb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::batch_fill::run: FunctionTooLong \u2014 rhwp::cli::commands::batch_fill::run 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":"src/cli/commands/batch_fill.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9982d77e46ea3d4df768e85b7fce6e8c19d36363aad300b344891355d725c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_content::edit_set_header_footer_text 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ae4c9934a937cf42b412d3bf1850dcd00fad3f9f7e4ba967bc621e022ea5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.recalculate_connector_routing: MethodTooLong \u2014 recalculate_connector_routing 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":"src/document_core/commands/object_ops/connector.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aedb9f4b1aad92e5fb843f3460d371e9dd403978424420cb0293524581028b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::queries::explore::build_menu: FunctionTooLong \u2014 rhwp::document_core::queries::explore::build_menu 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":"src/document_core/queries/explore.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1010c791d9391dab0830ed371fe5b81c85e10074326a8d729bc9eedeb8cfe144"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::model::border_paint::encode_with_storage: FunctionTooLong \u2014 rhwp::model::border_paint::encode_with_storage 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":"src/model/border_paint.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6216f2b1323058f6d089ccc20890225fd099c19879e5024a4aae6fc29482b19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/input-handler-text.ts: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 129 over it, 1.26\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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ca896261df69658e65e8aad14dc653e6d0b5a1a2625961cf3bdc4fa01d8216"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_mel_personnel_probe.rs: FileTooLong \u2014 629 significant 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 129 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_mel_personnel_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd53fce5a6b170f8388258e3538889a231eecd6ea53ef2da78c4e15276056df8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paragraph/reflow_fit.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: TypesetEngine (45-804). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f735ff0391a57cdd78ffb8f5f7c596a8887c22ea325730bfa59524919ddbdd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FontGlyphLowerer: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 483-1114. The bar is 400 significant lines; this is 100 over it, 1.25\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":"src/paint/font_glyph.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"362b0fb8a5a69733b1558e60d34a381da98b00edaae55558c88332189c78c803"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: block/whole_fit.rs: FileTooLong \u2014 625 significant 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: TypesetEngine (37-856). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/whole_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d077c43fb59a8d57bc7dfac5ee355dec039d3f04dc779971f9e48b6ebb72860b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::bitmap_raster::prepare_bitmap: FunctionTooLong \u2014 rhwp::renderer::bitmap_raster::prepare_bitmap runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746a37ef5061df8187de08841d11a3ae6c49d96c2d9aaa4defffde241b9335f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EqLayout.row_children: MethodTooLong \u2014 row_children runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/symbol_spacing.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb35b2cb305622ea989ece66bc3d6ec99ef98d02fb1552ee5327c08716743786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeTextureController._pump: MethodTooLong \u2014 _pump runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9555a839523acae4931efbf980d3d4b92bbe41c0d24ed161bd474372a56436f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharShapeDialog.buildBorderPanel: MethodTooLong \u2014 buildBorderPanel runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b16f6cb29946de120054e32ad16234221a02ec1fea22af96bf39f7d48ea9f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::tables::grid::edit_split_cell_into: FunctionTooLong \u2014 rhwp::cli::commands::edit::tables::grid::edit_split_cell_into 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b761ceecd8185f4cad8d6d8bd64239483f23d7216376b0f834e52a1229dfd37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::exchange::settlement::cmd_settle_verify: FunctionTooLong \u2014 rhwp::cli::protocol::exchange::settlement::cmd_settle_verify 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0731d11a8f288c8208a956321b2b11db0425c2da32a1c6b84fd983b93a0ab6aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_picture_properties_native: MethodTooLong \u2014 set_picture_properties_native 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4a58db04e828f63df9d2da297cc9e35b4eb6a104e289fe1a22ac17d06d5455"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.move_inline_control_native: MethodTooLong \u2014 move_inline_control_native 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":"src/document_core/inline_control.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c4209c276c44940f4111d2152bbfdf24e33edffec78de83b994fb2952f570"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_object_layout_child: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_object_layout_child 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":"src/parser/hwpx/section.rs"},"region":{"startLine":3847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27d6cbe3835f108263cc1910763d8966b9a9dae7973d6d848f532665ccf143"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.calc_nested_controls_bottom_height: MethodTooLong \u2014 calc_nested_controls_bottom_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11755}}}],"partialFingerprints":{"codehealthFindingId/v1":"6436975d23662d9e655a992090414d953961960792615e6388b77c522587bdfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.native_intra_para_saved_reset_trailing_trim: MethodTooLong \u2014 native_intra_para_saved_reset_trailing_trim 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2952cd07bc92da1902d0cce16e5b247309a78b702168db36fe619a5d82d066d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.place_table_fits_with_storage: MethodTooLong \u2014 place_table_fits_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df0218c3ef73e4eca6b96fdcf784cb2b20a3a1ce696c2f985346f991a697bea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_char_overlap: MethodTooLong \u2014 draw_char_overlap 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":"src/renderer/web_canvas.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"deafe638da6da99a02daf11f18d0b9fecda295092beb646b01297af0667a13fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/foreign_paste.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acc077c28213f740b004f4a991626dfdc670fa8519704f22ea1321747b1677a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeEditor: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 2 blocks, lines 71-755. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/editor.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d829eb3d9481e3966a06fe83b8365f53916fe6e0e1f91b1c2d399b99c93d6d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008fa1c694c481f042eb0c55ef912738699549107190821a005cda8231af13b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rhwp-agent/safety.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6504d0ed20035b2d9f74ce51b9ed88ae0974b2a2cb006641df70816daef4c04d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptionsDialog.createFontPanel: MethodTooLong \u2014 createFontPanel runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5bbfd8f03aa0435b1f31188e88a0f551541d6f7e1f224b5661bfb9ca722c80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableCreateDialog.showInputDialog: MethodTooLong \u2014 showInputDialog runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"77220652af82b1dab3ec10b9a3f00af4d0020ca74fedd6c72a106c8afcde4c5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::document_objects::edit_set_form_value_in_cell 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d8ae278b8c2bae6b12b96aa7985e758c62c8610ea4f0f9cb1af37eb1af6d06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::text::export_llm: FunctionTooLong \u2014 rhwp::cli::outputs::text::export_llm 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":"src/cli/outputs/text.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b51280526a1172dffbb3176adb0034689f96f56bb359c797048e7ddf89cf34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::ole_chart::legacy_column_renderer::render: FunctionTooLong \u2014 rhwp::ole_chart::legacy_column_renderer::render 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":"src/ole_chart/legacy_column_renderer.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d740cc127dcc4eddbd1c1d4c7a62e7b365a3e72ab28df8792dd176470206dd4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::form_appearance::form_drawing: FunctionTooLong \u2014 rhwp::renderer::form_appearance::form_drawing 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":"src/renderer/form_appearance.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd75f161587e7fda60f1c519a8c6ffda7acb883586ef0bc83064805d5e0e161"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.vpos_snap_current_height_with_storage: MethodTooLong \u2014 vpos_snap_current_height_with_storage 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":"src/renderer/typeset/section/vpos.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b3202f094a235e5f7208310fef63b7b42bc2950b35a9e93c8120e2d57c72b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::body_text::try_serialize_paragraph_with_msb: FunctionTooLong \u2014 rhwp::serializer::body_text::try_serialize_paragraph_with_msb 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":"src/serializer/body_text.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5d58d8cba596ffe0ad575ff5ce617d9572d569236516337a7933a4fa405ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ir_schema.rs: FileTooLong \u2014 613 significant 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 49 free functions. The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-contracts/src/ir_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554ddd8b2add960496f79f73374af4e4633de1288a48ff92bcc4526f9e8cc837"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.wire: FunctionTooLong \u2014 wire runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e99adc3b7914c128ef530711c17a50f0dd5aacb63b785b0643dff0da87395c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::formatting::edit_apply_para_format_in_cell 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"828d4374693214fd7b53c900396493ed60f8a8398a68617ce67d737ad6b9ea6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::tabular::table_to_csv: FunctionTooLong \u2014 rhwp::cli::outputs::tabular::table_to_csv 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":"src/cli/outputs/tabular.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7516a787020cdecf60a8c2a585f915949ea726064248d8317a7cce50c32424f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.replace_body_text_local_native: MethodTooLong \u2014 replace_body_text_local_native 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ae6e426e1efdc76305a9b52a32628d3032d9788a50fce8fc051742774ed14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaintOp.paint_bounds: MethodTooLong \u2014 paint_bounds 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":"src/paint/paint_bounds.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065e1aadcda26968d6eb3f4b80672bc6ab0f71336b6079d3f6b464b05b195ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PageLayerTree.write_text_v2_export: MethodTooLong \u2014 write_text_v2_export 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":"src/paint/text_v2_export.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89cc43636d5507db7bc71c014e00fca37cadbd56c6da40ae13c68df46d29240"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_detection::edges: FunctionTooLong \u2014 rhwp::parser::pdf::table_detection::edges 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e97e0ed0ec4797cd86193e78bb6e97dc128e836111b07f995d1367e6d4364f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.layout_partial_table: MethodTooLong \u2014 layout_partial_table 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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":5864}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c7440dc90dc28b41a318168e604b1025c2acb3616118a0f507851e0fb1c29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage 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":"src/renderer/typeset/inline_flow/plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8382503c832e841a25c36160c33eb507281227311c2e2b10504bc556dace78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composer/stored_lines_runs.inc.rs: FileTooLong \u2014 609 significant 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 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36c2ca31ca03fa5f8a07eddd4e837aad51556b52d50d025589721b75a00136c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_of_pie: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_of_pie 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a8c166649699d7c658b4c82d528c48895113e0d48e1eadbfe244477f5023c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main: FunctionTooLong \u2014 rhwp::mydocs::tech::investigations::issue-836::probes::diag_836::main 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":"mydocs/tech/investigations/issue-836/probes/diag_836.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db8387e0a3e5f01c691db7672e7b43c04b31c308439c7b3b0f39ec725853542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EquationEditorDialog.build: MethodTooLong \u2014 build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1be4c8da6a0541431d052c03248aa86e9188a724194659731503190d062a1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.imageForOp: MethodTooLong \u2014 imageForOp runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5901}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f81b5f1d31bef2e3462f8779a6dd1b0bd42dac701dcd011b0b75388ee32652"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::pdf::export_pdf: FunctionTooLong \u2014 rhwp::cli::outputs::pdf::export_pdf 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":"src/cli/outputs/pdf.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"baedd405d4ec3815e0badfeaffcc332b3a812847f40b4a220263a81162f87abc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::diagnostics::hwp5_first_para_control_probe::render_trace_report: FunctionTooLong \u2014 rhwp::diagnostics::hwp5_first_para_control_probe::render_trace_report 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":"src/diagnostics/hwp5_first_para_control_probe.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"796d49eab523ab7f957ead66fa54a510bb70994005a7f3d67d3e167b65d21ce5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::doclang::writer::write_block: FunctionTooLong \u2014 rhwp::doclang::writer::write_block 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":"src/doclang/writer/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"15228c51aeb37c41b022fa76367769152c4c13611f5ecc462e448feafe48a794"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::header::parse_para_shape_child: FunctionTooLong \u2014 rhwp::parser::hwpx::header::parse_para_shape_child 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":"src/parser/hwpx/header.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"05348741ad52f7bc6dc07ee736aaf20275204a6015600831d52c9ca9381b5da5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.reflow_cut_content_height: MethodTooLong \u2014 reflow_cut_content_height 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":"src/renderer/layout/table_layout/reflow_fragment_content.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ea725326a55fb199905e4911c5c9a6ad8504867cf950af08d29583d49a6eca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.judge_hwp3_variant_vpos_reset_break: MethodTooLong \u2014 judge_hwp3_variant_vpos_reset_break 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":"src/renderer/typeset/section/boundary.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db75b493f29d0ba1a5cce280c6b18343ba63d4605a8eec4e2ff5d914db2d7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PageBorderDialog: ClassTooLong \u2014 483 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 83 over it, 1.21\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":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9366e8670940d3d24e4b4c8992f8d73247d45ad022d6814c6dc4a8a244f876e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/mod.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":"src/parser/hwpx/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be62062453319aa59885f426af0e35f8b9382207e5ba24703dd109f189ea1d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeTextureController: 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":"bindings/Flutter/lib/src/native_texture_view.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b16e5014dc4c1a264267e0fd2b31afe25897b4c7794b8009385161ed6bc927"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UserSettingsService: 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":"rhwp-studio/src/core/user-settings.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f3e497f216aebc460c0fa94564c7ac1f7dd2bf6111f641a7c2a37c487864f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SkiaLayerRenderer: TooManyMethods \u2014 36 methods, declared across 7 files: skia/renderer.rs (25), skia/tiled_region.rs (4), skia/native_pua_fonts.rs (2), skia/surface.rs (2), \u002B3 more file(s). 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":"src/renderer/skia/renderer.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b6bd0126cff9964c0bc6653bfcccd753aaf432cc5ae621fa0d8fdd85aceb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: outputs/vector.rs: FileTooLong \u2014 600 significant 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 100 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":"src/cli/outputs/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3066ac42a58a95d769a491aea091f337d431b17db38289f374e617a3054e05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharShapeDialog.buildBasicPanel: MethodTooLong \u2014 buildBasicPanel runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b1ffa1f2dd4da7db6951cb74abf5ec3c94d4d90c0439b98726be1543c0972f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableCellPropsDialog.buildBasicTab: MethodTooLong \u2014 buildBasicTab runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01cd03c5a879f006f44de823e22922601ab6d57e346ec35e7821793c4f33cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::cell_paragraphs::edit_split_paragraph_in_cell 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":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c9f42c5ebce6660098917c6adb7d68ee5041edc325180d028be8abb8369f38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::sixel::export_sixel: FunctionTooLong \u2014 rhwp::cli::outputs::sixel::export_sixel 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":"src/cli/outputs/sixel.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6fb512898840c3fb53ba8de96ead7c96a9bd4d9d37c77376de8be8de6cba3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::text_v2_export::envelope_node: FunctionTooLong \u2014 rhwp::paint::text_v2_export::envelope_node 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":"src/paint/text_v2_export.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76333d8ed94505ea4702306d918e7b76846100d2c02f365e564075f17429788"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement 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":"src/renderer/float_placement/stored_header_frame.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ce5aa0130f6d43fe04ee3197afa5388d7599d4a76233a17570353e4ce9e80f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/ruler.ts: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Ruler (52-900). The bar is 500 significant lines; this is 96 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69b20a9a87a6d0375e20e4cd80b7ee4141c177b10368b435d84b0764c779f86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_combo: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_combo 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a7e84782c667ec098c25e66f5aa177c7a8911b17cd915891b2944e09d770b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sfnt-face.normalizeFontFaceData: FunctionTooLong \u2014 normalizeFontFaceData runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9f175afb46f5161386d9a34e44e86d5e320cd43e4add1d8eb809edf54fe355"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CellBorderBgDialog.buildBorderTab: MethodTooLong \u2014 buildBorderTab runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"63030d98e60637772964bd48b547789229e5cbe1a620526729a86b29e4096ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParaShapeDialog.buildExtendedPanel: MethodTooLong \u2014 buildExtendedPanel runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0237f9cbe2888283d2ae7dd89fdecd21e152aad5f5582e766a5347dbfde0222"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildLinePanel: MethodTooLong \u2014 buildLinePanel runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a09a6b4e9c01e6e03324e68e5584c66bcbce3b5994fdff23c3d23d6abc8f61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::diagnostics::hwp5_char_shape_audit::render_report: FunctionTooLong \u2014 rhwp::diagnostics::hwp5_char_shape_audit::render_report 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"386ca487e9ef5908d52c8349e15c1eaf310c7f40bad6b9e094d80471b45e9117"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.line_snapshot_evidence: MethodTooLong \u2014 line_snapshot_evidence 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":"src/document_core/queries/font_decision.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"2765e62a5d2b9768a68c71d9dc77ce7351914588af0b0a4f06334680330799d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_cell_reset_closes_body: MethodTooLong \u2014 stored_cell_reset_closes_body 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14798}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9f0c296849bc17079f24a9a5cf6d3b830e4f1bd9f4eadb1bba2607d8b9bf73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::table::format_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::table::format_with_storage 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":"src/renderer/typeset/table.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"169dabb91811f8aea49229bfc2a4d780d021cf73c24d8f9026722e600423a20f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HwpDocument.update_style_shapes: MethodTooLong \u2014 update_style_shapes 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":"src/wasm_api.rs"},"region":{"startLine":8113}}}],"partialFingerprints":{"codehealthFindingId/v1":"22564cd9641fd0f22c880ea4aab5b416389028ab1552306ae735da40a8c3a2b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serializer/cfb_writer.rs: FileTooLong \u2014 592 significant 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 92 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":"src/serializer/cfb_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f261238b41d618f2e34f6cc5696c2a79131cde082f9a4f476e78d7da530cc948"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_char_shape_audit.rs: FileTooLong \u2014 591 significant 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 91 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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9170879ec596c15085a7bf266d9ae0f75742b029c105e54699738ab089df0a27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provenance.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/rhwp-contracts/src/provenance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b98facddfa3244e53c0406ddf64bf12af39c77fd978bb77fb4d4f050e97f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paint/text_variants.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":"src/paint/text_variants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b984d714935513a483a69a1cde1934ba405c2be111a1314c99e8f4652089bfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paragraph/format.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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c57cf1ff144132315d31ca2bee299fc81da2a052509cd54dd6662c002e6ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_stock: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_stock 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"243711292b0ae0568e7241792bec6fcc50d303ab087d2bb7e7f5e1764d7ee563"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HwpCtrl.MovePos: MethodTooLong \u2014 MovePos runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"33467210a6c086297dd4116aa1f6c7fb9e02566fb8082c64721484d927b8e22a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::safety::run_armor: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::safety::run_armor 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef215ff3b461ea54d03477107d719b0568a06960ec233cb2a474b35a98b84f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_content::edit_insert_header_footer_text runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f122efbf600c29c061a3c89db33e76ef516c09ad6cd9a57b86ece3a2af4477"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::diagnostics::dump_paragraph_line_trace: FunctionTooLong \u2014 rhwp::cli::queries::diagnostics::dump_paragraph_line_trace 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b57bcb22ed7377244c9902771d3f8c50df54a53dcefabc8844b52d30481a0ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walk.walk: MethodTooLong \u2014 walk 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":"src/document_core/commands/paragraph_block/owned.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db3f01a37273a6984fa017ad4fa656b231eff528d4c0827bc7cef40b3c2c2f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::plan_schema::template::extend: FunctionTooLong \u2014 rhwp::plan_schema::template::extend 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":"src/plan_schema/template.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b498dbd9a8b4f07c09cb700929ad96153ec8f7e6fced25f4492e5252cb642e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.render_debug_overlay: MethodTooLong \u2014 render_debug_overlay 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":"src/renderer/svg.rs"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56726898b608f691d7a3328498fc199cb026928c384e7c14ce39ecfb96780b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: converter/player.rs: FileTooLong \u2014 589 significant 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: Player (2 blocks, 17-787). The bar is 500 significant lines; this is 89 over it, 1.18\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":"src/emf/converter/player.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af3620711c54e72caa5ddba10c26ca7a03639e4b36827f79d4f26e9b8a3fc4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equation/svg_render.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6407a7cbd8c9e3784ba894b2d8bbf387d4b24408019c5f913a1482787228f791"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/authority_ledger.py: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/authority_ledger.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66010b2ba3f7f6fe8efcbde62021218dfbce85ccd40790e13559a6d30c3e0b29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::safety::run_unicode_scan: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::safety::run_unicode_scan 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5631a5e79e52897f6a0a4c04e0ec41a76bc0ec34137dff65a61f47aca02375"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_content::edit_insert_field_in_hf 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c5a5f0e5ea3e0fd59d8d29bc5d7b8519a7024ada495f0045b5f2075758dc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::paragraph_block::validation::references::validate: FunctionTooLong \u2014 rhwp::document_core::commands::paragraph_block::validation::references::validate 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":"src/document_core/commands/paragraph_block/validation/references.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b853570911e38f0fdbad653adf9905b72873f99bf9b9fad6a1136d81373774b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::tracked_viewtext::project_paragraph: FunctionTooLong \u2014 rhwp::parser::tracked_viewtext::project_paragraph 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":"src/parser/tracked_viewtext.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fa94d836e15aa0d7cf927ef2ae03a5bf9615df38d47737898cb8b9db46630e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage: FunctionTooLong \u2014 rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage 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":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087ca74fc0ac0da31e5adbc835f4515fbda60edea65113f345e0f2a2ebca10f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_block_cell_flow_with_storage: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_block_cell_flow_with_storage 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":"src/renderer/float_placement.rs"},"region":{"startLine":7447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e220eaddf801e13cb843c469d567d0dc47b876505fb079e4b17fd0097ad67abb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted: FunctionTooLong \u2014 rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted 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":"src/renderer/kerning.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa332d65e43ed53c48e50f989ac3a2bd69a1f5c337d90636a9f24e650abe90b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::header::write_para_pr: FunctionTooLong \u2014 rhwp::serializer::hwpx::header::write_para_pr 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":"src/serializer/hwpx/header.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5a5496a1256a01cb8c38f497610d3f61c8dc0ade5aa9eefdb47a016252175b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::shape::write_line_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::shape::write_line_with_storage 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":"src/serializer/hwpx/shape.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cc60e89c46c8d5ba506efa5709869adeacfe94406fb1fba4670c34af508789"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/equation-editor-dialog.ts: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: EquationEditorDialog (211-776). The bar is 500 significant lines; this is 84 over it, 1.17\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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fe08a571ae76055777edffc9a78dacb318abbe850864cd878a7373283fcf09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RewindTailInput: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\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":"src/renderer/typeset/notes/endnotes/paragraph/rewind_tail.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c39e97738abec0eefa8dee7af01737218227699626e6ffc245adda96e6d1c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/picture.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), declaring 48 free functions. 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":"src/serializer/hwpx/picture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36549f6d5872670c278cb732e62bee2b72d47390f2f02979bd3d3c6a75693ea5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::chart_3d::render_value_grid_3d: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::chart_3d::render_value_grid_3d 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/rhwp-ooxml-chart/src/renderer/chart_3d.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6cb3aebee01576bae24c3e5e1b2ac5934937076f4202b0840c322ae927eb03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: content-script.showHoverCard: FunctionTooLong \u2014 showHoverCard runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-firefox/content-script.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"90071f2d6ec620228a790da0b0b329fa1d76218eabb24058af61587d2c5b25a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::difftext::run: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::difftext::run 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":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eab6d30e3f125a949dcfdbb7f46f13a68e16562b1872fb594124f1648c17223"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::fields::fill_fields_core: FunctionTooLong \u2014 rhwp::cli::commands::edit::fields::fill_fields_core 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa417f861ab77215390f6d9dd188630e86d1e71b6f6545d0689b50cd1790804c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::capsule::audit::cmd_audit: FunctionTooLong \u2014 rhwp::cli::protocol::capsule::audit::cmd_audit 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":"src/cli/protocol/capsule/audit.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d721b5731ef51f2295c2cce7bdfcff314996eda562df8fa3d7b8216fee9b9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::queries::field_query::collect_fields_from_paragraph: FunctionTooLong \u2014 rhwp::document_core::queries::field_query::collect_fields_from_paragraph 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f79516e9e6db2f58a58123e909697fc24582153450d991d507e91b9d623ef7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.saved_block_reset_opening_frame_height: MethodTooLong \u2014 saved_block_reset_opening_frame_height 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21367}}}],"partialFingerprints":{"codehealthFindingId/v1":"57792dc0cbd9b7830221d4c29cb96119e4d6956d499092cb2cf490fc247da31f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::scaffold::builder::build_table_paragraph: FunctionTooLong \u2014 rhwp::scaffold::builder::build_table_paragraph 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":"src/scaffold/builder.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a430f182228837b7775c558e450e1f9bdfe8795899487e538366f885c3940b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gym/report.py: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"gym/report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ebe00b3e9e4cd4da463fc94a905f45c1c1e4feaee2c8d02fd641bcbae33e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: capabilities/extended.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":"src/cli/metadata/capabilities/extended.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e033d6faab69af20ddc9591457e3a620a94c062a51fac89a8a60d1c480915a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-table.finishResizeDrag: FunctionTooLong \u2014 finishResizeDrag runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53bb69c34d09257616efb8ed4e22b553babca98ecc6531df287b750adfa2b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParaShapeDialog.collectMods: MethodTooLong \u2014 collectMods runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"051610e68699615ddb160b629162e648d160da57e90b8c33f1a3e6b1aaa0cd43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glyph-outline-payload-status.hasSupportedColrv1GraphContract: FunctionTooLong \u2014 hasSupportedColrv1GraphContract runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b4d0ec03882bd3bbeb45340edf3e36cade3b6d0e2c820bfb568c28240e5e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_content::edit_delete_hf_text 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"576c0606751c4775c20761a535a52552d3d03faa17bd8d593e51661364532d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.add_footnote_superscripts: MethodTooLong \u2014 add_footnote_superscripts 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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6ceed5a34fd4aeef7472838254880d5430c4de680297e4eedc524b282d56c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Paginator.paginate_with_forced_breaks_with_storage: MethodTooLong \u2014 paginate_with_forced_breaks_with_storage 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc9862edb6199a6fdf186ce1008f36ece4926de3c98d44b708119cf86bf9c32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::formatting::edit_apply_cell_style: FunctionTooLong \u2014 rhwp::cli::commands::edit::formatting::edit_apply_cell_style 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"97403460f5890072363fb426348448ceb554b7dd07c61d1c4efc2d99eda5c9c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::pdf_import::execute: FunctionTooLong \u2014 rhwp::cli::commands::pdf_import::execute 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":"src/cli/commands/pdf_import.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d43d59283263903ee7b11cce36bdb907c5a4a6a5ac10ec9e05d2afbd6b3fb05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.merge_paragraph_native: MethodTooLong \u2014 merge_paragraph_native 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef2394f0cd0e6ddd5d7c59377d8910cfd2b2d59d6b3e05d75a772fd04d7d774"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_inline_control_pen: MethodTooLong \u2014 stored_inline_control_pen 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74db7c748259dfbea74f7228acba3c40897496bf2ea09b5620fcc9fc27b650"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::svg_layer::project_debug_overlay: FunctionTooLong \u2014 rhwp::renderer::svg_layer::project_debug_overlay 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":"src/renderer/svg_layer.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63983d02d1bab9105f54a743560f7bf75a5cea30d065bad02e831d105b545e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composer/composition.inc.rs: FileTooLong \u2014 569 significant 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 69 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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08778aee1ec2f60b946cfb9d8f193eef02e3b6b7ae85768238e8cd717864e9b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rhwp::serializer::hml::body: 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":"src/serializer/hml/body.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8800a84fc273630937106bea9f63c5872da46fe4f158a2f4b3329196e9afd74b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_ooxml_chart::renderer::render_value_grid: FunctionTooLong \u2014 rhwp_ooxml_chart::renderer::render_value_grid 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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"de47e41c96e1032beb9b6b3913bcb58877d539fd751fd79276f3884dbd5e7649"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::safety::run_stego_scan: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::safety::run_stego_scan 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eac90a4673bd4f251667a375ee1bbbb33fe863e317f74279f2cd2f6a033218"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_properties::edit_apply_para_format_in_hf 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956bc7e18e8ddba8366b76eda3d3a521e646e1a0dd5534a482e5469c77a23a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::ole_chart::legacy_combo_renderer::render: FunctionTooLong \u2014 rhwp::ole_chart::legacy_combo_renderer::render 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":"src/ole_chart/legacy_combo_renderer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8b62652a9e4246750ccab347c6fe006c05d81f7b3faf8234d87c01f9cd28a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_common_shape_children: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_common_shape_children 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":"src/parser/hwpx/section.rs"},"region":{"startLine":7779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae1e609aebc8be4ca102efae00e2925affcfc83394f05974a58a0dfa73527f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ledger.candidate: MethodTooLong \u2014 candidate 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e42cc9fd3a359c24ed207156a47d1aa8fe6b4e947e1fe3df7ea052f9c32c84d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::pdf::direct_pdf_validation::validate_gradient: FunctionTooLong \u2014 rhwp::renderer::pdf::direct_pdf_validation::validate_gradient 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":"src/renderer/pdf.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4f0cc72384b2d5f22affedc02115e45dc0a4f7405db4ef95ea133cb69f0906"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::forced_boundary::prepare_forced_page_boundary: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::forced_boundary::prepare_forced_page_boundary 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":"src/renderer/typeset/paragraph/forced_boundary.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"19237daad7bbb687b8675c830493857171eb51d0230699aac0783d781e6173d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/search_query.rs: FileTooLong \u2014 563 significant 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 63 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":"src/document_core/queries/search_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b404b2694bd14bccd78089fc7eb1aeb86e8e5ac7f2774acf13b5d1551d5ad84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hml/preflight.rs: FileTooLong \u2014 563 significant 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 34 free functions. The bar is 500 significant lines; this is 63 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":"src/serializer/hml/preflight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2431f79cd52db67ab3c11f66e98612eeb728593296a1eaad60c843cc4b8fcd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.split_section_native: MethodTooLong \u2014 split_section_native 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":"src/document_core/commands/section_ops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f0b595be799f653352ef4d48c59d983732cf370906e483182665da66f87d68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextVariantScopeError.fmt: MethodTooLong \u2014 fmt 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":"src/paint/text_variants.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d918fd15f6ba14be6c5ad7cce58301571d4506aec752214e83fe72a01b245e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.begin_resumable_table_pagination: MethodTooLong \u2014 begin_resumable_table_pagination 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":"src/renderer/typeset/table/continuation/job.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fedc59488f9fc0e6c840ca565bcc3b1cde789231d3135b838e8109b513093c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_host/gpu_d3d.rs: FileTooLong \u2014 559 significant 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 70% of them inside a single declaration: NativeD3dPresenter (3 blocks, 240-741). The bar is 500 significant lines; this is 59 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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f32e3b3c0d87a3a0b507cbdc203f6b2b619f5ad64e9f95ec7366ac03495da1b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LenientCfbReader: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 417-1089. The bar is 400 significant lines; this is 45 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":"src/parser/cfb_reader.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"303dac1a9f04fa5c2e369b09a18299604d247980d3ba3e11425d0c274df2c339"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/insert.ts: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad79bbae480fe25ee52c17a98827f90641def51c7b2175728eb6b770f99aef8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paragraph/initial_fit.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), about 88% of them inside a single declaration: TypesetEngine (75-711). The bar is 500 significant lines; this is 56 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":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637b532c003c629ced8a678098243020ac895b1988e7d2db81f23e1b47118ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_native_ffi::session::rhwp_native_host_request: FunctionTooLong \u2014 rhwp_native_ffi::session::rhwp_native_host_request 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":"bindings/Native/src/session.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06b49aa4ddf5f8f5dd74ce0aaa8d69f0bc71e853d2a538e75bf686570268e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableCellPropsDialog.buildCellTab: MethodTooLong \u2014 buildCellTab runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b773570971f245626265e757c8a999191c07756140de3a19f1821c234d19d6fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::diagnostics::dump_raw_records: FunctionTooLong \u2014 rhwp::cli::queries::diagnostics::dump_raw_records 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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d386b1eefd1c68819b6b1c8a54aaa0f939108d177a7f29bb2f1c22068baa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::security_inspection::armor_command: FunctionTooLong \u2014 rhwp::cli::queries::security_inspection::armor_command 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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3381a28dad0f2d145bb9e06c8d2cedd7f2d5c6e60dd3c5c0cb256a66b5059367"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.merge_table_with_next_native: MethodTooLong \u2014 merge_table_with_next_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c21f96d62fabd4f59201a1ad7d05975a0cf58dff167d0244f9d96970200ef35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.resize_table_cell_native: MethodTooLong \u2014 resize_table_cell_native 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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1358e22a4efc948f754a4466bde0fe08a8b32952e4d64789f15a9f3ea20ad270"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::text_v2::collect_node: FunctionTooLong \u2014 rhwp::paint::text_v2::collect_node 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":"src/paint/text_v2.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c03b774bcce1071b8d7ee68626e14a8177c3ae9f9a17eb1166d3f69ebd79df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host: FunctionTooLong \u2014 rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host 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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"32531943bf52f11cee202f38fa6d2a88ad57bbd8c78bc23cfc34461675225c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::form::write_form: FunctionTooLong \u2014 rhwp::serializer::hwpx::form::write_form 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":"src/serializer/hwpx/form.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67abde52e37b17db3262f71a34d2ad60d071f2db610664d7945603eb429a722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: equation/canvas_render.rs: FileTooLong \u2014 554 significant 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 54 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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837ef7b377089c1d1c5c2286b2c79715aebfe9d744e86b43c0dcd9008e5c7ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/layout_frame.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: LayoutFrame (2 blocks, 460-1139). The bar is 500 significant lines; this is 52 over it, 1.10\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":"src/renderer/layout_frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb2e2c79fb5ae70bdad713292bcd3e071a81659b96876da34d3baad050d9a09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Planner: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 367-995. The bar is 400 significant lines; this is 41 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a579003b3882ab2c6a265a3a9dce27a3b5e8c4eb441567bd9624366226c398e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SvgRenderer: TooManyFields \u2014 33 stored fields beside 62 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":"src/renderer/svg.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee2e744206f53085b8ae35f954788bc7a9062a7203bee984d5b4bac8878fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TableCellPropsDialog: 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"95120f5b227ca913ce62dcb5b4f23a8a252018edd42f12df6450bb0028386a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Toolbar: 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":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"852834f66e322f99b60fb001d4641e5201b116dcd67441ab492195659b69c5de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ruler: 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3033e5b649efc1df7d7dddfdc0de79fcfca781d33432ea2885fa65f6c5a4a065"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParagraphFloatPlacement: TooManyMethods \u2014 33 methods, declared across 4 files: renderer/float_placement.rs (27), float_placement/split_host.rs (3), float_placement/stored_empty_host_frame.rs (2), float_placement/computed_host_origin.rs (1). The bar is 30 methods; this is 3 over it, 1.10\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":"src/renderer/float_placement.rs"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"907d010d20f5ff311d81889c2758cf3247e35e2547bbaf45573e78ded083f8d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/advanced.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":"src/cli/metadata/mcp/advanced.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bfa9707732dc0cf4cfc25ee37c41d575c39e5e7a982fb43cfd5b064e960819"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cards.addToolCard: FunctionTooLong \u2014 addToolCard runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e93e9a52126f7d315f973a46c5b93225129d57c816c61b1f483f449b6756aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-q::kit::fn_selection_rects::run: FunctionTooLong \u2014 rhwp::bin::rhwp-q::kit::fn_selection_rects::run 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":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f49861f8bd1fdb9a1e4d89aae4b197812b299746105861c039129526e7fd132"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::tables::grid::edit_merge_cells: FunctionTooLong \u2014 rhwp::cli::commands::edit::tables::grid::edit_merge_cells 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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"364d6abc384b015e90e96f7ded0a7a05f8126f4bc0f6b29ed56a7cf651969f0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::emf::parser::dispatch: FunctionTooLong \u2014 rhwp::emf::parser::dispatch 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":"src/emf/parser/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a10ae9961165f423d11f54ad62fc703bfb7005a5ab8d365575d8c4710ca0b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::kerning::apply_pair_candidate: FunctionTooLong \u2014 rhwp::renderer::kerning::apply_pair_candidate 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":"src/renderer/kerning.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d8800c2c2f789dea44066d33eee9528dabfd5a7fe07a8eaacc3d6304d75b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row: FunctionTooLong \u2014 rhwp::renderer::typeset::is_reparsed_single_column_cell_split_row 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":"src/renderer/typeset.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a05b89c27b18245d1547bdba482632e1675773df796a32d9094022362bfac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ParseState: TooManyFields \u2014 33 stored fields. 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/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb302e02873541703d4fb5c25c94956b559e454f6895810d4f11e6b5482ef9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LayerRenderDiagnostics: TooManyFields \u2014 33 stored fields. 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":"src/renderer/layer_renderer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7e4909d5d5ed3b49ad93b104d39b4a9cd10f7db670a61c831c6b6b032e6ceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/table.rs: FileTooLong \u2014 549 significant 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 49 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":"src/serializer/hwpx/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a96c8684763ac9ae7573495ee58d97a1e2ec7adbf96e6a2dc53929bb848aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VirtualScroll: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded), 38 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f5b2f4c654d670e1d5c5bb52b1275bdf47e75a47f09d7889834487db340866"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocumentAgentController: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 37 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"867cea3f9d2081ef672fa75ed51b403d12ce5a750b6f1dd20607e5632190184b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/control.rs: FileTooLong \u2014 546 significant 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 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd7ef8f839c1f584022daab4f0d0097b2c000922c08b89e9d498007cf80a72f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssistantView.proposal: MethodTooLong \u2014 proposal runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462a5e29025f524bac3449e41ea735f5fae1961b604861dd2304dea4ac86bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::explore::explore_document: FunctionTooLong \u2014 rhwp::cli::queries::explore::explore_document 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":"src/cli/queries/explore.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"83226f50b9e6693747232e4165b52e188621704904ac589affe47bbc427cce50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::control::shape::parse_shape_component_full: FunctionTooLong \u2014 rhwp::parser::control::shape::parse_shape_component_full 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":"src/parser/control/shape.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3687cdde618e6ad1bcb41dc9f60f15096b67b996fea9022f6c867f9526fd8669"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ledger.shared_edges: MethodTooLong \u2014 shared_edges 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":"src/parser/pdf/table_inference.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"301151bde58d46a9856114f3a4e54f284ca12e1664f4b6877cebbb1731b4de75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::kerning::compute_kerning_run_measurement: FunctionTooLong \u2014 rhwp::renderer::kerning::compute_kerning_run_measurement 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":"src/renderer/kerning.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"543c83fd9552d8f53379e2c1c8784bdb88c0194ce5f6c99484bc6ad0529621cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::skia::glyph_replay::construct_glyph_font: FunctionTooLong \u2014 rhwp::renderer::skia::glyph_replay::construct_glyph_font 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":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f20311675f2c599d400a45a8ff76ab0fb7475dd3647731f81ae175dcb109fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkiaLayerRenderer.render_pixels_in_window: MethodTooLong \u2014 render_pixels_in_window 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":"src/renderer/skia/renderer.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"026c529e8372a7c64314eed78233f7c0796e7ed1aa90a6c5697112a85b754d25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.render_image_with_sampling: MethodTooLong \u2014 render_image_with_sampling 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58a9de9ba34c7269bddf557bf1dd541e09d0555b9770883d978c59b1728bf41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::package_check::check_package: FunctionTooLong \u2014 rhwp::serializer::hwpx::package_check::check_package 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":"src/serializer/hwpx/package_check.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c182ddcaf0204ec800963c1117de95ae7a8fa9164a0c583d09ee782ab3ddf4a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwpx/context.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: SerializeContext (3 blocks, 110-719). The bar is 500 significant lines; this is 43 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":"src/serializer/hwpx/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f078218a84a488d163faf8f7550b230d04c6c205d725098fd12080af33f193"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RenderNormalizationOverlay: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 93-724. The bar is 400 significant lines; this is 34 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ca323c98d30e6f9b81a5e73c3386fa278c4742ea1f9c9e28525d554fb79063"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/extract_data.rs: FileTooLong \u2014 542 significant 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 42 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":"src/document_core/queries/extract_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1af96264c309fdf6aee42b346c6280675054dbd47165b3444e749a053505ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 186-756. The bar is 400 significant lines; this is 33 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f32b117df2576300c546a85575703e3373a6dadb0fa97abf2ecd33f98cb4b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BookmarkDialog.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/bookmark-dialog.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f964012d5f379688851244c373ec99b99c3a5ffef5d6901bb67037085e8495fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::formatting::edit_apply_char_format: FunctionTooLong \u2014 rhwp::cli::commands::edit::formatting::edit_apply_char_format 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da650b15377f500c25205bc4a53f58fb94f902e8e75d2212f46ebede5d466ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.closing_row_frames_with_storage: MethodTooLong \u2014 closing_row_frames_with_storage 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":"src/model/table/row_frames.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6f0b3da0fc08f0b40817a81257168a5eb565589b18ed788567a88899c4d56a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::inline_flow::finish_row_with_storage: FunctionTooLong \u2014 rhwp::renderer::inline_flow::finish_row_with_storage 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":"src/renderer/inline_flow.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f07675546b38157f5622a24e08c2ca11145a3508e25cbb49b3f3ec49bf4d66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::typeset::paragraph::place_after_failed_fit_with_storage: FunctionTooLong \u2014 rhwp::renderer::typeset::paragraph::place_after_failed_fit_with_storage 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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7ba940c95f3f583d2a4aee921a63a9320ce3ece517e9a1ea04559308504cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fragment/physical_rows.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: TypesetEngine (55-743). The bar is 500 significant lines; this is 39 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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ba113eecc6263aaad40d5c19ffa5cb242c6ec89fd42d4a2df1bbdc61cd9c8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: canvaskit/css-color.ts: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3000d23ff3fd9bbde64408c38d67de60eeac7868a36c28e3141b62d846f1cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: section/controls.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), about 98% of them inside a single declaration: TypesetEngine (8-806). The bar is 500 significant lines; this is 35 over it, 1.07\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":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5a3a66d5c32351df11b1bc4e4976bb7d499ed726782b592a28b9169601cc21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: content-script.showHoverCard: FunctionTooLong \u2014 showHoverCard runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-chrome/content-script.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66723a439e5a9e024a8bef87b6ad389f50159f6f8a60ca12ee6842bd333b67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FindDialog.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa525cafdecd55e274cf96b320a895df9308212259556b18203b85fa8fb973b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildMarginCaptionPanel: MethodTooLong \u2014 buildMarginCaptionPanel runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df271679bae234aca0f97583f7b8fe57180dbc6895a491494ac1ee004b8543"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell: FunctionTooLong \u2014 rhwp::cli::commands::edit::cell_paragraphs::edit_merge_paragraph_in_cell 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":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"12690249c325ebddd4b5a8aaf9467dd4296728d9a601c824dece00fbeac7055c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::shapes::edit_group_shapes: FunctionTooLong \u2014 rhwp::cli::commands::edit::shapes::edit_group_shapes 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":"src/cli/commands/edit/shapes.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89894c30429657f8b62f706a972e5f770061d7736349aef78b9fe0fbcebe6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::doclang::export_doclang: FunctionTooLong \u2014 rhwp::cli::outputs::doclang::export_doclang 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":"src/cli/outputs/doclang.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6121aa1889446a94eb5b5beacacc9ae4f9c68def73224b39734fabd8c2e77cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.find_next_editable_control_native: MethodTooLong \u2014 find_next_editable_control_native 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"84306141aa506a13079ee5773cb65dc44e6c6931382429678d02f724037e39f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::paint::shaping_glyph_vertical::build_vertical_leaf_glyph_run: FunctionTooLong \u2014 rhwp::paint::shaping_glyph_vertical::build_vertical_leaf_glyph_run 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":"src/paint/shaping_glyph_vertical.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f337e14bb7add84fd8ca8f151ae00023ade4c9de645eb7a29c608bb29c2c39b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::image_header::svg::parse_header: FunctionTooLong \u2014 rhwp::renderer::image_header::svg::parse_header 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":"src/renderer/image_header/svg.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be4dc1f0a8623593d677d26d00116fe7859f1a44fd4b9a1dd5e32de1a0a501"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_empty_prefix_row_closing_frame: MethodTooLong \u2014 stored_empty_prefix_row_closing_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b039da5002acb3895be78cb3fa447e94ec7a3ecb05e63d70c908fb4f64645c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::body_text::try_serialize_section_inner: FunctionTooLong \u2014 rhwp::serializer::body_text::try_serialize_section_inner 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":"src/serializer/body_text.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef009df3678a01f7c7a2c011da0d0f2e56cf946a41fe4608ed0d80c5ace928fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeDocument: TooManyMethods \u2014 32 methods. The bar is 30 methods; 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"78caa42a59cbdcf2434b76b43ce16bbf1a2b6842daa99ebe42fc552d85184562"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CommonObjAttr: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/shape.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdadb79d97f05c9a5f4ca3b23f3f008a5a1f01182ec7ea2b566b5c8908c32c82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CharShape: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b6d5361a137b1fbba08ea2d361854709969f9d9d173a7d75f562730126dab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RunEmitVars: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f191bd413c3914af9f4f057a4a95b744a07170ba95b2bad36310362900e77df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/layout.rs: FileTooLong \u2014 533 significant 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 33 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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210874ae1aa1ee7f54108fc85ff324ee13d82617be0364cf4715b93c12394a34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/para-shape-tab-builders.ts: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 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":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5b60febb65b762dee2b7c626fa4686fc05e88d31e44abd4bf5e8f6c742f1f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalFontsModal.build: MethodTooLong \u2014 build 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":"rhwp-studio/src/ui/local-fonts-modal.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a4883fc2070dec23b9d2dd38c5cf0750716a622d0b30ad91bb59cd4947fe0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::pdf_import::worker::execute: FunctionTooLong \u2014 rhwp::cli::commands::pdf_import::worker::execute 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":"src/cli/commands/pdf_import/worker.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ed26508c058a1d4239356fa09b04b7c489163509bbd248f59d0c8da24d7535"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info: FunctionTooLong \u2014 rhwp::document_core::commands::foreign_paste::merge_foreign_doc_info 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":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e28184edd75836f1959a7702e10194c6869a9b18cb8e5b899bfa90092d88fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.set_cell_field_text: MethodTooLong \u2014 set_cell_field_text 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":"src/document_core/queries/field_query.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"69834b08d103ab58c46ab80196d82b9434b206a1c18c118ecedcaf1d36d04725"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEditor.commit_ime_edit: MethodTooLong \u2014 commit_ime_edit 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":"src/native_host/ime_edit.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95fef86c5ce2b7f11a5b9a3c0f7f520c9384176b044a24ee49d41ed79cd884c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.ordinary_rowbreak_fragment_heights: MethodTooLong \u2014 ordinary_rowbreak_fragment_heights 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72229b4875803b9d4ef2aad2398017110d143d4af7e53ecdf2b350dd5fd9b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.stored_body_closing_fragment_extent: MethodTooLong \u2014 stored_body_closing_fragment_extent 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda0372dc00d8e248c5eb6fe36d22ff67c95062010c091978280532c86f70f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializeContext.try_assert_all_refs_resolved: MethodTooLong \u2014 try_assert_all_refs_resolved 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":"src/serializer/hwpx/context.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"66226e98a034ce193cdd1113ade13c1fe066543e01ebc16435268856a337ac14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::wasm_api::pdf_import::options: FunctionTooLong \u2014 rhwp::wasm_api::pdf_import::options 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":"src/wasm_api/pdf_import.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32c8bf035589149c74673d7ff471d2653aac7f1ce657e36a4c40a17ecc500b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/tabular_import.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). The bar is 500 significant lines; this is 29 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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e721987678a5f09008ae22540ed8bdb88bb28be11512025d58a751895f03fd02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/note_content.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":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f26b5350bb5588c4baf529a89ee70c272e82aaeba739330b249953673639fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queries/hidden_text.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: DocumentCore (369-872). The bar is 500 significant lines; this is 26 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":"src/document_core/queries/hidden_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"377e35462e22f86b87d80ce0e9460d7b99d9d26626b403fe7aaf9286b6594f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_host/editor.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: NativeEditor (2 blocks, 71-755). The bar is 500 significant lines; this is 26 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":"src/native_host/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad7196d4afd88ffdbf557145ba46adcd5afaf7e3b0c31e27a64faa7262e4d46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-keyboard.handleCtrlKey: FunctionTooLong \u2014 handleCtrlKey runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8994714e7c697ca586d89c7b9c7c2126fab49be3938fd2b58e2ad4788eafcef3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-picture.finishPictureResizeDrag: FunctionTooLong \u2014 finishPictureResizeDrag runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f499dddfda87446de3a60b580ee6b28e3830acac2c8478d53653d7a560f31a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PicturePropsDialog.buildShadowPanel: MethodTooLong \u2014 buildShadowPanel runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e9654d0b983ec17f2f83cce17580fa9c649550daebfa164e6a2f794242ae09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::cells::edit_set_cell_props: FunctionTooLong \u2014 rhwp::cli::commands::edit::cells::edit_set_cell_props 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef73c4902ae2c8b3ff4db304db424874e5c06074994e874f5b84ca2005dab51c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::document_text::edit_insert_column_break: FunctionTooLong \u2014 rhwp::cli::commands::edit::document_text::edit_insert_column_break 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b700ef82645a736b43480a001555c6af0e3af7aa235e630c09d13d62d7c005c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::queries::data_extraction::extract_data_command: FunctionTooLong \u2014 rhwp::cli::queries::data_extraction::extract_data_command 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":"src/cli/queries/data_extraction.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"85860c386c6b6048e30b5ed65977f57426f02092cd9803b2ebc7f449e1863f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::doclang::adapter::control::convert_control: FunctionTooLong \u2014 rhwp::doclang::adapter::control::convert_control 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":"src/doclang/adapter/control.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b993c1fa9b8d9145325ea269bf615d2b369ffa534485c8a6250e2eaf71e9ae72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::object_ops::chart::plan_identity_edits: FunctionTooLong \u2014 rhwp::document_core::commands::object_ops::chart::plan_identity_edits 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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51060d9daf0a602b4cefa4a1052cf2a20efacaca2eaaa98e10adc353517f60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.recalculate_table_formulas: MethodTooLong \u2014 recalculate_table_formulas 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":"src/document_core/commands/table_formula.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e621789dcdf2607ca41905ca663aa32a0672d019868c9da7730a8a0eebed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_future_paper_shape_frame: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_future_paper_shape_frame 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":"src/renderer/float_placement.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60253ae30a76bd5befd8d2502a3a96bb1e54a3728d457e9ef749ba7d57cb0e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.predict_endnote_render_y: MethodTooLong \u2014 predict_endnote_render_y 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":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f57a86381dbbf009b7c9e60ec8892b66df55e3c6556e9ed321beedc2922669"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hwp-editor-provider.ts: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: HwpEditorProvider (5-642). The bar is 500 significant lines; this is 22 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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a753b67e783cb624733c1ba6d069ed8d089b3c8d09fdb4a9e824d8ce2a7b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/hwp5_table_probe.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). The bar is 500 significant lines; this is 21 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":"src/diagnostics/hwp5_table_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704c3f2960c8f694ee460cbe18d28693f3cdd9cf25ed9a32504a7de302d6290"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/table_formula.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 66% of them inside a single declaration: DocumentCore (258-699). 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":"src/document_core/commands/table_formula.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b098ac5c21a4de948b3470564aadda45912c87e296716ec5be1983c82f029c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/footnote_ops.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), about 98% of them inside a single declaration: DocumentCore (15-734). The bar is 500 significant lines; this is 20 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":"src/document_core/commands/footnote_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb25dc0a6ce9aac8e41ac138cef4cc828a60f0a35d0cc453e5c7cb02705fb011"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp_native_ffi::session::rhwp_session_request: FunctionTooLong \u2014 rhwp_native_ffi::session::rhwp_session_request 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":"bindings/Native/src/session.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a69db4e63becf102e1cea4838ff2b0de618ccb0c174b02b870b5825b4f54f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CartesianLayout.new: MethodTooLong \u2014 new 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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"85398bdc91ae27fcd4a954f250e4b403a2e65871759319722a4e326ab539e7a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: text-variant-selection.selectLayerTextVariantsForLeaf: FunctionTooLong \u2014 selectLayerTextVariantsForLeaf runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit/text-variant-selection.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"667fe19ba671038946d2abdef9bd5daaba2f899cc32c3e92acdf3302decdf141"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::document_text::edit_insert_page_break: FunctionTooLong \u2014 rhwp::cli::commands::edit::document_text::edit_insert_page_break 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebb79ca8fbbaa728d1006bb6e3f95cbf00d670a244a02b082dd7f92a362f10c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_content::edit_split_paragraph_in_hf 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fde896be73fc85bb6b80b5b8a6820ea1ac91937fcb384249a86ee851c257144"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::outputs::preview::extract_thumbnail: FunctionTooLong \u2014 rhwp::cli::outputs::preview::extract_thumbnail 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":"src/cli/outputs/preview.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb7d254219f88ae217016190df68b4d4b8dc91dfb292015ee371ef1f6f91a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.apply_cell_style_native: MethodTooLong \u2014 apply_cell_style_native 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe87d3c63011e44b7ac8019d036b9db9b19ff6634b12fdd6a069d0f28ed22c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.relocate_floating_picture_native: MethodTooLong \u2014 relocate_floating_picture_native 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d35ac68e750b14b960ce83dd1ad1a21986f495c18d582725ebc7244a8eeaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::document_core::commands::paragraph_block::rows_geometry::inspect: FunctionTooLong \u2014 rhwp::document_core::commands::paragraph_block::rows_geometry::inspect 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":"src/document_core/commands/paragraph_block/rows_geometry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd78a83a85994cf309d42cab025f5ed94c1f4320582780961eb377abfa1fc1f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StemBlock.deserialize: MethodTooLong \u2014 deserialize 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":"src/parser/ingest/schema.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d90e38d39c8c9e8b3aa4e3236e7ba997d91bd72f18f97b8c4c6bc2c64af53e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::rag::chunker::linearize_table_parts: FunctionTooLong \u2014 rhwp::rag::chunker::linearize_table_parts 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":"src/rag/chunker.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2e79f3ed57fdfac0262a3bc9a925aefbf35cb8380116323385bdef82710525"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::image_resolver::print_alpha::print_alpha_payload: FunctionTooLong \u2014 rhwp::renderer::image_resolver::print_alpha::print_alpha_payload 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":"src/renderer/image_resolver/print_alpha.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac07735349e1dc713496f4e2ccb1d37b59b56c5f4757a3c177387380e152181"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.resolve_column_widths: MethodTooLong \u2014 resolve_column_widths 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba27d2572c69555d01df7d7b906351a39a0e0ce94850c9beb56f4792eacf14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.should_defer_fresh_rowbreak_wrapper_prefix: MethodTooLong \u2014 should_defer_fresh_rowbreak_wrapper_prefix 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4255aecc9cee269405c7ebe6683c63b6c509127d42b18a85f00f49ad8cb41b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/privacy.rs: FileTooLong \u2014 519 significant 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 19 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":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c6946c5f91f3e383fe6172c0a125b046a4b3bbc3180db8ac16a609ef22e76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/note.rs: FileTooLong \u2014 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), about 99% of them inside a single declaration: DocumentCore (8-751). The bar is 500 significant lines; this is 18 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":"src/document_core/commands/object_ops/note.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773bcdad92aa129d2a51ea20e98a01e832773fff13b448557ada0f2415c6e9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CellBorderBgDialog: 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"345fbe87a4571250cfb28c03103741b604784ba8968bea19b3e58e225060ca0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ViewportManager: 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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a51738890f8bea3cd608feb691e3523f023fcaaea3997c65c2dc2ae5276743"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HeightCursor: TooManyFields \u2014 31 stored fields beside 11 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e7c6e413074ac6964823e41546bcac48de1a6a21c8705d2e48e080f34129f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gym/certify.py: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 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":"gym/certify.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524859036faf3892b5adc6cd84c2af493f4881f69acad3bf68d6c1aa15dfe279"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/virtual-scroll.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: VirtualScroll (111-746). 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d817372f051dd0935d1ac7fd81f0be0882669580bf80405c728486ea229c2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/shape_item.inc.rs: FileTooLong \u2014 515 significant 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 100% of them inside a single declaration: LayoutEngine (2-755). 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":"src/renderer/layout/shape_item.inc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9183c8c3e199cbfe64a58f0074e84a82cf1f37771eb3687c396677670942ff0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main: FunctionTooLong \u2014 rhwp::mydocs::tech::investigations::issue-595::probes::inspect_595_regression::main 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":"mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4202626f6dffbb6b6b691f398c0013085220037d30713f3aba4c24edbf1e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: input-handler-table.finishImagePlacement: FunctionTooLong \u2014 finishImagePlacement runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"018d619edf72b2fe261d9f1ee4e7489f044d7b29a0dc8406d786442b249e4fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::document_objects::edit_set_form_value: FunctionTooLong \u2014 rhwp::cli::commands::edit::document_objects::edit_set_form_value 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4912c93e6a2f5e38271d477f2417c729da0a5ef8c7e4abcd16ca221c1d69b26d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_properties::edit_set_hf_picture 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"32858dcb9b34f963934bc017e62a02885de8823ab174c75e1e18c5d6ecfbf25e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template: FunctionTooLong \u2014 rhwp::cli::commands::edit::header_footer_properties::edit_apply_hf_template 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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f5805e4f52afcba0d3961b3f4834890fe94dab70a72a1610b8e6553e858a07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.create_border_fill_from_json: MethodTooLong \u2014 create_border_fill_from_json 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":"src/document_core/html_table_import.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea8e2f87e10aabcd03973fbeab47c346652ecfb9881953ec3d4acc8aeb99a15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow: FunctionTooLong \u2014 rhwp::renderer::float_placement::stored_partitioned_picture_cell_flow 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":"src/renderer/float_placement.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3027721006312caf765532a2930cbbdda496532b35cce4e5393b2e8588b8b3ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage: FunctionTooLong \u2014 rhwp::renderer::height_measurer::trim_stored_hwpx_inline_row_trailing_spacing_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c7d7939989bf37b8f75f1c7923432bba349202ad5c1977ab90050ff965fa63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::border_rendering::render_edge_borders: FunctionTooLong \u2014 rhwp::renderer::layout::border_rendering::render_edge_borders 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7de611dd08ca79b9fc5d02c7d43ebde158b8d8752ef10ede09d77416d492b5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.straddle_page_band_relief: MethodTooLong \u2014 straddle_page_band_relief 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":"src/renderer/layout/table_layout/rowspan_fragment_height.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5271f1ecc339342146269fa0ab07675f0e71f9454eb3f8ae60cc078d43cbd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderNormalizationOverlay.register_rendered_text_partitions_with_storage: MethodTooLong \u2014 register_rendered_text_partitions_with_storage 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":"src/renderer/render_normalization.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4d55fb6f3eccfc4621b3656b4bfd75e15ab3c57a5adf398e80954d173f9b0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SvgRenderer.draw_char_overlap: MethodTooLong \u2014 draw_char_overlap 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":"src/renderer/svg.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4dbe7fa5dd0641068dcf51da1a494fe3f11b4608647c10a5bdb332282acf49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::serializer::hwpx::section::render_paragraph_parts_with_storage: FunctionTooLong \u2014 rhwp::serializer::hwpx::section::render_paragraph_parts_with_storage 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236465b09b42b43b694e65f5fdb165433f04f8c79d62496e455dc393add5541"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: batch_convert::bin::mock_rhwp::run: FunctionTooLong \u2014 batch_convert::bin::mock_rhwp::run 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":"tools/batch-convert/src/bin/mock_rhwp.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffdef7a066b9dc453bb8c41414bf1a40a22a81f28362f00d8722907e9a1bab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/page-border-dialog.ts: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PageBorderDialog (32-655). The bar is 500 significant lines; this is 14 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":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d2d583b76463389a0ef7095cbf2a04145a06c4c444a7fbd89011224ea3319"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hwp3/drawing.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":"src/parser/hwp3/drawing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10de22c31255e285fcb7e9c08ce8147ffe72bfa13e48397225012f30d67240c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/render_normalization.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), about 85% of them inside a single declaration: RenderNormalizationOverlay (2 blocks, 93-724). The bar is 500 significant lines; this is 11 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":"src/renderer/render_normalization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f346118b180ae80003c506b8e5c6d04bd2647beca11ed5c150053eb467d4e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/glyph-outline-payload-status.ts: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf76240154e4b8f3016dca8af3ce4b958581cfc1878c3157ca4078792187bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::caption_validation::run: FunctionTooLong \u2014 rhwp::cli::commands::caption_validation::run 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":"src/cli/commands/caption_validation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6601c90d98e18cf6846fdbe0cc0c66dcb2f21068a86ed0da466e95e57c1ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::equations::edit_insert_equation: FunctionTooLong \u2014 rhwp::cli::commands::edit::equations::edit_insert_equation 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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3d13e7bc103aa8570743ec9b13f1cf8eceb94ade84a50726cbe68fe93673e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::diagnostics::hwp5_borderfill_diagonal_probe::render_diff_report: FunctionTooLong \u2014 rhwp::diagnostics::hwp5_borderfill_diagonal_probe::render_diff_report 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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"0044a95877c267d7839ea84b7ca3e284e3b4276c92b0b68955f6daedba11f1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.parse_inline_content: MethodTooLong \u2014 parse_inline_content 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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028f07ac71ac174ac8dd745e92c3af895fd1073b8e0a2b99bdd04cd1ad7178c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.handle_cell_boundary: MethodTooLong \u2014 handle_cell_boundary 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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb9c764259122576d01203e70c1dbbe61415ab2a7d8ffd9405bf335b66e1d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwp3::parse_field_control_char: FunctionTooLong \u2014 rhwp::parser::hwp3::parse_field_control_char 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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee815d1516c77ea1c99abab14bfcfd8026ce2df39c2c2606d95194d313a3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::render_backend::contract::standard_lifecycle_scripts: FunctionTooLong \u2014 rhwp::render_backend::contract::standard_lifecycle_scripts 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":"src/render_backend/contract.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc362e03daec725482bd9f368d835267ecae5c217bc55985ffdc405b11753a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::paragraph_layout::horizontal_shaping_initial_lane_preflight: FunctionTooLong \u2014 rhwp::renderer::layout::paragraph_layout::horizontal_shaping_initial_lane_preflight 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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"17365dd909b29708440e8b3d9ba3d1347906a4823d80e0ba864b2d7fed8647eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_row_reset_closes_declared_frame: MethodTooLong \u2014 stored_row_reset_closes_declared_frame 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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe814f90e3e7763a80755ca355abe3aa94ed0228fc234c2035cc19702e0672"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.render_text_run: MethodTooLong \u2014 render_text_run 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":"src/renderer/web_canvas.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2bc69faedcbea388a840353dbf5467c331f488a441edf4a2e1b94e1352c424"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: META_ESCAPE.parse: MethodTooLong \u2014 parse 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":"src/wmf/parser/records/escape/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36ddfc3031cf730d70827a769f2fc2f4fc1e90c7936f291e9726440b937f210"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev/page-scroll-probe.ts: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: installPageScrollProbe (75-592). The bar is 500 significant lines; this is 8 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6f0e8601448abbb139bbcbabc67d41cf6227792d19bb38484f85268f829a06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/worker.rs: FileTooLong \u2014 508 significant 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 8 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":"src/native_host/runtime/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba24828da61fb4474d0968f2ec55786635e32839d441a1ce9c4663e804e37b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: composer/stored_word_tail.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":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69a55e9496af2d5d4249ea94ca99ce9a8db05d8acaa4e5b721eccccddbdbabe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: edit/document_objects.rs: FileTooLong \u2014 505 significant 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 5 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b740861e2976cbe43b212d1e08b0e310faf97b2eb7e7c3a279b451bfeeba2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasKitLayerRenderer.fontDecisionEvidence: MethodTooLong \u2014 fontDecisionEvidence runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"445923bf3e317f0b6ee5e0b54ee972d37c597cb375b26e25ef41993c84fcbc4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-agent::grepcmd::run_grep: FunctionTooLong \u2014 rhwp::bin::rhwp-agent::grepcmd::run_grep 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":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2de8f3edb47520bbcd3f43bc4c8ff952978430f829c474eb78d39aa7aeb5ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::bin::rhwp-q::kit::chart_csv::run: FunctionTooLong \u2014 rhwp::bin::rhwp-q::kit::chart_csv::run 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":"src/bin/rhwp-q/kit/chart_csv.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"714ff0ee9635e77f1a5c5de2eab15167718de5904cbc5fc227d3ea2e57e9b392"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::fields::edit_fill_fields: FunctionTooLong \u2014 rhwp::cli::commands::edit::fields::edit_fill_fields 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f01ec6c2c620a55e741b136dd3a680e05f25f0ed124577ee04036cb32b516d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::commands::edit::page::edit_set_page_hide: FunctionTooLong \u2014 rhwp::cli::commands::edit::page::edit_set_page_hide 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"728d916adeac27c3a031e19dcc98917e92a398958b198ff50b4f8d72af1aef41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::cli::protocol::exchange::settlement::cmd_settle_propose: FunctionTooLong \u2014 rhwp::cli::protocol::exchange::settlement::cmd_settle_propose 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c191900430282661f3406430ccef82af730d5dfbd26e734230b298a5cf36dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::diagnostics::hwp5_inventory_diff::render_table_probe_plan_markdown: FunctionTooLong \u2014 rhwp::diagnostics::hwp5_inventory_diff::render_table_probe_plan_markdown 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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"3378d5c6e01a86c1fd08e72401b508f1f6d5659278c6e355a92361ec421554dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocumentCore.insert_equation_native: MethodTooLong \u2014 insert_equation_native 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":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"032491a0ae0a4e7da77642d48d4a500d859cb87c8559c9a20e29291f11c0d3d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::ole_chart::svg_renderer::render_body: FunctionTooLong \u2014 rhwp::ole_chart::svg_renderer::render_body 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":"src/ole_chart/svg_renderer.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a74851cecf95f1bc1d4af4db31eac7e8d59f56ea50c28b9d1279dcfd3d129bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::hwpx::section::parse_equation: FunctionTooLong \u2014 rhwp::parser::hwpx::section::parse_equation 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":"src/parser/hwpx/section.rs"},"region":{"startLine":6896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6956660c18142501ce3b7570452cdd3827731aeb57e03ded5b43b15ab072b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::parser::pdf::table_topology::evidence: FunctionTooLong \u2014 rhwp::parser::pdf::table_topology::evidence 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":"src/parser/pdf/table_topology.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6b10b546df6484c5e9f3d62fd4d17f41446420e1b107dcce7ef36662d43fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage: FunctionTooLong \u2014 rhwp::renderer::height_measurer::fit_stored_hwpx_no_adjust_rowspans_with_storage 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":"src/renderer/height_measurer.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0d4f6d36846372e10f85dc21ccb0760bda477a95a1986baca3124c3ea7f308"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlRenderer.draw_text_positioned: MethodTooLong \u2014 draw_text_positioned 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":"src/renderer/html.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ef7186df346f3c0b7214655f1ae9b94996c8aae77df16da58dd142e5132caa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes: FunctionTooLong \u2014 rhwp::renderer::image_resolver::uncompressed_palette_tiff_to_png_bytes 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":"src/renderer/image_resolver.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae52a2ee8439dc8d20f8f63fa0e795be1dd592436d3af8965e95ab74e26c425"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rhwp::renderer::layout::border_rendering::build_fallback_row_col_x: FunctionTooLong \u2014 rhwp::renderer::layout::border_rendering::build_fallback_row_col_x 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d2e89d5f77d24ea6c819de6d3aa3c054a432c959ad44f16ce1c91d2bec6aaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.stored_zero_origin_text_frame_break_witness: MethodTooLong \u2014 stored_zero_origin_text_frame_break_witness 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":"src/renderer/layout/table_layout/stored_zero_origin.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0483d69b5b00713500a4e63c8f1325c04aca75997e97901c4f2a0c1a067942"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypesetEngine.stored_partial_fragment_complete_extent: MethodTooLong \u2014 stored_partial_fragment_complete_extent 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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2734e02a44085b4042d9a509912b9dbe5ee9e454559aaf4274a9430e6e4ef7c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebCanvasRenderer.draw_path_with_gradient: MethodTooLong \u2014 draw_path_with_gradient 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":"src/renderer/web_canvas.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8cd48d173a76794eaf1478528f9fcf2074eff893d9d8dbfaf216916e60719"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: outputs/text.rs: FileTooLong \u2014 504 significant 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 4 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":"src/cli/outputs/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8383d5fca82e76b09b53fe115ee2b13a2444f9ce42df4f67abaed9e89ebc6835"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EquationEditorDialog: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b239bdfca4a42f1391da8c459d8ddee7a537cf6cfe69783e8da779a2514a88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativePresentationRegistry: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 535-1050. The bar is 400 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/presentation.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076be9e559207c7d7ebc3da0b08324eb15de755cae72683eb079fb2e837e359"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: references/_gen_pack.py: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00\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":".claude/skills/rhwp-fidelity-compare/references/_gen_pack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6da3ac3b40f8ab2a9d5c314ffa51a73d8acf64cb0213f4c6a224d89e97fcdd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan/execution.rs: FileTooLong \u2014 501 significant 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 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1deae4b83f8766ddd79bd9df8e9b18df6fe78716d5c622433478579c4afbe7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/native_webfonts.rs: FileTooLong \u2014 501 significant 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 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/native_webfonts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f9e939929d062458c2a399bf3ba43188ce50f5f23727cb630fb69b0d48911d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (57 members, 40 shared lines): src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/cell_paragraphs.rs:10-165 | src/cli/commands/edit/cells.rs:486-653 | src/cli/commands/edit/cells.rs:656-822 | src/cli/commands/edit/controls.rs:9-103 | src/cli/commands/edit/document_objects.rs:11-143 | src/cli/commands/edit/document_objects.rs:145-269 | src/cli/commands/edit/document_text.rs:229-336 | src/cli/commands/edit/document_text.rs:338-472 | src/cli/commands/edit/document_text.rs:474-606 | src/cli/commands/edit/document_text.rs:608-721 | src/cli/commands/edit/document_text.rs:723-831 | src/cli/commands/edit/document_text.rs:833-927 | src/cli/commands/edit/document_text.rs:929-1023 | src/cli/commands/edit/document_text.rs:1025-1118 | src/cli/commands/edit/equations.rs:119-252 | src/cli/commands/edit/equations.rs:254-348 | src/cli/commands/edit/formatting.rs:591-703 | src/cli/commands/edit/formatting.rs:706-855 | src/cli/commands/edit/header_footer_content.rs:8-125 | src/cli/commands/edit/header_footer_content.rs:128-246 | src/cli/commands/edit/header_footer_content.rs:578-730 | src/cli/commands/edit/header_footer_content.rs:733-870 | src/cli/commands/edit/header_footer_content.rs:873-1001 | src/cli/commands/edit/header_footer_content.rs:1004-1158 | src/cli/commands/edit/header_footer_properties.rs:7-137 | src/cli/commands/edit/header_footer_properties.rs:139-274 | src/cli/commands/edit/header_footer_properties.rs:276-389 | src/cli/commands/edit/media.rs:803-897 | src/cli/commands/edit/note_content.rs:8-124 | src/cli/commands/edit/note_content.rs:126-223 | src/cli/commands/edit/note_content.rs:227-344 | src/cli/commands/edit/note_content.rs:346-453 | src/cli/commands/edit/note_content.rs:457-565 | src/cli/commands/edit/notes.rs:9-102 | src/cli/commands/edit/notes.rs:104-197 | src/cli/commands/edit/notes.rs:199-293 | src/cli/commands/edit/page.rs:217-340 | src/cli/commands/edit/page.rs:342-466 | src/cli/commands/edit/shapes.rs:181-275 | src/cli/commands/edit/shapes.rs:455-549 | src/cli/commands/edit/tables/grid.rs:8-114 | src/cli/commands/edit/tables/grid.rs:116-222 | src/cli/commands/edit/tables/grid.rs:224-328 | src/cli/commands/edit/tables/grid.rs:330-471 | src/cli/commands/edit/tables/grid.rs:473-577 | src/cli/commands/edit/tables/grid.rs:579-693 | src/cli/commands/edit/tables/grid.rs:695-853 | src/cli/commands/edit/tables/layout.rs:8-101 | src/cli/commands/edit/tables/layout.rs:103-225 | src/cli/commands/edit/tables/layout.rs:227-347 | src/cli/commands/edit/tables/layout.rs:349-473 | src/cli/commands/edit/tables/layout.rs:588-701 | src/cli/commands/edit/tables/structure.rs:9-119 | src/cli/commands/edit/tables/structure.rs:121-214 | src/cli/commands/edit/tables/structure.rs:216-309 | src/cli/commands/edit/tables/structure.rs:311-427 \u2014 These 57 members are variants of one another: a block of 40 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 57 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 57 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b1a45ec0a8cb95e2be2913ec7687602c8c24e424c2c92380110eaddb1695c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (24 members, 45 shared lines): src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/controls.rs:9-103 | src/cli/commands/edit/document_objects.rs:271-404 | src/cli/commands/edit/document_objects.rs:406-562 | src/cli/commands/edit/document_text.rs:723-831 | src/cli/commands/edit/document_text.rs:1025-1118 | src/cli/commands/edit/equations.rs:254-348 | src/cli/commands/edit/formatting.rs:10-149 | src/cli/commands/edit/formatting.rs:152-276 | src/cli/commands/edit/formatting.rs:591-703 | src/cli/commands/edit/header_footer_properties.rs:7-137 | src/cli/commands/edit/media.rs:803-897 | src/cli/commands/edit/media.rs:900-1010 | src/cli/commands/edit/note_content.rs:8-124 | src/cli/commands/edit/note_content.rs:227-344 | src/cli/commands/edit/note_content.rs:346-453 | src/cli/commands/edit/note_content.rs:457-565 | src/cli/commands/edit/note_content.rs:569-695 | src/cli/commands/edit/notes.rs:9-102 | src/cli/commands/edit/notes.rs:104-197 | src/cli/commands/edit/notes.rs:199-293 | src/cli/commands/edit/shapes.rs:8-179 | src/cli/commands/edit/shapes.rs:181-275 | src/cli/commands/edit/shapes.rs:455-549 \u2014 These 24 members are variants of one another: a block of 45 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 24 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 24 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a85e6f5e60110e0b84b341a05b6d8985f5f0248db113353c247a9d7b778ee79"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (20 members, 45 shared lines): src/cli/commands/edit/bookmarks.rs:9-135 | src/cli/commands/edit/cell_paragraphs.rs:10-165 | src/cli/commands/edit/cell_paragraphs.rs:168-308 | src/cli/commands/edit/cells.rs:486-653 | src/cli/commands/edit/cells.rs:656-822 | src/cli/commands/edit/document_text.rs:833-927 | src/cli/commands/edit/document_text.rs:929-1023 | src/cli/commands/edit/document_text.rs:1025-1118 | src/cli/commands/edit/header_footer_content.rs:249-404 | src/cli/commands/edit/header_footer_content.rs:407-575 | src/cli/commands/edit/header_footer_content.rs:578-730 | src/cli/commands/edit/header_footer_content.rs:733-870 | src/cli/commands/edit/header_footer_content.rs:873-1001 | src/cli/commands/edit/header_footer_content.rs:1004-1158 | src/cli/commands/edit/header_footer_properties.rs:391-541 | src/cli/commands/edit/note_content.rs:227-344 | src/cli/commands/edit/note_content.rs:346-453 | src/cli/commands/edit/note_content.rs:457-565 | src/cli/commands/edit/notes.rs:9-102 | src/cli/commands/edit/notes.rs:104-197 \u2014 These 20 members are variants of one another: a block of 45 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 20 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 20 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3beeeb00e2419d801aeaabb5d7a966f469b59f5c8426451596d2c41d06478d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (17 members, 44 shared lines): src/cli/commands/edit/tables/grid.rs:8-114 | src/cli/commands/edit/tables/grid.rs:116-222 | src/cli/commands/edit/tables/grid.rs:224-328 | src/cli/commands/edit/tables/grid.rs:330-471 | src/cli/commands/edit/tables/grid.rs:473-577 | src/cli/commands/edit/tables/grid.rs:579-693 | src/cli/commands/edit/tables/grid.rs:695-853 | src/cli/commands/edit/tables/layout.rs:8-101 | src/cli/commands/edit/tables/layout.rs:103-225 | src/cli/commands/edit/tables/layout.rs:227-347 | src/cli/commands/edit/tables/layout.rs:349-473 | src/cli/commands/edit/tables/layout.rs:475-586 | src/cli/commands/edit/tables/layout.rs:588-701 | src/cli/commands/edit/tables/structure.rs:9-119 | src/cli/commands/edit/tables/structure.rs:121-214 | src/cli/commands/edit/tables/structure.rs:216-309 | src/cli/commands/edit/tables/structure.rs:311-427 \u2014 These 17 members are variants of one another: a block of 44 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 17 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 17 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6065a584a9ec1e92b0610d482e7fd4d4dc9664f8821886df49ee97445f0af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (15 members, 45 shared lines): src/cli/commands/edit/cell_paragraphs.rs:10-165 | src/cli/commands/edit/cell_paragraphs.rs:168-308 | src/cli/commands/edit/cells.rs:486-653 | src/cli/commands/edit/cells.rs:656-822 | src/cli/commands/edit/cells.rs:831-968 | src/cli/commands/edit/formatting.rs:706-855 | src/cli/commands/edit/formatting.rs:858-1019 | src/cli/commands/edit/tables/grid.rs:8-114 | src/cli/commands/edit/tables/grid.rs:116-222 | src/cli/commands/edit/tables/grid.rs:224-328 | src/cli/commands/edit/tables/grid.rs:330-471 | src/cli/commands/edit/tables/grid.rs:473-577 | src/cli/commands/edit/tables/grid.rs:579-693 | src/cli/commands/edit/tables/layout.rs:103-225 | src/cli/commands/edit/tables/layout.rs:349-473 \u2014 These 15 members are variants of one another: a block of 45 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 15 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 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ae46e5509b1367042d9a9d8c9db0224e4bffbfb91607067f8dc84a0d78a6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (12 members, 45 shared lines): src/cli/commands/edit/document_objects.rs:564-668 | src/cli/commands/edit/note_content.rs:126-223 | src/cli/commands/edit/page.rs:8-109 | src/cli/commands/edit/page.rs:111-215 | src/cli/commands/edit/shapes.rs:277-419 | src/cli/commands/edit/tables/layout.rs:8-101 | src/cli/commands/edit/tables/layout.rs:227-347 | src/cli/commands/edit/tables/layout.rs:475-586 | src/cli/commands/edit/tables/layout.rs:588-701 | src/cli/commands/edit/tables/structure.rs:121-214 | src/cli/commands/edit/tables/structure.rs:216-309 | src/cli/commands/edit/tables/structure.rs:311-427 \u2014 These 12 members are variants of one another: a block of 45 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f388c4cc192dea1f9f1208eecb93a7af0850e888285b1662f94f51286c8dab19"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (11 members, 51 shared lines): src/cli/commands/edit/cells.rs:831-968 | src/cli/commands/edit/tables/grid.rs:8-114 | src/cli/commands/edit/tables/grid.rs:116-222 | src/cli/commands/edit/tables/grid.rs:224-328 | src/cli/commands/edit/tables/grid.rs:330-471 | src/cli/commands/edit/tables/grid.rs:473-577 | src/cli/commands/edit/tables/grid.rs:579-693 | src/cli/commands/edit/tables/grid.rs:695-853 | src/cli/commands/edit/tables/layout.rs:103-225 | src/cli/commands/edit/tables/layout.rs:349-473 | src/cli/commands/edit/tables/structure.rs:9-119 \u2014 These 11 members are variants of one another: a block of 51 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1cc6394fb541c5b91d82277b3d42aad72c48408421df5a2bc56cea42e52a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (11 members, 46 shared lines): src/cli/commands/edit/header_footer_content.rs:8-125 | src/cli/commands/edit/header_footer_content.rs:128-246 | src/cli/commands/edit/header_footer_content.rs:249-404 | src/cli/commands/edit/header_footer_content.rs:407-575 | src/cli/commands/edit/header_footer_content.rs:578-730 | src/cli/commands/edit/header_footer_content.rs:733-870 | src/cli/commands/edit/header_footer_content.rs:873-1001 | src/cli/commands/edit/header_footer_content.rs:1004-1158 | src/cli/commands/edit/header_footer_properties.rs:139-274 | src/cli/commands/edit/header_footer_properties.rs:276-389 | src/cli/commands/edit/header_footer_properties.rs:391-541 \u2014 These 11 members are variants of one another: a block of 46 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04e4485c0cb24b8fecfe97b95d653743ea176ef6bb6bf44f76e7a46efd0358"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (10 members, 51 shared lines): src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/bookmarks.rs:244-372 | src/cli/commands/edit/controls.rs:9-103 | src/cli/commands/edit/document_objects.rs:271-404 | src/cli/commands/edit/equations.rs:254-348 | src/cli/commands/edit/media.rs:803-897 | src/cli/commands/edit/media.rs:900-1010 | src/cli/commands/edit/notes.rs:199-293 | src/cli/commands/edit/shapes.rs:181-275 | src/cli/commands/edit/shapes.rs:455-549 \u2014 These 10 members are variants of one another: a block of 51 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8857a50fb490d4328d2dd4407910a8ef9b8b26e270755d654834958b3bb1d1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (10 members, 44 shared lines): src/cli/commands/edit/document_objects.rs:145-269 | src/cli/commands/edit/document_text.rs:338-472 | src/cli/commands/edit/document_text.rs:474-606 | src/cli/commands/edit/document_text.rs:723-831 | src/cli/commands/edit/document_text.rs:1025-1118 | src/cli/commands/edit/equations.rs:119-252 | src/cli/commands/edit/formatting.rs:10-149 | src/cli/commands/edit/notes.rs:9-102 | src/cli/commands/edit/notes.rs:104-197 | src/cli/commands/edit/shapes.rs:8-179 \u2014 These 10 members are variants of one another: a block of 44 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c00d216f0c69b46147a32bbb1e7eeba94a434df77ac87ce5580cde85147ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (10 members, 36 shared lines): src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/controls.rs:9-103 | src/cli/commands/edit/document_objects.rs:271-404 | src/cli/commands/edit/equations.rs:254-348 | src/cli/commands/edit/media.rs:803-897 | src/cli/commands/edit/media.rs:900-1010 | src/cli/commands/edit/notes.rs:199-293 | src/cli/commands/edit/shapes.rs:181-275 | src/cli/commands/edit/shapes.rs:455-549 | src/cli/queries/structured_objects.rs:14-119 \u2014 These 10 members are variants of one another: a block of 36 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc6e9f2270f055b82c8f76f4394f3acb171803fdf2a2ff64fbe6bb707aebeb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (10 members, 34 shared lines): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:72-155 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:63-138 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:71-154 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:75-158 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:64-139 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:63-134 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:63-138 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:70-138 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:75-120 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:64-139 \u2014 These 10 members are variants of one another: a block of 34 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df3960e261c7b588b02a33127b6183debe708ba118f3987d23e81462a16941"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (10 members, 17 shared lines): src/bin/rhwp-q/kit/cursor_in_cell.rs:13-55 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:14-52 | src/bin/rhwp-q/kit/cursor_in_hf.rs:13-56 | src/bin/rhwp-q/kit/cursor_in_note.rs:13-53 | src/bin/rhwp-q/kit/flow_images.rs:13-40 | src/bin/rhwp-q/kit/footnote_hit.rs:13-45 | src/bin/rhwp-q/kit/footnote_info.rs:13-44 | src/bin/rhwp-q/kit/hit_header.rs:13-45 | src/bin/rhwp-q/kit/note_edit_info.rs:14-46 | src/bin/rhwp-q/kit/overlay_images.rs:13-44 \u2014 These 10 members are variants of one another: a block of 17 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f822558a19c74419c6ef5cc36e0416867878ea926458fac1b52485893c70cda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (9 members, 31 shared lines): src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/controls.rs:9-103 | src/cli/commands/edit/equations.rs:254-348 | src/cli/commands/edit/media.rs:803-897 | src/cli/commands/edit/note_content.rs:227-344 | src/cli/commands/edit/notes.rs:199-293 | src/cli/commands/edit/shapes.rs:181-275 | src/cli/commands/edit/shapes.rs:455-549 | src/cli/queries/structured_objects.rs:14-119 \u2014 These 9 members are variants of one another: a block of 31 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 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04ec0ccea52e1e49a8422af51d42ee86c333a29761628191e9c15733fa18783"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 51 shared lines): src/cli/commands/edit/document_objects.rs:145-269 | src/cli/commands/edit/header_footer_content.rs:249-404 | src/cli/commands/edit/header_footer_content.rs:407-575 | src/cli/commands/edit/header_footer_content.rs:578-730 | src/cli/commands/edit/header_footer_content.rs:733-870 | src/cli/commands/edit/header_footer_content.rs:873-1001 | src/cli/commands/edit/header_footer_content.rs:1004-1158 | src/cli/commands/edit/header_footer_properties.rs:391-541 \u2014 These 8 members are variants of one another: a block of 51 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 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ee08d31844bece8b68b4e73f22f0c7de4fc368bc9a64b20bc6de7ffd114f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 46 shared lines): src/cli/commands/edit/header_footer_content.rs:249-404 | src/cli/commands/edit/header_footer_content.rs:407-575 | src/cli/commands/edit/header_footer_content.rs:578-730 | src/cli/commands/edit/header_footer_content.rs:733-870 | src/cli/commands/edit/header_footer_content.rs:873-1001 | src/cli/commands/edit/header_footer_content.rs:1004-1158 | src/cli/commands/edit/header_footer_properties.rs:391-541 | src/cli/commands/edit/page.rs:217-340 \u2014 These 8 members are variants of one another: a block of 46 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 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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0342771036afed188275885355cfd0250625820e89f031859cbeed4a8678f8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 45 shared lines): src/cli/commands/edit/bookmarks.rs:244-372 | src/cli/commands/edit/cells.rs:831-968 | src/cli/commands/edit/document_objects.rs:11-143 | src/cli/commands/edit/document_objects.rs:271-404 | src/cli/commands/edit/document_objects.rs:406-562 | src/cli/commands/edit/media.rs:900-1010 | src/cli/commands/edit/note_content.rs:126-223 | src/cli/commands/edit/tables/layout.rs:475-586 \u2014 These 8 members are variants of one another: a block of 45 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 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4152c6e55b242aae973988eaadf616a0597be6733592410c2b8dc674f7a93e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 45 shared lines): src/cli/commands/edit/document_objects.rs:564-668 | src/cli/commands/edit/formatting.rs:10-149 | src/cli/commands/edit/formatting.rs:152-276 | src/cli/commands/edit/formatting.rs:858-1019 | src/cli/commands/edit/header_footer_properties.rs:7-137 | src/cli/commands/edit/note_content.rs:569-695 | src/cli/commands/edit/page.rs:8-109 | src/cli/commands/edit/page.rs:111-215 \u2014 These 8 members are variants of one another: a block of 45 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 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"df91639611b398f70fe1a842339c01c5d9d37acd429ce4b19b8e455a63590152"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 44 shared lines): src/cli/commands/edit/cells.rs:831-968 | src/cli/commands/edit/formatting.rs:706-855 | src/cli/commands/edit/formatting.rs:858-1019 | src/cli/commands/edit/tables/grid.rs:224-328 | src/cli/commands/edit/tables/grid.rs:330-471 | src/cli/commands/edit/tables/grid.rs:473-577 | src/cli/commands/edit/tables/grid.rs:579-693 | src/cli/commands/edit/tables/structure.rs:9-119 \u2014 These 8 members are variants of one another: a block of 44 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 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"66df27d56deefc62d548ffc870843287d099af2aed89892d5813c5cf141b24d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 27 shared lines): src/bin/rhwp-q/kit/caret_stops.rs:11-90 | src/bin/rhwp-q/kit/char_index.rs:12-113 | src/bin/rhwp-q/kit/chart_csv.rs:25-151 | src/bin/rhwp-q/kit/covering_pages.rs:8-90 | src/bin/rhwp-q/kit/page_border_fill.rs:11-80 | src/bin/rhwp-q/kit/page_text.rs:11-86 | src/bin/rhwp-q/kit/word_end.rs:12-105 | src/bin/rhwp-q/kit/word_starts.rs:11-90 \u2014 These 8 members are variants of one another: a block of 27 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 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":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"238b87b337abc8ac487967614259008d8c1f5892b85f60b66334b36aea5058fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 45 shared lines): src/cli/commands/edit/document_text.rs:11-227 | src/cli/commands/edit/document_text.rs:229-336 | src/cli/commands/edit/document_text.rs:338-472 | src/cli/commands/edit/document_text.rs:474-606 | src/cli/commands/edit/document_text.rs:608-721 | src/cli/commands/edit/equations.rs:119-252 | src/cli/commands/edit/header_footer_properties.rs:276-389 \u2014 These 7 members are variants of one another: a block of 45 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 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e183653ca7f51494376c3ecef58f4fce11574f761063c1420151129036d62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 45 shared lines): src/cli/commands/edit/page.rs:342-466 | src/cli/commands/edit/shapes.rs:8-179 | src/cli/commands/edit/tables/grid.rs:8-114 | src/cli/commands/edit/tables/grid.rs:116-222 | src/cli/commands/edit/tables/grid.rs:695-853 | src/cli/commands/edit/tables/layout.rs:103-225 | src/cli/commands/edit/tables/layout.rs:349-473 \u2014 These 7 members are variants of one another: a block of 45 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 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":"src/cli/commands/edit/page.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9033814dd4a14abafbe74adc25c230699ccc5e93b2b8168082a7100ffdfd43"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 22 shared lines): src/bin/rhwp-q/kit/caret_stops.rs:11-90 | src/bin/rhwp-q/kit/char_index.rs:12-113 | src/bin/rhwp-q/kit/cur_field_state.rs:11-102 | src/bin/rhwp-q/kit/line_starts.rs:11-92 | src/bin/rhwp-q/kit/para_bounds.rs:11-85 | src/bin/rhwp-q/kit/word_end.rs:12-105 | src/bin/rhwp-q/kit/word_starts.rs:11-90 \u2014 These 7 members are variants of one another: a block of 22 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 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":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daa4a6e9f5f43432cbb2e352209059e7c94f842f06995cf3483249e4b1ff6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 37 shared lines): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:156-229 | src/diagnostics/hwp5_cell_header_probe.rs:227-295 | src/diagnostics/hwp5_contract_probe.rs:180-247 | src/diagnostics/hwp5_first_para_control_probe.rs:187-279 | src/diagnostics/hwp5_mel_personnel_probe.rs:173-239 | src/diagnostics/hwp5_table_probe.rs:179-242 \u2014 These 6 members are variants of one another: a block of 37 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a8b3420b075f74f06f4c9d81e21d270396697fa1f2bf279b4b297761b45f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 28 shared lines): src/bin/rhwp-q/kit/form_at.rs:11-104 | src/bin/rhwp-q/kit/form_value.rs:12-114 | src/bin/rhwp-q/kit/hf_edit_target.rs:12-101 | src/bin/rhwp-q/kit/hit_fn_marker.rs:12-105 | src/bin/rhwp-q/kit/hit_in_footnote.rs:12-105 | src/bin/rhwp-q/kit/hit_in_hf.rs:12-129 \u2014 These 6 members are variants of one another: a block of 28 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ee8b1f0abd80ea7a6d5ad19d5fdbddb7e308c6bc74599494d3605671ca231c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 24 shared lines): src/diagnostics/hwp5_cell_header_probe.rs:170-216 | src/diagnostics/hwp5_contract_analyze.rs:95-142 | src/diagnostics/hwp5_contract_probe.rs:117-169 | src/diagnostics/hwp5_first_para_control_probe.rs:123-173 | src/diagnostics/hwp5_mel_personnel_probe.rs:116-162 | src/diagnostics/hwp5_table_probe.rs:122-168 \u2014 These 6 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9f86198c228325e476f69cfe01505c983f810c3c418cd52eeb4b06354e7c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 48 shared lines): src/cli/commands/edit/document_text.rs:229-336 | src/cli/commands/edit/document_text.rs:833-927 | src/cli/commands/edit/document_text.rs:929-1023 | src/cli/commands/edit/formatting.rs:152-276 | src/cli/commands/edit/page.rs:342-466 \u2014 These 5 members are variants of one another: a block of 48 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa1aeb2a7226c6b1c13bc998fdde1cc6b61bfba250c973d0fdf9a5664db4a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 44 shared lines): src/cli/commands/edit/bookmarks.rs:9-135 | src/cli/commands/edit/bookmarks.rs:137-242 | src/cli/commands/edit/bookmarks.rs:244-372 | src/cli/commands/edit/document_objects.rs:271-404 | src/cli/commands/edit/document_objects.rs:406-562 \u2014 These 5 members are variants of one another: a block of 44 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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b61263f04ef36d53c561a36b1632c0922aa6b3cc204fe7b3e62eafb1f7b7dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 42 shared lines): src/bin/rhwp-q/kit/cur_field_state.rs:11-102 | src/bin/rhwp-q/kit/field_info_at.rs:11-104 | src/bin/rhwp-q/kit/form_value.rs:12-114 | src/bin/rhwp-q/kit/line_starts.rs:11-92 | src/bin/rhwp-q/kit/para_bounds.rs:11-85 \u2014 These 5 members are variants of one another: a block of 42 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":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e90597dc18436832a36d1913899d66f720075115317afed891c069153a746"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 19 shared lines): src/bin/rhwp-q/kit/caret_stops.rs:11-90 | src/bin/rhwp-q/kit/covering_pages.rs:8-90 | src/bin/rhwp-q/kit/line_starts.rs:11-92 | src/bin/rhwp-q/kit/para_bounds.rs:11-85 | src/bin/rhwp-q/kit/word_starts.rs:11-90 \u2014 These 5 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8abb142f81baab3889fa2c42013bbc94d7b333048e18177abc09158f6d6c4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 53 shared lines): src/cli/commands/edit/document_text.rs:1025-1118 | src/cli/commands/edit/notes.rs:9-102 | src/cli/commands/edit/notes.rs:104-197 | src/cli/commands/edit/tables/insert.rs:9-243 \u2014 These 4 members are variants of one another: a block of 53 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"0257aff205651b7c414641719a0e83755761db00f74d9fc929aba8d3eeb547c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 50 shared lines): src/cli/commands/edit/formatting.rs:152-276 | src/cli/commands/edit/formatting.rs:858-1019 | src/cli/commands/edit/header_footer_properties.rs:391-541 | src/cli/commands/edit/note_content.rs:569-695 \u2014 These 4 members are variants of one another: a block of 50 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a2df3b7a40317506eb74e126afb21fbde9024d19311c24bdcb40d0c974ad84"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 44 shared lines): src/document_core/commands/text_editing.rs:1398-1546 | src/document_core/commands/text_editing.rs:1639-1761 | src/document_core/commands/text_editing.rs:1919-2000 | src/document_core/commands/text_editing.rs:4819-4961 \u2014 These 4 members are variants of one another: a block of 44 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55c48be38d536c53584bd189d733e5328d87bb4619c3ce3da5f644a60eef678"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 40 shared lines): src/bin/rhwp-q/kit/char_index.rs:12-113 | src/bin/rhwp-q/kit/cur_field_state.rs:11-102 | src/bin/rhwp-q/kit/field_info_at.rs:11-104 | src/bin/rhwp-q/kit/word_end.rs:12-105 \u2014 These 4 members are variants of one another: a block of 40 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":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6c01e12d878289ea98992c69c9303cd14b110a2420a78e7a86449f4e92ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 37 shared lines): src/bin/rhwp-q/kit/fn_selection_rects.rs:11-153 | src/bin/rhwp-q/kit/form_at.rs:11-104 | src/bin/rhwp-q/kit/hit_fn_marker.rs:12-105 | src/bin/rhwp-q/kit/hit_in_footnote.rs:12-105 \u2014 These 4 members are variants of one another: a block of 37 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":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75fb4f188dc8103eea5eea0c5138eea69167bf2f063f7e6d1f579650b6645d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 28 shared lines): src/bin/rhwp-q/kit/bin_data.rs:9-101 | src/bin/rhwp-q/kit/chart_csv.rs:25-151 | src/bin/rhwp-q/kit/page_border_fill.rs:11-80 | src/bin/rhwp-q/kit/page_text.rs:11-86 \u2014 These 4 members are variants of one another: a block of 28 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":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"218e18c0d51c2392901f65b07a11d7b59cf33eed0552b63132bf0baeb348ab78"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 23 shared lines): src/document_core/commands/text_editing.rs:1398-1546 | src/document_core/commands/text_editing.rs:1639-1761 | src/document_core/commands/text_editing.rs:1919-2000 | src/document_core/commands/text_editing.rs:4216-4466 \u2014 These 4 members are variants of one another: a block of 23 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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"58efeecd122c33a42009962985c2885d42f1c3d77700c640c3d66e55e075f3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 5 shared lines): src/document_core/commands/object_ops/common.rs:36-45 | src/emf/converter/device_stroke.rs:9-18 | src/parser/control/shape.rs:486-648 | src/parser/hwpx/section.rs:4131-4243 \u2014 These 4 members are variants of one another: a block of 5 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":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b3614e78688341721f9b3e2ac47f45ad3026a979f9f59a76b84df4f8b5dca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (281 shared lines): gym/tools/fuzz_corpus.py:914-1209 | gym/tools/robustness.py:756-1053 \u2014 These two members are variants of one another: 281 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb089300d97fc36584b95f45720ae6cf444afcfdd936e82a6615576e8e1de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (237 shared lines): src/document_core/commands/text_editing.rs:2210-2534 | src/document_core/commands/text_editing.rs:2594-2902 \u2014 These two members are variants of one another: 237 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbf15d4113e6e9ecca44da929c42c0ba7a94119b61aa798402976cd4c7ab1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (170 shared lines): src/renderer/layout/shape_layout.rs:4727-5006 | src/renderer/layout/table_cell_content.rs:77-642 \u2014 These two members are variants of one another: 170 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c5994fa26887ac5f09757b38428a1eb9c6904042786e27e5813ce6378a5978"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (141 shared lines): src/renderer/equation/canvas_render.rs:43-455 | src/renderer/equation/svg_render.rs:45-525 \u2014 These two members are variants of one another: 141 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb791386d2483542f5ab6f349d46f55366e2d010fe643eb2ff70e56533a605"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (128 shared lines): src/cli/outputs/kitty.rs:15-182 | src/cli/outputs/sixel.rs:15-174 \u2014 These two members are variants of one another: 128 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/kitty.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145e2c58b390ba8ebfb2ab672667335759887e454bf3d8096722192f72c5837"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (125 shared lines): src/parser/hwpx/section.rs:3114-3528 | src/parser/hwpx/section.rs:3853-4022 \u2014 These two members are variants of one another: 125 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad50add389ee88d64f741bd3d096e052ea76beea3e31a527d6e151ca5790a1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (110 shared lines): src/cli/outputs/tabular.rs:116-293 | src/cli/outputs/tabular.rs:326-536 \u2014 These two members are variants of one another: 110 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85df4187f559ad980bc5403ca7db062d555fcf55fab0e0ce5e1ed8691996f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (95 shared lines): src/parser/pdf/recognition.rs:849-1311 | tools/pdf-ir-poc/src/recognition.rs:572-881 \u2014 These two members are variants of one another: 95 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2960b7ed41efdb791bbd0596942da05a787c983d398a80650f40ff38c75abdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (93 shared lines): src/cli/commands/edit/media.rs:212-515 | src/cli/commands/edit/media.rs:519-800 \u2014 These two members are variants of one another: 93 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068697c6ee9f711186fff497c5ff40e9e824c97d29bfce4898e605a928a129a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (90 shared lines): src/bin/rhwp-q/more/probe.rs:77-185 | src/bin/rhwp-q/pack/probe.rs:77-175 \u2014 These two members are variants of one another: 90 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d561ef4abdd7b5edad13961d8f5971a4cbe4922e8fe87d6a48dd607da375667f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): src/document_core/commands/object_ops/chart.rs:875-1019 | src/document_core/commands/object_ops/chart.rs:1032-1172 \u2014 These two members are variants of one another: 89 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c93718edfe976f7da5983517fd5b51ddb6acd061c17964ec2a27df9aca6a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): src/bin/rhwp-agent/safety.rs:210-364 | src/bin/rhwp-agent/safety.rs:516-663 \u2014 These two members are variants of one another: 80 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cc63e646073a2a3c78bdec330501871dd2c2052d5ac09bd3513065f391e5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): src/parser/hwpx/header.rs:1661-1948 | src/parser/hwpx/section.rs:4394-4547 \u2014 These two members are variants of one another: 80 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75a5b3bcd88cabdb2cf7cff4e112aa0e1f10c3786c3fdfa174c6210cd80d9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (80 shared lines): src/cli/commands/conversion.rs:216-425 | src/cli/commands/conversion.rs:432-644 \u2014 These two members are variants of one another: 80 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b01e7d62eaac7b2b5540f3ad5582a4e53fdac5c90b51bef14a1aa23e591fb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): src/document_core/commands/text_editing.rs:6639-6743 | src/document_core/commands/text_editing.rs:6751-6862 \u2014 These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6639}}}],"partialFingerprints":{"codehealthFindingId/v1":"331e19e9de7fd964e1a1243c71cbe864238ec4404295c0c40c30eea4996b2bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (65 shared lines): src/parser/mod.rs:430-637 | src/parser/mod.rs:921-1116 \u2014 These two members are variants of one another: 65 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a08943cf8829347ffbc6988edc2cd09d6ede60451c174df8144c63fa149a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): src/cli/commands/generation.rs:18-197 | src/cli/commands/generation.rs:205-341 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/generation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52098379f3ff450baa6d8caa081cdec4b9426d96ca8b58d20fc40d8be0a78bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (60 shared lines): src/parser/pdf/structured_lowering.rs:1399-1485 | tools/pdf-ir-poc/src/structured_lowering.rs:332-407 \u2014 These two members are variants of one another: 60 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5cd62db25bf2388cf8d33c0756b6bed8e504af36bb2ea00f8b0216c138167c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): src/cli/commands/edit/formatting.rs:279-558 | src/cli/commands/edit/tables/grid.rs:330-471 \u2014 These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9be044cbac78f51f7e9f6f6c9db85b582c14a0f1aa621ad50ed6d02493838d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (56 shared lines): src/parser/pdf/table_hierarchy.rs:58-175 | tools/pdf-ir-poc/src/table_hierarchy.rs:54-153 \u2014 These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7523ada167d74ff6a8bdfef712db1aa1f0cd58841c067cd3afc6d8af30960b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (56 shared lines): src/diagnostics/hwp5_roundtrip_batch.rs:287-421 | src/diagnostics/hwpx_roundtrip_batch.rs:164-289 \u2014 These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"41deb8000e2e50eedad60ded12a57727372664dfc05a79fb668d823ad8a3f01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): src/cli/commands/edit/cells.rs:204-484 | src/cli/commands/edit/cells.rs:486-653 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9f793a56044de33824d4c2044d1e82c5da0ebda9d78e000052a8ec546e6a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (53 shared lines): src/parser/pdf/table_topology.rs:27-150 | tools/pdf-ir-poc/src/table_topology.rs:16-114 \u2014 These two members are variants of one another: 53 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0760dc122a3f60b3f768165bc51f0241d097afb93a76bf09c52d0262f2792b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): src/cli/commands/edit/privacy.rs:177-376 | src/cli/commands/edit/text.rs:60-265 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ae928c6a598af281b13a55fd907283c168100c097086d0f2280e9df07dae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): src/diagnostics/hwp5_roundtrip_batch.rs:602-705 | src/diagnostics/hwpx_roundtrip_batch.rs:438-542 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5be5467efe736db05dabf4238330934563ee64ef006fc32cf87788d6d070608"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): src/document_core/commands/object_ops/common.rs:573-632 | src/document_core/commands/object_ops/equation.rs:523-647 \u2014 These two members are variants of one another: 45 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77f845c855a08392721243d9ba422f2987e93b5d76284101dfc7661c17415a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): src/renderer/layout/shape_layout.rs:5033-5155 | src/renderer/layout/shape_layout.rs:5250-5338 \u2014 These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5033}}}],"partialFingerprints":{"codehealthFindingId/v1":"482ebd5d568d8493cd8456e3c5e3054b2f0527e274dfa4b1c36cf179b7fdc539"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): src/document_core/queries/cursor_nav.rs:810-898 | src/document_core/queries/cursor_nav.rs:931-1040 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"97789210ea5f79fcbf839ce6f7c13762d762fa7205296e9be1d672451ac2f60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): src/cli/commands/edit/fields.rs:202-365 | src/mcp_serve.rs:2216-2333 \u2014 These two members are variants of one another: 40 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/fields.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4b1cf20b65f18783a62afe047ef39a133bb4a48bf7a0df08e034c040a8df6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): src/renderer/layout/table_layout.rs:21044-21099 | src/renderer/layout/table_layout.rs:21933-21991 \u2014 These two members are variants of one another: 39 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21044}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b122ff1dd82a844a799cbd2b7a58254e00edc47e1d8d45e31e82d74608c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): src/renderer/layout/border_rendering.rs:1174-1291 | src/renderer/layout/border_rendering.rs:1631-1721 \u2014 These two members are variants of one another: 39 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cd7f8a64ec5f5f66e6cf6df63acd5dcf6a3c0e17c3d321e6d90485fe6a640a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): src/cli/protocol/exchange/disclosure.rs:4-106 | src/cli/protocol/trust/anchor.rs:156-261 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"92762589df061c8ed9b2d92a508f4fa7ecc1eac64d0394c011d93eb623f1d406"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): src/cli/commands/edit/equations.rs:7-116 | src/cli/commands/edit/media.rs:900-1010 \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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9c91a38eb264e841aeaf04dcdafefc159331c419c2f86a10bf848cfdcadb5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): src/native_host/gpu_d3d.rs:612-692 | src/native_host/gpu_metal.rs:404-462 \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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbee2ec77a6af572e5759104861bfdb7d7d5373912a56b81adc0f682b1f81d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): src/parser/hwpx/section.rs:5805-5871 | src/parser/hwpx/section.rs:5877-5937 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5805}}}],"partialFingerprints":{"codehealthFindingId/v1":"883973fdf5836b4ccb6b502e89e05cd4ebabee8aa1dcb76d4aeb883cd2066e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/renderer/web_canvas.rs:2338-2377 | src/renderer/web_canvas.rs:2385-2508 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64b24ad3b79d4efdc8ffc4def4636cdcd364de787e49c2eca2562b781cc69be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/document_core/commands/object_ops/picture.rs:113-157 | src/document_core/commands/object_ops/picture.rs:514-692 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae2e0a32206ee3e9161e189e5766729898c045a55708c890f7e92de981c215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/parser/cfb_reader.rs:1012-1029 | src/parser/cfb_reader.rs:1036-1053 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c90ffaf864ce18eb94545c9428e1479dbc3d9404949c4e1a33f23b668530dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/paint/dot_leader.rs:73-168 | src/renderer/arrow.rs:89-112 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/dot_leader.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3fc5579546dfc3b6fd9d269030bdb3ec5b3ecb53042acc73da46b41d0fd8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/parser/control.rs:577-600 | src/parser/control.rs:603-625 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1349bcf7f0657094d2429ab9e99a644d54e92cd94508677b352eda81f36eb0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/renderer/equation/font_frame_metrics.rs:184-196 | src/renderer/equation/font_frame_metrics.rs:217-229 \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":"src/renderer/equation/font_frame_metrics.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"635313f9bf0e6680bd5b4c69d6d7103e82c5daaf149738c6ee7734a056fb7ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/parser/hwpx/section.rs:6751-6780 | src/parser/hwpx/section.rs:6855-6891 \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":"src/parser/hwpx/section.rs"},"region":{"startLine":6751}}}],"partialFingerprints":{"codehealthFindingId/v1":"985248a7970dbc1e42f4acb9cf20618c79fcb847a94f64afa1ccef5e568daa55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/document_core/converters/hwpx_to_hwp.rs:2181-2206 | src/document_core/converters/hwpx_to_hwp.rs:2569-2599 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f98db50562f466e6d4566474d258c3411af56e0453566ba37b7e2e7b8d7d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/renderer/skia/equation_conv.rs:746-770 | src/renderer/skia/equation_glyph.rs:13-54 \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":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44d03533f55603783ee358d73be39a018a4fdd4dfd06c0c1001fed6c8007600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/bin/rhwp-q/more/main.rs:22-39 | src/bin/rhwp-q/pack/main.rs:22-39 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4a7f93a4aba47c7262e737f247f1fc236153ee13160d8df64c3addbc5c0950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/renderer/skia/hft_outline.rs:49-93 | src/renderer/skia/renderer.rs:2636-2678 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/hft_outline.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79e99491b816ce8a6f6852cb10fb8359bfc6ac37db4911b1183db1bf5b920d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (92 members, 50\u002B identical tokens): src/bin/rhwp-q/more/inventory.rs:137-162 | src/bin/rhwp-q/more/inventory.rs:164-189 | src/bin/rhwp-q/more/inventory.rs:191-216 | src/bin/rhwp-q/more/inventory.rs:218-243 | src/bin/rhwp-q/more/inventory.rs:245-270 | src/bin/rhwp-q/more/inventory.rs:272-297 | src/bin/rhwp-q/more/inventory.rs:299-324 | src/bin/rhwp-q/more/inventory.rs:326-351 | src/bin/rhwp-q/more/inventory.rs:353-378 | src/bin/rhwp-q/more/inventory.rs:380-405 | src/bin/rhwp-q/more/inventory.rs:407-432 | src/bin/rhwp-q/more/inventory.rs:434-459 | src/bin/rhwp-q/more/inventory.rs:461-486 | src/bin/rhwp-q/more/inventory.rs:488-513 | src/bin/rhwp-q/more/inventory.rs:515-540 | src/bin/rhwp-q/more/inventory.rs:542-567 | src/bin/rhwp-q/more/inventory.rs:569-594 | src/bin/rhwp-q/more/inventory.rs:596-621 | src/bin/rhwp-q/more/inventory.rs:623-648 | src/bin/rhwp-q/more/inventory.rs:650-675 | src/bin/rhwp-q/more/inventory.rs:677-700 | src/bin/rhwp-q/more/inventory.rs:702-727 | src/bin/rhwp-q/more/inventory.rs:729-752 | src/bin/rhwp-q/more/inventory.rs:754-777 | src/bin/rhwp-q/more/inventory.rs:779-802 | src/bin/rhwp-q/more/inventory.rs:804-827 | src/bin/rhwp-q/more/inventory.rs:829-852 | src/bin/rhwp-q/more/inventory.rs:854-877 | src/bin/rhwp-q/more/inventory.rs:879-902 | src/bin/rhwp-q/more/inventory.rs:904-929 | src/bin/rhwp-q/more/inventory.rs:931-956 | src/bin/rhwp-q/more/inventory.rs:958-983 | src/bin/rhwp-q/more/inventory.rs:985-1010 | src/bin/rhwp-q/more/inventory.rs:1012-1037 | src/bin/rhwp-q/more/inventory.rs:1039-1064 | src/bin/rhwp-q/more/inventory.rs:1101-1126 | src/bin/rhwp-q/more/inventory.rs:1128-1153 | src/bin/rhwp-q/more/inventory.rs:1155-1180 | src/bin/rhwp-q/more/inventory.rs:1182-1207 | src/bin/rhwp-q/more/inventory.rs:1209-1234 | src/bin/rhwp-q/more/inventory.rs:1236-1261 | src/bin/rhwp-q/more/inventory.rs:1263-1288 | src/bin/rhwp-q/more/inventory.rs:1290-1315 | src/bin/rhwp-q/pack/inventory.rs:82-107 | src/bin/rhwp-q/pack/inventory.rs:109-132 | src/bin/rhwp-q/pack/inventory.rs:134-157 | src/bin/rhwp-q/pack/inventory.rs:159-182 | src/bin/rhwp-q/pack/inventory.rs:184-207 | src/bin/rhwp-q/pack/inventory.rs:209-232 | src/bin/rhwp-q/pack/inventory.rs:234-257 | src/bin/rhwp-q/pack/inventory.rs:259-282 | src/bin/rhwp-q/pack/inventory.rs:284-307 | src/bin/rhwp-q/pack/inventory.rs:309-332 | src/bin/rhwp-q/pack/inventory.rs:334-357 | src/bin/rhwp-q/pack/inventory.rs:359-382 | src/bin/rhwp-q/pack/inventory.rs:384-413 | src/bin/rhwp-q/pack/inventory.rs:415-438 | src/bin/rhwp-q/pack/inventory.rs:440-463 | src/bin/rhwp-q/pack/inventory.rs:465-477 | src/bin/rhwp-q/pack/inventory.rs:479-491 | src/bin/rhwp-q/pack/inventory.rs:493-518 | src/bin/rhwp-q/pack/inventory.rs:520-545 | src/bin/rhwp-q/pack/inventory.rs:547-572 | src/bin/rhwp-q/pack/inventory.rs:574-597 | src/bin/rhwp-q/pack/inventory.rs:599-624 | src/bin/rhwp-q/pack/inventory.rs:626-651 | src/bin/rhwp-q/pack/inventory.rs:653-676 | src/bin/rhwp-q/pack/inventory.rs:678-701 | src/bin/rhwp-q/pack/inventory.rs:703-726 | src/bin/rhwp-q/pack/inventory.rs:728-753 | src/bin/rhwp-q/pack/inventory.rs:755-780 | src/bin/rhwp-q/pack/inventory.rs:782-805 | src/bin/rhwp-q/pack/inventory.rs:807-830 | src/bin/rhwp-q/pack/inventory.rs:832-855 | src/bin/rhwp-q/pack/inventory.rs:857-880 | src/bin/rhwp-q/pack/inventory.rs:882-905 | src/bin/rhwp-q/pack/inventory.rs:907-932 | src/bin/rhwp-q/pack/inventory.rs:934-959 | src/bin/rhwp-q/pack/inventory.rs:961-986 | src/bin/rhwp-q/pack/inventory.rs:988-1013 | src/bin/rhwp-q/pack/inventory.rs:1015-1038 | src/bin/rhwp-q/pack/inventory.rs:1040-1063 | src/bin/rhwp-q/pack/inventory.rs:1065-1090 | src/bin/rhwp-q/pack/inventory.rs:1092-1115 | src/bin/rhwp-q/pack/inventory.rs:1117-1142 | src/bin/rhwp-q/pack/inventory.rs:1166-1189 | src/bin/rhwp-q/pack/inventory.rs:1191-1214 | src/bin/rhwp-q/pack/inventory.rs:1216-1241 | src/bin/rhwp-q/pack/inventory.rs:1243-1266 | src/bin/rhwp-q/pack/inventory.rs:1268-1293 | src/bin/rhwp-q/pack/inventory.rs:1295-1320 | src/bin/rhwp-q/pack/inventory.rs:1322-1345 \u2014 These 92 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 92 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 92 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f718e5bbd6427abaf67324c4b3c4ff347295a1ae0d8aa66ddfe92a63cf4460d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (17 members, 50\u002B identical tokens): src/bin/rhwp-agent/envelope.rs:44-57 | src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:312-324 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:254-266 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:27-39 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:285-297 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:33-45 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:307-319 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:202-214 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:27-39 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:250-262 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:238-250 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:29-41 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:293-305 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:28-40 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:27-39 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:204-216 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:243-255 \u2014 These 17 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 17 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 17 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec80b069e1e8040fd4927bf50efafaf54e73f5b4089083c4418caccbe618f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): src/bin/rhwp-agent/envlint.rs:8-62 | src/bin/rhwp-agent/envlint.rs:64-102 | src/bin/rhwp-agent/explorecmd.rs:14-118 | src/bin/rhwp-agent/files.rs:8-29 | src/bin/rhwp-agent/files.rs:53-85 | src/bin/rhwp-agent/inspect.rs:83-104 | src/bin/rhwp-agent/planlint.rs:8-80 | src/bin/rhwp-agent/safety.rs:11-48 | src/bin/rhwp-agent/safety.rs:50-113 | src/bin/rhwp-agent/safety.rs:665-738 | src/bin/rhwp-agent/stats.rs:155-186 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envlint.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"be86e4d0cd0ae3ac28543595e476403edb81766456150c3462134a1ee1b0e670"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:230-242 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:163-175 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:205-217 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:208-220 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:165-177 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:182-194 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:180-192 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:135-147 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:213-225 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:156-168 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:164-176 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"647e9f6c2a5e9458fec1dc77bd8fd5f1594bb7eb518f38b22b038df66a7997bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs:4-61 | mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:82-165 | mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs:111-169 | mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:6-63 | src/diagnostics/hwp5_borderfill_diagonal_probe.rs:476-507 | src/diagnostics/hwp5_cell_header_probe.rs:748-779 | src/diagnostics/hwp5_contract_probe.rs:666-697 | src/diagnostics/hwp5_first_para_control_probe.rs:1348-1379 | src/diagnostics/hwp5_mel_personnel_probe.rs:662-693 | src/diagnostics/hwp5_table_probe.rs:513-544 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fb6fbf8b890a3c1730adff192eaac6b67b9503418b8b633dd09e65975d35d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:36-50 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:33-47 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:36-50 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:36-50 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:34-48 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:33-47 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:33-47 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:35-49 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:36-50 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:34-48 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd35ce895b30cc5e39af8b2edea3ebe85323b687055516a2e673372bd481737"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:207-228 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:140-161 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:181-203 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:185-206 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:141-163 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:147-180 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:140-178 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:190-211 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:122-154 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:141-162 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f43a400c7394354206a30c6acdaef53b882ee95e09ff97be0ba727f6f2918"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/wmf/parser/records/drawing/line_to.rs:36-56 | src/wmf/parser/records/drawing/text_out.rs:55-107 | src/wmf/parser/records/state/move_to.rs:35-55 | src/wmf/parser/records/state/offset_clip_rgn.rs:35-55 | src/wmf/parser/records/state/offset_viewport_org.rs:35-55 | src/wmf/parser/records/state/offset_window_org.rs:35-55 | src/wmf/parser/records/state/set_viewport_ext.rs:35-55 | src/wmf/parser/records/state/set_viewport_org.rs:35-55 | src/wmf/parser/records/state/set_window_ext.rs:35-55 | src/wmf/parser/records/state/set_window_org.rs:35-55 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/line_to.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66e995d6c4b3a7b3600e4b7e8959e3380027cb443ba9f143bb01e69d7e09659"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): src/bin/rhwp-q/kit/field_by_id.rs:92-100 | src/bin/rhwp-q/kit/field_info_at.rs:106-114 | src/bin/rhwp-q/kit/form_at.rs:106-114 | src/bin/rhwp-q/kit/form_value.rs:116-124 | src/bin/rhwp-q/kit/hf_edit_target.rs:103-111 | src/bin/rhwp-q/kit/hit_fn_marker.rs:107-115 | src/bin/rhwp-q/kit/hit_in_footnote.rs:107-115 | src/bin/rhwp-q/kit/hit_in_hf.rs:131-139 | src/bin/rhwp-q/kit/para_bounds.rs:87-95 \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":"src/bin/rhwp-q/kit/field_by_id.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca2221b396c1de0534fc9cbc5d6b0417f56312864d91ee5b1bbb863664d4a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): src/diagnostics/hwp5_anchor_trace.rs:145-237 | src/diagnostics/hwp5_borderfill_diagonal_probe.rs:430-438 | src/diagnostics/hwp5_cell_header_probe.rs:689-697 | src/diagnostics/hwp5_char_shape_audit.rs:355-377 | src/diagnostics/hwp5_char_shape_audit.rs:381-423 | src/diagnostics/hwp5_contract_probe.rs:597-605 | src/diagnostics/hwp5_first_para_control_probe.rs:1294-1302 | src/diagnostics/hwp5_mel_personnel_probe.rs:603-611 | src/diagnostics/hwp5_table_probe.rs:348-356 \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":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e10113ba33a43cda39af38b113628d8c411c2ea68d34d5ce8fee7e7c4368b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:83-110 | src/diagnostics/hwp5_cell_header_probe.rs:141-168 | src/diagnostics/hwp5_char_shape_audit.rs:132-178 | src/diagnostics/hwp5_contract_analyze.rs:66-93 | src/diagnostics/hwp5_contract_probe.rs:88-115 | src/diagnostics/hwp5_ctrl_data_trace.rs:22-49 | src/diagnostics/hwp5_first_para_control_probe.rs:94-121 | src/diagnostics/hwp5_mel_personnel_probe.rs:87-114 | src/diagnostics/hwp5_table_probe.rs:93-120 \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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c646675ded502345b0174e17979a5d8ce84747298e7efd16014f05e20241894f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/bin/rhwp-q/kit/auto_numbers.rs:10-46 | src/bin/rhwp-q/kit/equations.rs:10-43 | src/bin/rhwp-q/kit/hidden_comments.rs:10-37 | src/bin/rhwp-q/kit/hyperlinks.rs:10-36 | src/bin/rhwp-q/kit/index_marks.rs:10-36 | src/bin/rhwp-q/kit/page_hide.rs:10-34 | src/bin/rhwp-q/kit/pictures.rs:10-45 | src/bin/rhwp-q/kit/ruby.rs:10-41 \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":"src/bin/rhwp-q/kit/auto_numbers.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f023d2c8715c7d2db2e0150e275ece17be4d3efff7d901074fc430f1e4d673cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/cli/commands/edit/cells.rs:204-484 | src/cli/commands/edit/document_text.rs:11-227 | src/cli/commands/edit/media.rs:212-515 | src/cli/commands/edit/privacy.rs:579-802 | src/cli/commands/edit/runtime.rs:218-287 | src/cli/commands/edit/text.rs:60-265 | src/cli/commands/tabular_import.rs:184-466 | src/cli/commands/tabular_import.rs:479-753 \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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cb2efe56d4e779f54d6a8b48a4779668b3f1d06ac500ff16530f0b01403a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/wmf/converter/svg/mod.rs:734-793 | src/wmf/converter/svg/mod.rs:800-847 | src/wmf/converter/svg/mod.rs:1214-1247 | src/wmf/converter/svg/mod.rs:1254-1324 | src/wmf/converter/svg/mod.rs:1377-1421 | src/wmf/converter/svg/mod.rs:1432-1520 | src/wmf/converter/svg/mod.rs:1531-1573 | src/wmf/converter/svg/mod.rs:1584-1633 \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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ccdfc2154b0b20a8d00678c8a02ceb8bd177caead1ed16f9e8a0a29c83bdc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/diagnostics/layout_anomaly.rs:602-612 | src/document_core/queries/rendering.rs:2730-2970 | src/native_host/view.rs:288-336 | src/paint/paint_bounds.rs:330-339 | src/parser/pdf/table_detection.rs:26-48 | src/parser/pdf/table_detection/cell_regions.rs:144-165 | src/renderer/hyperlinks.rs:27-55 \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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40e80a2b49d5bfcc006b05e55d36ad431c4680e30a0681645cee1d5d9e844d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/document_core/commands/clipboard.rs:901-1043 | src/document_core/commands/clipboard.rs:1314-1508 | src/document_core/commands/foreign_paste.rs:41-261 | src/document_core/commands/formatting.rs:1167-1233 | src/document_core/commands/formatting.rs:1247-1309 | src/document_core/commands/formatting.rs:1802-1874 | src/document_core/commands/html_import.rs:188-449 \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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b269a2b43f0e7044035a0d311845274ef9fc147e933c1f2f25c79497d3ad832"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:220-249 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:222-252 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:167-196 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:244-277 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:196-226 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:143-172 \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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed9ba4a79208ad4016e89b853753bf7b04ead34e51f217fe622c54f3e6ae368"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/cli/batch/query.rs:15-50 | src/cli/batch/query.rs:64-97 | src/cli/batch/query.rs:104-115 | src/cli/batch/query.rs:119-131 | src/cli/batch/query.rs:134-145 | src/cli/batch/query.rs:151-167 \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":"src/cli/batch/query.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3375ef888904cd03ac6e1625253a616007b6bf1905d0b032f1157d78b934814f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/cli/queries/document_inventory.rs:16-78 | src/cli/queries/document_inventory.rs:81-150 | src/cli/queries/document_inventory.rs:153-222 | src/cli/queries/explain.rs:147-241 | src/cli/queries/explore.rs:19-159 | src/cli/queries/structured_objects.rs:259-331 \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":"src/cli/queries/document_inventory.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfa90031aba588c95dc687c4b5642061accb73ad138dba625ad28d323c87f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:263-285 | src/diagnostics/hwp5_cell_header_probe.rs:352-408 | src/diagnostics/hwp5_contract_probe.rs:294-371 | src/diagnostics/hwp5_first_para_control_probe.rs:377-400 | src/diagnostics/hwp5_mel_personnel_probe.rs:295-357 | src/diagnostics/hwp5_table_probe.rs:289-346 \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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d00e0c6ee8e68f26e2bfe41ce3f02e04fa87455b6ca5e03234fbeaba1ddcfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:440-451 | src/diagnostics/hwp5_cell_header_probe.rs:704-715 | src/diagnostics/hwp5_contract_probe.rs:612-623 | src/diagnostics/hwp5_first_para_control_probe.rs:1304-1315 | src/diagnostics/hwp5_mel_personnel_probe.rs:618-629 | src/diagnostics/hwp5_table_probe.rs:363-374 \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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6176f17675ca97b1b6bb00eaee139a6113bf3570f185f586804e9fddda4e615"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:463-474 | src/diagnostics/hwp5_cell_header_probe.rs:735-746 | src/diagnostics/hwp5_contract_probe.rs:653-664 | src/diagnostics/hwp5_first_para_control_probe.rs:1335-1346 | src/diagnostics/hwp5_mel_personnel_probe.rs:649-660 | src/diagnostics/hwp5_table_probe.rs:394-405 \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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1871a1c5e56eaff8a2b60383a046fb8301faedeab225488c721ff2a90a991f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:531-640 | src/diagnostics/hwp5_cell_header_probe.rs:878-952 | src/diagnostics/hwp5_contract_probe.rs:796-871 | src/diagnostics/hwp5_first_para_control_probe.rs:821-951 | src/diagnostics/hwp5_mel_personnel_probe.rs:792-858 | src/diagnostics/hwp5_table_probe.rs:647-709 \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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a5748f9c3440f98c7da5e5c7d53c9e9f34981c60fda74e54375ddb038a20e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/document_core/commands/document/grown_table_heights.rs:58-106 | src/document_core/commands/header_footer_ops.rs:942-979 | src/document_core/queries/hwpctrl_sets.rs:1569-1618 | src/document_core/queries/rendering.rs:4960-4984 | src/document_core/queries/rendering.rs:6366-6770 | src/renderer/render_normalization.rs:124-224 \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":"src/document_core/commands/document/grown_table_heights.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4814af8e7d575f1cd6d21046037010203ef42ff1504c32a055e4d594fe3c0445"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/renderer/layout/paragraph_layout.rs:8906-10661 | src/renderer/layout/table_layout.rs:7358-10488 | src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:76-710 | src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:80-544 | src/renderer/typeset/notes/endnotes/paragraph/rewind_tail.rs:66-348 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:110-1090 \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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":8906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bc73a03d62be24f82f4c17620c1d65160f704d118d5abc2cb406958e294c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): bindings/Native/src/lib.rs:496-510 | src/document_core/queries/bookmark_query.rs:458-476 | src/document_core/queries/field_query.rs:2751-2769 | src/render_backend/fixture.rs:88-103 | src/renderer/render_tree.rs:445-461 \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":"bindings/Native/src/lib.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b27f7ef678bdd7e3e16525a1671a08955ccfb11d6823c9a49eecc9875692b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:86-113 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:152-186 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:86-119 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:115-142 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:86-113 \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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db9fefc6843e448aa680a446f8e972a690680f368b24d0ddbed2b0b608ef61"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:115-131 | src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:16-31 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:16-31 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:196-248 | src/cli/outputs/preview.rs:11-165 \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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ced250a71f50a936207cc08e872533e2944dd4df6f2618002a2649db759dada"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/bin/rhwp-q/more/inventory.rs:52-68 | src/bin/rhwp-q/more/inventory.rs:70-88 | src/bin/rhwp-q/more/inventory.rs:106-119 | src/bin/rhwp-q/more/inventory.rs:121-135 | src/bin/rhwp-q/more/inventory.rs:1066-1080 \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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b584ee0632fa2d8a3a5ccdd8e6310985ef186059abff96f9b282875ffcdbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cli/commands/edit/media.rs:95-199 | src/cli/commands/edit/privacy.rs:50-175 | src/cli/commands/edit/text.rs:267-376 | src/cli/commands/tabular_import.rs:34-109 | src/cli/queries/info.rs:59-88 \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":"src/cli/commands/edit/media.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3e5f8818b9d849a8ec6772b46b818f6646b2939c82739f381346cec08fcad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cli/protocol/plan/mod.rs:10-129 | src/main.rs:1063-1135 | src/main.rs:1143-1214 | src/main.rs:1217-1289 | src/main.rs:1299-1372 \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":"src/cli/protocol/plan/mod.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b1236b909a252d6b1824508c7ef096acf38983de87d585b8c53cf9433c5bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/diagnostics/hwp5_cell_header_probe.rs:721-733 | src/diagnostics/hwp5_contract_probe.rs:639-651 | src/diagnostics/hwp5_first_para_control_probe.rs:1321-1333 | src/diagnostics/hwp5_mel_personnel_probe.rs:635-647 | src/diagnostics/hwp5_table_probe.rs:380-392 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4ac92d6418df1dc90020ae0b16bad6d015ba78fa6cb9847a32ff50d70fc4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/diagnostics/hwp5_cell_header_probe.rs:789-802 | src/diagnostics/hwp5_contract_probe.rs:707-720 | src/diagnostics/hwp5_first_para_control_probe.rs:1389-1402 | src/diagnostics/hwp5_mel_personnel_probe.rs:703-716 | src/diagnostics/hwp5_table_probe.rs:554-567 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb20cc7ee4b4c4e47c2d0ecbc89817c84fe65ad5e0227274b185b1d17aee3fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/diagnostics/hwp5_cell_header_probe.rs:809-854 | src/diagnostics/hwp5_contract_probe.rs:727-772 | src/diagnostics/hwp5_inventory_diff.rs:536-586 | src/diagnostics/hwp5_mel_personnel_probe.rs:723-768 | src/diagnostics/hwp5_table_probe.rs:578-623 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f8c11b4f0c72ab79870813e12080fca4c1e1b520ccb646ccb7736c5bd460a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/diagnostics/hwp5_inventory_diff.rs:755-850 | src/diagnostics/hwp5_inventory_diff.rs:852-904 | src/diagnostics/hwp5_inventory_diff.rs:910-969 | src/diagnostics/hwp5_inventory_diff.rs:971-1031 | src/diagnostics/hwp5_inventory_diff.rs:1033-1159 \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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1713ce14538ec446e2dad5604182773bf06c58c7ee73e26e0c5b9f03efa92329"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/document_core/commands/object_ops/table.rs:1114-1242 | src/document_core/commands/text_editing.rs:1398-1546 | src/document_core/commands/text_editing.rs:1551-1564 | src/document_core/commands/text_editing.rs:1639-1761 | src/document_core/commands/text_editing.rs:1919-2000 \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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3691775013cd1d816ee8ebf0299bf66672e541d0c567b326753852a4b82d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/document_core/commands/text_editing.rs:1398-1546 | src/document_core/commands/text_editing.rs:1639-1761 | src/document_core/commands/text_editing.rs:1794-1836 | src/document_core/commands/text_editing.rs:1891-1908 | src/document_core/commands/text_editing.rs:4216-4466 \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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"b599613f370ebd17fce435adaa91103b9093f2ff33348e48879d50a6b0648fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/document_core/queries/cursor_rect.rs:1605-2873 | src/document_core/queries/cursor_rect.rs:5264-5540 | src/document_core/queries/cursor_rect.rs:5814-6033 | src/document_core/queries/cursor_rect.rs:6181-6273 | src/document_core/queries/cursor_rect.rs:6464-6601 \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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"548cd8eaf60decda330ed52ed9ad1027f4fab0f462a6e8adaa90842613ded1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/document_core/queries/hwpctrl_sets.rs:586-624 | src/document_core/queries/hwpctrl_sets.rs:637-661 | src/document_core/queries/hwpctrl_sets.rs:983-1007 | src/document_core/queries/hwpctrl_sets.rs:2085-2124 | src/document_core/queries/hwpctrl_sets.rs:2419-2449 \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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d095b865bc00fdf54b86fcc4997dfc4239e3c6dc5ba83fd7703e038c4ef4535"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/document_core/queries/rendering_metafile_resources.rs:166-246 | src/renderer/layout.rs:1121-1130 | src/renderer/layout.rs:6738-7175 | src/renderer/layout.rs:7883-11386 | src/renderer/typeset.rs:1311-1320 \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":"src/document_core/queries/rendering_metafile_resources.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"52592bfca810e5d2e4a3d0332c1b6e13fb8e06ff970b6c93197c557b0f65c143"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/parser/hwpx/section.rs:2407-2673 | src/parser/hwpx/section.rs:3114-3528 | src/parser/hwpx/section.rs:3783-3844 | src/parser/hwpx/section.rs:7498-7605 | src/parser/hwpx/section.rs:7611-7740 \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":"src/parser/hwpx/section.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67edd509a4de99fb2e650e2c448aaac268ef9dc4dc9baf76e256660de7522b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/renderer/float_placement.rs:2961-3133 | src/renderer/float_placement.rs:3802-3841 | src/renderer/float_placement/stored_cut_outer_frame.rs:14-50 | src/renderer/float_placement/stored_header_frame.rs:13-72 | src/renderer/float_placement/stored_header_frame.rs:77-99 \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":"src/renderer/float_placement.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bca1bf62f851382dc5ef43309bb9f7cfc200ec15a90669800b1cb1f7c990939"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/serializer/hwpx/master_page.rs:79-130 | src/serializer/hwpx/section.rs:713-921 | src/serializer/hwpx/section.rs:4013-4065 | src/serializer/hwpx/section.rs:4939-4975 | src/serializer/hwpx/section.rs:4994-5022 \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":"src/serializer/hwpx/master_page.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf40ad492e6e16d681a0fe1752188ba435293658bc5849700b2d59b7643068a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/wmf/converter/svg/mod.rs:183-250 | src/wmf/converter/svg/mod.rs:261-328 | src/wmf/converter/svg/mod.rs:339-445 | src/wmf/converter/svg/mod.rs:470-537 | src/wmf/converter/svg/mod.rs:548-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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2196083a8ae18473c01d9c94565341327fbcdabd0b1c56463a05da1d63de9299"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/wmf/parser/records/state/set_bk_mode.rs:38-64 | src/wmf/parser/records/state/set_polyfill_mode.rs:37-62 | src/wmf/parser/records/state/set_rop2.rs:39-65 | src/wmf/parser/records/state/set_stretch_blt_mode.rs:37-63 | src/wmf/parser/records/state/set_text_align.rs:38-65 \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":"src/wmf/parser/records/state/set_bk_mode.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8360f04370cd3c0b7493c2d6b4cae51b1228bfa87f086033dd67db6a3fc21713"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/anchor_log.rs:34-44 | src/audit_standard.rs:29-39 | src/disclose.rs:29-39 | src/settle.rs:33-43 \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":"src/anchor_log.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f3e883a0812885c5395705ec50e2f88c1b217c29a37f54c07f13eaa7a608e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/bin/rhwp-agent/envelope.rs:26-39 | src/bin/rhwp-q/kit/envelope.rs:16-29 | src/bin/rhwp-q/more/envelope.rs:12-25 | src/bin/rhwp-q/pack/envelope.rs:12-25 \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":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585f43d06e5677200b8b7b993195c06e453ee5f9eb50affd30fc0c6c9e4e35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs:33-101 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:76-150 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:61-133 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:49-113 \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":"src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9263244cfbcfa029af8b1e227b50ed9aa38776ea95c1390f658627a1c4c55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/bin/rhwp-q/kit/chart_list.rs:12-39 | src/bin/rhwp-q/kit/empty_doc.rs:8-24 | src/bin/rhwp-q/kit/overflow_cells.rs:10-32 | src/bin/rhwp-q/kit/table_overlaps.rs:10-50 \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":"src/bin/rhwp-q/kit/chart_list.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"081dd257b920df30d7302d252c74a9cc19e47384f6d04ceee7651388bcd958c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cli/commands/edit/header_footer_content.rs:8-125 | src/cli/commands/edit/header_footer_content.rs:128-246 | src/cli/commands/edit/header_footer_properties.rs:139-274 | src/cli/queries/structured_objects.rs:122-256 \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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5353de2bd626c1115adbf8e92302281c95534376d692a40c0dc3f9280c1d656d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cli/queries/security_inspection.rs:571-799 | src/cli/queries/security_inspection.rs:843-1062 | src/document_core/queries/memo_query.rs:910-958 | src/document_core/queries/search_query.rs:225-298 \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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae980159601b44c77226732376b3860a78b76c2c8e1ddb0448b0244b1c52f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/diagnostics/hwp5_cell_header_probe.rs:415-501 | src/diagnostics/hwp5_first_para_control_probe.rs:765-783 | src/diagnostics/hwp5_mel_personnel_probe.rs:363-484 | src/diagnostics/hwp5_table_probe.rs:411-500 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c37ca76f4442e3df30feaefad7b5ab056889d22b7cf292c4afc619fd56bb89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/diagnostics/hwp5_cell_header_probe.rs:856-865 | src/diagnostics/hwp5_contract_probe.rs:774-783 | src/diagnostics/hwp5_mel_personnel_probe.rs:770-779 | src/diagnostics/hwp5_table_probe.rs:625-634 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b669511b5e585fedcd2c0df99553926ab309bfc56bc5db54540eda0b359707db"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/diagnostics/ir_field_sweep.rs:626-713 | src/diagnostics/ir_field_sweep.rs:871-915 | src/diagnostics/ir_field_sweep.rs:934-1011 | src/diagnostics/ir_field_sweep.rs:1014-1065 \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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d88d718a2f73cd7a806773001f689ac97c109fcb4bdafd62765974addc16f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/commands/clipboard.rs:582-604 | src/document_core/commands/clipboard.rs:617-695 | src/document_core/commands/clipboard.rs:707-754 | src/document_core/commands/header_footer_ops.rs:703-773 \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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"084be93f05c8566a50b3a01c741e68e51f78a8b5c103bd257d070dd5fa7fff1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/commands/clipboard.rs:2072-2107 | src/document_core/commands/clipboard.rs:2116-2153 | src/document_core/commands/clipboard.rs:2156-2172 | src/document_core/commands/clipboard.rs:2175-2193 \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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e95b3be82e10061c3263b70cac63e8cf1cc4907e618586516bfc581a6c3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/commands/formatting.rs:1167-1233 | src/document_core/commands/formatting.rs:1247-1309 | src/document_core/commands/formatting.rs:1670-1790 | src/document_core/commands/formatting.rs:1802-1874 \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":"src/document_core/commands/formatting.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3685d4d769c7a0bb28a2d26bf8822967d3d49acb0b323b1bcac3b13d4c1978e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/commands/text_editing.rs:4549-4597 | src/document_core/commands/text_editing.rs:4605-4651 | src/document_core/queries/cursor_rect.rs:6354-6393 | src/document_core/queries/cursor_rect.rs:6402-6453 \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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d8ff231374c37759f9b00540efe965cdf5197fc2fe794f40353db144aa59b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/helpers.rs:515-533 | src/document_core/helpers.rs:536-554 | src/document_core/helpers.rs:557-575 | src/document_core/helpers.rs:786-803 \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":"src/document_core/helpers.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1fac643b38b59e64c3b85053aacb0f387fa40b2a973daea2c7f904472c1ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/hyperlink.rs:388-439 | src/document_core/queries/bookmark_query.rs:125-210 | src/document_core/queries/field_query.rs:2598-2672 | src/document_core/queries/memo_query.rs:1914-1977 \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":"src/document_core/hyperlink.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6d9b51e2e5d2a1db7408487d36c198b9c2a316ab888785415ba615b19b2bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/document_core/queries/rendering.rs:5473-6306 | src/renderer/layout.rs:7883-11386 | src/renderer/pagination.rs:1544-1553 | src/renderer/pagination/engine.rs:3225-3242 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":5473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e8a2731ed7f48ac79b189725065678060d35c55155c1907a511c332bf494d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/paint/json.rs:548-561 | src/paint/text_v2_export.rs:41-202 | src/paint/text_v2_slots.rs:145-256 | src/renderer/skia/cache.rs:194-261 \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":"src/paint/json.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d30129a73b0d41ac89bc09f7713f85dd95127bf932536adc77ddc27d07257d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/paint/json.rs:2733-2750 | src/paint/json.rs:2769-2793 | src/paint/json.rs:2798-2819 | src/paint/json.rs:2824-2848 \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":"src/paint/json.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6487f065528b070ea2ca0ceb237a2980520b20cf81f31ca25e0b7ba9a27faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/equation/brace_outline.rs:34-52 | src/renderer/equation/integral_outline.rs:40-59 | src/renderer/equation/multiplication_outline.rs:31-50 | src/renderer/equation/radical_outline.rs:40-67 \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":"src/renderer/equation/brace_outline.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3e0cecbf86fb47ffcf4e6d3fd003e2fb7f2bac1053244cb64d956461d61e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/float_placement/stored_nested_before_host.rs:16-30 | src/renderer/layout/table_layout/stored_deferred_picture_frame.rs:8-18 | src/renderer/layout/table_layout/stored_mixed_opening_frame.rs:286-296 | src/renderer/render_normalization/stored_nested_text_frames.rs:44-55 \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":"src/renderer/float_placement/stored_nested_before_host.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"14acd1573a5172426c07ac9f86b7b9a02057d7018ac302b4b4cfeb3e692188d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/height_measurer.rs:2303-2670 | src/renderer/layout/paragraph_layout.rs:5680-8874 | src/renderer/layout/picture_footnote.rs:1929-2128 | src/renderer/typeset/paragraph/format.rs:405-834 \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":"src/renderer/height_measurer.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7493645c3a008e608ec1b04a80cc58309f38aee968d6670fe8fc9e676c59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/layout/picture_footnote.rs:386-694 | src/renderer/layout/shape_layout.rs:925-1348 | src/renderer/layout/table_layout.rs:3828-5030 | src/renderer/layout/table_partial.rs:6034-8394 \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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fd9d1cd10a03c6d7607dce661956f7841be96d5cbe1f87c7b5d1a634b4dd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/layout/table_layout.rs:2476-2519 | src/renderer/layout/table_layout.rs:2529-2557 | src/renderer/layout/table_layout/empty_line_flow.rs:204-323 | src/renderer/typeset/paragraph/format.rs:405-834 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff586b7bd0c508b47d9cc8c2a548609aa429664862646d1934dbe549d4e6f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/layout/table_layout.rs:6227-6256 | src/renderer/layout/table_layout.rs:10535-11482 | src/renderer/layout/table_layout.rs:12697-13318 | src/renderer/layout/table_layout.rs:14234-14259 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6bfd2d78845e7be8acb5e472b3adbbcdc5e4c71da59a130014ac81951046f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/layout/table_layout.rs:12032-12319 | src/renderer/layout/table_layout.rs:12697-13318 | src/renderer/layout/table_layout.rs:14978-18506 | src/renderer/layout/table_layout.rs:28590-28764 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12032}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda468cb504b76a2cc83dfb2c5ac9326f01c3eec4f120a0e038caeb0aa020998"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/skia/anisotropic_image.rs:11-69 | src/renderer/skia/anisotropic_image.rs:71-138 | src/renderer/skia/metafile_print.rs:5-72 | src/renderer/skia/print_image_sampling.rs:105-124 \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":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"842ab70ac7c1e51e1abd286a99e294583a1dece33c5d065f3b594d4bf6388fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/svg.rs:2626-2767 | src/renderer/svg.rs:2782-2860 | src/renderer/web_canvas.rs:3910-4069 | src/renderer/web_canvas.rs:4081-4179 \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":"src/renderer/svg.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"557b3a32c0405b2d4ffe932e1ea33aee6cc18496cfa137f59ba2134e0f49aaae"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/typeset.rs:3555-3694 | src/renderer/typeset/notes/endnotes/measure.rs:224-633 | src/renderer/typeset/notes/endnotes/measure.rs:646-761 | src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs:277-553 \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":"src/renderer/typeset.rs"},"region":{"startLine":3555}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce432b3003b97106eb24927cda35542f1b9dbfbdfdb3a4ef7a7b959e873f5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/web_canvas/cubic_reduction.rs:23-83 | src/renderer/web_canvas/metafile_print.rs:6-88 | src/renderer/web_canvas/print_image_sampling.rs:99-132 | src/renderer/web_canvas/print_jpeg.rs:10-59 \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":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec8eb6f530e5427f2f626eaa9fbcf215a7c1773f1dfedc8340731ff82297b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/renderer/web_canvas/cubic_reduction.rs:23-83 | src/renderer/web_canvas/cubic_reduction.rs:89-162 | src/renderer/web_canvas/metafile_print.rs:6-88 | src/renderer/web_canvas/print_image_sampling.rs:71-94 \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":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f88ef530cfedab7905ddde864169c3ddd1757382f4d5f62d7473bec448ed331"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/serializer/hwpx/section.rs:3339-3613 | src/serializer/hwpx/section.rs:4994-5022 | src/serializer/hwpx/shape.rs:684-776 | src/serializer/hwpx/table.rs:504-544 \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":"src/serializer/hwpx/section.rs"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c69aa7d4efe8794c5e7da7b4044358c012eadd433d24b24a64030942722710"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/wmf/converter/svg/mod.rs:671-727 | src/wmf/converter/svg/mod.rs:1168-1193 | src/wmf/converter/svg/mod.rs:1254-1324 | src/wmf/converter/svg/mod.rs:1331-1370 \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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2ea01066c6ee0855c3976fb03ff62717acb4aced2967f55ba8b11ff3bf3e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): gym/core/runner.py:229-243 | gym/tools/differential.py:251-265 | gym/tools/release_diff.py:246-260 | gym/tools/trajectory.py:376-390 \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":"gym/core/runner.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b641f7b0deb6883032837de8378c85a516134d538c5cc658b565caaccba200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs:12-41 | mydocs/pr/assets/seo_rii_20261030/consumer_probe.rs:12-48 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2277dd1c84a0c7fc7c2d610b787e342a045c8ab4aa594f01ea471e0742a61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): src/parser/pdf/recognition.rs:690-799 | tools/pdf-ir-poc/src/recognition.rs:435-542 \u2014 These two members are one piece of code written twice and then edited apart: 108 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40071e078aea094fdf8643e08fc5e9a55d4648456bd7542a589e711fc218a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): src/bin/rhwp-q/more/main.rs:41-108 | src/bin/rhwp-q/pack/main.rs:41-108 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/main.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b797ccf859acf78d935d9eefd148e552086ca8482b4b18a73c5cbf57dee02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (97 corresponding lines): src/parser/pdf/table_detection.rs:644-740 | tools/pdf-ir-poc/src/table_detection.rs:332-440 \u2014 These two members are one piece of code written twice and then edited apart: 97 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e4004828f9d6bf09631f3cee16938a8a0a25f9183a4e1d289826cfd69a1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): src/renderer/skia/text_replay/decorations.rs:32-97 | src/renderer/skia/text_replay/lines.rs:85-147 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab4a2d93c50bf7697dbea0d72e6fbba7fa321d15f28e74043f95b92c3fa3d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): src/document_core/commands/text_editing.rs:5677-5762 | src/document_core/commands/text_editing.rs:5770-5852 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5677}}}],"partialFingerprints":{"codehealthFindingId/v1":"897353171eb854d48e5f840571132043dec737d856c9f7e6181aa98a14d78eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (119 corresponding lines): src/model/table.rs:1713-1840 | src/model/table.rs:1854-1972 \u2014 These two members are one piece of code written twice and then edited apart: 119 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba6df95b06af786e12a980c23350b2345d2370b15a2c380d6bf75767d60a81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (96 corresponding lines): src/document_core/queries/doc_tree_nav.rs:1343-1439 | src/renderer/layout/shape_layout.rs:808-903 \u2014 These two members are one piece of code written twice and then edited apart: 96 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e747a27c5de8c8fae3d299160c177ff491fa0b3fffcfdb6f2eebc3aae4b810"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): src/renderer/anisotropic_sampling.rs:57-110 | src/renderer/cubic_sampling.rs:68-123 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/anisotropic_sampling.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1776f4d2165d046a9b979a8aab9837ebc2528dd7167db4d292a0654d9b1a4774"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): src/renderer/svg.rs:4526-4581 | src/renderer/web_canvas.rs:314-369 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":4526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c40cb9c5e6fff7ca35d12fb13a76e4a1ba687c5b9e672534f7131501159f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): src/renderer/height_measurer.rs:2088-2196 | src/renderer/layout/table_layout.rs:3468-3559 \u2014 These two members are one piece of code written twice and then edited apart: 92 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c6c2ae7a04fc15409842b0c966f359ab35cb7a0488418593138af811bd23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs:5-52 | mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwpx_slice.rs:6-53 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad6aa435bb7ab4752c67236061be6efdd3ad600dce040baddf86cf1bd1498bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): src/parser/pdf/table_detection.rs:446-501 | tools/pdf-ir-poc/src/table_detection.rs:224-275 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ee5cde76fba47edce7534398fffec3c9856b2752deaca6c7e4263837d4125a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): src/bin/rhwp-agent/inspect.rs:141-236 | src/bin/rhwp-agent/locate.rs:209-285 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dec4dfb623d60d9b31c40cf0ecb01c32bd1fd9feac8f9c73dfc745820ac1774"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/renderer/html.rs:492-534 | src/renderer/svg.rs:4233-4275 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/html.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"c878c24c1f4c0df967f29e770ff6b3cdd8609186a7ba6e57a47ecdf58606092c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): src/renderer/float_placement.rs:5302-5368 | src/renderer/float_placement.rs:5381-5446 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd47f0ecf5b360d6cd12c64e7f042b6897a46acb0b835104d141f6f3a272295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): src/document_core/queries/memo_query.rs:1388-1473 | src/document_core/queries/memo_query.rs:1476-1540 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d36f531f751099b11b7df0dead2454c5f5fba66d2c981289d35ae627f63f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): src/document_core/commands/formatting.rs:2331-2417 | src/document_core/commands/formatting.rs:2428-2545 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e388d4c391164e09a1ba2277d5c0bfe37fdda7646e9016100d29bb51048e460d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 73\u002B corresponding lines): src/wmf/parser/records/bitmap/bit_blt.rs:114-186 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:118-193 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:135-222 | src/wmf/parser/records/bitmap/stretch_blt.rs:132-214 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 73 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/bit_blt.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"28493cd2b24a83e81f4a5e199581a1e521270883a2495b92c7114381ee557095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): src/document_core/commands/text_editing.rs:4475-4540 | src/document_core/commands/text_editing.rs:4661-4724 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4475}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d1ac19a8edfe4c9e61666935e7efd4995439cf54a117c88eb889edd32dcbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): src/wmf/parser/objects/structure/log_color_space.rs:61-129 | src/wmf/parser/objects/structure/log_color_space_w.rs:61-130 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/log_color_space.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f48a17a72f2cd4a5bd066c8c47dde95493bade8bb709aa630b4faa14ac6cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): src/bin/rhwp-q/kit/layer_tree.rs:12-80 | src/bin/rhwp-q/kit/search_all.rs:12-86 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/layer_tree.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb92bf64dfae1da898ef81dac88092c4545f7501480a388f7b3d7113d0cade6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/model/border_paint.rs:645-702 | src/model/border_paint.rs:708-752 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98d22a3b3ff7841e85b6ac21b936d4b72fad61e29a1a6d953715ce1ade5220f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/document_core/commands/object_ops/equation.rs:153-200 | src/document_core/commands/object_ops/equation.rs:209-255 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e1006259052fd84fbdc67e5effadb2e09b977cd71e8f1301445c993bec894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): src/bin/rhwp-agent/safety.rs:115-208 | src/bin/rhwp-agent/structurecmd.rs:9-84 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba46f84bb5353e5cf2d60fc9d65c48c0e99e3f90468f20c104cf11e22404768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/renderer/native_pua_fonts.rs:358-404 | src/renderer/native_pua_fonts.rs:445-502 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/native_pua_fonts.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a05d2302eaad244e5fb8ea77c25a1ba679f4e0cd469b83fda58c9d17d8ec38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): src/document_core/commands/header_footer_ops.rs:401-467 | src/document_core/commands/header_footer_ops.rs:476-534 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed05ad61c34661ca5deb9d8f3ca69915f96f1f8c8f3dc27434af2eb0616c74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/wmf/parser/objects/graphics/brush.rs:31-92 | src/wmf/parser/objects/structure/log_brush.rs:27-83 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/brush.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7166138128a590881daaa8ea64573aaab71b73f1991f211291f9918674b4d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/cli/protocol/trust/gate.rs:15-65 | src/cli/protocol/trust/governance.rs:170-226 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefec45c21966dbb571ec852994e0290cca11dfefae995e778bf5df1f0a4f276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:148-244 | src/wmf/parser/objects/structure/bitmap_info_header/v5.rs:174-265 \u2014 These two members are one piece of code written twice and then edited apart: 92 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/bitmap_info_header/v4.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bda518e60b7ed088d22795d26705fc83d34ab46cad643cb58f8f675ee5fdd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/renderer/equation/operator_outline.rs:63-103 | src/renderer/equation/relation_outline.rs:111-166 \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":"src/renderer/equation/operator_outline.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d3c8f3488bf95704922822b7bcef1a57be3e46c7819b800aca02dd09a74504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): src/bin/rhwp-q/kit/cursor_in_cell.rs:68-107 | src/bin/rhwp-q/kit/cursor_in_hf.rs:69-123 | src/bin/rhwp-q/kit/cursor_in_note.rs:65-101 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"131a9408c2da3e6045243e384773ac2d67b5db1bcc45b59bd9aff40a6f8e35ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): src/renderer/float_placement.rs:3628-3676 | src/renderer/float_placement.rs:3685-3740 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9f699e7cad048126a67a888a68785affe7052aa1b9f557f1aa8d7ae6724e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): src/wmf/parser/records/bitmap/set_dib_to_dev.rs:64-123 | src/wmf/parser/records/bitmap/stretch_dib.rs:75-138 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/set_dib_to_dev.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b42e5e8bb6630b1317f2668a5e8afc006b33c7ee647ea25c1c11127a31c5fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): src/parser/hwp3/mod.rs:317-380 | src/parser/hwpx/section.rs:2729-2800 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09ba25c55f2d82f88017c21c140dbf6c58b4194cd6c2bb72800788dd32480e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): src/document_core/queries/field_query.rs:2501-2554 | src/document_core/queries/memo_query.rs:1761-1822 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a026fc590703cf34383fb169e3095751860c4f270f9f8be8be0a1cf7cc4a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/paint/json.rs:1860-1916 | src/paint/json.rs:1918-1967 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1c59a7bda9eb01cfe197bfe22726f52e74180fdf0c5360a42b1da7d3a0038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/document_core/commands/document.rs:2038-2084 | src/document_core/commands/document.rs:3411-3457 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53ef37703141d6c258a52e699d672a63058c3a3f7bad5cf57c760007c214a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/renderer/pagination/state.rs:92-130 | src/renderer/pagination/state.rs:136-171 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/state.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a27757ae8664f535cc4c71ad0852a7648b45368f71275537691589c081ffe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pdf/issue7998/generate_compound_variations.py:9-15 | pdf/issue7998/raster-strokes/generate_sources.py:9-15 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/issue7998/generate_compound_variations.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"74def86a640babd5337798e414f429eb65e4f12168e5040d27478c436d8a4ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/renderer/layout.rs:2658-2705 | src/renderer/typeset/controls/decoration_host.rs:94-134 \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":"src/renderer/layout.rs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"651df38baa0c63a6893d1ad6d2cc8e5efd98300abdfc10dce7c1a168535d6055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/parser/pdf/structured_lowering.rs:834-870 | tools/pdf-ir-poc/src/structured_lowering.rs:85-109 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edd172a1db115ed68d1698134c9c54a80489e7a8bd642eec40de2998cb790fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/diagnostics/render_geom_diff.rs:289-327 | src/docdiff/compare.rs:498-532 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd07841d917c97645b6b77230e271ba47e6a8ac43eaf2efa169dbd740e65ca44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/diagnostics/hwp5_inventory.rs:87-137 | src/diagnostics/hwp5_inventory_diff.rs:190-250 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f9151be9f23b52d43b9f3eff89f0ac771432e237c4d9a6c470b32a8706b9c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): src/document_core/commands/document.rs:1986-2036 | src/document_core/commands/document.rs:3357-3409 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7efdb9430c83fee074499dc85b91fc2062964f4d7107afa6744cf87ab61ca05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 47\u002B corresponding lines): src/renderer/height_measurer.rs:611-657 | src/renderer/layout/paragraph_layout.rs:925-982 | src/renderer/typeset.rs:117-184 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 47 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fb9d713e1c44e5a256ecd5bb3698ece1f87cd8201ca4ef7df29f9efe5ff133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/renderer/height_measurer.rs:2229-2268 | src/renderer/height_measurer.rs:6235-6283 \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":"src/renderer/height_measurer.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e462b43ccd69f305837eeb58022d29af8fee8b2fb4a4de3dc0f1e6cd40e8ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): src/diagnostics/hwp5_anchor_trace.rs:74-136 | src/diagnostics/hwp5_ctrl_data_trace.rs:51-110 | src/diagnostics/hwp5_inventory.rs:139-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d2e56dd8ca704db37c9568e5bb1f888e476c5136e335508be09fd893d18410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): src/document_core/commands/formatting.rs:1361-1441 | src/document_core/commands/formatting.rs:1457-1520 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdfacc164d97a24b05d74c662625e4f32a262e171566fc008c58a22a52873be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): src/wmf/parser/objects/graphics/region.rs:70-129 | src/wmf/parser/objects/structure/bitmap_info_header/info.rs:96-165 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/region.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"849f5e3cd1e77b84ab8121b714cbe519efc4d84d047ffd55c327107cc10089f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/document_core/commands/formatting.rs:1051-1095 | src/document_core/commands/formatting.rs:1098-1157 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b75a746e3e57d5f3c809dcb460b814b27b1bdb8326500121c1653a7a1bf25d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/renderer/mod.rs:4162-4203 | src/renderer/mod.rs:4206-4247 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":4162}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bed69d57a9ac37a1c07835a056ced4243683ea600ededa00c030a4191c6973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): bindings/Native/src/gpu_d3d.rs:181-210 | bindings/Native/src/gpu_metal.rs:191-219 \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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca861bcc175d811241c22dd71cd03a558e934fc0ce3591cfae2f3bdbe05570ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): src/parser/hwpx/section.rs:260-308 | src/parser/hwpx/section.rs:6591-6641 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccdccecc29b3bdf6257ee7aa882ab172caefb0ef0b66c94ef37e047d5e25f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): src/document_core/commands/text_editing.rs:6458-6516 | src/document_core/commands/text_editing.rs:6526-6578 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6458}}}],"partialFingerprints":{"codehealthFindingId/v1":"38369bc84234d7f8b24f704fe7356e4e0567732d0b48ac872f30ae354b0072bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/renderer/typeset/controls/stored_tac/owned_row.rs:74-112 | src/renderer/typeset/controls/stored_tac/owned_row.rs:126-161 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac/owned_row.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"949dc2b97db1b27c22885748dffd4d02ada8cb3ec9adefadb60e2d54465a879b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/cli/commands/caption_validation.rs:85-133 | src/document_core/commands/object_ops/picture.rs:63-107 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/caption_validation.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e662fa15ffca339a3f8da5ba5141ae94069bee823d2e817eb776f667c087a41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/bin/rhwp-q/kit/cursor_in_footnote.rs:63-96 | src/bin/rhwp-q/kit/note_edit_info.rs:56-86 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_footnote.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32921502768ee099f103b6fff9be8b64f3a7621396e7bc8d7bbb05da20920f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/paint/shaped_measurement.rs:310-360 | src/paint/shaped_measurement.rs:372-421 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaped_measurement.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d10f317ecf7a5731b6b5f35886d1e81fa73ad2b491556ebcd2e4cf9e235bdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/document_core/commands/object_ops/equation.rs:471-509 | src/document_core/commands/object_ops/picture.rs:1424-1480 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca34bba3a8321ab5eb323b6e8b3cff16adc50b2f62f59ad88678a09d6c2a8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): gym/tools/fuzz_corpus.py:774-851 | gym/tools/robustness.py:612-684 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"614ba30d9669462d08d12673e4accdaaf0d3d615dd7bda3a678d41de8f2fd906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/parser/cfb_reader.rs:1156-1181 | src/parser/cfb_reader.rs:1210-1233 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e98fc3b27e4d2e6175308a31c73cc7e076ecd92636bddaffb4cd423352cda37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/serializer/hwpx/field.rs:148-191 | src/serializer/hwpx/section.rs:3699-3745 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/field.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"71377667a9e6f963cc11aa731c7f072a91ef883e7ccce90885f4bc20951705c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): src/bin/rhwp-agent/lookups.rs:11-47 | src/bin/rhwp-agent/lookups.rs:324-368 | src/bin/rhwp-agent/lookups.rs:485-529 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f01c92ad7159772bdba6ad08dd8dceefc4c5f9fc99036a4c346c63c01b7c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:177-216 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:194-236 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:178-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f751f0783df237f2b933f14a9a3abf9b5b50ab1a3e01ea22d75ff6ca6d175f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): gym/certify.py:314-336 | gym/report.py:361-384 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/certify.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c688ed1ed4c70789c15bff787155eeefc32b854f120305b1ea785615512d8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/document_core/queries/field_query.rs:488-521 | src/document_core/queries/field_query.rs:539-581 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"444d6401ad2b9e04fa4fbbde46c699cda1478485c8d1422c29cc95fd229c895d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/bin/rhwp-agent/lookups.rs:254-295 | src/bin/rhwp-agent/lookups.rs:448-483 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38c2ecda581270b394bcc5627200d55495c5a8d5ed5bb6426abfd1f28e5b6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/model/hyperlink_format.rs:207-254 | src/model/hyperlink_format.rs:286-325 \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":"src/model/hyperlink_format.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"52212e8b2a8ed2c4bea5c1b75d941c54e5cc69a961b42a86b04fcfb2ad7ba0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 37\u002B corresponding lines): src/bin/rhwp-agent/inspect.rs:327-363 | src/bin/rhwp-agent/locate.rs:42-78 | src/bin/rhwp-agent/locate.rs:80-116 | src/bin/rhwp-agent/locate.rs:171-207 | src/bin/rhwp-agent/locate.rs:287-323 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f263e21bc812896bc32bf6c18f89786d886d42527754ec6747aa962cd05eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 34\u002B corresponding lines): src/bin/rhwp-agent/inspect.rs:106-139 | src/bin/rhwp-agent/inspect.rs:238-273 | src/bin/rhwp-agent/inspect.rs:365-407 | src/bin/rhwp-agent/lookups.rs:176-222 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca2bb6b0cf1b641d06980cca7e31334ab47483dcfbb3fd9a11f0c2eda73d174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/document_core/helpers.rs:1365-1406 | src/document_core/helpers.rs:1456-1490 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4149c1b40e1594e02a48b2e096eb24666a12aa274673c7890fed53ed57f739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/parser/pdf/table_detection.rs:378-411 | tools/pdf-ir-poc/src/table_detection.rs:168-194 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8397701a928e529ce16cb4ae5e8dfda9ac8b7920d7847df771348350a2354f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/parser/pdf/table_detection.rs:413-439 | tools/pdf-ir-poc/src/table_detection.rs:196-222 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e635c3f911fa09a6dcac46e3bcf7d9d20f601bb8825d857c383131cb3c5ad84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/renderer/layout/table_layout/row_physical_band.rs:134-167 | src/renderer/layout/table_layout/row_physical_band.rs:263-303 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/row_physical_band.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1fbcae3022c498c4fd984bf9c5628d67d1af7c4933c8987a9f3e277d1a215b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/bin/rhwp-agent/stats.rs:23-66 | src/bin/rhwp-agent/stats.rs:68-108 \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":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24229cb9a74355516c8340cbac1428339f2d21da93ba6418bf84ba84cd24479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/paint/device_clip.rs:7-34 | src/paint/device_fill.rs:41-73 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/device_clip.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"84040d488dcd95f8a4656dc406ca79c4ebb11a9b9bd039bb33ad955b30d29e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:148-185 | src/diagnostics/hwpx_roundtrip_batch.rs:35-75 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfb04700c1278ec3b683591c7b981bc81670f4cfd3d34b991e815006084417d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/document_core/commands/header_footer_ops.rs:293-331 | src/document_core/commands/header_footer_ops.rs:342-390 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcb690b8a95cf376e35fede957c31062184cf9002105272e4737de7742c9f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/native_host/gpu_d3d.rs:363-398 | src/native_host/gpu_metal.rs:249-284 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae9a6ef4d9e446044687d3c4946c574ca3d4118cb284d50bd03b67cfbc8ef9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/renderer/html.rs:536-571 | src/renderer/svg.rs:5527-5552 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/html.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb739b7846925f79c40dabfb0c2ecf04a5372aa788a2fe696f1437a9f9fa5716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:48-84 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:48-84 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-page-caret.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33ffab30d3623c6464378c27f121b03ab88c50629443c3d3657e83700fdfc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/diagnostics/hwp5_inventory_diff.rs:1399-1427 | src/diagnostics/hwp5_inventory_diff.rs:1943-1979 \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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c997931ebd8bf1fda34c45f6f3ac2f502d1feddc163f687589ec838bdc5b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/document_core/converters/common_obj_attr_writer.rs:46-81 | src/serializer/control.rs:2563-2598 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/common_obj_attr_writer.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4791039dd88f08d6725e72cbdafdf1385fd08099ee755f865edef02917705320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): src/document_core/queries/font_metric_coverage.rs:677-733 | src/document_core/queries/rendering.rs:598-657 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9baad66e04d433c89a1710aa4a65ec0a9272482bc730cecfab4be54cc0f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:112-145 | src/diagnostics/hwp5_char_shape_audit.rs:180-220 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e1b0026b3b41c8c06598d534638ae01eb54e26b8341df06244770a7bf52908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/document_core/commands/clipboard.rs:106-127 | src/model/paragraph.rs:830-850 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a329ee05bf4ace899b69603a309604392c602d3a86bd37bcab89527c8bcb996e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/renderer/pagination/engine.rs:143-185 | src/renderer/typeset.rs:2230-2277 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0b1b80c1aa066a488b45f233bd97c60e1c3be29c4e8baf730c78d862eb3be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/parser/pdf/structured_lowering/body.rs:46-67 | src/parser/pdf/structured_lowering/body.rs:118-145 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering/body.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff9fbc67431224e1d7f68ea09c48ed006a3bac30ca3dec7a072c2974d13a782"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): src/document_core/queries/grep.rs:144-169 | src/document_core/queries/hidden_text.rs:496-524 | src/document_core/queries/hidden_text.rs:529-554 | src/document_core/queries/injection_scan.rs:1214-1240 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c886f47987fc8da70c12c0d3031745d7cd7798966f0839cb4dbe072f1f1f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): bindings/Native/src/gpu_d3d.rs:254-276 | bindings/Native/src/gpu_metal.rs:263-285 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1286d46fdda7d558a91aa202f925ae0f62afd9f030e96d1a4a2f861f9b3df496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/parser/body_text.rs:301-345 | src/parser/hwpx/section.rs:154-195 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5376d1f3f3853255145c9ce6c14c93d1da274316c4c668865d37ccfb55109195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/diagnostics/hwp5_inventory_diff.rs:1856-1894 | src/diagnostics/hwp5_inventory_diff.rs:1902-1941 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec09b5615a69120e60d2f87dab9629d9104c4961463ff144338871b33bfc5140"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/document_core/queries/rendering.rs:4789-4826 | src/document_core/queries/rendering.rs:4829-4861 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85916fc007a330e89c7715f0206614319777c412c4cebe965955a500b600ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/renderer/equation/layout/script_geometry.rs:98-129 | src/renderer/equation/layout/script_geometry.rs:130-163 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/script_geometry.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff217b030a8785a401f7507526eb13c5d9b1c901df4748432f42e2a6ee407586"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): src/bin/rhwp-agent/fields.rs:6-38 | src/bin/rhwp-agent/harvest.rs:99-140 | src/bin/rhwp-agent/lookups.rs:224-252 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/fields.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e4e517fcc22d62fa5b1053bc370833f5a982720ea969f70233fca8c74f316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/model/paragraph.rs:873-900 | src/model/paragraph.rs:3446-3471 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd37babe48a155cf1cab8493f3c169c43a79859131d4ff9471275daf3983992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/render_backend/png_adapter.rs:146-168 | src/render_backend/skia_adapter.rs:170-190 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/png_adapter.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa7021e6f7bf66e273491d27cabd9335c107ff75440332734c322a76424be2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/render_backend/util.rs:19-41 | src/renderer/canvaskit_policy.rs:2159-2192 | src/renderer/pdf.rs:858-880 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/util.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d3f232d74c6c95116b16c9913b719621ab63ebb2f69f9971c23380b2e52b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/parser/hwpx/section.rs:3530-3551 | src/parser/hwpx/section.rs:3556-3582 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8939c44409b8a9b39320053fb8a8a6f55ec497620b5d5f7f01b527f90febe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/wmf/parser/records/drawing/pat_blt.rs:48-82 | src/wmf/parser/records/drawing/round_rect.rs:52-94 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/pat_blt.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f80cf46e50510f7ce063c776df4ca6a029d10c3cf0af859089bf6b1cfc9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/cli/queries/ir_comparison.rs:121-145 | src/cli/queries/ir_comparison.rs:319-338 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a542ab6554b39b941caaacde0b5d04340e71a2dc9f485fd2ef6ef66b9fa9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/document_core/commands/foreign_paste.rs:838-873 | src/document_core/queries/content_fonts.rs:57-92 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c58733e8d33f3a3709636adb7e5661120fa84ae8b631cd67a327405cfc1c257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/renderer/layout.rs:1955-1983 | src/renderer/typeset.rs:1886-1911 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec47d653cc5ddaacd66bc77d6176168bcc1379b35405c935c09d6cbac82e5ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/renderer/layout/paragraph_layout.rs:1708-1729 | src/renderer/typeset.rs:1784-1808 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fc8307a7c5242adec3be3401a7c06816071f28ffadd99eb2cf293932f4f2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/parser/control.rs:513-540 | src/parser/control.rs:543-570 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f08d8445acf228a8ab236620af35d00b538e6161715418a5e06830a21e0425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): src/bin/rhwp-agent/searchcmd.rs:61-94 | src/bin/rhwp-agent/searchcmd.rs:96-122 | src/bin/rhwp-agent/searchcmd.rs:124-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/searchcmd.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"188dbe197d63638c811e721abeec6ef2fd8116911805498bf1ddc280da7b9d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/bin/rhwp-agent/compare.rs:17-49 | src/bin/rhwp-agent/compare.rs:51-84 \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":"src/bin/rhwp-agent/compare.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2943decdf1907e512b989565585a7edfa986358c535690efcd179d337c5b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/parser/pdf/table_detection.rs:525-549 | tools/pdf-ir-poc/src/table_detection.rs:277-296 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc95b97e1cf32b28bab12713ba1153d2363dfa348e474c78d98bddf10796deae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/agent/dsel/suggest.rs:31-53 | src/bin/rhwp-agent/envelope.rs:297-311 | src/cli/metadata/capabilities/mod.rs:433-447 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/suggest.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"296ca00326c17d3979aff0cedd6df05fa44da15ad1116b610170b5d34fd54e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/paint/resources.rs:62-83 | src/paint/resources.rs:112-133 | src/paint/resources.rs:162-185 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/resources.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37612805350a4b040ac4a8fbd87ca949f4989b11884a76467aa3c2222ef0ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/wmf/parser/records/drawing/poly_line.rs:37-75 | src/wmf/parser/records/drawing/polygon.rs:40-77 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/poly_line.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea0406eda27244de153198f89ba3e500d5226de328a5fe57a2084c6ada082a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/document_core/queries/rendering.rs:1983-2011 | src/document_core/queries/rendering.rs:2070-2098 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dcf8b33f217adcf5a1e051ca98c6dbf4136c51775bf72108f07a539f4f37a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/renderer/mod.rs:3744-3774 | src/renderer/mod.rs:3781-3805 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad2dea2c3f09184dd3aca56a2a1077353061bb11bf04202f490591c663fca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/parser/control.rs:656-683 | src/parser/control.rs:707-721 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4119a3c8b1a8729b805df98805486e08871f39e64dc589c08753f3cdd51d9d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/bin/rhwp-agent/scan.rs:271-292 | src/cli/queries/scan.rs:131-150 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a48907591b8a5febe87aca19bd9c2e3b09a132cc7cf3ef0dbbdd83885570b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/cli/protocol/exchange/bundle.rs:216-247 | src/cli/protocol/harness.rs:326-358 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c6d87a33e0a3aaadde0aeafd902cc689d71fbd89f1a3bd61c46f3291b4e0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/renderer/mod.rs:3155-3184 | src/renderer/mod.rs:3195-3225 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32b3a86c69773235bb3cdcfbb02fb118b3697905895b03962b9edc92f971399"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/cli/integrity.rs:48-73 | src/cli/integrity.rs:83-106 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/integrity.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df099bac4b083e32d0ff72aa5c9255e407b69c215a1be5652e0292c9596f4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/renderer/native_pua_fonts.rs:84-106 | src/renderer/native_pua_fonts.rs:138-166 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/native_pua_fonts.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bee84472395f56d71ab19f87b35229745db0ae8b21df17fd91ae7f1c992ea5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/serializer/control.rs:1166-1196 | src/serializer/control.rs:1198-1227 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b59aa14d5ea1807197c92fa26ea3fd538eb7516dd83c0160dd1ca11acb22330"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/document_core/queries/doc_tree_nav.rs:798-842 | src/document_core/queries/doc_tree_nav.rs:852-898 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f98cef4880fbe69a92f0eabafd53ab130d71a519ea0568b0cae1cba40cc9c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): mydocs/tech/investigations/issue-1058/probes/dump_footnote_inner.rs:72-91 | mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:167-187 | mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:83-102 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-1058/probes/dump_footnote_inner.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"be353c19e13635cce39ac1d9a6c4ce4c859ea3d54ca712cc60baf1be4b63b39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/diagnostics/layout_anomaly.rs:621-639 | src/diagnostics/layout_anomaly.rs:758-776 \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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e372fa3de854d7b09524e635a42a27cc43745893dab62ad3a5a5a637fd468e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/document_core/hwpjson/body.rs:160-182 | src/document_core/hwpjson/body.rs:186-210 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/body.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a007bc04af6d3a346ed127ff925ee866d681507826c6f38441c61212a406d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): src/model/paragraph.rs:400-400 | src/renderer/composer.rs:276-276 | src/renderer/layout_frame.rs:480-480 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"962ef5073902c729e9ddd7222944b9d6e7d9ca1ffbdec03db55097bd2db5078f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/document_core/queries/extract_data.rs:437-454 | src/document_core/queries/extract_data.rs:457-480 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/extract_data.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9793b4f1d5e113f5d9e94e12ed0e1d11ec797b334546ee7498ffe7e793bd0fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/native_host/gpu_d3d.rs:404-434 | src/native_host/gpu_metal.rs:290-320 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"148091c3ec5a7f185a11d8dfb88d5d8fdd02ea6f24553e17f8882ca835557af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/parser/hwpx/section.rs:5747-5770 | src/parser/hwpx/section.rs:5776-5799 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4130d822668e03b0040074b50b4c0917f0cc0fcb6ca0e28e348066f50d6b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/Native/src/gpu_d3d.rs:127-143 | bindings/Native/src/gpu_metal.rs:9-28 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebd5bb33299dcfd98d277b050ecfab47cb47c8c301c66476c62a4edc4bd9818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): gym/core/checks.py:155-173 | gym/core/checks.py:276-293 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/checks.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"46844142559b8af9a4108e537ed0fd9cc3f51147448104c05e5796e189dde8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): bindings/swift/Sources/Rhwp/Rhwp.swift:123-160 | bindings/swift/Sources/Rhwp/Rhwp.swift:162-196 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/swift/Sources/Rhwp/Rhwp.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"765bb1c0a8afff68f44302f35e6b4539105ca656bea4d256e6d596932b4e6330"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:503-524 | src/diagnostics/hwpx_roundtrip_batch.rs:292-313 | src/diagnostics/layout_anomaly.rs:1799-1824 | src/diagnostics/render_geom_diff.rs:753-772 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc239b2ad30c5055b5df8999f39dd664302c7e63101d9ec7ba8e84022e7dabb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/document_core/queries/injection_scan.rs:563-598 | src/document_core/queries/injection_scan.rs:611-642 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"022dd814b8892adce51fcff7d2c32596e2327884a6bf9674270d977455e15a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:72-98 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:72-100 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8600467afb83c79ba3da98ced66f25de1bd3428fefa92a93ffbc1e3f66208a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/cli/queries/control_dump/story.rs:126-158 | src/cli/queries/control_dump/story.rs:258-285 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/control_dump/story.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7db96a2c968fa3af4e7a331e77801c4e1b6e9161b22e017278d1df56ef6665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/parser/hwpx/section.rs:2098-2122 | src/parser/hwpx/section.rs:6543-6575 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ad5519fefbf9fbed982203328931d78ffc38e318e95936fcbdc0f209386e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/renderer/font_metrics_data.rs:409-432 | src/renderer/layout/text_measurement.rs:1291-1310 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metrics_data.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11cf3a260c4376a3172ebbd9179c618375cd1eadc833def0c0dd9224331347a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 25\u002B corresponding lines): src/wmf/parser/records/drawing/ellipse.rs:47-77 | src/wmf/parser/records/drawing/ext_flood_fill.rs:42-66 | src/wmf/parser/records/drawing/frame_region.rs:41-70 | src/wmf/parser/records/drawing/rectangle.rs:46-76 | src/wmf/parser/records/state/exclude_clip_rect.rs:43-67 | src/wmf/parser/records/state/intersect_clip_rect.rs:43-67 | src/wmf/parser/records/state/scale_viewport_ext.rs:44-73 | src/wmf/parser/records/state/scale_window_ext.rs:44-73 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/ellipse.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3e5d3fd0b47daa6e300a9ca1dc707848c0ac0290ae571b67559270f48b9c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:570-585 | src/diagnostics/hwpx_roundtrip_batch.rs:407-421 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"11918ec8f6162b94b4cec895327d1c551ab5e85198f972e2a89887bea6c80d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/bin/rhwp-q/kit/flow_images.rs:48-72 | src/bin/rhwp-q/kit/overlay_images.rs:52-76 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/flow_images.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdcbc52408c3e702f2070216688a774b70da2fb702426c4744d831a3bade8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/diagnostics/hwp5_cell_header_probe.rs:583-612 | src/diagnostics/hwp5_mel_personnel_probe.rs:521-549 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf5cfd145f48c93e400c845dccb0d922056c6bcfcb0a32990241a3fdc55687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/parser/pdf/recognition.rs:806-828 | tools/pdf-ir-poc/src/recognition.rs:549-563 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"27738dd0eae53f1b7f40e3d8e1b98a04ba1df7eb1d79422ed40223c7fcd6d182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:278-302 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:259-283 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7b43cba378297fbe0702f28124ed5a6aef31d3c49ddf5cf75e55109498951e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/parser/hml/reader.rs:265-289 | src/parser/hml/reader.rs:297-325 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/reader.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4809cd6a8c5c147f6224c5739c9d624637f34ba37d08523bf61aa8026fb8c4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/renderer/float_placement.rs:185-215 | src/renderer/render_normalization/stored_word_tail.rs:508-537 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4021f8f523c8228a4c3880655015155042ae69affc09d06272a8be95505f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/document_core/commands/table_ops.rs:658-681 | src/document_core/commands/table_ops.rs:695-720 | src/document_core/commands/table_ops.rs:794-827 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5f9042b3309d22e0fe872d541519332adb04f6e827ba844fd19e40f47578c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs:5-10 | mydocs/pr/assets/seo_rii_20261030/consumer_probe.rs:5-10 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f565c64191523f0000b4771617ed4d11b46764912e0cdf56978b546847dcff83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/document_core/pdf_import_session.rs:283-310 | src/document_core/pdf_import_session.rs:318-349 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/pdf_import_session.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"917552c4f655669031cf212d29f450134ce446de24deecf4bf3985e1f6d86547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/document_core/queries/field_query.rs:1907-1941 | src/document_core/queries/field_query.rs:2022-2057 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc88f724d91e2b6395f2dfea978ed92a444fab74e6d7471687f54fd385e93c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/model/shape.rs:576-588 | src/model/shape.rs:591-603 \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":"src/model/shape.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e324ccd9fa869bc299ef843927fb53246e85e281f0fca12b52c1c5f7df936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): src/model/footnote.rs:65-65 | src/renderer/composer.rs:222-222 | src/renderer/style_resolver/resolved.rs:705-705 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/footnote.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe278f973a6df8a8130a98beae0eebded672997d611ff48bc36734160bc1c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/renderer/image_resolver/print_alpha_2024.rs:17-36 | src/renderer/image_resolver/print_picture_resample.rs:42-60 \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":"src/renderer/image_resolver/print_alpha_2024.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41d7ab8250d4133e4711a52a096bd87f4867cbfcd03eae4b26befb8557f6ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/document_core/table_calc/parser.rs:86-112 | src/document_core/table_calc/parser.rs:115-141 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/table_calc/parser.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5144751fd33c28d06da7e5438c22a379e748fc01f5d48767b8e07f0e584eb5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/renderer/layout/border_rendering.rs:1455-1485 | src/renderer/layout/border_rendering.rs:1497-1533 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"269eb73ce433f567ed3a084fc084467190fde96972c377229fbeb5859b146ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): mydocs/tech/investigations/issue-705/probes/inspect_705.rs:26-52 | mydocs/tech/investigations/issue-705/probes/scan_cell_pagehide.rs:19-51 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-705/probes/inspect_705.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d262ed007d503055ec2f66e2824c9f31d03878fcae704c5d770a315cd2d94929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/wasm_api/print_image_sampling.rs:91-103 | src/wasm_api/print_image_sampling.rs:106-121 | src/wasm_api/print_image_sampling.rs:125-137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api/print_image_sampling.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b992489a5d365e99f11a8202612bf36c3543fd1ebf906e3e2db33f7171ce20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/parser/control/shape.rs:1108-1129 | src/parser/control/shape.rs:1133-1163 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a9e32e95d946b776c812d74754de6e7f2c5429d7d70cc7b753f2587053794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/bin/rhwp-agent/harvest.rs:249-277 | src/bin/rhwp-agent/lookups.rs:297-322 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a12d17302f966cf94b98cb721f45c31a3bc50bb3b1583bf49206faee11051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/wasm_api.rs:2716-2730 | src/wasm_api.rs:2769-2784 | src/wasm_api.rs:5948-5964 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc5cfa1a988ba1556d7da0d5ad5e9a3b403395ee65164d04a0de6aaa177199c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/renderer/height_measurer.rs:359-374 | src/renderer/layout/table_layout.rs:22204-22227 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2133029fa1a77a126768865596a8c02be65aa1f03a8d12e19abc3e49b3bdf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/renderer/layout.rs:755-777 | src/renderer/layout/table_layout/deferred_flow_units.rs:117-141 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5dd7ce4275f3af35112397987269ee8d749439f9a5cf38df09a48f916aa788"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/native_host/gpu_d3d.rs:182-205 | src/native_host/gpu_metal.rs:122-145 | src/native_host/presentation.rs:105-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e8e1e679f13519653a5ef7e1664f2c735fd197a1292f7a3d0914e369262d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): bindings/Native/src/gpu_d3d.rs:224-242 | bindings/Native/src/gpu_metal.rs:233-251 \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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b5e006ec3f381dcea9bd752fa6a2076b5a69c84d5737f372663ff4b5ab6058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/document_core/commands/table_ops.rs:864-901 | src/document_core/commands/table_ops.rs:909-940 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d4a8cef9c6b87f955ca8e806e3e4f6021e3108bdef2f71747349ad42d970fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/parser/pdf/lowering.rs:154-186 | tools/pdf-ir-poc/src/lowering.rs:63-92 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc047d5ab7814960a547f14f62fc640aa93293a0e8268bcf152a5aaadcd933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/wasm_api.rs:1201-1228 | src/wasm_api.rs:1244-1268 | src/wasm_api.rs:1351-1372 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"084f93b8bfa76423e0e211edf87f65a225c5a1546518cf1826ff345b9dff1e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:133-155 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:135-155 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"459455e4250f5fa4a5992884c265556e7c6ba79bd6c511e8889dd990160a9352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/parser/hwpx/section.rs:1687-1711 | src/parser/hwpx/section.rs:3631-3649 \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":"src/parser/hwpx/section.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"345817bd37e578a41ea7838a882b70618f28ca7e924dfb728ac6fcc7edbeb64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): src/parser/pdf/allocation.rs:264-277 | src/parser/pdf/allocation.rs:540-554 | src/parser/pdf/allocation.rs:796-809 | src/parser/pdf/allocation.rs:876-891 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d8dce8a4f7c7edb8716b7fe956ef9197d5c390cb7c15b39507b99d21c6bb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/wmf/parser/records/drawing/flood_fill.rs:38-60 | src/wmf/parser/records/drawing/set_pixel.rs:37-59 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/flood_fill.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a669254930d1a27977173a3ed81037bea862f78ba93cbc9472081dd8fc218cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): src/bin/rhwp-agent/stats.rs:110-128 | src/bin/rhwp-agent/stats.rs:130-153 | src/bin/rhwp-agent/stats.rs:188-212 | src/bin/rhwp-agent/stats.rs:214-238 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae1227490dfa36bc3b5e80abbf836274eeb39a6af27ef71a48c7a4ac73240c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/document_core/commands/text_editing.rs:5861-5887 | src/document_core/commands/text_editing.rs:5980-6006 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5861}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3a607d58600a10ecb7d54c185aa24624d5e0984d32eb6edfadcc6fdb68cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/parser/hml/reader.rs:609-634 | src/parser/hml/reader.rs:658-687 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/reader.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8d8a669e1b981278c93e76f993b61b267c3474e29a8c06f3cd4046f6afccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/renderer/layout.rs:2001-2022 | src/renderer/typeset.rs:1981-2004 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a58dc1e59c87185cea35ce36e15980d0eea98d5fd4a9c6dff8bb38729c9affd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/serializer/hwpx/roundtrip.rs:1083-1118 | src/serializer/hwpx/roundtrip.rs:1128-1156 \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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc2acbc6ca6b002a6d1fc7ea582df02902a5210746d1ddd286ecb2f993462e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): src/bin/rhwp-agent/safety.rs:748-769 | src/bin/rhwp-agent/safety.rs:779-803 | src/cli/queries/security_inspection.rs:532-559 | src/cli/queries/security_inspection.rs:809-833 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c5d1e716840ebe76d65eae2154a1f2ec7071465ea0cc44af373d3269954999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/paint/json.rs:2929-2961 | src/paint/json.rs:2963-2984 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2767de21adab7fa31558177aef0de063bff7162cd88da68966042df82e883150"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/paint/paint_op.rs:1154-1169 | src/renderer/pdf.rs:363-376 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_op.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5064472ecab9ee35cb569ebeb6c8339fb102867636d24ba35f16b1ef86939ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/parser/hwp3/drawing.rs:49-78 | src/parser/hwp3/records.rs:204-233 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ee6300ee2279ec09e9012774d839c75fd96fb3e6a1eb209c4a8c209c3bf9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/paint/paint_bounds.rs:745-764 | src/renderer/render_tree.rs:1337-1345 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_bounds.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bebb1e5e4117b5b33ce356497866bb60bba41d593e7d99c316e4e89ec4d43db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/parser/body_text.rs:1432-1454 | src/parser/ole_container.rs:261-282 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb09b6ebf0943a1a1beedb8e2efeccf5acaf52393b7794d50efa4d42eef57027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/equation/canvas_render.rs:470-483 | src/renderer/equation/canvas_render.rs:492-507 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4b85e75b21b3e930eec7a3d8852c2ac050e254aaa0c058d86b22136a83b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/renderer/equation/multiplication_outline.rs:52-70 | src/renderer/equation/svg_render.rs:529-548 \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":"src/renderer/equation/multiplication_outline.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7e7f66def798fab981696561453da480abdf6757883e2ae69590c18549343e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/wasm_api.rs:5077-5090 | src/wasm_api.rs:6174-6188 | src/wasm_api.rs:9041-9055 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":5077}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d353e21c2bce7492bde1057cd56068a908d18e459b25d54a5aa542253fa99ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/document_core/commands/table_ops.rs:999-1026 | src/document_core/commands/table_ops.rs:1035-1068 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1efcd645f210938e37de9cb26d596bb560dddc95cef8fe97c01d82ce5936968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/document_core/commands/paragraph_block/import_json.rs:21-41 | src/document_core/commands/paragraph_block/template_operation.rs:112-131 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import_json.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae5a4f93346ca46b6a5ac3b711e1772e891019b14bf24d5917b8ca7e285f5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): src/renderer/char_overlap.rs:24-24 | src/renderer/height_measurer.rs:681-681 | src/renderer/pagination.rs:1158-1158 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/char_overlap.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c09351ac579a53bdfc1b5914d46d72f6e90d9ca086a7ebb27acfd92d74a68e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/serializer/hwpx/roundtrip.rs:858-871 | src/serializer/hwpx/roundtrip.rs:875-889 | src/serializer/hwpx/roundtrip.rs:1791-1804 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb73b1ca501bc9543c6d9fcc0d40d7a392aeff61e4de8d335551d0ccda76301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/bin/rhwp-agent/fields.rs:40-58 | src/bin/rhwp-agent/inspect.rs:302-325 | src/bin/rhwp-agent/tables.rs:43-61 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/fields.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2eff08371fba8b40736422d2be1deb4454445d56d0f219c4d0d53f30b012f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:250-276 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:225-257 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:232-257 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ecf5c6f3f6814b24b56840be6fd2efdcd70576ea0bc1a6406c961e5d963db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/document_core/queries/injection_scan.rs:700-720 | src/document_core/queries/injection_scan.rs:903-920 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"051aef70a7fe646663b59c973fec50096029d50df4c75cb090e1501b0f06e9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/diagnostics/ir_field_sweep.rs:1161-1175 | src/serializer/hwpx/roundtrip.rs:1808-1822 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52578ebd9d11eae0d11f54b87a7077422e11f446dc35c92efcb6aa860815d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/renderer/composer/line_breaking.rs:3769-3791 | src/renderer/composer/line_breaking.rs:3797-3819 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d528debf4e5aa29d293430bcad026a80dcb2211da4960bb76b281bd9b465f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gym/core/checks.py:260-272 | gym/core/checks.py:428-440 \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":"gym/core/checks.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f4b0a48d6a13f054397b07dbd1dce1f81b5970cf6593e7d23ec6832d957fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/parser/cfb_reader.rs:713-735 | src/parser/cfb_reader.rs:737-759 | src/parser/cfb_reader.rs:762-786 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8dbe8853c398a7ce63f4ecf8bfd204393853b7da69d18b62f0c21f6e1fec7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): src/wasm_api.rs:7366-7382 | src/wasm_api.rs:7421-7435 | src/wasm_api.rs:7537-7552 | src/wasm_api.rs:9486-9499 | src/wasm_api.rs:9702-9715 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":7366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea11077ea867c2b94e928cdd156a04aafb614e765aa30bde469555af94139d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/document_core/helpers.rs:1639-1662 | src/renderer/layout/border_rendering.rs:1598-1620 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb0e9f0f9eefbb14e7d362d0a68d288332e1fd6a7eabdfceb2741cd0ad27232"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/document_core/hwpjson/fonts_charpr.rs:166-180 | src/document_core/hwpjson/fonts_charpr.rs:182-195 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/fonts_charpr.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"23192c43e0c4b82b530ab6df1014245bda12f608e3bd7c68208dc102381982ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/native_host/editor.rs:453-466 | src/native_host/editor.rs:468-481 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/editor.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe4a13d9db3b1a88541b0e908bd2c24a5718071de06ab6f6954ae4892068f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/document_core/queries/field_query.rs:1453-1479 | src/document_core/queries/field_query.rs:2315-2338 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a27ae6b2269f2e94c02459bce2928410f621c77c8cbeb54d0fcc63fd62c134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/parser/hwp3/drawing.rs:349-367 | src/parser/hwp3/drawing.rs:402-420 | src/parser/hwp3/drawing.rs:455-478 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf43a4cfc519c9b18499fc8449f5f496c326028a3fe8b9be26d37522f309027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/native_host/gpu_d3d.rs:139-155 | src/native_host/gpu_metal.rs:80-96 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ab13ee9ab8df42143ffac4c95b68d094611027eff6e6b0262f81a31ed44cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/serializer/control.rs:1233-1254 | src/serializer/control.rs:1256-1273 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"098baf735c56a45e55cc33bbd6c5a6b2da324473a3f2bc6ccf4d952079f06b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/document_core/commands/header_footer_ops.rs:246-260 | src/document_core/commands/header_footer_ops.rs:268-282 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a375de60e3d6e24f40ce868e12dfa527a49dceef33d8d0abae613f7dc34a61fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/native_host/gpu_d3d.rs:125-137 | src/native_host/gpu_metal.rs:66-78 \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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e87afa45133898c538275417299ecc7cf53ab755c28d51ff23e7d49daba29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/renderer/svg.rs:1711-1737 | src/renderer/svg.rs:1748-1770 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a392eb5e53329922b2e25433dfacbd181f3c81a73bbff6de628a599f86a3083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 33\u002B corresponding lines): gym/tools/differential.py:191-224 | gym/tools/release_diff.py:189-221 | gym/tools/release_gate.py:230-267 | gym/tools/trajectory.py:332-367 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded5893e8f3479c31a2e0cf21c9cfcd7f542c806b124389c1ed542f7bea9731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/serializer/hwpx/char_shapes.rs:82-98 | src/serializer/hwpx/header.rs:692-711 | src/serializer/hwpx/shape.rs:1683-1699 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/char_shapes.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d426cfb8aa60445864b9577b6f4bd066cc7f35af353122ebb4bb2a72d2d26fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rhwp-ooxml-chart/src/renderer.rs:222-241 | src/emf/converter/svg.rs:56-75 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb90933be87c6e73745a8becbc70ac81ca5ddc70d7b4ca525624995564f3514"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): src/doclang/writer/escape.rs:49-67 | src/ole_chart/svg_renderer.rs:408-427 | src/renderer/equation/svg_render.rs:769-788 | src/renderer/pdf.rs:1810-1829 | src/renderer/svg.rs:4410-4429 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/escape.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"982d6f348d4420cf124ea5e9172729916c9933288c6e022d98328f7eda4fa9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/document_core/helpers.rs:1614-1636 | src/parser/hwpx/header.rs:2517-2538 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b2ccf1bef14057649eb88bf8c6f562d659f6f169eeeb71856befb63a3713eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/document_core/queries/cursor_nav.rs:584-597 | src/document_core/queries/cursor_nav.rs:600-613 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d6f38620b6e85ca7cf1d297f6b79e8ee391aeebc09a9f4456e0ed893dc494d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/renderer/skia/text_replay/decorations.rs:12-30 | src/renderer/skia/text_replay/lines.rs:66-84 \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":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4ff5ed189d73593fdf97776a72a19407ef5c6ecec6b0d7f05d7cd9e42d38b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/bin/rhwp-q/more/inventory.rs:90-104 | src/bin/rhwp-q/more/inventory.rs:1082-1099 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d339f5b8d1ce84afd77256268253756ff8b150c0c8c04603525f82c31b6b52a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/paint/font_glyph.rs:1116-1147 | src/renderer/canvaskit_policy.rs:2260-2299 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/font_glyph.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2bedd31276a00c1d655bed1e2f0ceaa3022501ab8c1fa4e2a757485b25d2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/parser/hwp3/ole.rs:127-150 | src/parser/hwp3/paragraph.rs:77-95 \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":"src/parser/hwp3/ole.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e5588a538035cdac78aef92d1e2bbcfef40da25c235261625ac89c77779e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:224-250 | src/diagnostics/hwpx_roundtrip_batch.rs:108-130 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1f7cd53aef5d28f7b66bd582d4b6a7bd53dc7b941dfd1abf9821079207a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/font_metric_math_symbol_blocks.rs:265-276 | src/renderer/font_metric_math_symbols.rs:77-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_math_symbol_blocks.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348ff442b6f018fd7ccc1efb706489e1b79242c764b3ab8509cfb8ed2ca9473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/serializer/hwpx/char_shapes.rs:116-138 | src/serializer/hwpx/header.rs:311-336 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/char_shapes.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6bad3d3666be716a2fd6c0c1b5d091f58f61db7699fa14d8aa093d0e8e4d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): mydocs/tech/investigations/issue-7441/probes/check_7441_footer_area_cover.rs:28-44 | mydocs/tech/investigations/issue-7441/probes/repro_7441_reporter_geometry.rs:34-47 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-7441/probes/check_7441_footer_area_cover.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63a75046747fc5806f69d259d875b2dd8c14785e81b2f3181b257cb1bbc9643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/parser/cfb_reader.rs:874-898 | src/parser/cfb_reader.rs:905-931 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1159bca3bfcdf45bb2a06f27194732b4a766e7cb47ada3794ec6fcb769daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/renderer/height_measurer.rs:2026-2045 | src/renderer/layout/table_layout.rs:3228-3244 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe00ec06ccc0ffdff170790fc81f947cf7298cb62d8012a01df999737b7c49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/wasm_api.rs:5894-5906 | src/wasm_api.rs:6001-6016 | src/wasm_api.rs:8826-8839 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":5894}}}],"partialFingerprints":{"codehealthFindingId/v1":"297dbf7f638f813638808d9d0701b22fa7a702f8639246f134d18941d7b51081"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): gym/tools/competitive_bench.py:310-323 | gym/tools/competitive_bench.py:349-362 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/competitive_bench.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c8c52096a6538b57ad210477c13d5f78190c17b559247c2b2b3caa2a8d08e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 1\u002B corresponding lines): src/model/control.rs:219-219 | src/model/control.rs:404-404 | src/renderer/inline_flow.rs:81-81 | src/renderer/inline_flow.rs:112-112 | src/renderer/mod.rs:5322-5322 | src/renderer/pagination.rs:347-347 | src/renderer/pagination.rs:693-693 | src/renderer/pagination.rs:1098-1098 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bfe2926e4a3a80bf4fc67610981a4e95b25009df02814ccb5b544f4f1b55d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/doclang/eqedit/latex.rs:399-410 | src/doclang/eqedit/latex.rs:415-427 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/eqedit/latex.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d970c27d97da57812970ee43e9b76515fa8e1a610ca3fdbbd814c5d3f824710b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): src/wasm_api.rs:2021-2033 | src/wasm_api.rs:2066-2078 | src/wasm_api.rs:3319-3331 | src/wasm_api.rs:6353-6364 | src/wasm_api.rs:6421-6438 | src/wasm_api.rs:6484-6495 | src/wasm_api.rs:9888-9900 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4082e5b5fa9386e09b55a997654d96e0ebbc9f01fa3a3d1476250b637e84bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mydocs/tech/investigations/issue-1113/probes/repro_1113_round1.rs:2-11 | mydocs/tech/investigations/issue-1113/probes/repro_1113_save.rs:4-19 \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":"mydocs/tech/investigations/issue-1113/probes/repro_1113_round1.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0234b50f54516d0f23128ca707a11a287f86cc26c4e508dc67f0bca3ba6b98e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): mydocs/tech/investigations/issue-1139/probes/diag_1139_para_shape.rs:9-28 | src/document_core/commands/object_ops/footnote_shape.rs:172-191 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-1139/probes/diag_1139_para_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d01c595c37fef3b5590bb700769af5e0b0f77a7ce643e12f328232d551bafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/wmf/parser/records/drawing/fill_region.rs:34-54 | src/wmf/parser/records/state/set_text_justification.rs:38-58 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/fill_region.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e988934a0bcb3bffead7e6822acde5012f75a38049682c6ee86f991318fe2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/wasm_api.rs:5365-5377 | src/wasm_api.rs:9152-9165 \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":"src/wasm_api.rs"},"region":{"startLine":5365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac41c7e071c538dce025ecf7bb795f1c019f30d2652e9929d4ce280378ffd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/bin/rhwp-agent/explaincmd.rs:10-27 | src/bin/rhwp-agent/inspect.rs:9-26 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/explaincmd.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"399c5e3e903a05836f157f2ec2a9b32dc471cbec5ee67bbc6808feb7a199b5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/model/control.rs:563-579 | src/parser/hwpx/section.rs:6191-6209 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"58798fbdbce175d6706584f9613b6ed89012fcbb502f627b25fd376f009bc8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/paint/json.rs:2319-2336 | src/paint/shaping_glyph.rs:375-393 | src/paint/text_shape.rs:447-465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b24e781adcfa280652c7957c2e0a934a39907a9a48337ea46961fc1b7a18180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): src/document_core/commands/table_ops.rs:80-101 | src/document_core/commands/table_ops.rs:111-132 | src/document_core/commands/table_ops.rs:141-162 | src/document_core/commands/table_ops.rs:171-192 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"769158c8c0497d00a82d348183e48870afdd0f81b83a53dfe38e49677094a709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/parser/hwpx/header.rs:1298-1318 | src/parser/hwpx/utils.rs:177-198 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ef82df20936a17b088c6b7bcba6fdb7e77db74265c06e39034d98ae91a65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/layout/text_measurement.rs:2970-2981 | src/renderer/layout/text_measurement.rs:3135-3153 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"1464cd5c4194895d8ca42498b61d14ce74251f7c4868af82d5596fe0410c1ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs:14-34 | mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs:36-53 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6361135cc62ab325b888012f2e6838d39cf5a4c2b315fd8a048f0ec5b198dcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/document_core/queries/rendering.rs:6310-6332 | src/document_core/queries/rendering.rs:6335-6352 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":6310}}}],"partialFingerprints":{"codehealthFindingId/v1":"49daa86e70b1cd57e277e182387b06d436afd82c22970d138502dfe0aeb58f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/native_host/presentation.rs:342-361 | src/native_host/presentation.rs:364-387 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/presentation.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"635fe883719ddeb936d97ac045e0100a3f807c30eb882f45320a1234fef78a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/renderer/cubic_sampling.rs:45-59 | src/renderer/image_resolver/print_alpha.rs:153-168 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/cubic_sampling.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b38b378ebe80741cc3e1f3de9ea3092d487291b9b425147fefc920f79e009e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/renderer/typeset/controls/deferred.rs:76-91 | src/renderer/typeset/controls/deferred.rs:96-110 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/deferred.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"226b6fd6c4ef6b5a6266c576f55d4b42f844e3cdb79633a2f843eb3f70241d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/renderer/layout.rs:4095-4109 | src/renderer/layout.rs:4114-4128 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dec1b1d13fc1ae98bdbb62232597f96f3e1eb0f6c24aab020de966a3b212d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/mod.rs:1265-1271 | src/renderer/mod.rs:1282-1292 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f94d9b0d445e543422d4ffb32844cf2cd74747d5afaf341fbef8a9bb56cc7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): src/wmf/parser/objects/structure/color_ref.rs:25-57 | src/wmf/parser/objects/structure/rect.rs:27-44 | src/wmf/parser/objects/structure/rect_l.rs:29-46 | src/wmf/parser/objects/structure/rgb_quad.rs:28-56 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/color_ref.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d09bc441716426f92fa0c7b0fd82138d7eec545484b846597865a749a1291f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): gym/core/checks.py:203-212 | gym/core/checks.py:382-392 | gym/core/checks.py:444-454 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/checks.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb74258c3bfe47b458aa1d49bcfb60d0adcd410be96d58e80617fce7e275a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): gym/tools/fuzz_corpus.py:1283-1295 | gym/tools/robustness.py:1112-1130 \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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa96805bf8977df3604089bb7bd188c1d9c060cd1303b3ab694197e0fdf184c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/document_core/commands/compose_controls.rs:122-146 | src/document_core/commands/compose_controls.rs:148-170 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/compose_controls.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb21bcb4432e8e6063384bab8f4e7ad31c22033a488cd1a9d559088b6e288a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/model/document.rs:690-711 | src/model/document.rs:734-755 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b8445ee23e5f2b3070b36e4c91185bccc85370d895016eb906548427a9a40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/paint/replay_order.rs:98-111 | src/renderer/svg_layer.rs:222-236 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/replay_order.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa9f7478838f8e6564e38245966157fd0685b39ec0f1858cb812d96f6dabdf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/serializer/hwpx/header.rs:847-868 | src/serializer/hwpx/header.rs:1393-1416 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/header.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22c871b5a6902b9e6c2b0d2c155b3bc0668974fb23f73ff83b71e6e1d6270de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/diagnostics/ir_field_sweep.rs:1182-1192 | src/diagnostics/ir_field_sweep.rs:1205-1223 | src/diagnostics/ir_field_sweep.rs:1226-1236 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386ead27a11b4556cac10d08f2275390b377e0c5915e5803b8a59439e1b4793"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/paint/text_variants.rs:523-541 | src/paint/text_variants.rs:547-562 | src/paint/text_variants.rs:679-700 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/text_variants.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"778120f87fdfe5a649820881888b4a64778c5e1b0a2ef8c6313fcdf2b6bc57fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/renderer/typeset/table/continuation/fragment/physical_rows.rs:35-53 | src/renderer/typeset/table/scan/row.rs:288-308 \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":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"64562e731eb09c8df252c31befea4217b3103891de001082a1ae9a63db7bf57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/renderer/float_placement.rs:6296-6309 | src/renderer/float_placement.rs:6311-6323 \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":"src/renderer/float_placement.rs"},"region":{"startLine":6296}}}],"partialFingerprints":{"codehealthFindingId/v1":"446993fa64033fd21a4bab4a33e7b90085f4474702701aed775aec5c17883a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/renderer/skia/image_coverage.rs:11-32 | src/renderer/skia/rectangle_fill.rs:11-37 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_coverage.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf081b0a7ac01cd7cf80c006808580d4b98a164c7ff95a244c2ef5a3017200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/document_core/helpers.rs:873-882 | src/renderer/skia/renderer.rs:2612-2621 \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":"src/document_core/helpers.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f72d0d3e77bf34d7b9df995d91ed9987bb0157dcb1233b0ff24601e7bd2712e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/parser/pdf/recognition.rs:552-577 | tools/pdf-ir-poc/src/recognition.rs:332-352 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d827cb3a8ebe4a4bebcf3b828bc82e6a376b01ae2c8bb38a36bb3c7b89c289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/renderer/float_placement.rs:6337-6359 | src/renderer/float_placement.rs:6457-6478 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":6337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce90dad84dee3854d71be16c0ba08d61e357765b861d716f0fe6fd2c2d8a2792"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rhwp-ooxml-chart/src/renderer.rs:536-562 | crates/rhwp-ooxml-chart/src/renderer.rs:618-642 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a762d160deb59fc9d03df0cf0ddf126ad758125c5a2fd9075cfd2a86082d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/document_core/queries/chart_extract.rs:271-283 | src/document_core/queries/table_extract.rs:292-304 \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":"src/document_core/queries/chart_extract.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7d5d795c73fecdc7c2f9cbe855d587362f3fb714477306ffab2ef3b72cac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/parser/hwp3/mod.rs:449-459 | src/parser/hwp3/mod.rs:473-485 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc49ceebb1007fad48f5fdb32c054786cc85debd3dcaf3843c57852a91ea12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): gym/certify.py:280-300 | gym/report.py:321-340 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/certify.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5647a9b60cd2babff5738949061d4ca37ee55db224a4e78385519e600bf0a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gym/certify.py:367-376 | gym/report.py:410-419 \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":"gym/certify.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87e3c18ccd08cc87402de3b9b8cd218848f86e79113a3a1621b77d78ecd97f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/document_core/native_pua_fonts.rs:209-220 | src/document_core/native_pua_fonts.rs:231-242 | src/document_core/native_pua_fonts.rs:252-263 | src/document_core/native_pua_fonts.rs:274-285 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/native_pua_fonts.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7bb33813a0830bf5b68ddef92aa2633718f5cd76cf0289268ff5c5dd27e0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/renderer/layout/text_measurement.rs:1152-1174 | src/renderer/layout/text_measurement.rs:1181-1200 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3e12299a4a10b4d9556aa5ee0aaa25b8e1e1b615f781b088610d5314f36944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): src/serializer/hwpx/header.rs:396-413 | src/serializer/hwpx/header.rs:724-740 | src/serializer/hwpx/header.rs:778-793 | src/serializer/hwpx/header.rs:937-952 | src/serializer/hwpx/header.rs:1044-1059 | src/serializer/hwpx/header.rs:1579-1595 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/header.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"20214b7c063cbd401ac894154131339cd45b7b66efc30239721f8ef43b0d1c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/document_core/hwpjson/pack.rs:160-174 | src/document_core/hwpjson/pack.rs:205-222 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/pack.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bbafcdd3a7549082feb0d17f6cf29b55342c9d0d7fd9abab018286add0eb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/document_core/queries/field_query.rs:1385-1411 | src/document_core/queries/field_query.rs:1502-1525 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7788970868f294d2709e776cbe8f5aeae3a542f5c4494b366697dd21b114fa8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/eps.rs:1929-1943 | src/renderer/html.rs:583-598 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f6e5bec0687bed29d670a099d603fb2eebebfb9294b4ff080ac31ec1fa7109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): src/renderer/pagination.rs:159-159 | src/renderer/pagination.rs:1114-1114 | src/renderer/pagination.rs:1139-1139 | src/renderer/style_resolver/resolved.rs:709-709 | src/renderer/typeset.rs:224-224 | src/renderer/typeset.rs:345-345 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"777a612b69932fc17ab8b85c89bbf4f88c0b0a9af60de81fab3248b4371aed02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/wasm_api/hyperlink.rs:81-93 | src/wasm_api/hyperlink.rs:96-108 \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":"src/wasm_api/hyperlink.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e29f1bcad9f47471e2443b01ccf34088c556e132075672a8b0de43dabe1c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/agent/dsel/parse.rs:526-541 | src/agent/dsel/parse.rs:543-560 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/parse.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ae7efb663ce53a81136d04fb3a0d2a966f56e9586a15712e93859668111af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/document_core/helpers.rs:215-224 | src/document_core/helpers.rs:229-238 \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":"src/document_core/helpers.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0ece1c1f1fe4f53802122620353c3bc2c246a0a1f8b26d16fc3ff2338e186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/renderer/float_placement.rs:2605-2627 | src/renderer/stored_line_ladder.rs:150-176 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a429d6d5db42473c87e7185bdb716e7eb8ef78b8beee132359ac5bfd6404a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): src/renderer/png_sampling.rs:60-84 | src/renderer/png_sampling.rs:91-99 | src/renderer/png_sampling.rs:101-109 | src/renderer/png_sampling.rs:111-120 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/png_sampling.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71442e7006945a2df8047298725b31456e4c09a9dfd68c3efd1466e35aa8ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/web_canvas/image_coverage.rs:11-22 | src/renderer/web_canvas/rectangle_fill.rs:11-32 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas/image_coverage.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7ed28c30d896df7cc2d75b4c2164937cce71e8dd82bfdb5d93c2514bc6023a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:588-600 | src/diagnostics/hwpx_roundtrip_batch.rs:424-436 \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":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961b26575933aab2b22560b194a31b451ee6d2b74d7442c52a48ed641fd0f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/document_core/commands/clipboard.rs:876-893 | src/document_core/commands/html_import.rs:163-179 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac299007fd5f0ba46ebe08ad68dc0cfc2e480a29acba8805953f37933b9230b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/document_core/commands/object_ops/picture.rs:299-313 | src/document_core/commands/object_ops/picture.rs:314-328 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bfa7157fe258b310879070288cdf1d4bbcf1a17f0197a63740d951bf659546"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/document_core/helpers.rs:823-834 | src/document_core/helpers.rs:891-902 | src/document_core/helpers.rs:915-927 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0ec6afe162fea009444e62405b98fadbd3cc1021345cecd10721351a2e12b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/paint/metafile_print/images.rs:28-39 | src/paint/metafile_print/text.rs:29-40 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_print/images.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab82be087f2dae349734cc88c558fc15ffc7ff238debc0c92af79241c144cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/bin/rhwp-agent/envelope.rs:179-189 | src/cli/metadata/capabilities/mod.rs:454-465 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38454d987d6e9ae48ad66d69ebbe9779799386f5b342f6d431b77ba6df7c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/diagnostics/layout_anomaly.rs:375-392 | src/diagnostics/layout_anomaly.rs:645-661 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"81abccee4c8b8dac872017ac8a5c4a19ad5dbb4aef2b616426ab13df9b23e8db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/renderer/pdf_raster_fidelity/pdf_page.rs:220-233 | src/serializer/hwpx/char_shapes.rs:52-68 | src/serializer/hwpx/package_check.rs:393-406 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf_raster_fidelity/pdf_page.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa452ee2979b8fb470c63fef724408e02fbc31ac893d2db37e0b61fb6e142a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/wasm_api.rs:4320-4343 | src/wasm_api.rs:4500-4518 \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":"src/wasm_api.rs"},"region":{"startLine":4320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c854cae93aaab9ea4760ef5c2462ffed279a7654221e3a8c3b8017ad59b93fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): gym/core/checks.py:144-151 | gym/core/checks.py:216-223 | gym/core/checks.py:458-465 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/checks.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7b5b9826ec7312fd2a108c14f34204a18e9a8f397daa7e092ad8b5409623f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/parser/hwpx/header.rs:463-475 | src/parser/hwpx/section.rs:1796-1815 \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":"src/parser/hwpx/header.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb85f00f7a2c5612d15b0de1bc92c278a4aa50d72212c137bfc93ead3918e8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/renderer/canvas.rs:332-344 | src/renderer/svg.rs:1486-1498 | src/renderer/web_canvas.rs:1809-1822 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"009a9a9e311b67f1a1e6aaa81fde999fe26283eb00388eb1aadc02f6795caacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/renderer/layout/paragraph_layout.rs:1157-1171 | src/renderer/typeset/paragraph/line_queries.rs:12-26 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"239431ac2780ba698fbba6951495eed37fe991a5dd36eb3ad15a518bfc516f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/skia/font_lookup.rs:123-139 | src/renderer/skia/font_lookup.rs:518-528 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/font_lookup.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af8bf408de4772a237970f629200cae6f695eab0a814f2f325c9e95dc73dcb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/scheduler.rs:277-297 | src/renderer/scheduler.rs:365-378 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/scheduler.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"789993fc14953b39ff03780f8593e59ad825c0639d74d61b7a8f4ae24d107d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/wasm_api.rs:1786-1796 | src/wasm_api.rs:1805-1817 | src/wasm_api.rs:1826-1837 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5cfa334bbbf9d5083bfaf16899efb0d4c933eb0182be6958741746844c04e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/document_core/commands/clipboard.rs:192-210 | src/document_core/helpers.rs:83-101 \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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb81b1a4da9bad45444652f0c9d5dd31f078edf6ba3edbf5c05cc262b760aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/cli/protocol/plan/template.rs:20-27 | src/cli/protocol/plan/template.rs:33-40 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/template.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"661b6e115c99a36d2840748282db7cc80b9d9b42073240c5ab25ecf1071953f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/parser/hwpx/header.rs:1233-1244 | src/parser/hwpx/section.rs:510-523 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f519515b133849327884ff1d1e452860e1bc50747b03dca699d1137b2e8c309b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/parser/hwpx/mod.rs:90-113 | src/parser/hwpx/mod.rs:115-131 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3442ef7dd6a6b1d772fe86615aa0184ff614ee2b92f792825582d683d969e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/security_trailer.rs:161-172 | src/security_trailer.rs:366-378 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security_trailer.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fca97494ea376c412bdea34ee9edef0a4114f9ca37acb47438fa0ab6270c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): gym/core/checks.py:396-402 | gym/core/checks.py:406-413 | gym/core/checks.py:417-424 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/checks.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bee8af1594bdcef6bc5f013a67543158d715a11ce265076a18a80ec22472215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:64-79 | mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:67-81 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71abea449eac8f3c16391af89b301c6fa2c1e4f40d7e6e3ca2cc7ffdccc2efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/renderer/composer/line_breaking.rs:3846-3861 | src/renderer/composer/line_breaking.rs:3863-3886 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3846}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cda8ac9fc130865b0a84d7954ba0551d90449b2f2b671c0b132dbfc5672161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/renderer/equation/font_frame_metrics.rs:101-116 | src/renderer/equation/font_frame_metrics.rs:119-133 | src/renderer/equation/font_frame_metrics.rs:136-148 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/font_frame_metrics.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe005a0e9eb98fe5703d39d6022bb69a2c1a612313ac1009f3af527cd4c7d756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/height_cursor.rs:2883-2896 | src/renderer/height_cursor.rs:2902-2915 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":2883}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f4177f20a9ea986e1231b3b7c4ae9a089b5ca729d271ed6eb01093e0d6443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/wasm_api.rs:8703-8723 | src/wasm_api.rs:8734-8755 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":8703}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d5c06988444d5242081b8d96309fd3b7610a153ddf312d1412b43fb6eaab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/wmf/parser/records/state/animate_palette.rs:41-57 | src/wmf/parser/records/state/set_pal_entries.rs:32-48 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/state/animate_palette.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e9178de41b125189f589a0ec958c28855d657e5b44b9da84357677c9fd242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/wmf/parser/records/state/set_bk_color.rs:33-49 | src/wmf/parser/records/state/set_text_color.rs:32-48 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/state/set_bk_color.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e23ec67e8d14346c14f9502ef45191b330b67663903f92b0b61f30bd21189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/parser/pdf/value_allocation.rs:265-281 | src/parser/pdf/value_allocation.rs:325-339 | src/parser/pdf/value_allocation.rs:389-404 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/value_allocation.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51821fa0b3dae017b479382d3bdbc77ea3c59b23d85302be04b2d3455382199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): bindings/swift/Sources/Rhwp/RhwpNativeHost.swift:17-26 | bindings/swift/Sources/Rhwp/RhwpNativeHost.swift:37-47 \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":"bindings/swift/Sources/Rhwp/RhwpNativeHost.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff5358716b1061ae8c34e0d7ad4f08004bb1d670f31407c9311e325c1f6c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mydocs/tech/investigations/issue-658/probes/inspect_658_selection.rs:15-23 | src/document_core/commands/table_ops.rs:2824-2835 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-658/probes/inspect_658_selection.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e6b4b581e10c35154b984a42ad6592de380ac81ac1362f0bc18346055785f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/document_core/native_pua_fonts.rs:294-306 | src/document_core/queries/rendering.rs:5040-5054 \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":"src/document_core/native_pua_fonts.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"21388002e5605604cdaaf6b8b8e3846ad55506b2ed65fe1ee76d4eca5e15dbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main.rs:482-492 | src/service/open.rs:348-359 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3373bdc5741bd6e226a56ec8c235c0a9de9d810408c748898ad2bf6a68966960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/parser/pdf/allocation.rs:394-403 | src/parser/pdf/allocation.rs:511-521 \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":"src/parser/pdf/allocation.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"936c8292ec906fd6f40485a42f17aac90cc9218cc8ee15dcd820917a8d234738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/layout/paragraph_layout.rs:1263-1274 | src/renderer/typeset.rs:1481-1492 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a03805824ef755d4f49ad3570dd7959325e343555b50fb6718a2a50c95009d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 17\u002B corresponding lines): src/wmf/parser/records/drawing/invert_region.rs:32-48 | src/wmf/parser/records/drawing/paint_region.rs:32-48 | src/wmf/parser/records/object/delete_object.rs:35-51 | src/wmf/parser/records/object/select_clip_region.rs:32-48 | src/wmf/parser/records/object/select_object.rs:38-54 | src/wmf/parser/records/object/select_palette.rs:32-48 | src/wmf/parser/records/state/resize_palette.rs:32-49 | src/wmf/parser/records/state/set_text_char_extra.rs:37-53 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/invert_region.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dfe14a4081278ca028fbb51deb16638cd523722092ea48a2b9dccc8d4afe85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): gym/tools/audit.py:498-512 | gym/tools/release_gate.py:564-582 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d109f42738dd8e009c69e6364223c3157715094ad6ab3187ab74046ae08a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/diagnostics/hwp5_first_para_control_probe.rs:1037-1056 | src/diagnostics/hwp5_first_para_control_probe.rs:1066-1092 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_first_para_control_probe.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bc693b9382536bb4c8a7e7e54cd1983bff59a17a7a0953bd46679fba0972cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/paint/json.rs:1652-1672 | src/paint/json.rs:1674-1687 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1625f0abac3347c7e75ddf5d2e4f0fb44a286153120d6bdd944cec20b18808da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/renderer/image_resolver.rs:832-844 | src/renderer/image_resolver.rs:952-964 \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":"src/renderer/image_resolver.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"26296a947d99ee6ff6c77a6dd3e5e23dc2ebc407582d3148c919938cb3857d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/layout/table_layout.rs:18789-18802 | src/renderer/layout/table_layout.rs:18813-18826 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2631788a1eeb13e09e4ca13eba92f28a144ace14cac57c5dd7fe9cbde74b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gym/core/checks.py:355-363 | gym/core/checks.py:469-477 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/checks.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"495f9914bba52906dc1d8ae0e174c15831caf664618ae21349a274f2df90a3d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rhwp-desk/src/commands.rs:141-152 | rhwp-desk/src/commands.rs:426-436 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/src/commands.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"258190cda831b64ba9cbc4625e3ddfab3488a8c565896bb823ab2fd6d46a79a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/document_core/helpers.rs:149-159 | src/document_core/helpers.rs:183-193 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9f49fd7f417b6c87b0198ac6ac3ca36c6b504cf829c3929aecace9f752b89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/native_host/gpu_d3d.rs:436-448 | src/native_host/gpu_metal.rs:322-334 \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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae74a814772216ac4a544e3a8997c682e65efe8804e7a644a183f8731355976a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/parser/crypto.rs:151-165 | src/parser/crypto.rs:190-204 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/crypto.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"42810f5d17fa14c60f41d057750c44a2e7cfcc65ee61a7cac2ebc3521ae8a281"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/renderer/layout/paragraph_layout/leading_justification.rs:175-192 | src/renderer/layout/paragraph_layout/leading_justification.rs:194-209 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout/leading_justification.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f339414627144786d0d6b6d7fb3b6dfc599b8f667a7304171f193e64c5fbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/rhwp-contracts/src/ir_schema.rs:803-863 | src/capabilities_schema.rs:526-557 | src/capabilities_schema.rs:563-592 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-contracts/src/ir_schema.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ca822aea52649f32ef46aad1672ceebad2b890fdf9111e0f890ca823d18218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/diagnostics/ir_field_sweep.rs:614-622 | src/diagnostics/ir_field_sweep.rs:715-723 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c3d0ac07112bd8b28c79f7c3f177fccd13222a0173fb94918a59f70c21064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/skia/equation_conv.rs:789-795 | src/renderer/skia/renderer.rs:2623-2629 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"10de794d205ddbe62e2a33c1ad5edffb3664aecc78eb67067e28c895426df9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/document_core/queries/rendering.rs:1847-1859 | src/document_core/queries/rendering.rs:2216-2225 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"f365beb710e0a36876646eec114f2d4f7f8b4031cfb5cc6f6b876cb42432f7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/native_host/gpu_gl.rs:1037-1053 | src/native_host/gpu_gl.rs:1057-1071 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_gl.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"f638ba8c4514184e6e467d5fe5700e51484f5ddba68c3cabbcebe9799576cc6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/parser/cfb_reader.rs:175-186 | src/parser/cfb_reader.rs:196-207 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a0ff43ab18612fe83b9d207a6824d87ed2e2a583973b17657f5f375bf00959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/float_placement.rs:9096-9107 | src/renderer/float_placement.rs:9109-9122 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":9096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8453a29d56571bb8d898907c7ed1e45265c4d1a6929db06de95a52742e853e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/renderer/shaping_vertical.rs:94-111 | src/renderer/shaping_vertical.rs:116-136 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_vertical.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46adc9fcc9eee67229f2279306f9e5587d22eec2eb7f09f1977516925504b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/serializer/control.rs:1283-1297 | src/serializer/control.rs:3104-3117 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7620344a800bcff30293dfeca05bc409e394bfcc3a7ac7cda5306f948ca2ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/document_core/queries/stego_scan.rs:280-291 | src/document_core/text_security.rs:660-671 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"74390802a0a95a130f3604af818e348c001195839829b2571abd9cca5feec66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/parser/hwp3/drawing.rs:135-148 | src/parser/hwp3/drawing.rs:431-442 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4121c11dd31b536b576c35772dff27f6dda328efdfe96314265fca5ddc469e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/renderer/composer/line_breaking.rs:3243-3252 | src/renderer/mod.rs:2384-2392 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"68038b465517d258da576cfcee40764e979710b27357b94fbcf218d94555b640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/renderer/typeset/table/scan/row.rs:226-243 | src/renderer/typeset/table/scan/row_entry.rs:78-103 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/row.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d00e8c02b759063994b5d751cf023006ad8daef1c1ad649036e4a4aa86e1dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/serializer/hwpx/picture.rs:368-379 | src/serializer/hwpx/table.rs:309-325 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a5b16823901126900926a69af4094eec7ec8d630ca31ce386a93d301570e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/serializer/hwpx/picture.rs:746-757 | src/serializer/hwpx/shape.rs:1659-1670 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0d4410442edf073444206530a3217defaba80e06d0a765897aafa57af7ae16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): .claude/skills/rhwp-knowledge-map/references/_gen_pack.py:301-311 | .claude/skills/rhwp-recipes/references/_gen_pack.py:392-402 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-knowledge-map/references/_gen_pack.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7b2de83b3e1948a6620980191b8b93e764b06c597b475ab645e2714b4cd130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): .claude/skills/rhwp-visual-regression/references/_gen_pack.py:1790-1797 | .claude/skills/rhwp-visual-regression/references/_gen_pack.py:1820-1829 | .claude/skills/rhwp-visual-regression/references/_gen_pack.py:1875-1890 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-visual-regression/references/_gen_pack.py"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"069863df38ae3722cd41e199b0916b018c74d7b8687cbda334651b137b0e09c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): bindings/Native/src/gpu_gl.rs:85-115 | bindings/Native/src/gpu_gl.rs:130-142 | bindings/Native/src/gpu_gl.rs:161-193 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_gl.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc2a3a216f33c8838bc3ffd84d2bd4a7a13dc1f81b66db0040f950471b2a8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:273-284 | src/diagnostics/hwpx_roundtrip_batch.rs:145-156 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de941c32581830b3826a1ebadde4a7f5657cdf7b91b303483ac9aade1111304"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/document_core/commands/text_editing.rs:6434-6448 | src/document_core/queries/cursor_nav.rs:788-802 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6434}}}],"partialFingerprints":{"codehealthFindingId/v1":"653b1fef280c2d21a404dc48e309b53761eb2cf659b1f17e87c0283960dc424d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/skia/synthetic_typeface.rs:67-77 | src/renderer/skia/synthetic_typeface.rs:122-135 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/synthetic_typeface.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17dc9c2b03686556f678baf50d8900548386219cbeade4753e7ca78f0db6d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/serializer/hwpx/writer.rs:76-85 | src/serializer/hwpx/writer.rs:88-97 \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":"src/serializer/hwpx/writer.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3eda759e19d9e9b3e975abbb4b7e999a8574898dc0442c8ad8265a805167c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/wasm_api.rs:4968-4987 | src/wasm_api.rs:5001-5021 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":4968}}}],"partialFingerprints":{"codehealthFindingId/v1":"60984fc52787bf073693fc55995336258a543b38620cf564b2e3df2c46308856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): src/wmf/parser/objects/graphics/pen.rs:24-39 | src/wmf/parser/objects/structure/ciexyz.rs:23-31 | src/wmf/parser/objects/structure/ciexyz_triple.rs:24-33 | src/wmf/parser/objects/structure/rgb_triple.rs:24-35 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/pen.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6016b48862a567c35ebe3910bb8507ee6f263f36008e2e443f5bd19a881ad962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/paint/json.rs:483-500 | src/paint/text_v2.rs:745-758 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8694b186d0248d232751a317c32b878ad771f6c5f4e5403a3b30e49ea610f506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/renderer/typeset.rs:1189-1203 | src/renderer/typeset.rs:1207-1215 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc20c4b1c079818498b1619369cd63ee7146e857247c7f1e690366624fa1ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rhwp-password-crypto/src/lib.rs:736-749 | src/parser/hwp3/mod.rs:109-124 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacaf82bc47fe207340883691b0efbd97626452b79ed94aed2bd7e5e741525be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 13\u002B corresponding lines): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:52-70 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:52-69 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:52-73 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:50-62 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:49-61 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:49-61 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:51-68 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:50-62 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e22f56276abe8e7bb26e083d75d3b94c164b115709217ca544bda4a62c77fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/document_core/commands/paragraph_block/template_operation.rs:137-153 | src/document_core/commands/paragraph_block/template_operation.rs:158-174 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template_operation.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd943d5869fa4e072af9856bbb18547a04db2857792c3295bd174cb99894dcf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/native_host/accessibility.rs:612-628 | src/native_host/accessibility.rs:632-652 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/accessibility.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd06c25f1f17677e4dfe576be3483d45e5e0d46641e746332b3279132c3f54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/parser/hwpx/section.rs:5571-5581 | src/parser/hwpx/section.rs:5583-5596 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3047ba99540f0c92c0431b1884fdd47080aed03a4477aa9b090bbc33269c35aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/layout/paragraph_border.rs:14-24 | src/renderer/layout/table_inline_picture_origin.rs:64-75 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_border.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e99ffc810b4a3bf05afe15ca7f9215807066813229c594581fc363e26d8ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/renderer/layout/table_layout/reflow_block_frames.rs:150-166 | src/renderer/layout/table_layout/reflow_block_frames.rs:210-227 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/reflow_block_frames.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"904bd7b8aea5322c76d5ad1661d5706608ff4eae0ee5d9e7a30b421e8fcd2640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/wasm_api.rs:3371-3390 | src/wasm_api.rs:5764-5784 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":3371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5683c492b663724d0b54de8d765534d4e0d1f5bc9cecc5e61b2ac57539c7e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): bindings/Native/src/gpu_d3d.rs:38-50 | bindings/Native/src/gpu_d3d.rs:64-74 | bindings/Native/src/gpu_d3d.rs:84-94 | bindings/Native/src/gpu_d3d.rs:101-111 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff03df8e6a596b70bd4f652fa6a9f1d12246700a71f6b438058c9c658e0dbad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): bindings/Native/src/gpu_metal.rs:67-79 | bindings/Native/src/gpu_metal.rs:94-106 | bindings/Native/src/gpu_metal.rs:116-128 | bindings/Native/src/gpu_metal.rs:140-152 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_metal.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d1f728002d900d900e012f451e1a34caccbd0affc8257a8ea2f2f10903b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/cli/outputs/vector.rs:863-872 | src/document_core/html_table_import.rs:1087-1099 \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":"src/cli/outputs/vector.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6060574db452227409c59aadbdfbeceb66d9a76f3dec074bb816ce1bfeb8210"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/diagnostics/hwp5_char_shape_audit.rs:552-561 | src/diagnostics/hwp5_contract_probe.rs:514-523 \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":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd452ed910255db7d0eeac79d5d06400ed5395cfba26dd2bdedcc4e923478ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/renderer/layout/paragraph_layout.rs:1226-1236 | src/renderer/layout/paragraph_layout.rs:1243-1256 | src/renderer/typeset.rs:1465-1475 | src/renderer/typeset/paragraph/line_queries.rs:32-43 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd479aa0e31331ee9fe4f8cbe79d7865ffccb348a5e93eecc9fa9851d2320aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/pdf_synthetic_bold.rs:94-104 | src/renderer/pdf_synthetic_italic.rs:80-90 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c83fd8c9c433ebcd81bb1d42e69624c2f2d25b772c2c3f31da0a9f55d920350"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): gym/tools/build_baseline.py:830-840 | gym/tools/discriminate.py:350-358 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/build_baseline.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc12e98642df2885f70739e3941d9833b550bde0e4ffe4e70b591a04d435cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/document_core/queries/hwpctrl_sets.rs:2372-2382 | src/document_core/queries/hwpctrl_sets.rs:2393-2399 | src/document_core/queries/hwpctrl_sets.rs:2402-2408 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0039b00535007bd4afcb6814365e1ecccaa04b118e24a097d81de18362abcb60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/parser/pdf/value_allocation.rs:282-292 | src/parser/pdf/value_allocation.rs:293-303 | src/parser/pdf/value_allocation.rs:308-318 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/value_allocation.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ce8659cbaee2ddde638347eb293625251264674b8e2a85e4f5d011ec7b1a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/anisotropic_sampling.rs:10-16 | src/renderer/cubic_sampling.rs:9-18 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/anisotropic_sampling.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc02ce4548219ddd4a80b2fedc72f0659f9090b5476d046e662b78a40de07a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/renderer/height_measurer.rs:7017-7032 | src/renderer/pagination.rs:75-91 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":7017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a7f90438b0517585a644848905d0ad470731488ffc516af0d0b91f6e39945b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/document_core/commands/text_editing.rs:1211-1222 | src/renderer/layout.rs:1886-1902 | src/renderer/typeset.rs:1052-1067 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a16616ee61e5d36e9e96a643353a96ae4a3efbc472fbe3d8d2709fd414b323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/eps.rs:120-128 | src/eps.rs:134-142 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf1e33dd0b808d75cbd04b3028b95e0312d6e57d6a512304b96bace0c02a08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/model/bin_data.rs:279-287 | src/model/bin_data.rs:290-300 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/bin_data.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d3a395f9be2dda04827b9cdec2c30e30f40a5c257a59e8ca9ff375f5ec2b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/layout/table_layout.rs:11525-11540 | src/renderer/layout/table_layout.rs:13735-13745 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":11525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc066c7b735dd34a0048cc651829cea01dcd147231e5afcf86bd7994240c914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/renderer/typeset.rs:1161-1174 | src/renderer/typeset.rs:1176-1187 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f6c4c10770bfb45532c468bfa1544f144062301d6bc86035ff8a9b38d23b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/ole_chart/grid.rs:498-506 | src/ole_chart/parser.rs:400-408 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/grid.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6876fc04ddf9a38ef51bc94a0c2311a5f770e46bd1417efb7ea127cf1703f633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/paint/metafile_print/images.rs:15-25 | src/paint/metafile_print/text.rs:18-26 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_print/images.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f5182262e84a0e6deef1ffffbd330d18e0566e435a68ab003ea31219ef154a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/parser/pdf/recognition.rs:650-657 | tools/pdf-ir-poc/src/recognition.rs:401-408 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d85bf5af55c5e70e0830dff44339ce5b6490a0ed7ae1fa802c11b951bffd305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/serializer/hwpx/section.rs:4098-4114 | src/serializer/hwpx/section.rs:4127-4143 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba09cec6c976b9750450eb253f9bc235ccaeb4bf30e464343f7d478cdfe6478"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/model/style.rs:677-684 | src/model/style.rs:686-693 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2c1170a0e4e21ad228d36a9b0f71b165b905cce1dd57b699b3ba65730a42f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/parser/hwp3/ole.rs:80-93 | src/parser/hwp3/records.rs:293-305 \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":"src/parser/hwp3/ole.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d89a2cdd5b01cf072f755660505c01f6d846642e304c619cb6711436b45ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/renderer/equation/logical_font_frame.rs:54-63 | src/renderer/equation/stored_alignment_metrics.rs:7-16 \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":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbad457819a8c2d1acbf96243905ab519627f462f84e985f242ca1d15b89a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/wmf/parser/objects/structure/bitmap_info_header/mod.rs:167-177 | src/wmf/parser/objects/structure/bitmap_info_header/mod.rs:179-186 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/bitmap_info_header/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"655620924a594a279586e730fcb562675bd0bdb2d6424b1b4c6acb0d2a6ba3c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/parser/cfb_reader.rs:283-295 | src/parser/cfb_reader.rs:309-318 \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":"src/parser/cfb_reader.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e772d7320b6a2cac0efbc8f2a52b3533ef7d34c783d4487559872e70aead5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/font_metric_contextual_scripts.rs:688-701 | src/renderer/font_metric_supplementary_pictographs.rs:254-267 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_contextual_scripts.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"575aa564ac2b5d05553dc7dd6045dca561f4737185cd5c19a526184fd2e8ce0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/wasm_api.rs:6373-6385 | src/wasm_api.rs:6398-6414 \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":"src/wasm_api.rs"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c043d74bfb224dc0c88b5aeb1a3cd76e06f36d37ff53db4b80cc1702b3d038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/diagnostics/hwp5_cell_header_probe.rs:642-646 | src/diagnostics/hwp5_mel_personnel_probe.rs:551-555 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db7104f536e8843de920b9057307e8dcf022da533618e1f9aa662702f224ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/document_core/commands/formatting.rs:260-271 | src/document_core/queries/cursor_nav.rs:911-923 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aeaf7089f3f8d24ab645718bf4b3d3208e4ce9f12f0ee73c641af87c3413c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/model/paragraph.rs:804-818 | src/renderer/composer/line_breaking.rs:3629-3642 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d3d0dd952ce990ccdfe5caf0bf9b39994c187e0d02c1de540cfca57081a8fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/model/shape.rs:617-630 | src/model/shape.rs:632-651 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/shape.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"382bab1bed9ccf7063dcf827d5ead17c6e14c8542a8e9410c324805907bf0e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/parser/hwpx/section.rs:2197-2211 | src/parser/hwpx/section.rs:7046-7061 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"915d5bd828c07a10cf03e03fb8136e255262e0cccf39ab4b176a1abe024c6384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): bindings/Native/src/gpu_d3d.rs:162-173 | bindings/Native/src/gpu_gl.rs:240-251 | bindings/Native/src/gpu_metal.rs:173-184 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"92583f477b9def099325f3e818dfde5c1ccc1e3684b08467c402d52aad88e904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/cli/document_io.rs:78-85 | src/cli/document_io.rs:90-97 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/document_io.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bd7da7b30977d8c6e656b2608a78861ac4e0f5242846be36743dffb5107b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/native_host/mod.rs:302-314 | src/native_host/mod.rs:323-335 \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":"src/native_host/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b398494e4a0ef7c0cef2db4b1394bfa49e754f7cd47e92d4de38a83730bc43b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/renderer/image_resolver.rs:306-318 | src/renderer/image_resolver.rs:330-340 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e5ddb48ae2a9fe7f95b63bfc432e76a90d8ae1ba3ed7fee8e7b6d2fba19e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/renderer/layout/shape_layout.rs:256-272 | src/renderer/layout/shape_layout.rs:298-312 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2519b65dc3099110b1ba574e0da23fdd76baf966f3bc8f96d9b2c35e5e565a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/serializer/hwpx/picture.rs:706-733 | src/serializer/hwpx/table.rs:233-267 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"00463cdd24b82255bf71ad8aa58cc4bd2fe108a0ba7448d6291dbe37fe189061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/parser/body_text.rs:898-912 | src/parser/body_text.rs:954-967 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdf8279c32f8e4b238bee91d8008ba9ecb99604e70427524427369c1fcd026d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/parser/hwp3/drawing.rs:378-390 | src/parser/hwp3/records.rs:433-439 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a13b0180959236fcc34de949e1380231e312e26eb4bdf81c90b9da25ee61960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/render_backend/png_adapter.rs:119-129 | src/render_backend/skia_adapter.rs:131-141 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/png_adapter.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0e06cc2cdbbce2841b0e721a0d68cded07f9045b1d081c0b5a95d1692eb13f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/serializer/control.rs:980-992 | src/serializer/control.rs:1110-1122 \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":"src/serializer/control.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e74ee30115c1a0768a349898f694f6724ce7d05282a47d9c2a5412b29731903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 1\u002B corresponding lines): src/model/style.rs:1335-1335 | src/renderer/composer.rs:246-246 | src/renderer/inline_flow/floating_shapes.rs:26-26 | src/renderer/layout_frame.rs:453-453 | src/renderer/mod.rs:186-186 | src/renderer/mod.rs:198-198 | src/renderer/pagination.rs:457-457 | src/renderer/space_compression.rs:9-9 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a210ef3c34401852f5713f2cc15f187693d85e84bc45ef515d81d8c8053953ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/parser/hml/reader.rs:1030-1034 | src/parser/hml/reader.rs:1041-1045 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/reader.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e99f2f8438020cb1b36270188c2ebb62200052dd9f04e398373ee3a5ea613ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/parser/hwpx/contract_streams.rs:142-150 | src/parser/hwpx/contract_streams.rs:153-161 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/contract_streams.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5a2fd0d045a5ce3ce5d3216c25ff20f0a27d84f66b75ba76b23a4cf3e22ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/parser/pdf/allocation.rs:54-60 | src/parser/pdf/allocation.rs:74-80 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b001fd83a3c27cedc86570a0d2abaa6654fc364b2c9526bfc29de3b6f9423df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/serializer/hml/head.rs:157-166 | src/serializer/hml/head.rs:200-229 \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":"src/serializer/hml/head.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc134dbd048fc0cb14e942ad24b2b31592bac75769538c0f00bdc1a1d14b91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/document_core/commands/object_ops/chart.rs:1266-1276 | src/document_core/commands/object_ops/chart.rs:1309-1322 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9dd8e6c1d44ce2781492cae1589a835636e67abcc2ab2a1521a772874c38a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/mcp_serve.rs:1768-1775 | src/mcp_serve.rs:1777-1784 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_serve.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bb8970e8e5f23ba780d530e2d163c82094a9a4a48a40c485215af9cb17b895"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/model/control.rs:107-116 | src/renderer/typeset/controls/stored_tac.rs:26-34 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0d9d9e419165c897c8e33a7c9485b21ff1d4dc08108eea21628bc1f465b76d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/paint/shaping_glyph.rs:592-598 | src/paint/shaping_glyph.rs:600-605 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7de3eae51d934e349e26256538826af828b948d8731799d436592cc71e2a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/renderer/layout/table_layout.rs:6490-6503 | src/renderer/layout/table_layout.rs:22704-22716 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811204a9125def328d81c8a2b2cc4983c30c754543664d932819b9b1ed94819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/serializer/hwpx/utils.rs:82-89 | src/serializer/hwpx/utils.rs:105-112 | src/serializer/hwpx/utils.rs:123-130 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/utils.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fef832b67a2148b2874f6400f1d215c8200480afeb6c7eda62dc4ec87cb4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gym/report.py:250-256 | gym/certify.py:256-261 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/report.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f29d37fe2dbd15ffe860b0dbfdb4b8b793116621e767c2179325484f8a40c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/document_core/commands/formatting.rs:2877-2887 | src/renderer/mod.rs:2865-2872 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"521fa7e8ea0da30e51c1f405f3580fb79d24ca0779d09684053ece5461ebce81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/parser/hwp_summary.rs:28-38 | src/parser/hwp_summary.rs:46-53 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp_summary.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"923e0c0c152107b4b66af16ae232d43cc67e225fe5b6437ec333580710518cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): gym/tools/competitive_bench.py:919-924 | gym/tools/competitive_bench.py:928-933 | gym/tools/competitive_bench.py:973-981 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/competitive_bench.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8774b8654784915db2d4404a56756631b1e91752bf62fafe677215047aba9b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): gym/tools/robustness.py:1149-1156 | gym/tools/robustness.py:1160-1172 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/robustness.py"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"78943e80e6b57037438cb639177d5f985a82eaf1cc447237a629b1f983ab3254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/equation/variable_outline.rs:188-194 | src/renderer/hft_outline.rs:156-162 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/variable_outline.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca0037fc48e20ed4505bf48b6e242a482dc726e9b05b71f39b1e9c022e8f34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/layout/table_layout.rs:871-876 | src/renderer/layout/table_layout.rs:894-899 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa048abaa7bedd4f876bbfd8bee80a78a5dab8700a49d4c6b2b42911cc07c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/serializer/hwpx/header.rs:590-600 | src/serializer/hwpx/header.rs:609-628 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/header.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"345fdd75b32c45ff427525593e59aec5e13b6863471e1a1da73eff3976e68651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/serializer/hwpx/picture.rs:264-280 | src/serializer/hwpx/shape.rs:952-967 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe0b0ffa9f9a4b47f7780c3053b188fce650fc3fe78a454deae2c2baf25444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/diagnostics/hwp5_cell_header_probe.rs:663-675 | src/diagnostics/hwp5_mel_personnel_probe.rs:572-584 \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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"804450c3c4ecf6de55e272f5f0cb12813a63ae1d9058043ce4173087ac80fe10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/parser/pdf/lowering.rs:35-38 | tools/pdf-ir-poc/src/lowering.rs:30-33 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9fb7c5008d1779a9cecca2fe922eebd2d4dc12ca8198e677ccbd77dd33301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/renderer/typeset.rs:969-977 | src/renderer/typeset.rs:2529-2536 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e5c63d0fa6944f0929b05eb4b1a91d2d85214fadfd6ba807a7417b0de40abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): src/renderer/typeset.rs:3821-3843 | src/renderer/typeset/controls.rs:105-124 | src/renderer/typeset/paragraph.rs:157-179 | src/renderer/typeset/paragraph.rs:964-989 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4d20f936257eff41b1431eb3a49655ea57af4639f27da602b3b59a9e3c8035"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/agent_dominance_metrics.py:129-133 | .claude/skills/rhwp-explore/references/_gen_pack.py:1357-1360 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/agent_dominance_metrics.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe1e6179fdc3317e4db2dd9c48d6961563d293404cfc12ee5fc8100f4d48983"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/document_core/hwpjson/body.rs:151-157 | src/document_core/hwpjson/fonts_charpr.rs:94-104 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/body.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d522397de44a0db8164f5a504abf58ef3642f517e83e75e5a75c2651ea538ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/parser/pdf/structured_lowering.rs:1496-1504 | tools/pdf-ir-poc/src/structured_lowering.rs:417-424 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"63585cc63b65110f585393f69990676fbbea31de232bbcb00838fc5ed3d908c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/renderer/layout.rs:4448-4456 | src/parser/pdf/structured_lowering.rs:2137-2144 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2ea9457bc0f83971884e7ede891bfc303497d38d9a6497a9e5731e15665992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/layout/shape_layout.rs:3201-3209 | src/renderer/layout/shape_layout.rs:3211-3216 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b16989e5861bd883ba4bf94f42caf61a9a0813d874350b4686a612848d3d732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/document_core/commands/object_ops/chart.rs:180-186 | src/document_core/commands/object_ops/chart.rs:193-204 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7dd575a07c50e0b2327ee7870f62f7f96082edbb8ba8c38b80cc9a1cd59957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/native_host/gpu_d3d.rs:333-341 | src/native_host/gpu_metal.rs:222-232 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a588c3ac680b7d8667bd297ca9e70bea8eef89cc80038afaefd79d75a8e76f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/float_placement.rs:7954-7960 | src/renderer/float_placement.rs:8593-8602 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":7954}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f81d2b67a0263e02c2c5bc094a58684ff8cfb53920a1d42259e737a1e72118a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/document_core/commands/document.rs:1952-1960 | src/renderer/pagination.rs:181-188 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f494dcaf7c1c6bdea3926744cea07b9e43b93cc1e9eb718fe0f7abc0f8b4cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/renderer/shaping_vertical.rs:609-619 | src/renderer/shaping_context.rs:349-357 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_vertical.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd8ba4d8aa393d5f03f05bbafbcf59297892eb16748fa8b30aa09da83f5f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): gym/tools/differential.py:444-455 | gym/tools/release_diff.py:500-509 \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":"gym/tools/differential.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"525296296a4c35605529c00c8b7c58effea1a69b051ee74131d0ade3e599bb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/renderer/composer/line_breaking.rs:3663-3675 | src/renderer/composer/line_breaking.rs:3678-3685 | src/renderer/pagination.rs:1517-1532 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad0bba6be99ddc1807bc8be00af9a8938af80b50f3dcda8e6b9ba4b9b055db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/document_core/commands/paragraph_block/import.rs:54-74 | src/document_core/commands/paragraph_block.rs:60-88 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75e82d4c2b661f383d14d36ad9fe637edfd4c6d817a9f10163b34df7f933c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/document_core/queries/font_metric_coverage/report.rs:66-77 | src/service/open.rs:391-402 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_metric_coverage/report.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9071cbc18cad0e2cbd29cebce4b657927402d23930a203905843ed34fb6a6c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/parser/pdf/allocation.rs:218-225 | src/storage.rs:187-194 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaf8253a4bc4b0901c59170db43bf641a783299b01a02caf0a0e4838c4b5018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/renderer/height_measurer.rs:861-868 | src/renderer/typeset/table/continuation/fragment/physical_rows.rs:21-28 | src/renderer/typeset/table/scan/row.rs:278-285 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4033b01034c8db509e9a1b2193d627a074cdc0e78b6c65e3b6a83a8efa01a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/parser/pdf/allocation.rs:206-213 | src/storage.rs:170-178 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac83466e92eba72073911ae7563ffb0146f8e782874031770ffc1ef7fdb85f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/renderer/composer/nested_table_frames.rs:28-44 | src/renderer/float_placement/reflow_block_lines.rs:20-33 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/nested_table_frames.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab7d2c3840ad23503ec36919ed400023ea352c4191bb0e246b53f43b3cc7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/parser/body_text.rs:398-408 | src/parser/hwpx/section.rs:605-616 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/body_text.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1bb146595ce95e72ceaa811957105b1e85a6cb89a4b9e835f831c2d1f3e048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): src/parser/pdf/table_detection.rs:569-571 | src/parser/pdf/table_hierarchy.rs:50-52 | tools/pdf-ir-poc/src/table_detection.rs:309-311 | tools/pdf-ir-poc/src/table_hierarchy.rs:49-51 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a96176361ca4232cdf151a826e9dc643eb6e0cbba6718dc19913cb311878ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/parser/pdf/table_hierarchy.rs:41-43 | tools/pdf-ir-poc/src/table_hierarchy.rs:40-42 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d176c817a56f8962fc437e9bf1a5405cba7568d385c3aeea9ef206d037e3dd40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/renderer/composer/line_breaking.rs:4275-4284 | src/renderer/composer/line_breaking.rs:4332-4340 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9135dcfae8aa3ac7b5bba32f18e1d1f1fd0e0bdc3406776868358ed333a400d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): src/model/border_paint.rs:1195-1204 | src/model/table_row_grid.rs:470-479 | src/model/text_clip.rs:275-284 | src/model/text_paint.rs:150-159 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"12206ebfaf6ad7d59f8814013d950896c7c6012334a3e1258e30946f3e1164a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/render_backend/png_adapter.rs:104-111 | src/render_backend/skia_adapter.rs:116-123 | src/render_backend/svg_adapter.rs:89-96 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/png_adapter.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af74a8824247e449ffedf3e82f0d2fb71a3f814f15e48766594bc36b34530e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/document_core/helpers.rs:1046-1051 | src/emf/converter/svg.rs:47-52 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"3683758d50ec628dc342a367d07d3ff83ba19a781158d77663d5f7a3ad60210f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): src/parser/pdf/recognition.rs:130-132 | tools/pdf-ir-poc/src/recognition.rs:96-98 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8030f7ea19eec464bc2f435b31fd8eb2e144485aed6d7ed0684fb0114c8556e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): .claude/skills/rhwp-exam-ingest/references/_gen_pack.py:37-39 | .claude/skills/rhwp-form-fill/references/_gen_pack.py:414-416 | .claude/skills/rhwp-knowledge-map/references/_gen_pack.py:295-297 | tools/inspect_msec/gen_msec_fixtures.py:571-573 | tools/layout_anomaly/gen_m02f_fixtures.py:426-428 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-exam-ingest/references/_gen_pack.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbacb3f14a3a4ef19206a3c9aec0eee4500b4305696ff57a69520cf870d3e290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:188-200 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:121-133 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:162-177 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:115-127 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2391b9672a5309f02327198071a014123735c7a6df47b8d592bf731774bd154d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/diagnostics/hwp5_roundtrip_batch.rs:258-269 | src/diagnostics/hwpx_roundtrip_batch.rs:133-141 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"18096bcc3fb418adba33265c971f7081cbca2d27cf41e603d1f89bcb9e469b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): gym/tools/differential.py:927-929 | gym/tools/release_diff.py:856-859 | gym/tools/release_gate.py:857-860 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"09993ddc0a5386c20260bbf8086f7fef2ec26349aa39dd039e8c01dfb2aa972f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/document_core/commands/object_ops/common.rs:179-186 | src/renderer/typeset.rs:1043-1050 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4eef3d9e60e51e5be9715a637dff8e0073726fa50f85ffcc0d6d2568da5212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): src/renderer/char_overlap.rs:32-32 | src/renderer/height_measurer.rs:1816-1816 | src/renderer/layout_frame.rs:86-86 | src/renderer/pagination.rs:315-315 | src/renderer/typeset.rs:208-208 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/char_overlap.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"052c47de6171a43a54ab4fe7a157fc40ea65c77e4c2d86e4dea812def5f1b44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/renderer/equation_tac_flow.rs:253-269 | src/renderer/layout/table_layout.rs:146-163 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation_tac_flow.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44ce89db7acafcf0155938d9c538b077d4840544e61aa89bed9d43449106209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/renderer/layout_frame.rs:396-396 | src/renderer/pagination.rs:442-442 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout_frame.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab26ed144f7123692cdc4656c448bc59ed8ca39d2fc92b65f88ebd5030c717f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): .agents/skills/bug-hunter/references/_gen_pack.py:1145-1148 | .claude/skills/rhwp-bulk-pipeline/references/_gen_pack.py:235-238 | .claude/skills/rhwp-cli/references/_gen_pack.py:493-496 | .claude/skills/rhwp-codex/tools/gen_skill_pack.py:24-27 | .claude/skills/rhwp-explore/references/_gen_pack.py:1350-1353 | .claude/skills/rhwp-fde/references/_gen_pack.py:228-231 | .claude/skills/rhwp-visual-regression/references/_gen_pack.py:424-427 | tools/proptest_roundtrip/gen_m04f_catalogs.py:304-307 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/bug-hunter/references/_gen_pack.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"476d5c493a884df7316df3f9d8197b062acd77ce92ca11141e44e29701348e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): bindings/Native/src/lib.rs:483-494 | src/serializer/hwpx/roundtrip.rs:1849-1856 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fa9e583412cadbf2d9f0849450e2749671c281bfb99fac359e57e5f429486a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/diagnostics/hwp5_contract_analyze.rs:961-966 | src/serializer/hwpx/section.rs:4080-4085 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc0203a23cabd470c9da87eefb452436744daeb5b9f28303f2ced777f32378c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/document_core/converters/hwpx_to_hwp.rs:2601-2607 | src/renderer/layout/shape_layout.rs:123-129 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97dbc383e0f0867e7a8aa071a1582196d51e96fedffdc121869a9a92c1adcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/renderer/composer/line_breaking.rs:519-536 | src/renderer/composer/punctuation_slots.rs:42-53 | src/renderer/composer/supplemental_clusters.rs:54-65 | src/renderer/layout/text_measurement.rs:940-951 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf92b7ee8744863c2460c492d84e7d6636a315d45fd7d65338ca7b8187dc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): gym/score.py:103-106 | gym/tools/build_baseline.py:929-931 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"gym/score.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb4d392826b6179595154799a7e4f68d9efd08b23927c49befd7b6756bee9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/doclang/resources.rs:123-132 | src/serializer/hwpx/context.rs:891-901 \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":"src/doclang/resources.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da22da5afef3385a1553847b292c35902859f1cb7a621e21aa86471763dc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/document_core/queries/hwpctrl_sets.rs:41-48 | src/parser/pdf/table_paint.rs:108-114 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed213fdf84896d6529302103938618b6c42a7aa87371cda247f993940c9481cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/paint/json.rs:3764-3774 | src/renderer/canvaskit_policy.rs:2436-2445 \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":"src/paint/json.rs"},"region":{"startLine":3764}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caa6d43cb6dbe9d6de49e85f9fe19bf6d575bda8dd14f6e7e312a23c15371d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/wasm_api.rs:1164-1169 | src/wasm_api/layer_export.rs:103-108 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d830daeee525ba9dc01411a10cbea701cc5291e5cb735dc66f401f068f02cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/parser/hml/reader.rs:1847-1856 | src/parser/hwpx/header.rs:31-40 \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":"src/parser/hml/reader.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb336af10236bc05f4ec98afe50a341869e3c00d3ace7678ff24572a263b1830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/rag/chunker.rs:48-59 | src/renderer/composer/line_breaking.rs:1371-1385 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rag/chunker.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb897ad920b75f7381a4e2a760cf25c91857f78a814abcf483e12581b94f914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/equation/svg_render.rs:791-796 | src/serializer/hwpx/form.rs:55-60 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da968a61987716670fbba5e7d1a33c91fd6d81cc27d5c7a489a25145674fd07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/doclang/resources.rs:239-244 | src/doclang/writer/mod.rs:309-314 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/resources.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e0c47fcedb65f0086ad8227308deb23a487bc29fc61aae9f9451afa9904579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): bindings/Native/src/session.rs:708-712 | src/native_host/presentation.rs:36-41 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"bindings/Native/src/session.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081f20c8d11149d99e40034e075fd90dad28c71e28a611583a20300527b99c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/renderer/composer/supplemental_clusters.rs:14-23 | src/renderer/layout/text_measurement.rs:895-905 \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":"src/renderer/composer/supplemental_clusters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3402a6dfdf8ba39ab77904edc022319aacb763196d01ed277c498dfa04aa6c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/height_cursor.rs:131-137 | src/renderer/typeset.rs:926-932 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8ad482e293c337a14c70a2f990a2003d09433cc31b6ed240f9f29adf667160"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mydocs/tech/investigations/issue-8174/probes/library_consumer.rs:8-15 | src/document_core/queries/memo_query.rs:224-231 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-8174/probes/library_consumer.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6593ccf94379898757bddd99514bfa6a435cfa1cf282ce97892f4607ea86bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/diagnostics/hwp5_contract_analyze.rs:646-652 | src/diagnostics/hwp5_inventory_diff.rs:2225-2231 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c179bb833b4b25dde9d8d98b652f06218304b4be3f093c572349f93890dcdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/emf/parser/mod.rs:479-482 | src/ole_chart/grid.rs:513-516 | src/paint/color_glyph.rs:437-440 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/parser/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d0cbff66d7c7b488452cdcf3d09f872f6831db2cf352aa2541157a8a1806a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/parser/hwp3/mod.rs:544-550 | src/renderer/pagination.rs:1534-1540 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"696979f2c480ead3a0bb105857af45458de52763c2d6589ccba5b0590cd0e5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/serializer/char_shape.rs:90-93 | src/serializer/hwpx/char_shape_tables/attr_bits.rs:57-60 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/char_shape.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1076068e1013408ff36e1674cf7509adc3fffcfc1b902a1f6b4d73570d3ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/renderer/composer.rs:176-183 | src/renderer/composer/line_breaking.rs:459-466 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52ced69bfdcf306d2466caac9a29cd6f1cd312a2a2dc229689c8f749e579e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): .claude/skills/rhwp-chief/_gen_pack.py:92-95 | tools/provenance_map/fatten_provenance_map.py:64-67 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-chief/_gen_pack.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78745215df229635afff4426d2a78896e3c01115ca821d6b71d1d0c22c4f40d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs:11-11 | mydocs/pr/assets/seo_rii_20261030/consumer_probe.rs:11-11 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"166c7c456320bba2773aaecf98a1287bb3a969b0a4230b1d2618434d142a4b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/render_backend/png_adapter.rs:89-102 | src/render_backend/skia_adapter.rs:101-114 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/png_adapter.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315dcc84e5129894afd99925d734fbbc5b91a18558dc86c1e7e98068a8ff061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/paint/metafile_picture.rs:72-79 | src/renderer/image_resolver/print_picture_resample.rs:62-68 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_picture.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a869035bca7f82e329f0b558b151f254b3992a89bcaadf67c29b51976e8cd329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/parser/hwp3/mod.rs:5528-5540 | src/serializer/hwpx/roundtrip.rs:774-782 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5528}}}],"partialFingerprints":{"codehealthFindingId/v1":"98de2095d73a1b1737db6e7f8c1fce2c61e66f3c5fdbba4cdd3bcd0c87bf89df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): gym/tools/fuzz_corpus.py:908-910 | gym/tools/robustness.py:750-752 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0615f1754cf13e93791d9dc952fb5e91353e73b3705a829b13ea29b72c95272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): pdf/issue7998/generate_native_border_sources.py:5-5 | pdf/issue7998/generate_periodic_border_sources.py:5-5 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"pdf/issue7998/generate_native_border_sources.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab74ae4a02a5c0238e3d2367c67a705a81173e453baaa751810b5e61c68fb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): bindings/Flutter/lib/src/native_document.dart:120-122 | bindings/Flutter/lib/src/native_ffi.dart:100-102 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"bindings/Flutter/lib/src/native_document.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ec27dc85b5dc8a6b546f6ee112d9eefb18a3c0a9718c55045d9fe7004b76f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): src/agent/dsel/ast.rs:229-231 | src/docdiff/model.rs:299-305 | src/parser/tags.rs:366-371 | src/serializer/doc_info.rs:589-594 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/ast.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a4a067d21abc55693e399af3ce41e075e7cea8afe72f661eae163f23467629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/equation/layout/symbol_advances.rs:201-206 | src/renderer/hancom_pua.rs:104-110 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/symbol_advances.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6bf196a3a6858d4f0d714c247c90d727251d17ee160af43c69dc7b44d113fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/layout_frame.rs:508-513 | src/renderer/supplemental_metrics.rs:474-479 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout_frame.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d3331d52f5d830995e44ecf3c039fbfc5dde8f800684dadc8c289f8ce20f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): gym/certify.py:273-276 | gym/report.py:344-347 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/certify.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9e7a8052f3d836aa03ab0d0dac6bd7de1c833ae0fb6f73763ab1ae24193d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): src/diagnostics/hwp5_cell_header_probe.rs:699-702 | src/diagnostics/hwp5_contract_probe.rs:607-610 | src/diagnostics/hwp5_mel_personnel_probe.rs:613-616 | src/diagnostics/hwp5_table_probe.rs:358-361 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f336de92e19f94509b581a7fad46e4a3108f805275a996539bff82d09768b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): gym/report.py:304-309 | gym/tools/discriminate.py:637-642 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/report.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94b360ada50443f172a05bc0a401abf72cd68c6ebbadb9723fac91cd0a92c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): gym/tools/build_baseline.py:711-714 | gym/tools/competitive_bench.py:532-535 | gym/tools/discriminate.py:178-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/build_baseline.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa0a534682d975b9055cebb2842c62dca24e122f9cbf13ce36721cfa1becbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/renderer/height_cursor.rs:139-145 | src/renderer/typeset.rs:910-916 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e381e28c9b5f74efb0d2940137dd6ef015e00d6ad2fa367e6b9bf9cf1e4b58b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/renderer/layout/paragraph_layout.rs:4746-4762 | src/renderer/layout/shape_layout.rs:1595-1615 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c041025514e5d84d75806ed76f56ac9830cb65b88b79faefb90df06f457dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/rhwp-password-crypto/src/lib.rs:912-919 | src/document_core/helpers.rs:322-327 | src/serializer/hwpx/field.rs:65-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8548906cc56daae3668ba3d02574fb96b2a94e6d81cf84c1b010255312d831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/renderer/composer/frame_geometry.rs:58-64 | src/renderer/layout/table_layout/declared_first_frame.rs:13-17 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/frame_geometry.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c8451c5e15119127abc5e3cd5d6bc4f8330d6979c6ace990b13a5ec1b9293c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/renderer/composer/line_breaking.rs:1853-1858 | src/renderer/layout_frame.rs:774-779 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b41ccaf78f815251ccef86c3e972e5b43d66ef1e12bdd5810f68c11e6607a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/renderer/hft_outline.rs:30-37 | src/renderer/pua_glyph.rs:107-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/hft_outline.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d2b5c94405dc7ad72daa1680b83d98e9bcedd6adbc30383c30f01a8c5ab6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/paint/json.rs:2344-2350 | src/paint/paint_op.rs:913-918 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd171e8a670c02729e65249133b7deef1123318e53c433c096eea4d49b734c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/document_core/queries/rendering.rs:1819-1825 | src/renderer/layout/utils.rs:44-49 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"be57c1c197679652a2ab09d58bb2a0467f71022ca6c94c5c06a21b58cd8767e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rhwp-ooxml-chart/src/patch.rs:302-306 | src/cli/commands/edit/cells.rs:199-203 \u2014 These two members are one piece of code written twice and then edited apart: 5 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/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c9bf6f203faea5a25491afb1a2036339f7a788517e4a75ec24ee29471dbf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (120 lines \u00D7 2): src/renderer/height_measurer.rs:4025-4144 | src/renderer/height_measurer.rs:5041-5160 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:4025\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e81c01e42b64898c9b5f9e49a7ec21bad227355f1d9ff8eb4cd03d47e2b668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (165\u2013176 lines \u00D7 2): src/document_core/commands/formatting.rs:434-609 | src/document_core/commands/formatting.rs:619-783 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:434\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"debfcd1239157e7ed61d15a32fa165f5a4e7f8099a6a053d3cb790857cf34209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (82\u201383 lines \u00D7 2): src/document_core/commands/text_editing.rs:2386-2468 | src/document_core/commands/text_editing.rs:2755-2836 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2386\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"826e1929457ea81912ce3975ebcd5b7e595c3ff79bd35dea4ab58ee8e9adb319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69\u201379 lines \u00D7 2): src/renderer/layout/table_layout.rs:1127-1195 | src/renderer/layout/table_layout.rs:1450-1528 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:1127\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/layout/table_layout.rs:1195\u0060 calls \u0060Some\u0060, \u0060has_fragment_border_line\u0060, \u0060push_fragment_border_line\u0060 and \u0060src/renderer/layout/table_layout.rs:1528\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ba88f4b5653140e06ec956923fd4b3f2d7a81204f8a2bb837ecd9e8031e98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67\u201375 lines \u00D7 2): src/cli/commands/edit/media.rs:232-306 | src/cli/commands/edit/media.rs:646-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a73fec98c873d2f97db79b9525a96fef2fb9d5dd913a85cad5c26bc7e9ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2): src/cli/outputs/kitty.rs:19-92 | src/cli/outputs/sixel.rs:19-92 \u2014 before extracting anything, compare \u0060src/cli/outputs/kitty.rs\u0060 and \u0060src/cli/outputs/sixel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/kitty.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/kitty.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3342206dcf7e396ea8d975a53ed353acbbdff7dca77c84a88b9c0961e0ed8699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67\u201370 lines \u00D7 2): src/document_core/queries/field_query.rs:937-1006 | src/document_core/queries/field_query.rs:1124-1190 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/field_query.rs:937\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":"src/document_core/queries/field_query.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"94821946aa5fbff528a21b0884343b3d7e46b39fa5d6d93b141e8f048f66f17b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201365 lines \u00D7 3): src/renderer/height_measurer.rs:4140-4204 | src/renderer/height_measurer.rs:5156-5220 | src/renderer/height_measurer.rs:5852-5907 \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":"src/renderer/height_measurer.rs"},"region":{"startLine":4140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc734e286efddb95a87621d0f35908754b421117d0365ecb666fb5c73275432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): src/parser/pdf/recognition.rs:1014-1072 | tools/pdf-ir-poc/src/recognition.rs:717-775 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:1014\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f145299a349e28323fb26aab262db3c9634425ccf433f73007261d61a6a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201357 lines \u00D7 2): src/renderer/height_measurer.rs:2093-2149 | src/renderer/layout/table_layout.rs:3475-3530 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2093\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":"src/renderer/height_measurer.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabc119426694f747928fad3f2b72ababee7455792a08c5f6e386cf89325ffe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201356 lines \u00D7 2): src/parser/hwpx/section.rs:5810-5865 | src/parser/hwpx/section.rs:5880-5931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5810}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aeecdf472f7031bb2ba50fa6d4ab1de224cbb435dec27896c0bb4d25f6dc52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201355 lines \u00D7 2): src/parser/hwpx/section.rs:3318-3372 | src/parser/hwpx/section.rs:3929-3979 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5efbb2bf514d38ffb093b6e42de6ed9d08578a7b5b589fa8ed29860f34642a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201355 lines \u00D7 2): src/parser/mod.rs:832-886 | src/parser/mod.rs:972-1025 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:832\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e96afcda54fd3a1660734d3a41a18e2335e3701137b271322b8e3322105908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201353 lines \u00D7 2): src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:188-240 | src/wmf/parser/objects/structure/bitmap_info_header/v5.rs:206-257 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/bitmap_info_header/v4.rs\u0060 and \u0060src/wmf/parser/objects/structure/bitmap_info_header/v5.rs\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:188\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/bitmap_info_header/v4.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"671a66c6ce8e0526d852dac0851b83da364b59d364672fb6688cf478e67affc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201352 lines \u00D7 2): src/renderer/composer/line_breaking.rs:191-242 | src/renderer/layout/text_measurement.rs:3195-3213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca45888ebf6d465cb4a7493fe932e60c8511f15d2e28579575354668fab203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): src/bin/rhwp-q/more/envelope.rs:91-139 | src/bin/rhwp-q/pack/envelope.rs:91-139 \u2014 \u0060src/bin/rhwp-q/more/envelope.rs\u0060 and \u0060src/bin/rhwp-q/pack/envelope.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 7 separate duplicated blocks between them, totalling at least 125 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/envelope.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a14e209df77ec518a183055a508c0f430834f4eb4919158a688d7e40d938b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:1681-1756 | src/document_core/queries/cursor_rect.rs:3912-3987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf877db50f722bb2c68bb6de2b55f05f8bae76b22b74fd89df5b38194ec6abb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): src/bin/rhwp-q/more/probe.rs:89-136 | src/bin/rhwp-q/pack/probe.rs:89-136 \u2014 \u0060src/bin/rhwp-q/more/probe.rs\u0060 and \u0060src/bin/rhwp-q/pack/probe.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 5 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/probe.rs:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"63279be4d0d0558af92e3b48f30bd56e13706d7a89f6d4f30b7f05b784d86d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201348 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4833-4878 | src/renderer/layout/table_cell_content.rs:215-262 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4833\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7d573d9986041e110140715fd994396d3193cfe80a302c418d320f0fbd8621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201347 lines \u00D7 2): src/renderer/composer/cell_line_breaking.inc.rs:235-281 | src/renderer/composer/cell_line_breaking.inc.rs:293-338 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/cell_line_breaking.inc.rs:235\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, \u0060src/renderer/composer/cell_line_breaking.inc.rs:283\u0060 calls \u0060text_width\u0060, \u0060matches\u0060, \u0060count\u0060 and \u0060src/renderer/composer/cell_line_breaking.inc.rs:340\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/cell_line_breaking.inc.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3bd22563613d95de1dc09925e4c9c820a400672ead701e1d45792324fbf777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201347 lines \u00D7 2): src/renderer/layout/table_layout.rs:16852-16898 | src/renderer/layout/table_layout.rs:16942-16983 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:16942\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":16852}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b514084785f11d5ad55cad3743b82aba8fa8bb8f795986ae38f40a48cb72a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201346 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:1356-1399 | src/renderer/layout/shape_layout.rs:825-870 \u2014 before extracting anything, compare \u0060src/document_core/queries/doc_tree_nav.rs\u0060 and \u0060src/renderer/layout/shape_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/doc_tree_nav.rs:1356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"393f5ce4625a869647c80c3442d2c51dbfb2553c741088e9356f8050d905d585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): src/document_core/commands/text_editing.rs:4250-4293 | src/document_core/commands/text_editing.rs:5126-5169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4250}}}],"partialFingerprints":{"codehealthFindingId/v1":"86126dbb073f378ca9f4e5acb39b8f5a3cac11acb8560e45a4f3c142c3b8d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201343 lines \u00D7 2): src/document_core/commands/clipboard.rs:1051-1092 | src/document_core/commands/html_import.rs:524-566 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/html_import.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"2532308d6d452065edee3ad901ac4fdd71a34d8d0586493118387843eb903f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201343 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:5510-5548 | src/renderer/layout/paragraph_layout.rs:10258-10300 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:5510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4121120bfdb9fa3d1e5b4120812e623d6929044dd0674adf1aca1d53a33d0f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 4): src/bin/rhwp-q/kit/form_at.rs:27-66 | src/bin/rhwp-q/kit/hit_fn_marker.rs:28-67 | src/bin/rhwp-q/kit/hit_in_footnote.rs:28-67 | src/bin/rhwp-q/kit/hit_in_hf.rs:45-84 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_fn_marker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 155 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/form_at.rs:27\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8329d1251e32a975102ce746f00d591928342d8a3d5c43a75541d5094a348ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201340 lines \u00D7 2): src/parser/hwpx/section.rs:3227-3266 | src/parser/hwpx/section.rs:3855-3886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:3227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ca017c5668f754521501cb1885cc7d41f12f5c685ebc52e12ee5d4c19f989e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): src/renderer/layout/shape_layout.rs:3532-3571 | src/renderer/layout/shape_layout.rs:3865-3904 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:3532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/shape_layout.rs:3858\u0060 calls \u0060push\u0060 and \u0060src/renderer/layout/shape_layout.rs:3531\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b8af815161c75195d4cf87501d03da84fb097f4f4718e75d193e5b55c483f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): src/renderer/svg.rs:2664-2703 | src/renderer/svg.rs:2792-2830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f4d3877c3011a45c7dae6feba67488bdab3a6439aa5cbff709bc6bdefb5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (100 lines \u00D7 2): src/paint/metafile_masks.rs:19-118 | src/paint/metafile_print/masks.rs:19-118 \u2014 before extracting anything, compare \u0060src/paint/metafile_masks.rs\u0060 and \u0060src/paint/metafile_print/masks.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_masks.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"272cefacee3f07b3f8dba2fff6f85c99b9a5fe2fc238a17b06b55793a03bda7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201339 lines \u00D7 2): src/renderer/height_measurer.rs:3932-3970 | src/renderer/height_measurer.rs:4975-5010 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:3932\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3745777939a44c5ce38c8cd1c5e68fe3373546691866299bae6d13e31af8c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1409-1447 | tools/pdf-ir-poc/src/structured_lowering.rs:340-378 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf298258290e368dd1318d9c012cc1cc2363cc7585b5162e5e5fe473f254f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/parser/hwpx/section.rs:2917-2953 | src/parser/hwpx/section.rs:3042-3078 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:2917\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6816f2584d3f5a19bc197db7a5946db8c552bccec945558c286ad99c51cb48e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201336 lines \u00D7 2): src/cli/commands/conversion.rs:341-371 | src/cli/commands/conversion.rs:543-578 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/conversion.rs:341\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"da04d34ce30a2cfd1faadbc42301a2e90471649f09d0d4d1509d551721943c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201336 lines \u00D7 2): src/renderer/layout/table_layout.rs:5786-5821 | src/renderer/layout/table_layout.rs:5924-5948 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:5786\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d56fafc4392e9b7985b5edd02c3058e9ab8d2602812e9528b85b24a3b42b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201335 lines \u00D7 2): src/renderer/layout.rs:2555-2589 | src/renderer/layout.rs:2679-2695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e24b00e2962b25ba0041a1d49cccf8e996aa46f1dc174de792cd8a562d3152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/renderer/pagination/state.rs:96-130 | src/renderer/pagination/state.rs:137-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/state.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/pagination/state.rs:93\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060 and \u0060src/renderer/pagination/state.rs:136\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/state.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"34236ae665084dd635cd20a8861c9164687b7eed2bec373e265735d2ebab2de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/renderer/shaping_paragraph.rs:428-462 | src/renderer/shaping_paragraph.rs:637-671 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/shaping_paragraph.rs:428\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a692fef4d62110eb64407367329896fb6582ec9a7fc147b43d81b660b3d007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 2): src/wmf/parser/records/drawing/poly_line.rs:41-75 | src/wmf/parser/records/drawing/polygon.rs:44-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/poly_line.rs:41\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":"src/wmf/parser/records/drawing/poly_line.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae56d66b983596e2da32fd83db6c2aa0ef4d0a4fb7e06d84df13f9c4f5f3d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3): src/renderer/layout/shape_layout.rs:2159-2192 | src/renderer/layout/shape_layout.rs:2389-2422 | src/renderer/layout/shape_layout.rs:2457-2490 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:2159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e92c2de6fb7929358e04c205c2e6cad687194d715fe18a5eeca18c35349fc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): src/parser/pdf/lowering.rs:327-359 | tools/pdf-ir-poc/src/lowering.rs:155-188 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/lowering.rs:327\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":"src/parser/pdf/lowering.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbea2fe5eb2f8180e83b54afc4e8de0048326b5e8a46e6234ea88c0b5d273bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57\u201360 lines \u00D7 2): src/renderer/equation/canvas_render.rs:309-365 | src/renderer/equation/svg_render.rs:368-427 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:309\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a53bfd9624251e4e96cbeacbd2e6e119f971961c936d0b966ec8a186d2f753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): src/cli/commands/edit/header_footer_content.rs:304-336 | src/cli/commands/edit/header_footer_content.rs:777-809 | src/cli/commands/edit/header_footer_content.rs:1063-1095 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:304\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a007ac649266646289dd111299cfdf1cecbc9a05bccb5c4ce46dd291095975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): src/cli/commands/edit/header_footer_content.rs:454-486 | src/cli/commands/edit/header_footer_content.rs:909-941 | src/cli/commands/edit/header_footer_properties.rs:438-470 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:454\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f13d0b38de60e1928a8037feaa1ff2724f7762265408f19f76016fc7c1556f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201333 lines \u00D7 3): src/document_core/commands/clipboard.rs:1001-1033 | src/document_core/commands/foreign_paste.rs:223-251 | src/document_core/commands/html_import.rs:411-439 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1001\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"6964008eade1ab17ea68bada1f56cb4941150017c09489f0108f0bb961be5bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201333 lines \u00D7 3): src/renderer/typeset.rs:3659-3690 | src/renderer/typeset/notes/endnotes/measure.rs:599-628 | src/renderer/typeset/notes/endnotes/measure.rs:725-757 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset.rs:3659\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":"src/renderer/typeset.rs"},"region":{"startLine":3659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4386de04a9be07a2ec799c152a8548b844a5d1cb433add3d70964a8cf1bde9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/bin/rhwp-q/more/probe.rs:153-185 | src/bin/rhwp-q/pack/probe.rs:143-175 \u2014 \u0060src/bin/rhwp-q/more/probe.rs\u0060 and \u0060src/bin/rhwp-q/pack/probe.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 5 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/probe.rs:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a52c369e94b97af988c1cef80bab9403d34a86a4915d0050a4dd1b553bedec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/document_core/commands/object_ops/common.rs:302-334 | src/document_core/commands/object_ops/picture.rs:387-419 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c95d5c87db56a1949ea130f971de73e488dba91734655a82cfe242f0c0b27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:524-556 | src/document_core/commands/object_ops/table.rs:956-987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"93315bfc5279bb16ad6bc6e6d8667406a9bf857a7cb4e3d34982fe8c62b9ac6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): src/document_core/queries/field_query.rs:496-521 | src/document_core/queries/field_query.rs:550-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/field_query.rs:496\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1067d7f73bafccf2227ac4473230ad142d13ed4cefd401b80c1bb5b5ca7bbfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/renderer/layout.rs:8563-8594 | src/renderer/layout.rs:10466-10497 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:8563\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":8563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d6ea34d5572235aea538bf0e5fafcd67032436d1edf80afa83d112b59916f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4893-4924 | src/renderer/layout/table_cell_content.rs:530-561 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4893\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d52e56510cffcfda70329686bb0fa055403df60aafebf46ac6adddb175996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): src/renderer/layout/table_layout.rs:1197-1227 | src/renderer/layout/table_layout.rs:1530-1561 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:1197\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad00769c186dbc86775b3042511fb6a7058fe648a6aa8a9ee0117f3617f220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/wmf/parser/objects/structure/log_color_space.rs:98-129 | src/wmf/parser/objects/structure/log_color_space_w.rs:99-130 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/log_color_space.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/log_color_space.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"19287d8fd5689f8a7c750c410ec4d082f99cdadf95c4ad825274ed7fb6b9edbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/bin/rhwp-q/kit/hf_edit_target.rs:17-47 | src/bin/rhwp-q/kit/hit_in_hf.rs:19-49 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/hf_edit_target.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_in_hf.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/hf_edit_target.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/hf_edit_target.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"194ae9291cc72a89315efce1e38ad31cedd3305b0a9c18342b294d3d642fa14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): src/cli/outputs/text.rs:584-612 | src/cli/outputs/vector.rs:395-425 \u2014 before extracting anything, compare \u0060src/cli/outputs/text.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85f939f6ef467aa77ad2b7ca6af85d274e6ae72d104c523d9c35c77d9f5b166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/document_core/commands/text_editing.rs:2317-2347 | src/document_core/commands/text_editing.rs:2686-2716 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2317\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f19f52edc2af2921dbc6167a62970257bf5fe8ca8b8021371eefddf93e1d4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): src/document_core/queries/rendering.rs:8746-8776 | src/document_core/queries/rendering.rs:8865-8894 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:8746\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":8746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed79f1d1624fd604ef3eac989a103f4ff31c95f66ce155ad8a38d6a971f8c74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/parser/pdf/lowering.rs:365-395 | tools/pdf-ir-poc/src/lowering.rs:193-223 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/lowering.rs:365\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":"src/parser/pdf/lowering.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a3c1b726ac44ede72d4d92211aba46bde5aea3abc6002dc117d7d346563a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:4577-4607 | src/renderer/layout/paragraph_layout.rs:4640-4670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f18bd891768e73e07ba0a776818c1a254001071960c1c162c9140c31a44e29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/renderer/layout/table_partial.rs:2599-2629 | src/renderer/layout/table_partial.rs:5740-5770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f16299e8ca8931aed7b88ef4538b9e59851fb495408af3f66dfa2753163d0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 4): src/wmf/converter/svg/mod.rs:210-239 | src/wmf/converter/svg/mod.rs:288-317 | src/wmf/converter/svg/mod.rs:405-434 | src/wmf/converter/svg/mod.rs:497-526 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:210\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4936c0b896932347e100f922818206f8a8a83515e9a1111ea64ad120965a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201330 lines \u00D7 3): src/serializer/hwpx/section.rs:2518-2540 | src/serializer/hwpx/section.rs:2644-2673 | src/serializer/hwpx/section.rs:2947-2976 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/section.rs:2518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5722a69c39970324dcc21b005045942a9dacfa6ac649888521d98ea7f84c4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 3): src/wmf/parser/records/drawing/arc.rs:64-110 | src/wmf/parser/records/drawing/chord.rs:67-113 | src/wmf/parser/records/drawing/pie.rs:66-112 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/drawing/arc.rs\u0060 and \u0060src/wmf/parser/records/drawing/chord.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/arc.rs:64\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":"src/wmf/parser/records/drawing/arc.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2935eca2535c0d2ffbfa2a572a2a3b7db8b34c9ec25efcafc137ded437eaf839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/document_core/helpers.rs:1367-1396 | src/document_core/helpers.rs:1457-1486 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/helpers.rs:1367\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, \u0060src/document_core/helpers.rs:1397\u0060 calls \u0060ends_with\u0060 and \u0060src/document_core/helpers.rs:1487\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b548d1ec8e2b9f2626cb08b6d925e33dcd5ace0ace8ed25dca1a0d629a2e755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/parser/doc_info.rs:685-714 | src/parser/hwp3/records.rs:113-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/doc_info.rs:685\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c539e1354bce0e8d76c8d54b9b4f40de16c89265be008cdf355c0adbd7632324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4800-4829 | src/renderer/layout/table_cell_content.rs:181-210 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4800\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4800}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdf81ea706b7c90957c245eb47080b854f6c45646d361595713a00c7c82a67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/renderer/typeset.rs:3556-3585 | src/renderer/typeset/notes/endnotes/measure.rs:647-676 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset.rs:3556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68a5a366efc774025cc517139f6183f669e493ee2445383b4876993cc15b87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/serializer/hwpx/section.rs:2717-2746 | src/serializer/hwpx/section.rs:2796-2825 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:2717\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":"src/serializer/hwpx/section.rs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d1c49d91ff0701450593acbe68e7d8c6c7261e11ca6c6cb1c21e1c2fb054a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/wmf/parser/records/bitmap/set_dib_to_dev.rs:92-121 | src/wmf/parser/records/bitmap/stretch_dib.rs:107-135 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs\u0060 and \u0060src/wmf/parser/records/bitmap/stretch_dib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs:92\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/set_dib_to_dev.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0fade35b50bb8763236fb4e5f7128ebb8262cc5f6f75a450deffa0d6617af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 6): src/renderer/layout/paragraph_layout.rs:8912-8940 | src/renderer/layout/table_layout.rs:7366-7394 | src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:88-116 | src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:109-137 | src/renderer/typeset/notes/endnotes/paragraph/rewind_tail.rs:75-103 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:153-181 \u2014 before extracting anything, compare \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:8912\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060InitialFitInput\u003C\u0027_\u003E\u0060 in one and \u0060NewNoteFitInput\u003C\u0027_\u003E\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":8912}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8bc5258135155e5a576f781003b4628fa2e64b1dbc00f5f8ee6d1e1930b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/cli/outputs/kitty.rs:94-122 | src/cli/outputs/sixel.rs:94-122 \u2014 before extracting anything, compare \u0060src/cli/outputs/kitty.rs\u0060 and \u0060src/cli/outputs/sixel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/kitty.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/kitty.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"feae89d4d186007ab85288a10607c352758467c7d32185b32c2633ce3a1b32bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/document_core/commands/document.rs:459-487 | src/document_core/mod.rs:614-642 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5174744f45280760c92fecc81e557a7efdb26023fe548f7e2c7a1106c5d88d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201329 lines \u00D7 2): src/document_core/converters/common_obj_attr_writer.rs:53-81 | src/serializer/control.rs:2575-2598 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/converters/common_obj_attr_writer.rs:53\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":"src/document_core/converters/common_obj_attr_writer.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11506d402343b49d85669df400d999f2c76783a0261e9879624751857002607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:436-464 | src/document_core/queries/doc_tree_nav.rs:467-491 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/doc_tree_nav.rs:436\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"861607dfad48cd1ec7284ee3d17c2d17e0cbdee4030525645005556a40d021de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): src/parser/hwpx/section.rs:3288-3316 | src/parser/hwpx/section.rs:3900-3926 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3288\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1f6c881fa805a40504e96107cb2d249e6ec8f806935dc26dcc17b7276ea0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): src/parser/pdf/recognition.rs:716-764 | tools/pdf-ir-poc/src/recognition.rs:463-511 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:716\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cf507ef7fb89f7c0779faf38615f947cef7558b7f1801a394aa4ca1b947d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/renderer/layout/table_partial.rs:2089-2117 | src/renderer/layout/table_partial.rs:2440-2468 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:2089\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5d119e7d3648a7be7e5ba216c18a72393002660bee90eac269aea44cdaab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/renderer/skia/equation_conv.rs:497-525 | src/renderer/skia/equation_conv.rs:529-557 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/skia/equation_conv.rs:497\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":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5f681e0b1810388b1c518c7d5f2edac5ee48d2cbb5a5bb652a025797e366f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): src/cli/commands/edit/document_text.rs:37-64 | src/cli/commands/edit/document_text.rs:351-378 | src/cli/commands/edit/document_text.rs:487-514 \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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d215e3337d0b15778391f326aeeb921b8db80d976f03102922455a1a8a668978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): src/diagnostics/hwp5_cell_header_probe.rs:353-380 | src/diagnostics/hwp5_mel_personnel_probe.rs:296-323 | src/diagnostics/hwp5_table_probe.rs:290-317 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:353\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"96abfa9aff3eb01374facf78fbd3a1edbd1c6206ad867a0d14dc3f2018d688ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 3): src/renderer/web_canvas.rs:3982-4008 | src/renderer/web_canvas.rs:4032-4059 | src/renderer/web_canvas.rs:4113-4140 \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":"src/renderer/web_canvas.rs"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"510aa59dd2dde843a88cc6e29a553520f618491db4b79b95f9c84d869de259e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): src/bin/rhwp-q/kit/char_index.rs:39-85 | src/bin/rhwp-q/kit/word_end.rs:39-85 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 and \u0060src/bin/rhwp-q/kit/word_end.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/char_index.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee00c7bf04751c4b7cb4ad9f83f6d34eceb4eac435c8023decf81b31374221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/bin/rhwp-q/kit/cur_field_state.rs:39-66 | src/bin/rhwp-q/kit/field_info_at.rs:39-66 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 and \u0060src/bin/rhwp-q/kit/field_info_at.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cur_field_state.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3cc752fadb5a6cee1ca423b7b050588c91ecb178f9750648d7b755d339bb02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/cli/commands/edit/cell_paragraphs.rs:19-46 | src/cli/commands/edit/cells.rs:496-523 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"667aa64091cda3aa055f7bd9b6cd08a821247b27908a8a4f92a9829c7170ad4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/cli/commands/edit/document_objects.rs:296-323 | src/cli/commands/edit/document_objects.rs:437-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:296\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35bc5139f3cdff39e9b80b44c6e8259a1a3fea3b6b2d9740434e7d6abd10d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/cli/outputs/pdf.rs:84-111 | src/cli/outputs/vector.rs:82-109 \u2014 before extracting anything, compare \u0060src/cli/outputs/pdf.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/pdf.rs:84\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d92c1674c6a9ec4f2921254ea3d8f7cb2a15aec49c3e2e6533e8cc1fe197d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/document_core/commands/clipboard.rs:2074-2101 | src/document_core/commands/clipboard.rs:2118-2145 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/clipboard.rs:2074\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e6c3944e80408890d8989c0c34cabcdeb3e9c2bd5b3f2988c88a1319f0d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): src/document_core/commands/text_editing.rs:6662-6691 | src/document_core/commands/text_editing.rs:6779-6807 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6662\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6662}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db996c944129521777ca263beb0133758d95a8be73011300555f6fd49c8798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/paint/json.rs:1861-1888 | src/paint/json.rs:1919-1946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060style\u0060 to \u0060\u0026TextStyle\u0060 in one and \u0060\u0026PaintTextStyle\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/paint/json.rs:1890\u0060 calls \u0060push_str\u0060 and \u0060src/paint/json.rs:1947\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ddcf8d5aaff8961bc02479926baf1b6ad16ff2f4ffebf12779d6cb16f2b8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/parser/hwp3/mod.rs:329-355 | src/parser/hwpx/section.rs:2746-2773 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:329\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 \u0060common\u0060 to \u0060\u0026crate::model::shape::CommonObjAttr\u0060 in one and \u0060\u0026CommonObjAttr\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/hwpx/section.rs:2744\u0060 calls \u0060hwp5_attr_bits\u0060 and \u0060src/parser/hwp3/mod.rs:327\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7984d7be6687f1a5c91bde66d1a655f96904814ed0dda00d07342926fc3707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:468-495 | src/parser/pdf/structured_lowering.rs:569-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"99445d0a052a23565f512118e9842f9bda3c7f10465fa9d6c1325bd711ff6d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2787-2813 | src/renderer/layout/shape_layout.rs:3002-3029 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2787\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"74938112815d3c85fcbb97f76604e7c13871672f2e88cd1e3cbbcf1371701ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): src/renderer/layout/table_partial.rs:3660-3687 | src/renderer/layout/table_partial.rs:3757-3781 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:3660\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf832ad43d5eb401a7418edc3f8b468d402983cd390f7be18ba6d6ca1de55a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201327 lines \u00D7 10): mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs:29-31 | mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:113-115 | mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs:125-127 | mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:42-44 | src/diagnostics/hwp5_borderfill_diagonal_probe.rs:481-507 | src/diagnostics/hwp5_cell_header_probe.rs:753-779 | src/diagnostics/hwp5_contract_probe.rs:671-697 | src/diagnostics/hwp5_first_para_control_probe.rs:1353-1379 | src/diagnostics/hwp5_mel_personnel_probe.rs:667-693 | src/diagnostics/hwp5_table_probe.rs:518-544 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs\u0060 and \u0060mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs:29\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:480\u0060 calls \u0060from_le_bytes\u0060 and \u0060mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:42\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2d29630d92976e91a2d6c9bc7db8818bfab10e40c207f3bb9aa07e22734557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 4): src/cli/commands/edit/header_footer_content.rs:33-59 | src/cli/commands/edit/header_footer_content.rs:153-179 | src/cli/commands/edit/header_footer_properties.rs:179-205 | src/cli/queries/structured_objects.rs:143-169 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5270dd1cbf556a0290136a5e5d0484552e33bee70de2c23d54e3ca461ab29a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 3): src/cli/commands/edit/document_text.rs:96-122 | src/cli/commands/edit/document_text.rs:402-427 | src/cli/commands/edit/document_text.rs:538-563 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:96\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f977d1218806662d5ba3de1c640c37daaae8b6a473d6d5339993827d0c2325e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): src/cli/queries/diagnostics.rs:416-442 | src/diagnostics/hwp5_contract_analyze.rs:900-926 | src/document_core/commands/clipboard.rs:47-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/diagnostics.rs:416\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/diagnostics.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4716e91460f579389bd453b409e9ca61da3e8d14d5301a45eff5c85cc005e18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs:20-46 | mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwpx_slice.rs:21-48 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs\u0060 and \u0060mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwpx_slice.rs\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs:20\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":"mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa1e4fcb22b6a621bcd014dde20c9f660362f53c845d73b603d9f8b6a42669e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:44-70 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:44-70 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e0eb80ac494290c058b93354cf50115ecf9e4092561ee963e8eaf4e97860a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:32-58 | src/docdiff/compare.rs:396-422 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6a1a92a6300e0a68ebc164a610ed21732b5a067d205845d023fb10ff7d25f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:341-367 | src/diagnostics/render_geom_diff.rs:119-145 \u2014 before extracting anything, compare \u0060src/diagnostics/layout_anomaly.rs\u0060 and \u0060src/diagnostics/render_geom_diff.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42e57d12c0024d09c4b03817ce4483a705d1502a4cb8d42798244711b501c22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:114-140 | src/document_core/commands/object_ops/picture.rs:563-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8579e9875057aa9d2b07b80d8780bf70adbc9da43595e2aaf55fc232507de79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:1893-1919 | src/document_core/commands/object_ops/picture.rs:1970-1994 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/picture.rs:1893\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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e51caf0825e27fcf0eb83e032d423a6c1a5727548de7be3a67ae9607fbb240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/document_core/commands/text_editing.rs:4476-4502 | src/document_core/commands/text_editing.rs:4662-4688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09334d89fd452c7d2124673e605e82bbbb199c8d6abce133ea6ec8231640163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/parser/hwpx/header.rs:1868-1893 | src/parser/hwpx/section.rs:4505-4531 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1868\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c63ed8640c051c475753f6cb95a6da5610e368fde15e86e12a09719d44e9827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201343 lines \u00D7 2): src/parser/mod.rs:1190-1230 | src/parser/mod.rs:2162-2204 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:1190\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":"src/parser/mod.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25131229789e33135e0c9aca0d3c7bd4f4c347c2dfadc652d608e6ee0d24d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): src/renderer/height_measurer.rs:633-657 | src/renderer/typeset.rs:158-184 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060src/renderer/height_measurer.rs:633\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e126814ae17f0b00596d374beeb7b667b5dc3319e9432a61384aa6e748e9392e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201327 lines \u00D7 2): src/renderer/height_measurer.rs:5613-5639 | src/renderer/height_measurer.rs:5662-5679 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:5613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6525e9bc208997f6e6c6c9c66d250c6dc0d544e17df27f3073aa2cadbdefd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2830-2856 | src/renderer/layout/shape_layout.rs:2973-2998 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2830\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb28eb6787784448e92347c311bb414babec8da3ab72f232b2d4643861815c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/renderer/layout/table_layout.rs:8684-8710 | src/renderer/layout/table_partial.rs:3987-4012 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:8684\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8684}}}],"partialFingerprints":{"codehealthFindingId/v1":"de215b241c326037d0e14d6f6cbbc0aad7112a02ec421681f9d435d0d69f4f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/renderer/layout/table_layout.rs:13062-13088 | src/renderer/layout/table_layout.rs:13244-13270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13062}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb01fe69b6a17c414d2c8a728964aa25403c329efea8272cc65291b729575ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/renderer/layout/table_layout.rs:17454-17480 | src/renderer/layout/table_layout.rs:18020-18046 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:17454\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":17454}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea03edeb29944d70d141c802de492f1a87c1947cb7cde99ae927d0db501c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/renderer/layout/table_layout.rs:23728-23754 | src/renderer/layout/table_layout.rs:23986-24011 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:23728\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23728}}}],"partialFingerprints":{"codehealthFindingId/v1":"a491bd66d4a24ce32288d25fb35c6e2bc969d909d6b3905df09f7fbd19ff2de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 4): src/main.rs:1064-1089 | src/main.rs:1144-1169 | src/main.rs:1218-1242 | src/main.rs:1300-1325 \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":"src/main.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9438c9e555ab4532d3679bfd7edd8febd55c219f75557cc8edf47cdeba453d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:118-143 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:106-131 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:86-111 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:118\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"83832e6465e2dedecc01dec8cafa46fa1bd70795586567b673470fa079fbdb60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/cli/commands/edit/cell_paragraphs.rs:176-201 | src/cli/commands/edit/formatting.rs:867-892 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee0aeafc47c43eeb12f3556bbb9f459a03e56cceb46c9b88d60b604927faa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/cli/outputs/tabular.rs:137-162 | src/cli/outputs/tabular.rs:347-372 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:137\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bccba3f649463284a04734097d3f4047badeedf701f4d3c1028b4467bf8785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/cli/queries/security_inspection.rs:733-758 | src/cli/queries/security_inspection.rs:1005-1030 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:733\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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5616e97cd8a9c6c5d9a93abfa4f4fe5d182e66da42820e755451cc5f9dd32982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:613-638 | src/diagnostics/hwpx_roundtrip_batch.rs:449-474 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"97824a6398d55603c8076cb16a99a38b045022f00ba6c83171e76b97ab939cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/paint/json.rs:1474-1499 | src/paint/layer_tree.rs:281-306 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f123ae50a9f8d14a76216aefb43685211ad99ca1df643451092687328a68f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/parser/hwpx/section.rs:757-781 | src/parser/hwpx/section.rs:974-999 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:757\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, \u0060src/parser/hwpx/section.rs:783\u0060 calls \u0060Some\u0060 and \u0060src/parser/hwpx/section.rs:1000\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"481cb96b1fa451b019c7af5ca382c8d1b5a210effbd766eb10abb6058a002c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/renderer/layout.rs:13447-13471 | src/renderer/layout.rs:15477-15502 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:13447\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":"src/renderer/layout.rs"},"region":{"startLine":13447}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b9550ec4b4f59151a681a6de0f0af2417dcb17ede4374a5216bfacee46e1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2091-2115 | src/renderer/layout/shape_layout.rs:2119-2144 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2091\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"3685f5575d4fa929de5f3e974e165b7283eabbaa0574b19e4927daed27324518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/renderer/svg.rs:2627-2652 | src/renderer/web_canvas.rs:3911-3936 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 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 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 after the matched lines, \u0060src/renderer/web_canvas.rs:3939\u0060 calls \u0060save\u0060 and \u0060src/renderer/svg.rs:2658\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a35502c8a0c46659b69e95c88f4f6a200edc39c0ed883d6c11169384771fb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:64-88 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:65-89 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:64-88 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:65-89 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-markdown.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 158 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f5a16aa15f63a3bc69997c9d6f22f723533c28603d3c40f45ee1031eff0c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): src/bin/rhwp-q/kit/envelope.rs:100-124 | src/bin/rhwp-q/more/envelope.rs:64-88 | src/bin/rhwp-q/pack/envelope.rs:64-88 \u2014 \u0060src/bin/rhwp-q/kit/envelope.rs\u0060 and \u0060src/bin/rhwp-q/more/envelope.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 4 separate duplicated blocks between them, totalling at least 56 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/envelope.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f57e1cb8eefa5e214872d0a12ef891d0baefc409fa937979ebc703c86ff289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 3): src/cli/outputs/text.rs:584-607 | src/cli/outputs/vector.rs:395-419 | src/cli/outputs/vector.rs:680-703 \u2014 before extracting anything, compare \u0060src/cli/outputs/text.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0123f983365f833f010ca54131c777e6ca4b6e143eb618871ad75fc2cbac9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/cli/commands/tabular_import.rs:199-223 | src/cli/commands/tabular_import.rs:548-572 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/tabular_import.rs:199\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":"src/cli/commands/tabular_import.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b049ce9d7cef87f57e9f165f79c899957b507a5ddebc53da28f8182d47b00d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:598-622 | src/document_core/commands/object_ops/table.rs:1003-1025 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:598\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25960e8a96b670928e5f702fd63bd53d60a1b6c97dd7d75d59948e915461302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/document_core/commands/text_editing.rs:2214-2237 | src/document_core/commands/text_editing.rs:2595-2619 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a952dbe3fbfc4fb1d0b93c786cb9fe2e182ba7fe5750fed511771c2d7e2f8217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/renderer/height_measurer.rs:2058-2082 | src/renderer/layout/table_layout.rs:3438-3462 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"73174e7feeaf2609150913568595a2dde34c1e22657c8e6a0e6edc7ea0dca5f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201325 lines \u00D7 2): src/serializer/hwpx/shape.rs:1622-1646 | src/serializer/hwpx/table.rs:234-243 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/shape.rs\u0060 and \u0060src/serializer/hwpx/table.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/table.rs:234\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":"src/serializer/hwpx/shape.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e0b3e57c76dc64f52e8324e7f819c536de5e542f2479176ad8d5fd5fa5292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): src/diagnostics/hwp5_cell_header_probe.rs:357-380 | src/diagnostics/hwp5_contract_probe.rs:324-347 | src/diagnostics/hwp5_mel_personnel_probe.rs:300-323 | src/diagnostics/hwp5_table_probe.rs:294-317 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f17d1302a2876f3b0358406878a6027d7c40305e21553fb1132843b55626bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 3): src/renderer/layout.rs:15406-15428 | src/renderer/layout.rs:16473-16495 | src/renderer/layout.rs:16665-16688 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:15406\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":"src/renderer/layout.rs"},"region":{"startLine":15406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9877c24405f96982686686fb663109d060c26e4899b990a93b5e91515809d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201324 lines \u00D7 3): src/renderer/layout/table_cell_content.rs:1485-1501 | src/renderer/layout/table_layout.rs:4847-4870 | src/renderer/layout/table_partial.rs:8017-8040 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:1485\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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6ef66038bdd349e7eed9f0732ceec4cc4cf946638c65bca9aca29c2f3f4a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/cli/commands/conversion.rs:390-413 | src/cli/commands/conversion.rs:609-632 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/conversion.rs:390\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f9f838b0db62e1d82ba68e87057949396f2adb3081e4e7673cd18f160a4e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/cli/commands/edit/document_objects.rs:342-364 | src/cli/commands/edit/document_objects.rs:492-515 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/document_objects.rs:342\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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a970d4bda8ab4c597d6d126b7434ce2d570a311d65559fbe0767b52843e44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): src/cli/commands/edit/privacy.rs:273-296 | src/cli/commands/edit/text.rs:203-220 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/privacy.rs\u0060 and \u0060src/cli/commands/edit/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:273\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8540500eafb46409b0f0f661bc55a2d1b15c789ef2961c3d2701d0897c6daebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/diagnostics/hwp5_inventory.rs:142-165 | src/diagnostics/hwp5_inventory_diff.rs:259-282 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_inventory.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"30936f9ec63625dfc269ad8eecb2f355d1d4a5cbd901020abbcc8dba2bf0cb61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:1870-1891 | src/document_core/commands/object_ops/picture.rs:1945-1968 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/picture.rs:1870\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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"280082de4ed0eee02ab2ed44c4e7d87b2b334b9448e80d62565c46e5d0c22700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): src/document_core/commands/text_editing.rs:5603-5626 | src/document_core/commands/text_editing.rs:5642-5659 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:5603\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cc4743c9b141e69448c4e7b46df5ad260c44478910eeb1194c4e3e65db8540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/document_core/commands/text_editing.rs:6031-6054 | src/document_core/queries/search_query.rs:777-800 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:6031\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df851d67a493c7b568aaa5eb2522c37b62bad2c00cfe898a2c0622e9b69f556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:552-575 | src/document_core/queries/doc_tree_nav.rs:604-627 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/doc_tree_nav.rs:552\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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e35742bb1bfe232fa919eeff2b6a52953ca7243a79965aefa019cfd9b3e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/document_core/queries/rendering.rs:1430-1453 | src/document_core/queries/rendering.rs:1651-1674 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:1430\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bde9ced04cd0051678cb1e94973aa43000cb0abee6146eb7a006576d1ae6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/parser/hwpx/header.rs:1826-1847 | src/parser/hwpx/section.rs:4469-4492 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1826\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, \u0060src/parser/hwpx/header.rs:1853\u0060 calls \u0060parse_i8\u0060 and \u0060src/parser/hwpx/section.rs:4493\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"09af4e4dc0739247c19bbbc451c2a480c0beff9b65aab321888c07cfd0c89c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): src/parser/mod.rs:432-455 | src/parser/mod.rs:923-940 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4faf38ea80dd7578579b8111a434f1952f7c6d1f0bcc529b88ffdfd47c1b69d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/parser/mod.rs:1167-1187 | src/parser/mod.rs:2115-2138 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:1167\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca02b46c4ff2858c002ac185edbee04f99af43090fae5601100d9b3110279257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): src/renderer/layout/table_layout.rs:14493-14516 | src/renderer/layout/table_layout.rs:14568-14588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faa7469f64a3b28731aa8b38849c5ab0f6da84f8979a786e9be3ce58a0426ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/renderer/layout/table_partial.rs:804-827 | src/renderer/layout/table_partial.rs:891-914 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:804\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a9718bff250c77f8e1209da13191681de07fe97d412b203fbf816ce51e12fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/renderer/layout/text_measurement.rs:464-486 | src/renderer/layout/text_measurement.rs:683-706 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/text_measurement.rs:464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/layout/text_measurement.rs:487\u0060 calls \u0060push\u0060 and \u0060src/renderer/layout/text_measurement.rs:707\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71c3fb5d307873bb65b83b093395b0c7a9dc92a9ffc8eab87716aa01e65730d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/serializer/hwpx/section.rs:1346-1369 | src/serializer/hwpx/section.rs:1424-1447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1cf2c685de7babcd40bc35259d3affca7a3254e07796e5d3a9566cf92fca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/wmf/converter/bitmap.rs:74-97 | src/wmf/converter/bitmap.rs:130-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/bitmap.rs:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/bitmap.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425ebf3c1dadc7f76858d5baf8e91628bf78df7f98e725a5b71be3c7901b4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/wmf/parser/records/bitmap/dib_bit_blt.rs:151-172 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:174-197 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs:151\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/dib_bit_blt.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a5739149f73b1a80acc5a6992d9df1448f8faad54fa364978a9dbc1cb82ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 10): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:110-132 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:109-131 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:109-131 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:113-135 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:110-132 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:101-123 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:109-131 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:99-121 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:96-118 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:110-132 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:110\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a91e20eeb7bbc565495d9df9cb5aa801ceaf628e2dc7f24fbb73219055387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 5): src/cli/commands/edit/cells.rs:402-424 | src/cli/commands/edit/document_text.rs:146-167 | src/cli/commands/edit/media.rs:406-428 | src/cli/commands/tabular_import.rs:376-397 | src/cli/commands/tabular_import.rs:672-693 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f867ce68847bebc6d53a9d602f04d53e8c1a87c57eb9a10a54a5f290f218cbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 4): src/cli/outputs/text.rs:124-145 | src/cli/outputs/text.rs:586-607 | src/cli/outputs/vector.rs:397-419 | src/cli/outputs/vector.rs:682-703 \u2014 before extracting anything, compare \u0060src/cli/outputs/text.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/text.rs:124\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":"src/cli/outputs/text.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc00ffddb9972e7f398392cbbd81b9bc1d6a92fba4039eab4d496139c06f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): src/bin/rhwp-agent/chunkplan.rs:37-59 | src/bin/rhwp-agent/fingerprint.rs:180-202 | src/bin/rhwp-agent/piiscan.rs:75-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/chunkplan.rs:37\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7211b65951b5ce644c996e86dd889dfbaf75e4988de63227b57363d7f8fd19b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): src/serializer/hwpx/section.rs:2635-2657 | src/serializer/hwpx/section.rs:2717-2738 | src/serializer/hwpx/section.rs:2796-2817 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/section.rs:2635\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f64099c55c9bf93a7f2f2bf2d13f6be7d5563bb5e973494e98c54265798153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:80-102 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:77-99 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-para-shape.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 221 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b425fd3c05f2899bc05449bf8f50a9bcac73cc886c17b755f03d2d39ef25c8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:79-101 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:83-105 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-form-info.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd4a0b3eb0d286f297eaaec2cfc8d708580bef23006b9e5c441b234890f1ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:118-140 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:134-156 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62900d9ff0e972c0778ed9c54f605852789e6bd3c4fc2fd0c3fec37d2e2f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/cli/queries/security_inspection.rs:624-646 | src/cli/queries/security_inspection.rs:896-918 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:624\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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290726a434a30e43435cd5848ed6ddf41147edf9f3c04cd70801f2b5e6fe62d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:309-330 | src/diagnostics/hwpx_roundtrip_batch.rs:183-205 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:309\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":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"034dfaea41c4516af6533e3886df5654aa0ac66f1983928fb33bdb39fc259a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/document_core/commands/table_ops.rs:879-901 | src/document_core/commands/table_ops.rs:918-940 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/table_ops.rs:879\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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32076ec8d04375b981b1f68dbce6d245fc2e12bba134ac15789a9f4a1aca85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/document_core/commands/text_editing.rs:4518-4540 | src/document_core/commands/text_editing.rs:4703-4724 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:4518\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2615ef051187b936d521b701063f9a38a09b6076e6aebd927daa10f762b4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/document_core/commands/text_editing.rs:5252-5274 | src/document_core/commands/text_editing.rs:5392-5414 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:5252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ed5b959dbb2550a326651dce5b975d78401d1ee5b20d8e0a30b00073f4676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/document_core/queries/memo_query.rs:1447-1469 | src/document_core/queries/memo_query.rs:1514-1536 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/memo_query.rs:1447\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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"969237ed8aa45955f446d36a7278dab7a53b56793184c8d143d191902687da40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/paint/text_v2.rs:390-413 | src/paint/text_v2.rs:420-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":"src/paint/text_v2.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e94a155544939b55f05fb8cb78d8be9eca65ab74e2e95c53e1f54a7dd06346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/parser/hwp3/mod.rs:1367-1390 | src/parser/hwp3/mod.rs:1869-1892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fedb8f5993e295c39e7a987b1197c971d6dd7d6499b1c0692693b23acec07e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1335-1378 | tools/pdf-ir-poc/src/structured_lowering.rs:276-319 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef42e49fef09c3cfc0e82f73470ab400cc874e723bfdad16943ef7b686fd68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): src/renderer/pagination/engine.rs:1574-1594 | src/renderer/pagination/engine.rs:1761-1783 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/pagination/engine.rs:1574\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4e381caa843e3e716cdfe2c623e934f259ea1d76006df12102af635c2ab830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/renderer/shaping_paragraph.rs:1268-1289 | src/renderer/shaping_paragraph.rs:1299-1321 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/shaping_paragraph.rs:1299\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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7819986fcb439d83b5812b562a7c87bb52ad865bda5aa1a624586029b79defc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/renderer/svg.rs:1215-1237 | src/renderer/web_canvas.rs:635-657 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7ed116c62b16fbaf1c733221707343485ed2da346e0b1e50621cf3b4986f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): src/serializer/hwpx/section.rs:2756-2775 | src/serializer/hwpx/section.rs:2864-2886 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:2756\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4f97a49fabb21033aedfe4f66778be606296a4f29fad969a279195726e5578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201323 lines \u00D7 2): src/wmf/converter/svg/mod.rs:897-919 | src/wmf/converter/svg/mod.rs:1663-1677 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wmf/converter/svg/mod.rs:897\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dea42945e9237775c4bf34f9a33cbf23cdc27847ea86ac890cb47f491e41d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 82): src/cli/commands/edit/bookmarks.rs:56-77 | src/cli/commands/edit/bookmarks.rs:173-194 | src/cli/commands/edit/bookmarks.rs:291-312 | src/cli/commands/edit/cell_paragraphs.rs:64-85 | src/cli/commands/edit/cell_paragraphs.rs:220-241 | src/cli/commands/edit/cells.rs:271-292 | src/cli/commands/edit/cells.rs:551-572 | src/cli/commands/edit/cells.rs:720-741 | src/cli/commands/edit/cells.rs:890-911 | src/cli/commands/edit/controls.rs:45-66 | src/cli/commands/edit/document_objects.rs:47-68 | src/cli/commands/edit/document_objects.rs:205-226 | src/cli/commands/edit/document_objects.rs:318-339 | src/cli/commands/edit/document_objects.rs:459-480 | src/cli/commands/edit/document_objects.rs:604-625 | src/cli/commands/edit/document_text.rs:58-79 | src/cli/commands/edit/document_text.rs:262-283 | src/cli/commands/edit/document_text.rs:372-393 | src/cli/commands/edit/document_text.rs:508-529 | src/cli/commands/edit/document_text.rs:664-685 | src/cli/commands/edit/document_text.rs:767-788 | src/cli/commands/edit/document_text.rs:870-891 | src/cli/commands/edit/document_text.rs:966-987 | src/cli/commands/edit/document_text.rs:1061-1082 | src/cli/commands/edit/equations.rs:187-208 | src/cli/commands/edit/equations.rs:290-311 | src/cli/commands/edit/formatting.rs:59-80 | src/cli/commands/edit/formatting.rs:197-218 | src/cli/commands/edit/formatting.rs:380-401 | src/cli/commands/edit/formatting.rs:627-648 | src/cli/commands/edit/formatting.rs:760-781 | src/cli/commands/edit/formatting.rs:921-942 | src/cli/commands/edit/header_footer_content.rs:64-85 | src/cli/commands/edit/header_footer_content.rs:184-205 | src/cli/commands/edit/header_footer_content.rs:331-352 | src/cli/commands/edit/header_footer_content.rs:481-502 | src/cli/commands/edit/header_footer_content.rs:661-682 | src/cli/commands/edit/header_footer_content.rs:804-825 | src/cli/commands/edit/header_footer_content.rs:936-957 | src/cli/commands/edit/header_footer_content.rs:1090-1111 | src/cli/commands/edit/header_footer_properties.rs:58-79 | src/cli/commands/edit/header_footer_properties.rs:210-231 | src/cli/commands/edit/header_footer_properties.rs:318-339 | src/cli/commands/edit/header_footer_properties.rs:465-486 | src/cli/commands/edit/media.rs:614-635 | src/cli/commands/edit/media.rs:839-860 | src/cli/commands/edit/media.rs:947-968 | src/cli/commands/edit/note_content.rs:56-77 | src/cli/commands/edit/note_content.rs:166-187 | src/cli/commands/edit/note_content.rs:278-299 | src/cli/commands/edit/note_content.rs:386-407 | src/cli/commands/edit/note_content.rs:501-522 | src/cli/commands/edit/note_content.rs:618-639 | src/cli/commands/edit/notes.rs:45-66 | src/cli/commands/edit/notes.rs:140-161 | src/cli/commands/edit/notes.rs:235-256 | src/cli/commands/edit/page.rs:48-69 | src/cli/commands/edit/page.rs:151-172 | src/cli/commands/edit/page.rs:276-297 | src/cli/commands/edit/page.rs:391-412 | src/cli/commands/edit/shapes.rs:92-113 | src/cli/commands/edit/shapes.rs:217-238 | src/cli/commands/edit/shapes.rs:335-356 | src/cli/commands/edit/shapes.rs:491-512 | src/cli/commands/edit/tables/grid.rs:50-71 | src/cli/commands/edit/tables/grid.rs:158-179 | src/cli/commands/edit/tables/grid.rs:264-285 | src/cli/commands/edit/tables/grid.rs:394-415 | src/cli/commands/edit/tables/grid.rs:513-534 | src/cli/commands/edit/tables/grid.rs:627-648 | src/cli/commands/edit/tables/grid.rs:771-792 | src/cli/commands/edit/tables/insert.rs:100-121 | src/cli/commands/edit/tables/layout.rs:37-58 | src/cli/commands/edit/tables/layout.rs:157-178 | src/cli/commands/edit/tables/layout.rs:283-304 | src/cli/commands/edit/tables/layout.rs:401-422 | src/cli/commands/edit/tables/layout.rs:515-536 | src/cli/commands/edit/tables/layout.rs:635-656 | src/cli/commands/edit/tables/structure.rs:55-76 | src/cli/commands/edit/tables/structure.rs:150-171 | src/cli/commands/edit/tables/structure.rs:245-266 | src/cli/commands/edit/tables/structure.rs:340-361 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:56\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422aebc1d6a1843dc38700fab25628e0d8b5f5adcc2ae54052aaeea519d97fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:157-178 | src/diagnostics/hwp5_cell_header_probe.rs:228-249 | src/diagnostics/hwp5_contract_probe.rs:181-202 | src/diagnostics/hwp5_first_para_control_probe.rs:188-209 | src/diagnostics/hwp5_mel_personnel_probe.rs:174-195 | src/diagnostics/hwp5_table_probe.rs:180-201 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ff60e2440bc907b11346464d572ae5a7c394ec4becab600cd08c4c36c84776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): src/bin/rhwp-q/kit/caret_stops.rs:17-38 | src/bin/rhwp-q/kit/char_index.rs:19-40 | src/bin/rhwp-q/kit/word_end.rs:19-40 | src/bin/rhwp-q/kit/word_starts.rs:17-38 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c989ee10d709d66de72d711ab3931812fa85423f4de662a1a899455f8ae77fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 4): src/cli/commands/edit/document_text.rs:94-115 | src/cli/commands/edit/document_text.rs:290-309 | src/cli/commands/edit/document_text.rs:400-420 | src/cli/commands/edit/document_text.rs:536-556 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ace723862275f67164a3ad6bbbbc572f6f56765391b5d981aeab51c014064a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 4): src/cli/commands/edit/formatting.rs:220-240 | src/cli/commands/edit/formatting.rs:945-966 | src/cli/commands/edit/header_footer_properties.rs:488-508 | src/cli/commands/edit/note_content.rs:642-663 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/formatting.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/formatting.rs:220\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c140a649a9cc91e9e5389e667e366ca45db2837962b76fc95854bc95cc26ab46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): src/cli/commands/edit/cell_paragraphs.rs:108-129 | src/cli/commands/edit/cells.rs:595-616 | src/cli/commands/edit/cells.rs:764-785 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:108\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3430ba1645193596725d4d5d80e1ad33265712b8aaec39d0b32f4133cf0e5f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/cli/outputs/tabular.rs:21-42 | src/cli/outputs/text.rs:272-293 \u2014 before extracting anything, compare \u0060src/cli/outputs/tabular.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:21\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5309b8654e563211a13965ff7483522ac78449e872a5550e1c23c745033107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/cli/queries/security_inspection.rs:601-622 | src/cli/queries/security_inspection.rs:873-894 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:601\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cf56add5251781f5763e21b8cc7793a9e95b4a71e7a138f14f4002bc9b9290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): src/document_core/commands/text_editing.rs:2470-2514 | src/document_core/commands/text_editing.rs:2838-2882 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2470\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a074b0339f3a91e57dffa166ffaaabd159b6dd560aa17f5420c9c080d26d1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/native_host/gpu_d3d.rs:405-426 | src/native_host/gpu_metal.rs:291-312 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060target\u0060 to \u0060NativeD3dTarget\u0060 in one and \u0060NativeMetalTarget\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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a4099b5721e1f8cae4ce2d15aecdb518bcd22ddeeec89dd98c04ff323b5b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/parser/control.rs:516-537 | src/parser/control.rs:546-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5552088bd8db3862a9d93fc08d7d2b4a8fde2bf2f0486903f9e6f48891fb6c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/parser/hwp3/mod.rs:5125-5146 | src/parser/hwpx/note_line_positions.rs:71-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:5125\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a2ea587ffc54c9efb2866ae4645020662a06026643908d7020dae545f9bfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/renderer/height_measurer.rs:2175-2196 | src/renderer/layout/table_layout.rs:3538-3559 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dceb1b764c4ecebb5bc86bed44795181dd56b78c4bef0450d20076c63687dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/renderer/height_measurer.rs:3637-3658 | src/renderer/layout/table_layout.rs:11860-11881 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:3637\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c12d570ea6d1d99e5ec399fbe31fbe9ee01f078b25f09ffade185abfdf054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/renderer/height_measurer.rs:4804-4825 | src/renderer/height_measurer.rs:5321-5342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4804}}}],"partialFingerprints":{"codehealthFindingId/v1":"7748909aded6e86b78f65b85a8a01380fa504cf982b234b8fe4b476470ac17fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/renderer/kerning.rs:1625-1647 | src/renderer/kerning.rs:1664-1685 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/kerning.rs:1625\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/kerning.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dc61d0a4d6a4538de21a9ac4635a036bf6d1a9676d3643fc8b7a8e4b73620e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/renderer/layout.rs:1934-1953 | src/renderer/typeset.rs:1926-1947 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:1934\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8c1d36497c6a68d1df38d6ba7a3556de0fc31fa1e7dbae6ca464c806fa92fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:5481-5498 | src/renderer/layout/paragraph_layout.rs:10220-10241 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:5481\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5481}}}],"partialFingerprints":{"codehealthFindingId/v1":"542c29d067e07a0f1f9c27833dfb768d18a8668bb0b9594386cfa7662b0ceeaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/renderer/layout/table_layout.rs:9095-9115 | src/renderer/layout/table_layout.rs:9685-9706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":9095}}}],"partialFingerprints":{"codehealthFindingId/v1":"028a55eee005de7685344c59cefa082da58c94193d1d63129c8b293c6f922cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/renderer/layout/table_layout.rs:27630-27651 | src/renderer/layout/table_partial.rs:6847-6867 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:27630\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27630}}}],"partialFingerprints":{"codehealthFindingId/v1":"9985941e2d8e71749d8993cd56642f7e4c5a3459bcbca30a90a25e3f2c6c7d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/renderer/svg.rs:922-943 | src/renderer/web_canvas.rs:1096-1115 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:922\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, \u0060src/renderer/web_canvas.rs:1116\u0060 calls \u0060set_fill_style_str\u0060, \u0060set_font\u0060 and \u0060src/renderer/svg.rs:944\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b8f8d124a9063d61eeb15102bbb0af8483e446e2288f4cab9602ccc9293df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): src/renderer/typeset/table/continuation/fragment/scan.rs:731-752 | src/renderer/typeset/table/continuation/fragment/scan.rs:778-796 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/table/continuation/fragment/scan.rs:731\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":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d422650a60c3d15fda712010fa2b3398981cf8315095fe85255ba970376e50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/serializer/hwpx/shape.rs:91-113 | src/serializer/hwpx/shape.rs:374-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/shape.rs:91\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/shape.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"96907c92e140d3eb45dc3e07d2c0b0ae8e9907e08b14a000f5ca648c9a2c20f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201322 lines \u00D7 2): src/wmf/parser/records/drawing/ext_text_out.rs:125-138 | src/wmf/parser/records/drawing/text_out.rs:68-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/wmf/parser/records/drawing/ext_text_out.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d648158da53163edab83b7b25b8da8c9c1b1cf82d141655a96eea2de164fc700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 10): src/cli/commands/edit/bookmarks.rs:148-168 | src/cli/commands/edit/controls.rs:20-40 | src/cli/commands/edit/document_objects.rs:283-303 | src/cli/commands/edit/equations.rs:265-285 | src/cli/commands/edit/media.rs:814-834 | src/cli/commands/edit/media.rs:912-932 | src/cli/commands/edit/notes.rs:210-230 | src/cli/commands/edit/shapes.rs:192-212 | src/cli/commands/edit/shapes.rs:466-486 | src/cli/queries/structured_objects.rs:23-43 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7011ec3bc40d436d37132e440a9bc7e84618e0b7590e0e2ddd721ede6d4f791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 7): src/cli/commands/edit/tables/layout.rs:12-32 | src/cli/commands/edit/tables/layout.rs:232-252 | src/cli/commands/edit/tables/layout.rs:480-500 | src/cli/commands/edit/tables/layout.rs:594-614 | src/cli/commands/edit/tables/structure.rs:125-145 | src/cli/commands/edit/tables/structure.rs:220-240 | src/cli/commands/edit/tables/structure.rs:315-335 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/layout.rs\u0060 and \u0060src/cli/commands/edit/tables/structure.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/layout.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87a305110b4fd643ee55ac7237112825a8d95de91365f0fea5d2d5b2ca09e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): src/bin/rhwp-agent/safety.rs:157-177 | src/bin/rhwp-agent/safety.rs:254-274 | src/bin/rhwp-agent/safety.rs:400-420 | src/bin/rhwp-agent/safety.rs:559-579 | src/bin/rhwp-agent/structurecmd.rs:40-60 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/safety.rs\u0060 and \u0060src/bin/rhwp-agent/structurecmd.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/safety.rs:157\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d719503fffed6edb273162ce3fa98972ab127a858736f41756a665b2e92a2099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): src/cli/commands/edit/document_objects.rs:569-589 | src/cli/commands/edit/note_content.rs:131-151 | src/cli/commands/edit/page.rs:13-33 | src/cli/commands/edit/page.rs:116-136 | src/cli/commands/edit/shapes.rs:282-302 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/note_content.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:569\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4841e0b223a4c735dea267225bd00585f66b159216ac68e50f4ce271f29cc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): src/wmf/converter/svg/mod.rs:230-250 | src/wmf/converter/svg/mod.rs:308-328 | src/wmf/converter/svg/mod.rs:425-445 | src/wmf/converter/svg/mod.rs:517-537 | src/wmf/converter/svg/mod.rs:589-609 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:230\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c3e695bb7961b22434cf00a080aea9657bc638231d1b0561032bb27236dafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): src/cli/commands/edit/document_text.rs:1036-1056 | src/cli/commands/edit/notes.rs:20-40 | src/cli/commands/edit/notes.rs:115-135 | src/cli/commands/edit/shapes.rs:26-46 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/notes.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 250 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:1036\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff3a9e52f4a945fc3e60b53e6285d4c595857bc27eefb71bb8b031d98b13b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): src/cli/commands/edit/header_footer_content.rs:297-317 | src/cli/commands/edit/header_footer_content.rs:616-636 | src/cli/commands/edit/header_footer_content.rs:770-790 | src/cli/commands/edit/header_footer_content.rs:1056-1076 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:297\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6acdd8eef5c46c9508152d980c8fc870ef43e6ce94de757ea8c963e347e229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): src/wmf/parser/records/bitmap/bit_blt.rs:131-152 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:135-156 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:158-179 | src/wmf/parser/records/bitmap/stretch_blt.rs:155-176 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/bit_blt.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/bit_blt.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc4d121853886c962a4f7deecb863bd892ffdd7afa087e1813609991a079d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:224-239 | src/document_core/queries/cursor_rect.rs:995-1015 | src/document_core/queries/cursor_rect.rs:4783-4797 \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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6b470e62e0a1aa04359c939cf910c42168410023c1940dbfadfc665170ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/main.rs:1099-1119 | src/main.rs:1178-1198 | src/main.rs:1252-1272 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:1099\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":"src/main.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b43056f373447631a9e0129aef4684e94cad06ef1037a86dc4ea51b0bd68d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): src/parser/hwpx/section.rs:6556-6575 | src/parser/hwpx/section.rs:6621-6641 | src/parser/hwpx/section.rs:6872-6891 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:6556\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6556}}}],"partialFingerprints":{"codehealthFindingId/v1":"102ad562766ec7d570b3e35cef303b8f0ccf111a9e78e5a9b729a05763c44fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201321 lines \u00D7 3): src/renderer/layout/table_layout.rs:16863-16883 | src/renderer/layout/table_layout.rs:16950-16968 | src/renderer/layout/table_partial.rs:3072-3081 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:16863\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":16863}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c4944c819dc5c4c47bca1d9a4f0dfaf629e573ebceac463166345253493ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 3): src/renderer/skia/anisotropic_image.rs:41-61 | src/renderer/skia/anisotropic_image.rs:113-132 | src/renderer/skia/metafile_print.rs:51-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/anisotropic_image.rs:41\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":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"243bf87a4ba6e729151084b7b13518472813e5fc5fc4b250b89fe86feb0b9f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/renderer/web_canvas/cubic_reduction.rs:52-72 | src/renderer/web_canvas/metafile_print.rs:57-77 | src/renderer/web_canvas/print_image_sampling.rs:105-125 \u2014 before extracting anything, compare \u0060src/renderer/web_canvas/cubic_reduction.rs\u0060 and \u0060src/renderer/web_canvas/metafile_print.rs\u0060 as WHOLE FILES: this scan already matched 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas/cubic_reduction.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3952089a7e8b739af708c01a39bfc499b513009c3cf80be2802ba9c8bc7215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/cli/batch/mod.rs:304-324 | src/cli/commands/batch_fill.rs:144-164 \u2014 before extracting anything, compare \u0060src/cli/batch/mod.rs\u0060 and \u0060src/cli/commands/batch_fill.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/batch/mod.rs:304\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":"src/cli/batch/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"704bc46bc2cecfff082ea53b1db05f8b85df438e7e46f8bf7cfe1a4215fab035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): src/cli/protocol/exchange/disclosure.rs:132-152 | src/cli/protocol/exchange/disclosure.rs:238-255 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/exchange/disclosure.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/protocol/exchange/disclosure.rs:236\u0060 calls \u0060read\u0060, \u0060map_err\u0060, \u0060to_string\u0060 and \u0060src/cli/protocol/exchange/disclosure.rs:132\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07753da94d05d3ab478f5b45014ddad60d0935022c255aa1e8607398b1b0b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/cli/queries/explain.rs:174-194 | src/cli/queries/explore.rs:53-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/cli/queries/explain.rs:174\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/explain.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdac0e42270eaa479443536d6eeda97a9b8223b9d305490f18127062ad517ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/cli/queries/security_inspection.rs:711-731 | src/cli/queries/security_inspection.rs:983-1003 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:711\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3153a435953cc55bb88cca48f4b6700de950e9b82d978a3b9acfd05fbeb3065f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:157-177 | src/diagnostics/hwpx_roundtrip_batch.rs:46-66 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:157\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":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c522491a35df5bf3b50eff0bc5b928e92d27558b71302dfaecbcb907644481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:290-310 | src/diagnostics/ir_field_sweep.rs:334-353 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/ir_field_sweep.rs:290\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6e6243fd527d219276a446703b89348880009ee088e4f9cec5c3634fadd97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:873-893 | src/diagnostics/ir_field_sweep.rs:1022-1042 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/ir_field_sweep.rs:873\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d1b9a56fb0628f4145de79d6747948a328f58ecf23246f96c55754108170c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/document_core/commands/formatting.rs:2058-2077 | src/document_core/commands/formatting.rs:2494-2514 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:2058\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74723bf648f5426e443a5811edc4aaed24df27a7047d58fe96527ad6d9df4e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/document_core/commands/object_ops/common.rs:593-613 | src/document_core/commands/object_ops/equation.rs:598-618 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/equation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/common.rs:593\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":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b23d2cd56042da0ae132ed8272fe1928249aedc096a47c671e7bd972b69c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/document_core/commands/text_editing.rs:5009-5029 | src/document_core/commands/text_editing.rs:5042-5062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82199737810d244d46deea9f9216f91fe75b0248fd17403143e816d3380d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:4032-4050 | src/document_core/queries/cursor_rect.rs:4176-4196 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:4032\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da27205e40e5b4dfc43be43af22da759858c645437486e55c579e61f9117a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/model/table.rs:1952-1972 | src/model/table.rs:2101-2121 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/table.rs:1952\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"58754b8c3999b7a41696fbbf4ed82093ac221d0f46aeccd139181bf6d7016b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/paint/json.rs:3733-3753 | src/renderer/canvaskit_policy.rs:2414-2434 \u2014 before extracting anything, compare \u0060src/paint/json.rs\u0060 and \u0060src/renderer/canvaskit_policy.rs\u0060 as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86dc08b40d44c128889271bf9710330f768bcd1cfcc2d7494fc227e391bdb5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/parser/auto_numbers.rs:362-382 | src/parser/auto_numbers.rs:384-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/auto_numbers.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c945ddf7355fb2c616c555e3df5ae0b1976c2d919a92b560ae40bcef643b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/renderer/equation/canvas_render.rs:394-414 | src/renderer/equation/svg_render.rs:462-482 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:394\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50e54e180a9c307a665df315a1d0cfeee4e03f6764f7532c23c054208d98406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/renderer/pagination/engine.rs:1153-1176 | src/renderer/typeset/controls/host_wrap.rs:16-38 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/controls/host_wrap.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:1153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a11b3dfa80c2b894685faef44845c62a5fc3132ce1c34549874245161b691b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/renderer/skia/text_replay.rs:267-287 | src/renderer/skia/text_replay.rs:300-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c222b556142bf36317912222c172faeb98af1fcc70a575b65deeb6e968267469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201321 lines \u00D7 4): src/document_core/html_table_import.rs:1106-1108 | src/document_core/html_table_import.rs:1130-1130 | src/renderer/svg.rs:4534-4554 | src/renderer/web_canvas.rs:322-340 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/html_table_import.rs:1106\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"217d8a8d7c5886b15ea0469cb85f61a621f87c9f8518e65de90367625c1effc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:101-121 | src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:443-463 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:464\u0060 calls \u0060var_os\u0060, \u0060is_some\u0060 and \u0060src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:122\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ac8bba265a06d2e2029d25dfb0613287de256326589e0533825b45456fb0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 8): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:91-110 | src/diagnostics/hwp5_cell_header_probe.rs:149-168 | src/diagnostics/hwp5_contract_analyze.rs:74-93 | src/diagnostics/hwp5_contract_probe.rs:96-115 | src/diagnostics/hwp5_ctrl_data_trace.rs:30-49 | src/diagnostics/hwp5_first_para_control_probe.rs:102-121 | src/diagnostics/hwp5_mel_personnel_probe.rs:95-114 | src/diagnostics/hwp5_table_probe.rs:101-120 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:91\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40b239b79852dff9ad80cb875e379d51560f4da7a4cbe1f06766640b9824fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 7): src/cli/commands/edit/header_footer_content.rs:291-310 | src/cli/commands/edit/header_footer_content.rs:448-467 | src/cli/commands/edit/header_footer_content.rs:610-629 | src/cli/commands/edit/header_footer_content.rs:764-783 | src/cli/commands/edit/header_footer_content.rs:903-922 | src/cli/commands/edit/header_footer_content.rs:1050-1069 | src/cli/commands/edit/header_footer_properties.rs:432-451 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:291\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6fcba807b42c7bf163bc351acac286ddf440f6252d075908d06c8827bfcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): src/diagnostics/hwp5_cell_header_probe.rs:821-841 | src/diagnostics/hwp5_contract_probe.rs:739-759 | src/diagnostics/hwp5_inventory_diff.rs:551-571 | src/diagnostics/hwp5_mel_personnel_probe.rs:735-755 | src/diagnostics/hwp5_table_probe.rs:590-610 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:821\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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94608c842d162b964a3a9c95ca44cae40efc14b8b44ec6ed27bdcb6363e1386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 5): src/wmf/parser/records/state/set_bk_mode.rs:45-64 | src/wmf/parser/records/state/set_polyfill_mode.rs:44-62 | src/wmf/parser/records/state/set_rop2.rs:46-65 | src/wmf/parser/records/state/set_stretch_blt_mode.rs:44-63 | src/wmf/parser/records/state/set_text_align.rs:46-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/state/set_bk_mode.rs:45\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/state/set_bk_mode.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3dcab748d79fd39d42237081df6bcbc51367d3abf57ed7ba016e80f1e52364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/cli/commands/edit/document_text.rs:846-865 | src/cli/commands/edit/document_text.rs:942-961 | src/cli/commands/edit/page.rs:361-380 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/page.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da6b6279e76ef463b80a07931ebb7db59ec773e5dd3485d8044a49a63957c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): src/cli/outputs/tabular.rs:27-45 | src/cli/outputs/text.rs:278-297 | src/cli/queries/security_inspection.rs:37-56 \u2014 before extracting anything, compare \u0060src/cli/outputs/tabular.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:27\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"777dff5da344d149e9e5eab710bc9acc4da05657c029ab5d221af422eea10e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): src/document_core/commands/table_ops.rs:663-681 | src/document_core/commands/table_ops.rs:702-720 | src/document_core/commands/table_ops.rs:808-827 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/table_ops.rs:663\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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"1778a67eb99be95fa3c9af11284462afcca2c0b254c4694d3766b64f5dba1117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/document_core/helpers.rs:1617-1636 | src/parser/hwpx/header.rs:2519-2538 | src/serializer/doc_info.rs:660-679 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/helpers.rs:1617\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1445d19592c97a368699d21f82a428f7a2033231da6b0e1b89ea68ef556b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/document_core/queries/hwpctrl_sets.rs:2134-2153 | src/document_core/queries/hwpctrl_sets.rs:2244-2263 | src/document_core/queries/hwpctrl_sets.rs:2288-2307 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/hwpctrl_sets.rs:2134\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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"927556253b5688a5b10e74f036c2e449a89555c4510a19bee05439b9b4e15d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/renderer/svg.rs:5353-5372 | src/renderer/svg.rs:5429-5448 | src/renderer/svg.rs:5496-5515 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:5353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":5353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7575364cb006ff16c622b1406bf31daa0641a0864a900ff3058b5ea78b35084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:451-470 | crates/rhwp-ooxml-chart/src/renderer.rs:498-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb420e463d20ec9523de41d925031c9a425f3d5c3edb028955c68193de4c3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:53-72 | src/bin/rhwp-agent/stats.rs:158-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/safety.rs:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512a03841a84b212c75b2640ebe17acd8a7c77454ac606d24a63545dbd484b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/bin/rhwp-q/kit/flow_images.rs:53-72 | src/bin/rhwp-q/kit/overlay_images.rs:57-76 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 and \u0060src/bin/rhwp-q/kit/overlay_images.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/flow_images.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/flow_images.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"086747e304d41e110b1ceb38747195f5b4d22733549bed880a473186eec7deed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/bin/rhwp-q/kit/footnote_hit.rs:26-45 | src/bin/rhwp-q/kit/hit_header.rs:26-45 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/footnote_hit.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_header.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/footnote_hit.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/footnote_hit.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c10ebf86853dcb7cb525f76f52ecad30dc2cf81fbaca2031cff2d1324eb0ea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/cli/commands/edit/text.rs:335-354 | src/cli/commands/tabular_import.rs:75-94 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/text.rs\u0060 and \u0060src/cli/commands/tabular_import.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/text.rs:335\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/text.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c6723cc2ee39c85a571cb341c734f343118f772bf34ec0b6bded579d6ab037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/cli/commands/generation.rs:70-89 | src/cli/commands/generation.rs:233-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/generation.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/generation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8324a1b55cdf54841288300ae584fa2570664e53ec589c6f08b79a8825eae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/cli/protocol/exchange/settlement.rs:187-206 | src/cli/protocol/exchange/settlement.rs:335-354 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/exchange/settlement.rs:187\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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e70b9b42ac87276a4fb4be0eaf9d617ac5e9a7f6b3522f257d13e27191cea4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:584-603 | src/diagnostics/hwp5_mel_personnel_probe.rs:522-541 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:584\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, \u0060src/diagnostics/hwp5_cell_header_probe.rs:604\u0060 calls \u0060find_host_para_index\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs:542\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec78139f3a597524fd4cd08d7fadfdb24f23b759c221a7946ca2b052d86aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/document_core/commands/formatting.rs:808-825 | src/document_core/commands/formatting.rs:885-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4acbaac9ea62ab083eb7cbce4d5648c115cbab68b3c0753a89b2f13fba92b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): src/document_core/commands/html_import.rs:374-393 | src/document_core/commands/html_import.rs:428-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/html_import.rs:374\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":"src/document_core/commands/html_import.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003a38a4bf1bff0133bb072285d438ee232dcc07b63c7023039c5963c16b3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/document_core/commands/text_editing.rs:2515-2534 | src/document_core/commands/text_editing.rs:2884-2902 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2515\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"263c78a68da6aedb1b6ccfa3e00baf0d427f16b6e0899d71d99b8d9605e567c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/document_core/queries/bookmark_query.rs:160-179 | src/document_core/queries/field_query.rs:2626-2645 \u2014 before extracting anything, compare \u0060src/document_core/queries/bookmark_query.rs\u0060 and \u0060src/document_core/queries/field_query.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aba6333570b3293163f15c0b139cfd21e5142ae386ed719036ab7df8c6c903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): src/parser/control/shape.rs:1109-1123 | src/parser/control/shape.rs:1134-1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e275383cf764c0a8e81766f0b9f155f4cbd140a4b533ae78d15c026d22759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/parser/pdf/recognition.rs:589-610 | tools/pdf-ir-poc/src/recognition.rs:362-383 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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. 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd5368748da60fe8b9c8ca2f0791b47abcd08d0d3521515525eff9f79c778bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/parser/pdf/table_detection.rs:415-437 | tools/pdf-ir-poc/src/table_detection.rs:198-220 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545b85f2b4463993c130c6584f0a47b973d660364164e165b7318c17825b50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/renderer/layout.rs:11688-11707 | src/renderer/layout.rs:12394-12413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":11688}}}],"partialFingerprints":{"codehealthFindingId/v1":"94374dd473de241cc510bd2a96337e1ea0031be7f3d556deb6290d63015a45a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1466-1485 | src/renderer/layout/border_rendering.rs:1514-1533 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1466\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"4377d276b2b6a7a6ad6e27ccc1ea6bcec0ca7f1d3419cea4fd5d3671905279f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2691-2708 | src/renderer/layout/shape_layout.rs:2724-2743 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2691\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880f61cf3b91324eaa5a273b7de17e4f63d7313b40c67c45b415e1f8a9b3c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201320 lines \u00D7 2): src/renderer/layout/table_layout.rs:14409-14419 | src/renderer/layout/table_layout.rs:15059-15078 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:14409\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce8d9ecad6babef425674f98479813b020993ab92d548bf315380dd7d09fe66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): src/renderer/layout/table_layout.rs:23767-23786 | src/renderer/layout/table_layout.rs:24011-24026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23767}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ce446aa12bb3d8f0fb3332c628e71a819435b9ec0dcd0db7eea88715eec3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/renderer/layout/table_layout/reflow_external_cut.rs:92-111 | src/renderer/layout/table_layout/reflow_fragment_content.rs:234-253 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/layout/table_layout/reflow_external_cut.rs:92\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":"src/renderer/layout/table_layout/reflow_external_cut.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd92f4e93b505145ba6fc50f1bfa202b58715a5bd1dcc48c7127a34210834a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/renderer/layout/table_partial.rs:8244-8263 | src/renderer/layout/table_partial.rs:8271-8290 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:8244\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":8244}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d884389d4aa36da201537c63e4a72452d3226ecabf33d7bd9b5e06a2b41454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/renderer/layout/text_measurement.rs:527-546 | src/renderer/layout/text_measurement.rs:2812-2829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6aeeaa4ec13ed950a1591294201682e02c12e8aa8c209c5a2a568a96758efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:154-173 | src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:189-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8569785ede963cda3cce98ea830eed1f01b9c514439ebba936b9e9caa1988ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 15): src/cli/commands/edit/document_objects.rs:216-232 | src/cli/commands/edit/document_text.rs:273-289 | src/cli/commands/edit/document_text.rs:383-399 | src/cli/commands/edit/document_text.rs:519-535 | src/cli/commands/edit/document_text.rs:881-897 | src/cli/commands/edit/document_text.rs:977-993 | src/cli/commands/edit/document_text.rs:1072-1088 | src/cli/commands/edit/note_content.rs:397-413 | src/cli/commands/edit/note_content.rs:512-528 | src/cli/commands/edit/notes.rs:56-72 | src/cli/commands/edit/notes.rs:151-167 | src/cli/commands/edit/page.rs:402-418 | src/cli/queries/security_inspection.rs:165-183 | src/cli/queries/security_inspection.rs:278-296 | src/cli/queries/security_inspection.rs:376-394 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:216\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"836602d701ddb1040fb1a45b8a183b8fd007e8d02ae03d193e44833dfcc408da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 10): src/bin/rhwp-agent/grepcmd.rs:56-74 | src/bin/rhwp-agent/harvest.rs:43-61 | src/bin/rhwp-agent/harvest.rs:168-186 | src/bin/rhwp-agent/inspect.rs:171-189 | src/bin/rhwp-agent/lookups.rs:99-117 | src/bin/rhwp-agent/safety.rs:151-169 | src/bin/rhwp-agent/safety.rs:248-266 | src/bin/rhwp-agent/safety.rs:394-412 | src/bin/rhwp-agent/safety.rs:553-571 | src/bin/rhwp-agent/structurecmd.rs:34-52 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/grepcmd.rs\u0060 and \u0060src/bin/rhwp-agent/inspect.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/grepcmd.rs:56\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"192eb2a5926c7d6a46526e781e5d879adaf48fd8cb3219c5b33cecb8ff508862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): src/diagnostics/hwp5_cell_header_probe.rs:186-204 | src/diagnostics/hwp5_contract_analyze.rs:111-129 | src/diagnostics/hwp5_mel_personnel_probe.rs:132-150 | src/diagnostics/hwp5_table_probe.rs:138-156 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_analyze.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:186\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"24250959e8ca9506e24f286ca733905cbd6457b250df74e1dfb04b7069c92bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/bin/rhwp-q/kit/canvaskit_preflight.rs:55-73 | src/bin/rhwp-q/kit/layer_tree.rs:31-49 | src/bin/rhwp-q/kit/search_all.rs:33-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/canvaskit_preflight.rs:55\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":"src/bin/rhwp-q/kit/canvaskit_preflight.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11eb646dd9783ca148f5f10a3b14438caa92d772dbcd4a2d62dafe46e9d3a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/bin/rhwp-q/kit/cur_field_state.rs:21-39 | src/bin/rhwp-q/kit/line_starts.rs:20-38 | src/bin/rhwp-q/kit/para_bounds.rs:20-38 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 and \u0060src/bin/rhwp-q/kit/line_starts.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cur_field_state.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafac35ce66676be79b90b1c23763c1d7a3071a2c3b63e1a65331d436cd15419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/document_core/commands/formatting.rs:1700-1718 | src/document_core/commands/formatting.rs:1904-1922 | src/document_core/commands/header_footer_ops.rs:1197-1215 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/formatting.rs:1700\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":"src/document_core/commands/formatting.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46adf31fdc77e4865bb4c734d01d37915fd47d1da6ac2661143786a7306975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): src/document_core/helpers.rs:1641-1659 | src/parser/doc_info.rs:364-381 | src/renderer/layout/border_rendering.rs:1599-1617 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/helpers.rs:1641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43f09e2f402815f71cc5cd621a18f297d86ccd186469206534cd04eda1ed2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): src/document_core/queries/rendering.rs:4252-4270 | src/document_core/queries/rendering.rs:4295-4311 | src/document_core/queries/rendering.rs:4365-4381 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a4b200c47073653ccc7eff918e05a8b789d2dc32ceeb038a6bea4fcdc73b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/native_host/gpu_d3d.rs:183-201 | src/native_host/gpu_metal.rs:123-141 | src/native_host/presentation.rs:106-124 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs: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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"445865e30c0b8d27a15bac3b18556c906d08cadb0ea3490d99dc90b5d93f907a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/parser/hwp3/mod.rs:3257-3275 | src/parser/hwp3/mod.rs:3281-3299 | src/parser/hwp3/mod.rs:3314-3332 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:3257\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"69976f47ae8cbfb3bd62a501f4dcfca95217bf436af03ab61830b76074d397f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201328 lines \u00D7 3): src/renderer/height_measurer.rs:2230-2257 | src/renderer/height_measurer.rs:6236-6260 | src/renderer/height_measurer.rs:6373-6392 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"923244ef5506f6e056e2b756b800527db127009fb791e31b4f18f21c2d9cf330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): src/renderer/layout/table_layout.rs:8263-8277 | src/renderer/layout/table_partial.rs:3653-3671 | src/renderer/layout/table_partial.rs:3750-3766 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/layout/table_layout.rs:8278\u0060 calls \u0060Some\u0060, \u0060get\u0060 and \u0060src/renderer/layout/table_partial.rs:3672\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3c54bb7767c24958a867b6c9756ff99421c874f02981301273003394b80358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/renderer/layout/table_partial.rs:8243-8261 | src/renderer/layout/table_partial.rs:8270-8288 | src/renderer/layout/table_partial.rs:8308-8326 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_partial.rs:8243\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c7fcebc69357bd9b7604fbc20374fd74018c726c1e613bcd6587220827230f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rhwp-ooxml-chart/src/patch.rs:813-831 | crates/rhwp-ooxml-chart/src/patch.rs:840-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/patch.rs:813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1b23ee12d8c203008fa4bf22b6d740434b713c65db744fc29e3fd3f1f1885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:959-977 | crates/rhwp-ooxml-chart/src/renderer.rs:1064-1082 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/renderer.rs:959\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"346b76e4c56f5db747353fe59aba4d0ba419222ac964d77608c1b1d3cc50e6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:59-77 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:59-77 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-section-starts.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:59\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":"src/bin/rhwp-q/commands/rhwp-q-page-caret.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"088283089d44edef7dbdc1945eaadcc1ee0d5438e54a1b7204a7314547026051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/bin/rhwp-q/kit/line_starts.rs:54-72 | src/bin/rhwp-q/kit/para_bounds.rs:54-72 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/line_starts.rs\u0060 and \u0060src/bin/rhwp-q/kit/para_bounds.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/line_starts.rs:54\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/line_starts.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb47dbf54ae39df8a3503c6849bad4845cfce0ddafa4211fac509a089bb8c040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/cli/commands/edit/cells.rs:914-932 | src/cli/commands/edit/tables/layout.rs:538-555 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/tables/layout.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 209 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:914\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"b865341f70d1d7345386a986ef57ff04ec39943d17f8b66b5626f3766a98e65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/cli/commands/edit/media.rs:378-396 | src/cli/commands/edit/media.rs:757-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/media.rs:378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1cc2898d14ff4ad5e33ae1617b6a451876217b85aefe104cc2ab8c9877f49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/cli/outputs/raster.rs:211-229 | src/cli/outputs/text.rs:457-475 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/raster.rs:211\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7d2ec37cff4ae23b3d7abdc1d215f88ad5dc4eac99c78b6029325de60c0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): src/document_core/builders/exam_paper.rs:111-125 | src/scaffold/builder.rs:141-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/builders/exam_paper.rs:111\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":"src/document_core/builders/exam_paper.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d1e101517df46f0deabdf40c704589fa7b115a8cd82c2079c4b20de5b1880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/document_core/commands/clipboard.rs:2135-2153 | src/document_core/commands/clipboard.rs:2177-2193 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/clipboard.rs:2135\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a04ceb57fc518ce612b341233b490b2c52773debbf5566b11c010ad36d87a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/document_core/commands/formatting.rs:1064-1082 | src/document_core/commands/formatting.rs:1115-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":"src/document_core/commands/formatting.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eff9c318c2715e0bd9be44abd34ecf98a1763ec3ee88b292ff1a58be1d6d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/document_core/commands/text_editing.rs:1689-1707 | src/document_core/commands/text_editing.rs:1942-1960 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:1689\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5758f28ac35967588890c5c6a73f37db083a4888dcb25383d242a50c290b77e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/document_core/commands/text_editing.rs:4579-4597 | src/document_core/commands/text_editing.rs:4636-4651 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:4579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acc1ce886bcdc7ee50c4bd2caf05616130c6e826bf0a62fa2e72a90c2e74701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/document_core/queries/rendering.rs:1415-1433 | src/document_core/queries/rendering.rs:1456-1474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b1aef0084a0e6543b5ad6b2c06d8b357a200779d024c4a9ad04d2cf4581552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/document_core/queries/rendering.rs:1636-1654 | src/document_core/queries/rendering.rs:1677-1695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/document_core/queries/rendering.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b496ca0726effe60cdb8179ae1afc7f3764f0fd69223afd469ad424bf2e6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/document_core/queries/rendering.rs:4459-4477 | src/document_core/queries/rendering.rs:4480-4498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 after the matched lines, \u0060src/document_core/queries/rendering.rs:4479\u0060 calls \u0060Placeholder\u0060 and \u0060src/document_core/queries/rendering.rs:4504\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":4459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae50c8210c5641a04d9728d4244a339e994fb2de86e7b0d58440cef623b9b55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/main.rs:521-539 | src/service/open.rs:313-329 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:521\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":"src/main.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ef825810879daf9de0e4656b5222e8b6c73131c66a2f4a10c75a7862fb7db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/parser/hwp3/mod.rs:1737-1755 | src/parser/hwp3/mod.rs:1957-1975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30be3ada9bffd5bd23e92e92a65bbc73a631e19b0aea2b78e4f27e0dd66888d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/parser/hwpx/section.rs:2962-2980 | src/parser/hwpx/section.rs:3014-3032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea1e0a0bad1e2bd493b5e6b2b16b9f9bb200ee9d8b85b63591bcec8aa54c41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/parser/mod.rs:457-486 | src/parser/mod.rs:942-971 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:457\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":"src/parser/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c395d3a4b4264d2f62e32ee71dbc986ae4b541c556cb118a750febed4d7106a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/parser/pdf/lowering.rs:308-325 | tools/pdf-ir-poc/src/lowering.rs:135-153 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e75bf511005c6e95e98a0b08e2e85bd2de7ba913114838edf686210764849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/renderer/composer/line_breaking.rs:4626-4643 | src/renderer/composer/line_breaking.rs:6225-6243 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/line_breaking.rs:4626\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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff49675764ca7f54b4c528af469aff8a94da90ff3187818751947173950c99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/renderer/equation/canvas_render.rs:372-388 | src/renderer/equation/svg_render.rs:436-454 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:372\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0289f1ab8ad8151529dc13b438026bda4d4820331b06bd008b5367454da2aed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/equation/operator_outline.rs:79-97 | src/renderer/equation/relation_outline.rs:142-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/equation/operator_outline.rs:79\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":"src/renderer/equation/operator_outline.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab64782fe7f44b71f3591505e4d37b3c12d282f3f0b509d1b11c62b84c62c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/renderer/layout.rs:1956-1974 | src/renderer/typeset.rs:1887-1902 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:1956\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a075f71ab34e2d2fdfd5e5a05f563a357aa607b08613db1a22b6cefae4973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/layout/picture_footnote.rs:956-974 | src/renderer/layout/tac_picture_item.inc.rs:416-434 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/layout/picture_footnote.rs:956\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/layout/tac_picture_item.inc.rs:435\u0060 calls \u0060Some\u0060 and \u0060src/renderer/layout/picture_footnote.rs:975\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b36e74b38c687a2f46a2c37addd7c380e467534c71bf16e72f5b97de704656e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/renderer/layout/table_partial.rs:3697-3713 | src/renderer/layout/table_partial.rs:3796-3814 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:3697\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c833a5d26a30c307aabdd0b794a523f7aec116d30769422cd6f742ddbb63c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/layout/tac_picture_item.inc.rs:344-362 | src/renderer/layout/tac_picture_item.inc.rs:370-388 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/tac_picture_item.inc.rs:344\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":"src/renderer/layout/tac_picture_item.inc.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ac9c18824a20e47de0ca903b3d2fa28ca5dc3a9233e3873e344a7fc834ed15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/render_normalization/math_table.rs:220-238 | src/renderer/render_normalization/math_textbox.rs:162-180 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization/math_table.rs\u0060 and \u0060src/renderer/render_normalization/math_textbox.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/render_normalization/math_table.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/math_table.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5f9fada077f9dc43fb8ddc5d6b5b463bd2826fe800ea5c2516f263bb2b69f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/svg.rs:2940-2958 | src/renderer/svg.rs:2967-2985 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:2940\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"583386bc6a70b58fff78671a7ba27c6f94a6d7cf5ae0c72c93855cef5b492286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/renderer/svg.rs:5376-5392 | src/renderer/svg.rs:5451-5469 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:5376\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":"src/renderer/svg.rs"},"region":{"startLine":5376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473d68c9766408c2c99ab3dde27bc3de56bd3831b8980b044f65af6f00b49f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/renderer/web_canvas.rs:3950-3968 | src/renderer/web_canvas.rs:4092-4110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"640870b2cd09fb9ac282eb46c76383fcc997c3428de225f3c1e3940aca439b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/serializer/body_text.rs:1189-1207 | src/serializer/body_text.rs:1217-1235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/body_text.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"44853860f9bc345faad4258988634d682d856cc18bf80a8fa2bac62cf88271d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/wmf/parser/records/drawing/flood_fill.rs:42-60 | src/wmf/parser/records/drawing/set_pixel.rs:41-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/flood_fill.rs:42\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":"src/wmf/parser/records/drawing/flood_fill.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2741613ec0018f404f070e1eb5d82111d398a1aeb2548cf123a0b7b3d8ae43b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 13): src/bin/rhwp-q/kit/cur_field_state.rs:59-76 | src/bin/rhwp-q/kit/field_by_id.rs:33-50 | src/bin/rhwp-q/kit/field_info_at.rs:59-76 | src/bin/rhwp-q/kit/field_list_json.rs:19-36 | src/bin/rhwp-q/kit/fn_selection_rects.rs:98-115 | src/bin/rhwp-q/kit/form_at.rs:59-76 | src/bin/rhwp-q/kit/form_value.rs:60-77 | src/bin/rhwp-q/kit/hf_edit_target.rs:51-68 | src/bin/rhwp-q/kit/hit_fn_marker.rs:60-77 | src/bin/rhwp-q/kit/hit_in_footnote.rs:60-77 | src/bin/rhwp-q/kit/hit_in_hf.rs:77-94 | src/bin/rhwp-q/kit/line_starts.rs:46-63 | src/bin/rhwp-q/kit/para_bounds.rs:46-63 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 and \u0060src/bin/rhwp-q/kit/field_info_at.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cur_field_state.rs:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"675128fa98c5be015b006938daf5647a44f6c0c476182e1ef782e4f2403edb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 13): src/cli/commands/edit/bookmarks.rs:189-205 | src/cli/commands/edit/cell_paragraphs.rs:80-97 | src/cli/commands/edit/controls.rs:61-77 | src/cli/commands/edit/equations.rs:306-322 | src/cli/commands/edit/media.rs:855-871 | src/cli/commands/edit/notes.rs:251-267 | src/cli/commands/edit/shapes.rs:233-249 | src/cli/commands/edit/shapes.rs:507-523 | src/cli/commands/edit/tables/grid.rs:643-660 | src/cli/commands/edit/tables/layout.rs:173-190 | src/cli/commands/edit/tables/layout.rs:417-434 | src/cli/commands/edit/tables/layout.rs:651-668 | src/cli/queries/structured_objects.rs:52-68 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:189\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf57ef73a5ed8e822f14afd7a3c6327dcc3b6b26d9760072de4ef7db5b5bf40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 10): src/bin/rhwp-q/kit/bin_data.rs:35-52 | src/bin/rhwp-q/kit/caret_stops.rs:45-62 | src/bin/rhwp-q/kit/char_index.rs:59-76 | src/bin/rhwp-q/kit/chart_csv.rs:52-69 | src/bin/rhwp-q/kit/covering_pages.rs:42-59 | src/bin/rhwp-q/kit/page_border_fill.rs:32-49 | src/bin/rhwp-q/kit/page_text.rs:32-49 | src/bin/rhwp-q/kit/source_image_bytes.rs:33-50 | src/bin/rhwp-q/kit/word_end.rs:59-76 | src/bin/rhwp-q/kit/word_starts.rs:45-62 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/bin_data.rs\u0060 and \u0060src/bin/rhwp-q/kit/source_image_bytes.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/bin_data.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9cfaec729cb884f410ec48188e04e5f1f1df28a041e163a4c880a1589d0624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 7): src/cli/commands/edit/cell_paragraphs.rs:96-109 | src/cli/commands/edit/cell_paragraphs.rs:256-269 | src/cli/commands/edit/cells.rs:312-329 | src/cli/commands/edit/cells.rs:583-596 | src/cli/commands/edit/cells.rs:752-765 | src/cli/commands/edit/cells.rs:929-942 | src/cli/commands/edit/formatting.rs:963-976 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:96\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bc4b2fe123741e5a41c483d53a9e690c2353006ed3502c3de5cba89491abb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 6): src/bin/rhwp-agent/grepcmd.rs:77-94 | src/bin/rhwp-agent/safety.rs:167-183 | src/bin/rhwp-agent/safety.rs:264-280 | src/bin/rhwp-agent/safety.rs:410-426 | src/bin/rhwp-agent/safety.rs:569-585 | src/bin/rhwp-agent/structurecmd.rs:50-66 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/grepcmd.rs\u0060 and \u0060src/bin/rhwp-agent/safety.rs\u0060 as WHOLE FILES: this scan already matched 3 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/grepcmd.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e22663d6a8e2da0cb02f948f8c4dab2d1018c43d86a886c635650fc332e3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): src/serializer/hwpx/section.rs:2517-2534 | src/serializer/hwpx/section.rs:2643-2660 | src/serializer/hwpx/section.rs:2724-2741 | src/serializer/hwpx/section.rs:2803-2820 | src/serializer/hwpx/section.rs:2946-2963 \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":"src/serializer/hwpx/section.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7b0c1e002d15a81dece06d1e379adff6708cf8ecca18612127a12e6dfaef95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): src/renderer/layout/table_layout.rs:12207-12224 | src/renderer/layout/table_layout.rs:28647-28664 | src/renderer/layout/table_layout.rs:28698-28715 | src/renderer/layout/table_layout.rs:28743-28760 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff967d9b3a52ee108ddbd9171aaef07d49f1fcb57ee50c23121998d9b09ad20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:49-66 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:49-66 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:49-66 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dce98e4239f7408ab75ddfd23aec0bd34494e29385dcd73487cc2a210594c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/cli/commands/edit/cells.rs:428-445 | src/cli/commands/edit/media.rs:432-449 | src/cli/commands/tabular_import.rs:401-418 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/media.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 266 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:428\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b033e80285eceefe771da126f964bc412d04bc521197f1e5ccf367fcf28d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): src/cli/commands/edit/document_objects.rs:171-187 | src/cli/commands/edit/header_footer_content.rs:626-643 | src/cli/commands/edit/media.rs:559-575 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/header_footer_content.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 163 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:171\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76bbbf4c9b5bf016f9ad566c0c7cee93252a67706dad9836cb81763b24eff97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/cli/outputs/pdf.rs:78-95 | src/cli/outputs/text.rs:442-459 | src/cli/outputs/vector.rs:76-93 \u2014 before extracting anything, compare \u0060src/cli/outputs/pdf.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/pdf.rs:78\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88d0a6efc5e0f9f9b3397b4e25904c5ec5b4a367f77dac5ff286869f562bde1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): src/cli/queries/data_extraction.rs:47-64 | src/cli/queries/security_inspection.rs:604-620 | src/cli/queries/security_inspection.rs:876-892 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/data_extraction.rs:47\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cli/queries/security_inspection.rs:620\u0060 calls \u0060Some\u0060 and \u0060src/cli/queries/data_extraction.rs:64\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/data_extraction.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b35638cb2f19c86ecc465a6460170ad52ec59e0be2309b3ef1f15a00d613537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): src/document_core/commands/clipboard.rs:946-963 | src/document_core/commands/foreign_paste.rs:175-189 | src/document_core/commands/html_import.rs:253-269 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0432935c770d411dbdcb87ec24ba875a173f2cc5902c2936a425413e7c970b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): src/renderer/svg.rs:2707-2723 | src/renderer/svg.rs:2743-2760 | src/renderer/svg.rs:2833-2850 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/svg.rs:2725\u0060 calls \u0060iter\u0060, \u0060char_overlap_display_text\u0060 and \u0060src/renderer/svg.rs:2762\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e8b588b80a449b8fb482b11fafd18441eb383ea3a0930dc01fffa8eea7e0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): src/wmf/converter/bitmap.rs:48-70 | src/wmf/converter/bitmap.rs:83-105 | src/wmf/converter/bitmap.rs:139-161 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/bitmap.rs:48\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/bitmap.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a404d4b3e4d43ace00f73cbddf30906300714d8f93bac1317b1da9d45c39528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/wmf/converter/svg/mod.rs:186-203 | src/wmf/converter/svg/mod.rs:264-281 | src/wmf/converter/svg/mod.rs:473-490 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:186\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d394ec0ed1de42279d69e22d7d8b35e5fc2ffb66a6c4f5f9d2d28a817b7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/wmf/parser/records/bitmap/dib_stretch_blt.rs:139-156 | src/wmf/parser/records/bitmap/stretch_blt.rs:136-153 | src/wmf/parser/records/drawing/pat_blt.rs:52-69 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/stretch_blt.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs:139\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":"src/wmf/parser/records/bitmap/dib_stretch_blt.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d4eaf28ba1ab5cea9f88631f5cf5b0cd4d51f4f4c8415578414ab89509c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): mydocs/tech/investigations/issue-595/probes/inspect_595.rs:138-155 | mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs:66-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs:85\u0060 calls \u0060default\u0060 and \u0060mydocs/tech/investigations/issue-595/probes/inspect_595.rs:157\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-595/probes/inspect_595.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc8dedb6a967c58efb88939060861142220bdba86eb85ef0a3d8f72c8302cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/bin/rhwp-agent/chunkplan.rs:62-79 | src/bin/rhwp-agent/piiscan.rs:95-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/chunkplan.rs:62\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2592cc6c75e2d7cca079a5083bf0996cac2c33c5b164f86724efbbf38afde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:324-342 | src/bin/rhwp-agent/safety.rs:628-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/safety.rs:324\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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"729f85c73e57b3b9dc5d62d09345eebc3c1e11282dd993a21137097a1a6fe952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/bin/rhwp-q/kit/covering_pages.rs:14-31 | src/bin/rhwp-q/kit/page_border_fill.rs:16-33 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 and \u0060src/bin/rhwp-q/kit/page_border_fill.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/covering_pages.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/covering_pages.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b652cd5a671e40156f287849c65ce44c391ca15f9ca27860089f54cdd478646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/bin/rhwp-q/more/probe.rs:188-205 | src/bin/rhwp-q/pack/probe.rs:178-195 \u2014 \u0060src/bin/rhwp-q/more/probe.rs\u0060 and \u0060src/bin/rhwp-q/pack/probe.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 5 separate duplicated blocks between them, totalling at least 113 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ccde4eb89c7ce57b90b2b5060c5f538fe12dda30f74942c6c84a0c810faf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/cli/commands/edit/formatting.rs:175-192 | src/cli/commands/edit/note_content.rs:596-613 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/formatting.rs\u0060 and \u0060src/cli/commands/edit/note_content.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/formatting.rs:175\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b281ee7e8af3becb041f8db405efacb2a28dd3b3e3ca4575c51af0aa62aa99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/cli/commands/generation.rs:95-112 | src/cli/commands/generation.rs:262-279 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/generation.rs:95\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/generation.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f8411a57ca04b0690eddc7fe7e3ea5b8e1727b63351b838d5ffb5b1b72db2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/cli/outputs/tabular.rs:168-185 | src/cli/outputs/tabular.rs:378-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:168\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb483c77b8fa1ce7a6333d0f3903cc52c79277b3f0a404d05e50da8f974f5b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/diagnostics/hwp5_char_shape_audit.rs:356-375 | src/diagnostics/hwp5_char_shape_audit.rs:382-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe4142c40cf344e65c04f7a5d807734de85f78a19ecd1a6dcc7fa38b6960e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/diagnostics/hwp5_inventory.rs:120-137 | src/diagnostics/hwp5_inventory_diff.rs:233-250 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_inventory.rs: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":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acaffe8a3b2d29ef062f6cd53e02e08d54aef175fa22988951cfc4b8c9aa5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:347-364 | src/diagnostics/hwpx_roundtrip_batch.rs:225-242 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:347\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f49221083cc645e17f108e4f84e3d1a6d57fb752aa34e850f855f03b0e80ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/document_core/commands/clipboard.rs:584-601 | src/document_core/commands/clipboard.rs:673-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/clipboard.rs:579\u0060 calls \u0060Ok\u0060, \u0060store_clipboard\u0060 and \u0060src/document_core/commands/clipboard.rs:671\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c240aeb00bac54e3265991839549c51a9763fad2d3e05bbd0cd2e29694975082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201318 lines \u00D7 2): src/document_core/commands/object_ops/common.rs:615-626 | src/document_core/commands/object_ops/equation.rs:620-637 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/equation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea80d365149e7bfd7210a01717b23bd1767574c6545e3bb034475e8bae0f001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/document_core/commands/text_editing.rs:2249-2266 | src/document_core/commands/text_editing.rs:2624-2641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bccc32bdadfe12c0e46ee781e027cbd812beb608203b662364abda570822e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/document_core/commands/text_editing.rs:5717-5734 | src/document_core/commands/text_editing.rs:5807-5824 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:5717\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5717}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b73b26c8011486ce383cc4e413210070316325ff1cf57c3c5600ea15479ea3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/document_core/commands/text_editing.rs:6486-6502 | src/document_core/commands/text_editing.rs:6548-6565 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6548\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a526375373834bd8cf3c868b4e51aea529c8d3812480726b91c57d129e9e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:964-977 | src/document_core/queries/cursor_rect.rs:1008-1025 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:964\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c150abf556988f4337af06b83bf22333269ea1ebfa8cd26be5f8b532e7948ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:6355-6372 | src/document_core/queries/cursor_rect.rs:6403-6420 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:6355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f656b1429e1daa7185f4171f08843902580113f0626677e0607df417d3fa4cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:587-604 | src/document_core/queries/hwpctrl_sets.rs:2086-2103 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/hwpctrl_sets.rs:587\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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ce62b505a5968b5c8288c4fbb5a25f2efb9e2633212496a1fafa317ff7d6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): src/parser/hwp3/mod.rs:362-379 | src/parser/hwpx/section.rs:2773-2785 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:362\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060common\u0060 to \u0060\u0026crate::model::shape::CommonObjAttr\u0060 in one and \u0060\u0026CommonObjAttr\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":"src/parser/hwp3/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb095f68902a04025b890b389db98ec676e4783ca39ddbe5b170b68a93f617b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/parser/hwpx/section.rs:6752-6768 | src/parser/hwpx/section.rs:6856-6873 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:6752\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6417a1cc87e1c42695a577fcbe9f7c8f3f5c9249916c87a72210a64f4d76e648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/bitmap_raster.rs:203-220 | src/renderer/bitmap_raster/cropped_window.rs:94-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/bitmap_raster.rs:203\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":"src/renderer/bitmap_raster.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9e2f20c47d93a3d849f68aaf241a4bd29a092c48951fd7e20373e4972a8f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/equation/svg_render.rs:431-448 | src/renderer/equation/svg_render.rs:457-474 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/equation/svg_render.rs:431\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":"src/renderer/equation/svg_render.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9664927cd864aeaf1c3c2cf17a9463ff32b828817e3880e153a0cab28ec835cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/float_placement.rs:3629-3646 | src/renderer/float_placement.rs:3686-3703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":3629}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b2112ff2edb3a8a87a6b796e5e31d728f3f58906d5a5a2bc8b769dc7d21c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/layout/shape_layout.rs:3574-3591 | src/renderer/layout/shape_layout.rs:3641-3658 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:3574\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f042290e2f0adca3e574ac68c48fbad6e7357d703386b5ee5ff01559f74155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4959-4976 | src/renderer/layout/table_cell_content.rs:576-593 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4959\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4959}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a7d8bd4e563e46b0075fe71dd15cba45b8ce358f3736ffd781b5978ad88e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/renderer/layout/shape_layout.rs:5138-5155 | src/renderer/layout/shape_layout.rs:5323-5338 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:5138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5138}}}],"partialFingerprints":{"codehealthFindingId/v1":"168313d1fcd5869d0b667dea2ec7bebfa06d31eea9ea002b5b6096517f252b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:862-879 | src/renderer/layout/table_partial.rs:7155-7172 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c6fb028466956c2b6fb4daa7184a45100e2933e560789775aa04381aea2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/renderer/layout/table_layout.rs:8198-8215 | src/renderer/layout/table_layout.rs:9073-9089 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:8198\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8198}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e0b222c8d0dedeff01a260d9dcca8cc41322d38e6749066f401aeefc021ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/renderer/layout/table_layout.rs:9025-9040 | src/renderer/layout/table_partial.rs:4242-4259 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:9025\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":9025}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a880280896c293fdb88395ec0eb719d6b6e9f746369f13899adbd73c7b0fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/renderer/layout/table_layout.rs:22291-22308 | src/renderer/layout/table_layout.rs:22352-22368 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:22291\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22291}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b5a3188203739e8ccd83efe2548f0c7e2e2f00dd3fe271a4392bc698c831dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/renderer/layout/text_measurement.rs:577-594 | src/renderer/layout/text_measurement.rs:746-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5e6be8c303a67098aedf53b0b3c48e3e5a2ed615d0b057af4b0d485d362664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/skia/anisotropic_image.rs:19-36 | src/renderer/skia/anisotropic_image.rs:91-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/anisotropic_image.rs:19\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c92bee46351e33868560369e423f6e0087e68a0d81b8af048266cd12cab79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/skia/equation_conv.rs:751-768 | src/renderer/skia/equation_glyph.rs:17-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/equation_conv.rs:751\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":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8877271907d746d171a53f3458ed62decadb2955221230354118f20718570f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:239-254 | src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:258-275 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"407dcc37ee104d227fa969cdb8ffb8092127633312dded2ff42e14b9f716e373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/serializer/hwpx/section.rs:1374-1391 | src/serializer/hwpx/section.rs:1472-1489 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:1374\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0e3364db0a0d7818763e8407f0554bc06b1119530027fcc23af9722d8d3436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/wmf/parser/objects/graphics/brush.rs:75-92 | src/wmf/parser/objects/structure/log_brush.rs:67-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/brush.rs:75\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/brush.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6142fd258b77a2c2e4a1562308076984a87e29321a3c3a76815c0f72bdc691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): src/wmf/parser/objects/structure/log_color_space.rs:62-95 | src/wmf/parser/objects/structure/log_color_space_w.rs:62-95 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/log_color_space.rs:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/log_color_space.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"19236cd7e6cc17a9daeae60807456d2e0d8712f233319a967756e1a7246f33f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 83): src/cli/commands/edit/bookmarks.rs:52-68 | src/cli/commands/edit/bookmarks.rs:169-185 | src/cli/commands/edit/bookmarks.rs:287-303 | src/cli/commands/edit/cell_paragraphs.rs:60-76 | src/cli/commands/edit/cell_paragraphs.rs:216-232 | src/cli/commands/edit/cells.rs:267-283 | src/cli/commands/edit/cells.rs:547-563 | src/cli/commands/edit/cells.rs:716-732 | src/cli/commands/edit/cells.rs:886-902 | src/cli/commands/edit/controls.rs:41-57 | src/cli/commands/edit/document_objects.rs:43-59 | src/cli/commands/edit/document_objects.rs:201-217 | src/cli/commands/edit/document_objects.rs:314-330 | src/cli/commands/edit/document_objects.rs:455-471 | src/cli/commands/edit/document_objects.rs:600-616 | src/cli/commands/edit/document_text.rs:54-70 | src/cli/commands/edit/document_text.rs:258-274 | src/cli/commands/edit/document_text.rs:368-384 | src/cli/commands/edit/document_text.rs:504-520 | src/cli/commands/edit/document_text.rs:660-676 | src/cli/commands/edit/document_text.rs:763-779 | src/cli/commands/edit/document_text.rs:866-882 | src/cli/commands/edit/document_text.rs:962-978 | src/cli/commands/edit/document_text.rs:1057-1073 | src/cli/commands/edit/equations.rs:183-199 | src/cli/commands/edit/equations.rs:286-302 | src/cli/commands/edit/fields.rs:55-71 | src/cli/commands/edit/formatting.rs:55-71 | src/cli/commands/edit/formatting.rs:193-209 | src/cli/commands/edit/formatting.rs:376-392 | src/cli/commands/edit/formatting.rs:623-639 | src/cli/commands/edit/formatting.rs:756-772 | src/cli/commands/edit/formatting.rs:917-933 | src/cli/commands/edit/header_footer_content.rs:60-76 | src/cli/commands/edit/header_footer_content.rs:180-196 | src/cli/commands/edit/header_footer_content.rs:327-343 | src/cli/commands/edit/header_footer_content.rs:477-493 | src/cli/commands/edit/header_footer_content.rs:657-673 | src/cli/commands/edit/header_footer_content.rs:800-816 | src/cli/commands/edit/header_footer_content.rs:932-948 | src/cli/commands/edit/header_footer_content.rs:1086-1102 | src/cli/commands/edit/header_footer_properties.rs:54-70 | src/cli/commands/edit/header_footer_properties.rs:206-222 | src/cli/commands/edit/header_footer_properties.rs:314-330 | src/cli/commands/edit/header_footer_properties.rs:461-477 | src/cli/commands/edit/media.rs:610-626 | src/cli/commands/edit/media.rs:835-851 | src/cli/commands/edit/media.rs:943-959 | src/cli/commands/edit/note_content.rs:52-68 | src/cli/commands/edit/note_content.rs:162-178 | src/cli/commands/edit/note_content.rs:274-290 | src/cli/commands/edit/note_content.rs:382-398 | src/cli/commands/edit/note_content.rs:497-513 | src/cli/commands/edit/note_content.rs:614-630 | src/cli/commands/edit/notes.rs:41-57 | src/cli/commands/edit/notes.rs:136-152 | src/cli/commands/edit/notes.rs:231-247 | src/cli/commands/edit/page.rs:44-60 | src/cli/commands/edit/page.rs:147-163 | src/cli/commands/edit/page.rs:272-288 | src/cli/commands/edit/page.rs:387-403 | src/cli/commands/edit/shapes.rs:88-104 | src/cli/commands/edit/shapes.rs:213-229 | src/cli/commands/edit/shapes.rs:331-347 | src/cli/commands/edit/shapes.rs:487-503 | src/cli/commands/edit/tables/grid.rs:46-62 | src/cli/commands/edit/tables/grid.rs:154-170 | src/cli/commands/edit/tables/grid.rs:260-276 | src/cli/commands/edit/tables/grid.rs:390-406 | src/cli/commands/edit/tables/grid.rs:509-525 | src/cli/commands/edit/tables/grid.rs:623-639 | src/cli/commands/edit/tables/grid.rs:767-783 | src/cli/commands/edit/tables/insert.rs:96-112 | src/cli/commands/edit/tables/layout.rs:33-49 | src/cli/commands/edit/tables/layout.rs:153-169 | src/cli/commands/edit/tables/layout.rs:279-295 | src/cli/commands/edit/tables/layout.rs:397-413 | src/cli/commands/edit/tables/layout.rs:511-527 | src/cli/commands/edit/tables/layout.rs:631-647 | src/cli/commands/edit/tables/structure.rs:51-67 | src/cli/commands/edit/tables/structure.rs:146-162 | src/cli/commands/edit/tables/structure.rs:241-257 | src/cli/commands/edit/tables/structure.rs:336-352 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/tables/insert.rs:95\u0060 calls \u0060Some\u0060 and \u0060src/cli/commands/edit/bookmarks.rs:51\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94093aa7442a2b514271d9a9bf87db9c2736293efe08c50c549ba3e0f1eee04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 17): src/cli/commands/edit/document_objects.rs:215-230 | src/cli/commands/edit/document_text.rs:272-287 | src/cli/commands/edit/document_text.rs:382-397 | src/cli/commands/edit/document_text.rs:518-533 | src/cli/commands/edit/document_text.rs:880-895 | src/cli/commands/edit/document_text.rs:976-991 | src/cli/commands/edit/document_text.rs:1071-1086 | src/cli/commands/edit/formatting.rs:390-405 | src/cli/commands/edit/note_content.rs:396-411 | src/cli/commands/edit/note_content.rs:511-526 | src/cli/commands/edit/notes.rs:55-70 | src/cli/commands/edit/notes.rs:150-165 | src/cli/commands/edit/page.rs:401-416 | src/cli/commands/edit/shapes.rs:345-360 | src/cli/queries/security_inspection.rs:164-180 | src/cli/queries/security_inspection.rs:277-293 | src/cli/queries/security_inspection.rs:375-391 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:215\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3788eead9c1cac22f89cb39ccb9ad89e1161af187f30ed5c7a3c247efe09e67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 14): src/cli/commands/edit/bookmarks.rs:184-199 | src/cli/commands/edit/cell_paragraphs.rs:75-91 | src/cli/commands/edit/cell_paragraphs.rs:231-247 | src/cli/commands/edit/controls.rs:56-71 | src/cli/commands/edit/equations.rs:301-316 | src/cli/commands/edit/media.rs:850-865 | src/cli/commands/edit/notes.rs:246-261 | src/cli/commands/edit/shapes.rs:228-243 | src/cli/commands/edit/shapes.rs:502-517 | src/cli/commands/edit/tables/grid.rs:638-654 | src/cli/commands/edit/tables/layout.rs:168-184 | src/cli/commands/edit/tables/layout.rs:412-428 | src/cli/commands/edit/tables/layout.rs:646-662 | src/cli/queries/structured_objects.rs:47-62 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:184\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe06fa4efb2845931d83d330d79226912c60bb3c05cbdc3e371e30eadba40e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 9): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:87-103 | src/diagnostics/hwp5_cell_header_probe.rs:145-161 | src/diagnostics/hwp5_char_shape_audit.rs:133-149 | src/diagnostics/hwp5_contract_analyze.rs:70-86 | src/diagnostics/hwp5_contract_probe.rs:92-108 | src/diagnostics/hwp5_ctrl_data_trace.rs:26-42 | src/diagnostics/hwp5_first_para_control_probe.rs:98-114 | src/diagnostics/hwp5_mel_personnel_probe.rs:91-107 | src/diagnostics/hwp5_table_probe.rs:97-113 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d25502beb47fcd598e1506e1d743b5e76a81089e064024fb3b5b2cb4eb9790d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 9): src/wmf/parser/records/drawing/line_to.rs:40-56 | src/wmf/parser/records/state/move_to.rs:39-55 | src/wmf/parser/records/state/offset_clip_rgn.rs:39-55 | src/wmf/parser/records/state/offset_viewport_org.rs:39-55 | src/wmf/parser/records/state/offset_window_org.rs:39-55 | src/wmf/parser/records/state/set_viewport_ext.rs:39-55 | src/wmf/parser/records/state/set_viewport_org.rs:39-55 | src/wmf/parser/records/state/set_window_ext.rs:39-55 | src/wmf/parser/records/state/set_window_org.rs:39-55 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/state/move_to.rs\u0060 and \u0060src/wmf/parser/records/state/set_window_org.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/line_to.rs:40\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":"src/wmf/parser/records/drawing/line_to.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c63de93264d36ebc1952938251278276065c4393b7bbb79173dcce12481e895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 8): src/wmf/parser/records/drawing/ellipse.rs:61-77 | src/wmf/parser/records/drawing/ext_flood_fill.rs:51-66 | src/wmf/parser/records/drawing/frame_region.rs:55-70 | src/wmf/parser/records/drawing/rectangle.rs:60-76 | src/wmf/parser/records/state/exclude_clip_rect.rs:52-67 | src/wmf/parser/records/state/intersect_clip_rect.rs:52-67 | src/wmf/parser/records/state/scale_viewport_ext.rs:58-73 | src/wmf/parser/records/state/scale_window_ext.rs:58-73 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/drawing/ellipse.rs\u0060 and \u0060src/wmf/parser/records/drawing/rectangle.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/ellipse.rs:61\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/ellipse.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50addb2794448a57d6de87adcc0c31d8d8264d85eb8a71a88e1c7c74e150a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 7): src/cli/commands/tabular_import.rs:525-541 | src/cli/outputs/tabular.rs:147-163 | src/cli/outputs/tabular.rs:357-373 | src/cli/outputs/text.rs:66-82 | src/cli/queries/digest.rs:84-100 | src/cli/queries/security_inspection.rs:158-175 | src/cli/queries/structure.rs:58-74 \u2014 before extracting anything, compare \u0060src/cli/commands/tabular_import.rs\u0060 and \u0060src/cli/outputs/tabular.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/tabular_import.rs:525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/tabular_import.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9175c4bc3664dc1a64cb906d4ae860fe9673555d559b8c823b1e619c8e07226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 7): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:126-142 | src/diagnostics/hwp5_cell_header_probe.rs:196-212 | src/diagnostics/hwp5_contract_probe.rs:148-164 | src/diagnostics/hwp5_ctrl_data_trace.rs:89-105 | src/diagnostics/hwp5_first_para_control_probe.rs:152-168 | src/diagnostics/hwp5_mel_personnel_probe.rs:142-158 | src/diagnostics/hwp5_table_probe.rs:148-164 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:126\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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"96917914c0962cbd5e4ff32279bf11f53150e3fbe479877e2eb000dfe706fefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 6): src/cli/commands/edit/cells.rs:408-424 | src/cli/commands/edit/document_text.rs:152-167 | src/cli/commands/edit/media.rs:412-428 | src/cli/commands/edit/runtime.rs:231-246 | src/cli/commands/tabular_import.rs:382-397 | src/cli/commands/tabular_import.rs:678-693 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:408\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"765011aacd2cf5aae2231ba0023f5372e6d1c78ead4a01a4fbde7b30aa160925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): src/cli/commands/edit/cells.rs:850-866 | src/cli/commands/edit/tables/grid.rs:350-366 | src/cli/commands/edit/tables/grid.rs:597-613 | src/cli/commands/edit/tables/grid.rs:719-735 | src/cli/commands/edit/tables/layout.rs:127-143 | src/cli/commands/edit/tables/layout.rs:371-387 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:850\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b442339fe5192bd0f2896f9d359a92a828bdb3e3ff591543bad9823649372a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): src/bin/rhwp-q/kit/caret_stops.rs:30-46 | src/bin/rhwp-q/kit/char_index.rs:32-48 | src/bin/rhwp-q/kit/covering_pages.rs:27-43 | src/bin/rhwp-q/kit/word_end.rs:32-48 | src/bin/rhwp-q/kit/word_starts.rs:30-46 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:30\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7a11456719fcaed70e60d31b7f1ab773046ff2d16ac19d7c6dcc921ed35632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): src/bin/rhwp-q/kit/cur_field_state.rs:32-48 | src/bin/rhwp-q/kit/field_info_at.rs:32-48 | src/bin/rhwp-q/kit/form_value.rs:33-49 | src/bin/rhwp-q/kit/line_starts.rs:31-47 | src/bin/rhwp-q/kit/para_bounds.rs:31-47 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 and \u0060src/bin/rhwp-q/kit/field_info_at.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cur_field_state.rs:32\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57bd3d92cf476c2f3eba74172222204c7c2fed19bfec4e82517a08ed9122e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): src/cli/commands/edit/header_footer_content.rs:16-32 | src/cli/commands/edit/header_footer_content.rs:1015-1031 | src/cli/commands/edit/header_footer_properties.rs:148-164 | src/cli/commands/edit/header_footer_properties.rs:283-299 | src/cli/commands/edit/header_footer_properties.rs:401-417 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dadc274bba2443c01189b3c3dc5dd2b8afaf5a22aa815b4a601a5b7dd2c142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): src/parser/hwpx/section.rs:3134-3150 | src/parser/hwpx/section.rs:3788-3804 | src/parser/hwpx/section.rs:7520-7536 | src/parser/hwpx/section.rs:7653-7669 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:3134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31c3061112b34d1f02fc8c5f9245df1a0a86a7e4b9708abc05e8b15a9a4370d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/bin/rhwp-agent/envlint.rs:11-27 | src/bin/rhwp-agent/envlint.rs:67-83 | src/bin/rhwp-agent/planlint.rs:11-27 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/envlint.rs:11\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envlint.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa9d92039b27c8df6ae6abd543395904316e1ee50b372cb960fad9fb7b343f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/cli/commands/edit/document_objects.rs:164-180 | src/cli/commands/edit/document_text.rs:627-643 | src/cli/commands/edit/media.rs:552-568 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:164\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c521654526d2d53f7a94da4e21d6482ca4c44be27075698cf0631975f4ddee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/cli/outputs/pdf.rs:55-71 | src/cli/outputs/raster.rs:89-105 | src/cli/outputs/vector.rs:144-160 \u2014 before extracting anything, compare \u0060src/cli/outputs/pdf.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cda1c707f190ce419abc35c641a322eab41e089be3663666fafbb3cf371907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/diagnostics/hwp5_anchor_trace.rs:31-47 | src/diagnostics/hwp5_inventory.rs:91-107 | src/diagnostics/hwp5_inventory_diff.rs:193-209 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_anchor_trace.rs\u0060 and \u0060src/diagnostics/hwp5_inventory.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":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791017a22d4c34b336b0ec5e58eaa892400e2594a02114c02919337b080a08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/renderer/layout/shape_layout.rs:3573-3589 | src/renderer/layout/shape_layout.rs:3640-3656 | src/renderer/layout/shape_layout.rs:4689-4705 \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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3573}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b1489fa46e6275dc383a6342614577d55f456521f2f8a99504ae113c95c60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): src/renderer/layout/table_layout.rs:13065-13081 | src/renderer/layout/table_layout.rs:13247-13263 | src/renderer/layout/table_layout.rs:14237-14251 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:13065\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13065}}}],"partialFingerprints":{"codehealthFindingId/v1":"525886828fc51acc356989503becc60035182cba631fd62719ec83b2e8639472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:223-239 | src/emf/converter/svg.rs:57-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"30171a37b92135edb246dc6a52d2ef469d49b45e5429d400ee55e281d8a8915d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/cli/commands/batch_convert.rs:147-162 | src/cli/commands/conversion.rs:371-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/batch_convert.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/batch_convert.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa83fe4fb5bdf82c3fd131fd44c6a2943cb759766d2b762de699fa86a60908ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/cli/commands/edit/bookmarks.rs:16-32 | src/cli/commands/edit/bookmarks.rs:251-267 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/bookmarks.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de48da6bd1359bce36b94c1d8dcc2f7db60dbbeb5e00c168a2769fd54391e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/cli/commands/edit/fields.rs:251-267 | src/mcp_serve.rs:2266-2280 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/fields.rs\u0060 and \u0060src/mcp_serve.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"949bee65a9a8ec6e48af02d65e3e3fa6b3a14c79ce056bd57603cc8fd52588e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/cli/commands/edit/header_footer_content.rs:265-281 | src/cli/commands/edit/header_footer_content.rs:422-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e05c385177c502e945e4d3a438d7023091a82cd2a0cf99058c48ca2c17510cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/cli/commands/edit/header_footer_properties.rs:90-101 | src/cli/commands/edit/tables/grid.rs:417-433 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 and \u0060src/cli/commands/edit/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_properties.rs:90\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":"src/cli/commands/edit/header_footer_properties.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"72619a11d431bed9fd86d0f23bd11b2c4879e3bda20688befc7b3cfbde8f6e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/cli/commands/edit/privacy.rs:256-271 | src/cli/commands/edit/privacy.rs:757-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:256\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"249c7fe9bbeaeaa48bf2683b3703d3560365a3f454ca0a165e894a12ecb848e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/cli/outputs/raster.rs:366-380 | src/cli/outputs/vector.rs:388-404 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3b4f48dc7c534c42b25bb06cc373599bf511cdb99f0c64bee2acdcd0e4dba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/cli/protocol/exchange/settlement.rs:10-26 | src/cli/protocol/exchange/settlement.rs:146-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/settlement.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa931c9ccf0e01b0fe122cfb4c4022b991454ccc2ec0a998d865fba7a19336c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/cli/protocol/trust/gate.rs:21-37 | src/cli/protocol/trust/governance.rs:177-193 \u2014 before extracting anything, compare \u0060src/cli/protocol/trust/gate.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/trust/gate.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1d0d96ad82e5d92142b1e5f79676e6ab384b0de34f2a772af32d08951e0de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/cli/queries/security_inspection.rs:233-249 | src/cli/queries/security_inspection.rs:501-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1407b9904a9f34260aea27da0c4f5e3a41caa1a55257b376c96b229c80e04a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:468-484 | src/diagnostics/hwp5_mel_personnel_probe.rs:451-467 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:468\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d1954c29bf126608c9c2d48acc1f1556cbe1dcc4c5d4d8e5bc844eac8b13f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:683-699 | src/diagnostics/hwpx_roundtrip_batch.rs:496-512 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:683\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":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d865691955a7ee0f7723770017605fea52258a2ad638c9f21564dccf01c48142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/document_core/commands/clipboard.rs:905-918 | src/document_core/commands/clipboard.rs:1326-1342 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/clipboard.rs:905\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c07b1e17a8e982e485d0be250d13b2380af19a844b65fd73c662e76c8da9b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/document_core/commands/clipboard.rs:2091-2107 | src/document_core/commands/clipboard.rs:2158-2172 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/clipboard.rs:2091\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84a082440bbb4e0a44c6f87d6a1a4b870b6f603c2fd7b56f536cd0b215e978e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/document_core/commands/text_editing.rs:2349-2365 | src/document_core/commands/text_editing.rs:2718-2734 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2349\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e2048567d6360503f5f2cd2616b9bdd11c8390712b31f6e2676370b60f147e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/document_core/queries/field_query.rs:2528-2544 | src/document_core/queries/memo_query.rs:1802-1818 \u2014 before extracting anything, compare \u0060src/document_core/queries/field_query.rs\u0060 and \u0060src/document_core/queries/memo_query.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5569507620b18412f2022bef1ff8f9a1914db7963066680191aee47826be2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/native_host/clipboard.rs:315-331 | src/native_host/clipboard.rs:382-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/clipboard.rs:315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/clipboard.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"155f0ed25e129be571ce0fc78b6d01395dec6778289ef95dddff9e43c3303f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/native_host/gpu_d3d.rs:382-398 | src/native_host/gpu_metal.rs:268-284 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:382\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49056716308003b8e4dd37df0a72039d4705ba091dddb554531be7e47a8e8a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser/hwp3/mod.rs:2103-2119 | src/parser/hwp3/mod.rs:2121-2137 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwp3/mod.rs:2103\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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dbc2268ebfc5ed08367c0df6741eab1655271cccb42de5797521fcd126a71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser/hwp3/mod.rs:4539-4555 | src/parser/hwp3/mod.rs:4619-4635 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwp3/mod.rs:4539\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":"src/parser/hwp3/mod.rs"},"region":{"startLine":4539}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c160445733756ecd550038f394e1ba7edcbd2c5e3e7be39f40a2cd858e2d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): src/parser/hwpx/section.rs:3366-3378 | src/parser/hwpx/section.rs:7895-7911 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3366\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fbd6bf24b84c887e26ba6c362aa5963e00222d1b27b2fd1fa4c9310322d1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/parser/mod.rs:514-529 | src/parser/mod.rs:1052-1068 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/mod.rs:514\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be2e82680d2a9131bd2f48ffb97f09e30a01b410dfafd50b6526512b50cc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser/pdf/body_regions.rs:210-226 | src/parser/pdf/body_regions.rs:252-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/body_regions.rs:210\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":"src/parser/pdf/body_regions.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"43662086831ae143dc021dbd5ef75c4ce29d0438036f190019714b9d401b51f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1897-1913 | src/parser/pdf/structured_lowering.rs:1973-1989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/structured_lowering.rs:1895\u0060 calls \u0060try_from\u0060, \u0060map_err\u0060 and \u0060src/parser/pdf/structured_lowering.rs:1972\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdd5ec944da556e26768838b1e7b63acfc43fbe395df468213546d1d2f5d739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/renderer/composer/line_breaking.rs:981-997 | src/renderer/composer/line_breaking.rs:1017-1032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f288ebe7ba381510d0106eca17859e5a1e6f3ba0e5e3404ade8a771129099e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/composer/stored_tac_display.inc.rs:564-580 | src/renderer/composer/stored_tac_display.inc.rs:582-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd83499d6c2d9c6c53c17d9a0a501dd421400cb3b030b5a377b9d44609df967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/renderer/float_placement.rs:4861-4877 | src/renderer/float_placement.rs:5157-5172 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:4861\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":"src/renderer/float_placement.rs"},"region":{"startLine":4861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce48caff866dfa7e9c0dd922a41fa9b522c1da5610fdb907b539887cd854b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/renderer/float_placement.rs:9173-9184 | src/renderer/float_placement.rs:9329-9345 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:9173\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/float_placement.rs:9346\u0060 calls \u0060is_some_and\u0060, \u0060has_non_whitespace_text\u0060, \u0060is_empty\u0060 and \u0060src/renderer/float_placement.rs:9185\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":9173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d90aa45e916c446df9dd629ce605de53bb82fcab9be7197e2d5c7335fea38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/renderer/layout.rs:17737-17753 | src/renderer/layout.rs:17766-17781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":17737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eed3809d4524234940a0a9a91c2d3703d56c5be7fcb3543aaabbd8fc250418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1057-1073 | src/renderer/layout/border_rendering.rs:1100-1116 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1057\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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4340c5e3c67b658bfee38cb717c006a08a6cfbeb68430d1075f8675e033a95e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1915-1931 | src/renderer/layout/border_rendering.rs:1936-1952 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1915\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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7907f48d476ed496536b9a028a19ec9c4d910a6f4de95aef14be11f24a1b245e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:5282-5298 | src/renderer/layout/paragraph_layout.rs:10469-10485 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:5282\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ab5e0756aec5cdb5eb90b7cd3b5be5a61e3e3b573555a91137e0401bbe32e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9717-9732 | src/renderer/layout/paragraph_layout.rs:9813-9829 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:9717\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9717}}}],"partialFingerprints":{"codehealthFindingId/v1":"98964c28bd888f86d5f1bd7f839a9a80b7a7d121750f7661fa015584c1e79489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9971-9987 | src/renderer/layout/paragraph_layout.rs:10540-10556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9971}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5ee33977734271ffa0dd87be0556901dd4b1b652ac502d1095d1f195a4ba88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4579-4595 | src/renderer/layout/table_layout.rs:9422-9438 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4579}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcccb4bca8c80a7c9ec8be6cdde7118587d6393812189c6a4cd101c3ef79ff1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/mod.rs:4171-4187 | src/renderer/mod.rs:4215-4231 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/mod.rs:4171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"29867a7d5e539ffcfa7b3d0d15edc061f8cfa177df87d32c847b6a238cec2003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/skia/hft_outline.rs:67-83 | src/renderer/skia/renderer.rs:2640-2656 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/hft_outline.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/hft_outline.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1f092737058e67ef38cf863fbb755228c9119b8f665a0ef899be4e5f00387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/svg.rs:2526-2542 | src/renderer/web_canvas.rs:4452-4468 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd0580f4a3272a24300115e735c470bb90f914c2fe319a9a169703c9c725fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/renderer/svg.rs:3585-3599 | src/renderer/web_canvas.rs:2714-2730 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bba141725e1d97e540da5f1b8e917c15ae6751073af5b89d711ee05bda8dc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/typeset.rs:3589-3605 | src/renderer/typeset/notes/endnotes/measure.rs:446-462 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/typeset.rs:3588\u0060 calls \u0060available_height\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs:445\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3589}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb1adcc336a52cef15e23d8a3395f49eed8244bbe3c955a9f3dede5e3566144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/serializer/control.rs:3047-3063 | src/serializer/doc_info.rs:775-790 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/serializer/control.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"976dc84cac92f898bdd3b25de0f5e6548e732d9053f26b2bf7bd56d58108b9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/serializer/hwpx/section.rs:2543-2558 | src/serializer/hwpx/section.rs:2677-2693 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:2543\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2934157f9608297f0ebbe30bb1de3951b84c9eb4290c6fefb7e0eba496b5df5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/wmf/parser/records/drawing/fill_region.rs:38-54 | src/wmf/parser/records/state/set_text_justification.rs:42-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/fill_region.rs:38\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":"src/wmf/parser/records/drawing/fill_region.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f2a4054c082545be607250f83e56cf7d9dc43ba40af009a8b9d4631d24b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 24): src/cli/commands/edit/document_objects.rs:214-227 | src/cli/commands/edit/document_text.rs:271-284 | src/cli/commands/edit/document_text.rs:381-394 | src/cli/commands/edit/document_text.rs:517-530 | src/cli/commands/edit/document_text.rs:879-892 | src/cli/commands/edit/document_text.rs:975-988 | src/cli/commands/edit/document_text.rs:1070-1083 | src/cli/commands/edit/formatting.rs:389-402 | src/cli/commands/edit/note_content.rs:395-408 | src/cli/commands/edit/note_content.rs:510-523 | src/cli/commands/edit/notes.rs:54-67 | src/cli/commands/edit/notes.rs:149-162 | src/cli/commands/edit/page.rs:400-413 | src/cli/commands/edit/privacy.rs:600-615 | src/cli/commands/edit/shapes.rs:344-357 | src/cli/outputs/preview.rs:37-51 | src/cli/outputs/tabular.rs:151-166 | src/cli/outputs/tabular.rs:361-376 | src/cli/outputs/text.rs:70-84 | src/cli/queries/security_inspection.rs:163-177 | src/cli/queries/security_inspection.rs:276-290 | src/cli/queries/security_inspection.rs:374-388 | src/cli/queries/structure.rs:62-77 | src/cli/queries/structured_objects.rs:171-185 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:214\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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d5ee318746bf826ee29dfdb9338daf35f57bc0e0d78089e8661c9d33d36a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 10): src/cli/commands/edit/cell_paragraphs.rs:44-59 | src/cli/commands/edit/cell_paragraphs.rs:200-215 | src/cli/commands/edit/cells.rs:521-536 | src/cli/commands/edit/cells.rs:700-715 | src/cli/commands/edit/cells.rs:860-875 | src/cli/commands/edit/formatting.rs:740-755 | src/cli/commands/edit/formatting.rs:891-906 | src/cli/commands/edit/tables/grid.rs:607-622 | src/cli/commands/edit/tables/layout.rs:137-152 | src/cli/commands/edit/tables/layout.rs:381-396 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9378dac8f97cd188cbb2f3e4ee3f685299104b91e5a6555483461a80b7c5c174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7): src/cli/commands/edit/header_footer_content.rs:137-152 | src/cli/commands/edit/header_footer_content.rs:261-276 | src/cli/commands/edit/header_footer_content.rs:418-433 | src/cli/commands/edit/header_footer_content.rs:590-605 | src/cli/commands/edit/header_footer_content.rs:744-759 | src/cli/commands/edit/header_footer_content.rs:883-898 | src/cli/queries/structured_objects.rs:127-142 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/queries/structured_objects.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"607350a9d4c285f07a0625252bda71533d7d0544540e4c574fdcb1d6e56f58be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 7): src/parser/hwp3/mod.rs:2618-2626 | src/parser/hwp3/mod.rs:2809-2821 | src/parser/hwp3/mod.rs:2871-2886 | src/parser/hwp3/mod.rs:2927-2936 | src/parser/hwp3/mod.rs:2958-2967 | src/parser/hwp3/mod.rs:2985-2994 | src/parser/hwp3/mod.rs:3012-3021 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:2809\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8988390160c3f5ce5036b0dcd8540fc5c3376640234a15036c9510735b2f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): src/cli/queries/document_inventory.rs:19-34 | src/cli/queries/document_inventory.rs:84-99 | src/cli/queries/document_inventory.rs:156-171 | src/cli/queries/explain.rs:150-165 | src/cli/queries/explore.rs:29-44 | src/cli/queries/structured_objects.rs:262-277 \u2014 before extracting anything, compare \u0060src/cli/queries/document_inventory.rs\u0060 and \u0060src/cli/queries/structured_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/document_inventory.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/document_inventory.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5339c4a00235e581b3cac32e874c4037e81d60f0682108ae4b6943a3f7f2377f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): src/cli/commands/edit/cell_paragraphs.rs:106-121 | src/cli/commands/edit/cells.rs:593-608 | src/cli/commands/edit/cells.rs:762-777 | src/cli/commands/edit/formatting.rs:809-824 | src/cli/commands/edit/formatting.rs:973-988 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:106\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":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a02c4beab41d5aa347225ab967eb1d999aeff64fc64085ca13482a92c069316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 5): src/cli/commands/edit/cells.rs:458-469 | src/cli/commands/edit/document_text.rs:199-212 | src/cli/commands/edit/media.rs:463-477 | src/cli/commands/edit/privacy.rs:322-337 | src/cli/commands/edit/text.rs:234-245 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:458\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"737130793b68a3cad1349b9eee26e625be90b035d3f7556a93aa22d4df15afb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 5): src/doclang/writer/escape.rs:51-65 | src/ole_chart/svg_renderer.rs:410-425 | src/renderer/equation/svg_render.rs:771-786 | src/renderer/pdf.rs:1812-1827 | src/renderer/svg.rs:4412-4427 \u2014 before extracting anything, compare \u0060src/doclang/writer/escape.rs\u0060 and \u0060src/ole_chart/svg_renderer.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":"src/doclang/writer/escape.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bef141339fff34464a0c6eb93966291ea6466869508c1c2712f84d84aecd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs:41-56 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:84-99 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:68-83 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:56-71 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs:41\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":"src/bin/rhwp-q/commands/rhwp-q-font-layout-evidence.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a2a5e1eff1856a407e36f8302b50716f833ef10504dfda671e87e35ce1edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): src/cli/commands/edit/document_objects.rs:627-641 | src/cli/commands/edit/equations.rs:75-90 | src/cli/commands/edit/page.rs:71-85 | src/cli/commands/edit/page.rs:174-188 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/equations.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 228 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:627\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8fbd292b75b98882e1a701d37b8f0729bea245c76957a97ea13cd429a75ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/diagnostics/hwp5_cell_header_probe.rs:483-498 | src/diagnostics/hwp5_first_para_control_probe.rs:766-781 | src/diagnostics/hwp5_mel_personnel_probe.rs:466-481 | src/diagnostics/hwp5_table_probe.rs:482-497 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_first_para_control_probe.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8fb4003f2e12b5d0431eb5f0085d177d3d5bb1cd5c12287e86b2e874fbb798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/diagnostics/ir_field_sweep.rs:677-692 | src/diagnostics/ir_field_sweep.rs:885-900 | src/diagnostics/ir_field_sweep.rs:959-974 | src/diagnostics/ir_field_sweep.rs:1034-1049 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/ir_field_sweep.rs:677\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 \u0060a\u0060 to \u0060\u0026Paragraph\u0060 in one and \u0060\u0026Table\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diagnostics/ir_field_sweep.rs:695\u0060 calls \u0060is_some\u0060 and \u0060src/diagnostics/ir_field_sweep.rs:901\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e1fc69d86bb331c269f02fac4859f0c54319f666083e5f8fe1efaa781ce635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 3): src/document_core/commands/formatting.rs:808-818 | src/document_core/commands/formatting.rs:885-900 | src/document_core/commands/table_ops.rs:1094-1104 \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":"src/document_core/commands/formatting.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"720c82005c3acf4020a9567adc051b948721cb4b50ee544d0f3d65eb86d23de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 3): src/document_core/commands/text_editing.rs:6488-6503 | src/document_core/commands/text_editing.rs:6554-6566 | src/document_core/commands/text_editing.rs:6833-6845 \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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e37012eab77e5b657cd0a360a310ebd884a9a7ac5f579ee261028ae4a182a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/renderer/layout/table_partial.rs:1600-1615 | src/renderer/layout/table_partial.rs:1689-1704 | src/renderer/layout/table_partial.rs:6671-6686 \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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de811d53331cace0d9ddc52e065dfec8024423286c313d5935a999813330754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/renderer/web_canvas.rs:2263-2277 | src/renderer/web_canvas.rs:2349-2364 | src/renderer/web_canvas.rs:2473-2488 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas.rs:2263\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":"src/renderer/web_canvas.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc583a0e7e13da64e7fbed4caa440fe326c8b81f778c7035cea661a265a5a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/serializer/hwpx/section.rs:2541-2556 | src/serializer/hwpx/section.rs:2675-2690 | src/serializer/hwpx/section.rs:2977-2992 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/section.rs:2541\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":"src/serializer/hwpx/section.rs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25198935c0ab4a4a20f6f0e105c87473f886109cd9a3d7138ee269c87fcfaf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): bindings/Native/src/gpu_d3d.rs:227-242 | bindings/Native/src/gpu_metal.rs:236-251 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:227\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ae01bcbfb05f6621170eacc79737522c32b57a5dfbad48816861b282a0107c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bin/rhwp-agent/difftext.rs:250-265 | src/bin/rhwp-agent/scan.rs:89-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/bin/rhwp-agent/difftext.rs:250\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"00545ec16f5b8d42fc85fd22c052c12be42f674511f12235cda77ec058f585fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bin/rhwp-agent/lookups.rs:79-94 | src/bin/rhwp-agent/safety.rs:374-389 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/lookups.rs\u0060 and \u0060src/bin/rhwp-agent/safety.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/lookups.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f8e939544f33ee024d80029d2b1f2fcc449ed8bf287a28166db2979d72ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:229-244 | src/cli/queries/security_inspection.rs:859-874 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/safety.rs: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. 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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2e41a2566698d8bfe4bff0ed70ffe4de2e597eb0a2a3510149e5b06bd037bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/bin/rhwp-q/kit/footnote_hit.rs:56-85 | src/bin/rhwp-q/kit/hit_header.rs:56-85 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/footnote_hit.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_header.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/footnote_hit.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04579fe66251e99150a04bbb5b7bd7e5e7c7da7d652f45b5f5bdb73e9d14f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/bin/rhwp-q/more/main.rs:24-39 | src/bin/rhwp-q/pack/main.rs:24-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/main.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/main.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd11255798785de4f55f0da02aea0b6806ed4cb3ee177587b6c7d8abd5b4a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): src/cli/commands/conversion.rs:260-270 | src/cli/commands/conversion.rs:481-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/conversion.rs:260\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9649c6e6f5822e21fa6d9136089eb794cfe1bc01e3cd923ab288eb576d7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/cli/commands/edit/bookmarks.rs:79-93 | src/cli/commands/edit/bookmarks.rs:315-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f6210c089f073dd1c7cae91199995905fb23ea846ccffd35d7daefea99ab11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/commands/edit/equations.rs:157-172 | src/cli/commands/edit/tables/insert.rs:52-67 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/equations.rs\u0060 and \u0060src/cli/commands/edit/tables/insert.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/equations.rs:157\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/equations.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6185684db41589ba7c949266e11c19a11f1ab33fc31d73db5338c19f111ef6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/commands/edit/formatting.rs:655-670 | src/cli/commands/edit/formatting.rs:790-805 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/formatting.rs:655\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5365f7e7418ec3fe21aecceb5bc413000aaac888ad16014fe397e48e12c98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/outputs/tabular.rs:233-248 | src/cli/outputs/tabular.rs:473-488 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff3dbe578cbfde0f1e800f2d736c58188e5d35a13562ed30ae7d28ba7fec281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201324 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:276-285 | src/diagnostics/hwp5_cell_header_probe.rs:385-408 | src/diagnostics/hwp5_contract_probe.rs:362-371 | src/diagnostics/hwp5_first_para_control_probe.rs:391-400 | src/diagnostics/hwp5_mel_personnel_probe.rs:348-357 | src/diagnostics/hwp5_table_probe.rs:323-346 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:276\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b42627338dc3f52e10ae74d93d698197b9f193c851cd4ad86687ed8793be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:905-920 | src/diagnostics/hwp5_mel_personnel_probe.rs:819-834 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:905\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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"426c35d7cf7dde45caea6714c7479b21a18282ec8f5e0f7886b82f7fda36eba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:367-382 | src/diagnostics/hwpx_roundtrip_batch.rs:245-260 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d31a85ab10b9a8b25150c520e1ab25b32f043de959ab25388707a56ba1dd20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/document_core/commands/formatting.rs:1949-1964 | src/document_core/commands/formatting.rs:2055-2069 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:2055\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07221b851187b05a091977816bbbc3dd2bcd3ac883bc5444f6cd2df01e440d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/commands/text_editing.rs:4407-4422 | src/document_core/commands/text_editing.rs:4437-4452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3a60b35b5a7ac19f2c01accd92bf20ed6c47373d8923ba7e832646690f0598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:859-874 | src/document_core/queries/cursor_nav.rs:969-984 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:859\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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef11a1a0615177a143b8cba6f2ad036e1bdd926e2a5e8b69c04853a0560928b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:1607-1619 | src/document_core/queries/cursor_rect.rs:4513-4528 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/document_core/queries/cursor_nav.rs:1607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be00a4f92e6c0cbe98fc2c2a15356de2c3c4c6261e16ec98b98d9de9c50e092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:2004-2019 | src/document_core/queries/cursor_rect.rs:2930-2944 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:2004\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d7294b1c0f6a9bfbf45f7943fe062841ff445d0819724108fb46a2130bb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/queries/field_query.rs:2507-2522 | src/document_core/queries/memo_query.rs:1774-1789 \u2014 before extracting anything, compare \u0060src/document_core/queries/field_query.rs\u0060 and \u0060src/document_core/queries/memo_query.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"856a17342e9a159271ad964bb6e59a7899a294e123a02b7f4ec898173900c239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/queries/grep.rs:377-392 | src/document_core/queries/grep.rs:460-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/grep.rs:377\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3decd05c003e5fbc4253dadf2183f965d22733738e928fba63e01516b03d71de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/document_core/queries/grep.rs:382-397 | src/document_core/queries/grep.rs:561-574 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/grep.rs:382\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, \u0060src/document_core/queries/grep.rs:398\u0060 calls \u0060Some\u0060, \u0060clone\u0060 and \u0060src/document_core/queries/grep.rs:575\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb1a3df09024322da6538d0bb45905a0f64792c05c41ad8b70a1bcebc26d259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:1030-1045 | src/document_core/queries/hwpctrl_sets.rs:1104-1119 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/hwpctrl_sets.rs:1030\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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c820a2ca61de90f55396a35b21aed9a8e0f65f137a6595105e3bed10dd75a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/document_core/queries/rendering.rs:7628-7643 | src/document_core/queries/rendering.rs:7868-7883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":7628}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a6f4213d6b8237d070c8eabc62ed517fee40cfe781e7931b6bc8686cbaf3c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/model/control.rs:566-579 | src/parser/hwpx/section.rs:6194-6209 \u2014 before extracting anything, compare \u0060src/model/control.rs\u0060 and \u0060src/parser/hwpx/section.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/control.rs:566\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e471d0c0f251b716337d61484f444bb63e303c3a1754294481fb76616a89199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/native_host/gpu_d3d.rs:364-379 | src/native_host/gpu_metal.rs:250-265 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:364\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad28e012d6920efabe9eb42fe8921d39a3e8cd1142499220ac826bb3bd299a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 3): src/paint/json.rs:2320-2323 | src/paint/shaping_glyph.rs:378-393 | src/paint/text_shape.rs:450-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/shaping_glyph.rs:378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"df42360edb9748e7c506870295d331953131376ad1c1254d29b89221bd2d60e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/parser/control.rs:658-673 | src/parser/control.rs:688-700 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/control.rs:658\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5053e8d9511f206a71bf6f003956483cbd06390482904dede73a249b70bbe18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/parser/hwpx/header.rs:792-807 | src/parser/hwpx/header.rs:824-839 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:792\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/header.rs:841\u0060 calls \u0060parse_color\u0060 and \u0060src/parser/hwpx/header.rs:808\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e61ea60939b1d66e8cc3834efc5a5fbc29dc998e8e0d38519d38b7e034d777f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/parser/pdf/table_detection.rs:396-411 | tools/pdf-ir-poc/src/table_detection.rs:179-194 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:396\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dde26682eb70a849628940870b3755fc217185f80b73b5385917b5e9d6f6d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/parser/pdf/table_detection.rs:466-481 | tools/pdf-ir-poc/src/table_detection.rs:240-255 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:466\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7080080c1ab2c1062ac369baffc87503d0cc5befa587eb38c643100302f41c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/height_measurer.rs:4597-4612 | src/renderer/height_measurer.rs:4646-4661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a856398d9d185b7d4c3d6cb5020399d9b22de358bbbf6b854d5955e8e6cdc9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layer_renderer.rs:610-625 | src/renderer/layer_renderer.rs:629-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layer_renderer.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc905da43f6892187519c5ecc50cd9895a61e45f7572fa312573ee90259df85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout.rs:9730-9745 | src/renderer/layout.rs:9754-9769 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:9730\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":9730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c182ce6ad1e255019896c116d4ab472b58261b1528cbba22beed422f8fe7b507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2304-2319 | src/renderer/layout/shape_layout.rs:2427-2442 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2304\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/shape_layout.rs:2302\u0060 calls \u0060has_saved_affine_geometry\u0060, \u0060is_some\u0060 and \u0060src/renderer/layout/shape_layout.rs:2425\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a39248f8002394d95765645929c87edf8b06993658b35449b89a915f9f9a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4991-5006 | src/renderer/layout/table_cell_content.rs:627-642 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4991\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"91139b15d48223c15f89ab7f1c33307ecf88912a8cab66701537a349ea7be8f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout/table_layout.rs:7775-7790 | src/renderer/layout/table_partial.rs:3200-3215 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:7775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7775}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af38b1e4e4a4669cec364b8d13fec342b85a11b09adc4a4a5f84f14bbfba757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout/table_layout.rs:8150-8168 | src/renderer/layout/table_partial.rs:3606-3621 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:8150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8150}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a26d4ce0f4fe841283c2a51b0c3a1711a63a77a2612d650ed402b52eb01949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/renderer/layout/table_layout.rs:9192-9207 | src/renderer/layout/table_layout.rs:10333-10346 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:9192\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":9192}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbc614be3432fc062b3bca8cd116ee4cae6a910f4d6896dc078332293d9c578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/renderer/layout/table_layout.rs:16914-16929 | src/renderer/layout/table_layout.rs:17509-17523 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:16914\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":16914}}}],"partialFingerprints":{"codehealthFindingId/v1":"991de157bdcd39e2702f3009ea7d7e44d06e67b1b381b9d2a565caeb2eef47d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/layout/table_layout.rs:21055-21070 | src/renderer/layout/table_layout.rs:21945-21960 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:21055\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21055}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ac37b20977a892f56be72110c27520b9be1af5f6d8177f140bdcdfd058e2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/renderer/mod.rs:1627-1641 | src/renderer/typeset/paragraph/format.rs:648-663 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/paragraph/format.rs:648\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":"src/renderer/mod.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd18417e80441a303f7d41de96df007c3e3a647987dff9748ac1f35cef6400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/renderer/pagination/engine.rs:3197-3212 | src/renderer/typeset/state/finalize.rs:155-167 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/state/finalize.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf5c06ed5b522c3179732d5cfe03c3acc6c62e5db7f699e749b5e720ea1831e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/renderer/skia/prepared_page.rs:144-158 | src/renderer/skia/tiled_region.rs:224-239 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/skia/prepared_page.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"992ab8ba5edeb4fd43aee36139f3d54a222deec8b8abc6a24220f33f1f95a529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/svg.rs:3703-3718 | src/renderer/svg.rs:3858-3873 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:3703\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3703}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a1e6951aac80a5b5b167e7da0f96751372676b20a72094629281bd359b1621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/typeset/controls/stored_tac/owned_row.rs:97-112 | src/renderer/typeset/controls/stored_tac/owned_row.rs:146-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/controls/stored_tac/owned_row.rs:97\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac/owned_row.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2debb2374bd65d124ef40cd042f6a9fe4ed7673123a44de25b3bec7bec455132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/renderer/typeset/table/continuation/fragment/scan.rs:186-201 | src/renderer/typeset/table/continuation/fragment/scan.rs:645-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72fd991d705f013dcdb1514ac9bef23ed935a9cc735334aa34bd40270dda2b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201316 lines \u00D7 3): src/serializer/hwpx/char_shapes.rs:84-98 | src/serializer/hwpx/header.rs:696-711 | src/serializer/hwpx/shape.rs:1687-1690 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/serializer/hwpx/char_shapes.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/char_shapes.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc75aa344f03d41f525bce16838ccd95b0c23df3060d386d92e451ebf83491c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 69): src/cli/commands/edit/bookmarks.rs:65-77 | src/cli/commands/edit/bookmarks.rs:182-194 | src/cli/commands/edit/bookmarks.rs:300-312 | src/cli/commands/edit/cell_paragraphs.rs:73-85 | src/cli/commands/edit/cell_paragraphs.rs:229-241 | src/cli/commands/edit/cells.rs:280-292 | src/cli/commands/edit/cells.rs:560-572 | src/cli/commands/edit/cells.rs:729-741 | src/cli/commands/edit/cells.rs:899-911 | src/cli/commands/edit/controls.rs:54-66 | src/cli/commands/edit/document_objects.rs:56-68 | src/cli/commands/edit/document_objects.rs:327-339 | src/cli/commands/edit/document_objects.rs:468-482 | src/cli/commands/edit/document_objects.rs:613-625 | src/cli/commands/edit/document_text.rs:67-79 | src/cli/commands/edit/document_text.rs:673-685 | src/cli/commands/edit/document_text.rs:776-788 | src/cli/commands/edit/equations.rs:196-208 | src/cli/commands/edit/equations.rs:299-311 | src/cli/commands/edit/formatting.rs:68-80 | src/cli/commands/edit/formatting.rs:206-218 | src/cli/commands/edit/formatting.rs:636-648 | src/cli/commands/edit/formatting.rs:769-781 | src/cli/commands/edit/formatting.rs:930-942 | src/cli/commands/edit/header_footer_content.rs:73-85 | src/cli/commands/edit/header_footer_content.rs:193-205 | src/cli/commands/edit/header_footer_content.rs:340-352 | src/cli/commands/edit/header_footer_content.rs:490-502 | src/cli/commands/edit/header_footer_content.rs:670-682 | src/cli/commands/edit/header_footer_content.rs:813-825 | src/cli/commands/edit/header_footer_content.rs:945-957 | src/cli/commands/edit/header_footer_content.rs:1099-1111 | src/cli/commands/edit/header_footer_properties.rs:67-81 | src/cli/commands/edit/header_footer_properties.rs:219-231 | src/cli/commands/edit/header_footer_properties.rs:327-339 | src/cli/commands/edit/header_footer_properties.rs:474-486 | src/cli/commands/edit/media.rs:623-635 | src/cli/commands/edit/media.rs:848-860 | src/cli/commands/edit/media.rs:956-968 | src/cli/commands/edit/note_content.rs:65-77 | src/cli/commands/edit/note_content.rs:175-187 | src/cli/commands/edit/note_content.rs:287-299 | src/cli/commands/edit/note_content.rs:627-639 | src/cli/commands/edit/notes.rs:244-256 | src/cli/commands/edit/page.rs:57-69 | src/cli/commands/edit/page.rs:160-172 | src/cli/commands/edit/page.rs:285-297 | src/cli/commands/edit/shapes.rs:101-113 | src/cli/commands/edit/shapes.rs:226-238 | src/cli/commands/edit/shapes.rs:500-512 | src/cli/commands/edit/tables/grid.rs:59-71 | src/cli/commands/edit/tables/grid.rs:167-179 | src/cli/commands/edit/tables/grid.rs:273-285 | src/cli/commands/edit/tables/grid.rs:403-415 | src/cli/commands/edit/tables/grid.rs:522-534 | src/cli/commands/edit/tables/grid.rs:636-648 | src/cli/commands/edit/tables/grid.rs:780-792 | src/cli/commands/edit/tables/insert.rs:109-121 | src/cli/commands/edit/tables/layout.rs:46-58 | src/cli/commands/edit/tables/layout.rs:166-178 | src/cli/commands/edit/tables/layout.rs:292-304 | src/cli/commands/edit/tables/layout.rs:410-422 | src/cli/commands/edit/tables/layout.rs:524-536 | src/cli/commands/edit/tables/layout.rs:644-656 | src/cli/commands/edit/tables/structure.rs:64-76 | src/cli/commands/edit/tables/structure.rs:159-171 | src/cli/commands/edit/tables/structure.rs:254-266 | src/cli/commands/edit/tables/structure.rs:349-361 | src/cli/queries/structured_objects.rs:45-57 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:65\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"598f383d4f0aacc0c5220e9a13f16dff546721da854fccd99f2547e9089b17d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 18): src/cli/commands/edit/document_objects.rs:57-69 | src/cli/commands/edit/header_footer_content.rs:341-353 | src/cli/commands/edit/header_footer_content.rs:491-503 | src/cli/commands/edit/header_footer_content.rs:671-683 | src/cli/commands/edit/header_footer_content.rs:1100-1113 | src/cli/commands/edit/header_footer_properties.rs:220-233 | src/cli/commands/edit/header_footer_properties.rs:475-487 | src/cli/commands/edit/note_content.rs:288-300 | src/cli/commands/edit/shapes.rs:102-114 | src/cli/commands/edit/tables/grid.rs:60-72 | src/cli/commands/edit/tables/grid.rs:168-180 | src/cli/commands/edit/tables/grid.rs:274-286 | src/cli/commands/edit/tables/grid.rs:523-535 | src/cli/commands/edit/tables/insert.rs:110-122 | src/cli/commands/edit/tables/layout.rs:293-305 | src/cli/commands/edit/tables/layout.rs:525-537 | src/cli/commands/edit/tables/structure.rs:65-77 | src/cli/commands/tabular_import.rs:530-544 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/header_footer_content.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 163 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:57\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53421baa15efb31321bd9ed97befccb869570c489f8b2557fe4e23f59687de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 17): src/cli/commands/edit/tables/grid.rs:79-93 | src/cli/commands/edit/tables/grid.rs:187-201 | src/cli/commands/edit/tables/grid.rs:293-307 | src/cli/commands/edit/tables/grid.rs:430-444 | src/cli/commands/edit/tables/grid.rs:542-556 | src/cli/commands/edit/tables/grid.rs:658-672 | src/cli/commands/edit/tables/grid.rs:802-816 | src/cli/commands/edit/tables/layout.rs:66-80 | src/cli/commands/edit/tables/layout.rs:188-202 | src/cli/commands/edit/tables/layout.rs:312-326 | src/cli/commands/edit/tables/layout.rs:432-446 | src/cli/commands/edit/tables/layout.rs:551-565 | src/cli/commands/edit/tables/layout.rs:666-680 | src/cli/commands/edit/tables/structure.rs:84-98 | src/cli/commands/edit/tables/structure.rs:179-193 | src/cli/commands/edit/tables/structure.rs:274-288 | src/cli/commands/edit/tables/structure.rs:369-383 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/grid.rs\u0060 and \u0060src/cli/commands/edit/tables/layout.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce6da9cd05224190cbd253aac28df3b8226b795200c2ef03d325fdd8476c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 11): src/bin/rhwp-agent/grepcmd.rs:55-69 | src/bin/rhwp-agent/harvest.rs:42-56 | src/bin/rhwp-agent/harvest.rs:167-181 | src/bin/rhwp-agent/inspect.rs:170-184 | src/bin/rhwp-agent/locate.rs:238-252 | src/bin/rhwp-agent/lookups.rs:98-112 | src/bin/rhwp-agent/safety.rs:150-164 | src/bin/rhwp-agent/safety.rs:247-261 | src/bin/rhwp-agent/safety.rs:393-407 | src/bin/rhwp-agent/safety.rs:552-566 | src/bin/rhwp-agent/structurecmd.rs:33-47 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/grepcmd.rs\u0060 and \u0060src/bin/rhwp-agent/inspect.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/grepcmd.rs:55\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":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d44285523716d22414c54992d06b3236dbf3a9b00a19e8d08528bd54c14390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): src/wmf/converter/svg/mod.rs:187-201 | src/wmf/converter/svg/mod.rs:210-224 | src/wmf/converter/svg/mod.rs:265-279 | src/wmf/converter/svg/mod.rs:288-302 | src/wmf/converter/svg/mod.rs:405-419 | src/wmf/converter/svg/mod.rs:474-488 | src/wmf/converter/svg/mod.rs:497-511 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:187\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/wmf/converter/svg/mod.rs:203\u0060 calls \u0060use_source\u0060, \u0060source_bitmap16\u0060 and \u0060src/wmf/converter/svg/mod.rs:226\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3fb17d766aedbb6e0fe03a0b747b67063d51411087e1813f48d9efbef13c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:196-210 | src/diagnostics/hwp5_cell_header_probe.rs:267-283 | src/diagnostics/hwp5_contract_probe.rs:219-235 | src/diagnostics/hwp5_first_para_control_probe.rs:240-254 | src/diagnostics/hwp5_mel_personnel_probe.rs:211-227 | src/diagnostics/hwp5_table_probe.rs:214-230 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:196\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":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a92e1c7227654d2de64ab9c37a74dbb5aaa3cf8cc1649f8804e35f2c8427b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/document_core/commands/text_editing.rs:1399-1413 | src/document_core/commands/text_editing.rs:1643-1657 | src/document_core/commands/text_editing.rs:1796-1810 | src/document_core/commands/text_editing.rs:1892-1906 | src/document_core/commands/text_editing.rs:4217-4231 \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. 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, \u0060src/document_core/commands/text_editing.rs:1640\u0060 calls \u0060normalize_text_newlines\u0060, \u0060as_ref\u0060 and \u0060src/document_core/commands/text_editing.rs:1398\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c3050c96d198c085de7059cf800b10bdd798208f69ab8f5540ec759b47d093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 5): src/document_core/commands/text_editing.rs:1476-1489 | src/document_core/commands/text_editing.rs:1701-1715 | src/document_core/commands/text_editing.rs:1954-1968 | src/document_core/commands/text_editing.rs:4426-4440 | src/document_core/commands/text_editing.rs:4924-4938 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:1476\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, \u0060src/document_core/commands/text_editing.rs:4441\u0060 calls \u0060reflow_paragraph\u0060 and \u0060src/document_core/commands/text_editing.rs:1490\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26752ca5b1d98e6ef9905b8d6e2d80c4555ffec94563d43d3c36e0bfabc6666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): src/cli/commands/edit/cells.rs:426-440 | src/cli/commands/edit/document_text.rs:169-182 | src/cli/commands/edit/media.rs:430-444 | src/cli/commands/tabular_import.rs:399-413 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cli/commands/edit/document_text.rs:183\u0060 calls \u0060chars\u0060, \u0060count\u0060 and \u0060src/cli/commands/edit/cells.rs:442\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2b4bc1d06837366557dbacd986a7a4decc51678d8093506ad9a80dab15d324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/cli/commands/conversion.rs:248-262 | src/cli/outputs/vector.rs:346-360 | src/cli/outputs/vector.rs:640-652 \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":"src/cli/commands/conversion.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d54456e9af75a1fba88560688c92440acc769df87c8af88aa12c84cd60608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/cli/commands/edit/tables/grid.rs:14-28 | src/cli/commands/edit/tables/grid.rs:229-243 | src/cli/commands/edit/tables/structure.rs:14-28 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/grid.rs\u0060 and \u0060src/cli/commands/edit/tables/structure.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32ebf6ee01a1c4e8c288407ad3ede6452d75ad35c3a6c37847520e80b422bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/cli/commands/tabular_import.rs:520-534 | src/cli/outputs/tabular.rs:22-36 | src/cli/outputs/text.rs:273-287 \u2014 before extracting anything, compare \u0060src/cli/commands/tabular_import.rs\u0060 and \u0060src/cli/outputs/tabular.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/tabular_import.rs:520\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/tabular_import.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0115d89b76973a5beceeff5e301e10b4dbbb5f7173e49f1595e49ccce9cbac30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/cli/outputs/raster.rs:214-228 | src/cli/outputs/text.rs:460-474 | src/cli/outputs/vector.rs:237-251 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/raster.rs:214\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":"src/cli/outputs/raster.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baacb7aaf91a4cedc90b2277fa295ec8f5c5d3cc18d6743e2cba73cf52b6c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:962-973 | src/document_core/queries/cursor_rect.rs:1006-1020 | src/document_core/queries/cursor_rect.rs:4791-4802 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:962\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef269596c8629ab07c541843543ae33a33d395ddd03d02b8572c47b0649c430e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): src/renderer/height_measurer.rs:628-640 | src/renderer/layout/paragraph_layout.rs:949-960 | src/renderer/typeset.rs:153-167 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/paragraph_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:628\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060para\u0060 to \u0060\u0026Paragraph\u0060 in one and \u0060Option\u003C\u0026Paragraph\u003E\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":"src/renderer/height_measurer.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5bec23f9aebbb6ccc7eec3a08d9744a3d937f00d32650de5214ac769c20e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/renderer/height_measurer.rs:2410-2422 | src/renderer/mod.rs:1627-1641 | src/renderer/typeset/paragraph/format.rs:648-662 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/typeset/paragraph/format.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76cfdf114b79549e09074c8095b1669153270a1c945d1244b4520f6879d070a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/renderer/html.rs:517-529 | src/renderer/svg.rs:4258-4270 | src/renderer/web_canvas.rs:3393-3407 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:517\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":"src/renderer/html.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98c9756639596688217730014ed48c159604a5fd65755d99cf4b67da29dfba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/renderer/shaping_paragraph.rs:1217-1231 | src/renderer/shaping_paragraph.rs:1270-1284 | src/renderer/shaping_paragraph.rs:1302-1316 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/shaping_paragraph.rs:1217\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":"src/renderer/shaping_paragraph.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ef4c5a65d0333c80ec0558057ea9051d3ac1bf98efca3d02ab1b619416c50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/renderer/typeset.rs:3589-3601 | src/renderer/typeset/notes/endnotes/measure.rs:446-458 | src/renderer/typeset/notes/endnotes/measure.rs:679-693 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/measure.rs:679\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/typeset.rs:3588\u0060 calls \u0060available_height\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs:445\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3589}}}],"partialFingerprints":{"codehealthFindingId/v1":"8332d16bf5d1e84d53ad474fc5f435cb6bcc6ff3ec0e2391089709199c53932b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): src/wmf/parser/objects/graphics/font.rs:113-127 | src/wmf/parser/objects/structure/bitmap_info_header/info.rs:97-108 | src/wmf/parser/records/bitmap/stretch_dib.rs:81-92 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/font.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/wmf/parser/records/bitmap/stretch_dib.rs:93\u0060 calls \u0060parse\u0060 and \u0060src/wmf/parser/objects/graphics/font.rs:128\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/font.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca24831cb028606c44c9cef5c516d5bbba15767bdb654fa97a113699c0d905c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): bindings/Native/src/gpu_d3d.rs:259-276 | bindings/Native/src/gpu_metal.rs:268-285 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499377138021cc980086fc2de0e561e30de208850a8dad7910e2a2eded2e62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhwp-agent/difftext.rs:253-267 | src/bin/rhwp-agent/evidence.rs:42-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/difftext.rs:253\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f4b9b3242f4a2e94894ea945f44419b8bb75dbcc145710804d049772d3751e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhwp-agent/explaincmd.rs:11-25 | src/bin/rhwp-agent/inspect.rs:10-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/bin/rhwp-agent/explaincmd.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b9e667284836ca9ef17439cb54528b10ffb980f6cca27e3ebf8ca771df8371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhwp-agent/stats.rs:26-40 | src/bin/rhwp-agent/stats.rs:71-85 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/stats.rs:26\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d9b0cc44dee2b1eb8b68ad293c57a0cc13a87f4d6bb8b323463d730e2ef45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/commands/edit/cells.rs:351-365 | src/cli/commands/tabular_import.rs:324-338 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 177 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:351\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"63990236f082e6a6900194da6252710f280fb47147a213ad1f3128f598a287ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/commands/edit/privacy.rs:252-266 | src/cli/commands/edit/text.rs:167-181 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/privacy.rs\u0060 and \u0060src/cli/commands/edit/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e67b1d6b03263000f970dc5cb33110292f0932feb5c41075d33cdfb248946e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/commands/edit/tables/grid.rs:122-136 | src/cli/commands/edit/tables/grid.rs:478-492 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/tables/grid.rs: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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97a626ad60c65de7aabf584a8f74ac79684e037bc5e32e832ffb4eeeff3c64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/cli/commands/tabular_import.rs:35-48 | src/cli/commands/tabular_import.rs:483-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/tabular_import.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/tabular_import.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea0bca00ea2977c109d97343fd41da2c02f323ed561153a6dbb6bcd12fd5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/outputs/doclang.rs:43-57 | src/cli/outputs/vector.rs:620-634 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/cli/outputs/doclang.rs:43\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":"src/cli/outputs/doclang.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b0d29ffd5df48bdb62d3f63e7c4168293ea4753295ae1865d6e9536620a181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/outputs/kitty.rs:128-142 | src/cli/outputs/sixel.rs:128-142 \u2014 before extracting anything, compare \u0060src/cli/outputs/kitty.rs\u0060 and \u0060src/cli/outputs/sixel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/kitty.rs:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/kitty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c9df237a849ebf9ce5b53d5a176cb730e56e96525e207db49541dcfe00a061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/cli/queries/control_dump/mod.rs:25-38 | src/cli/queries/info.rs:23-37 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/cli/queries/info.rs:39\u0060 calls \u0060detect_format\u0060 and \u0060src/cli/queries/control_dump/mod.rs:39\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/control_dump/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d735838ca629d3660b995499a4e2967904c6633209dba9cfcd9204a42ed52b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:956-974 | src/document_core/commands/object_ops/chart.rs:1105-1123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"b074ec04a63aadc808a7cf3abdf4bf061a6277f6d298297e1b6bee33c53c605b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/document_core/commands/table_ops.rs:2281-2295 | src/document_core/commands/table_ops.rs:2297-2311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8af8bbc5711c61c6fe1536bc802dad725493143ede53a422c3f48c57904b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/document_core/commands/text_editing.rs:6560-6574 | src/document_core/commands/text_editing.rs:6612-6623 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6560\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6560}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c946c7da527c34d359b06bdff329965b7787052efa89c58ce28bab7f5a749f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/document_core/pdf_import_session.rs:297-310 | src/document_core/pdf_import_session.rs:335-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/pdf_import_session.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/pdf_import_session.rs:296\u0060 calls \u0060map_err\u0060, \u0060RenderError\u0060, \u0060to_string\u0060 and \u0060src/document_core/pdf_import_session.rs:335\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/pdf_import_session.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cd113dc2f99ede5d76e7c8b8d51ffe3f62f264ff0b3e6643b30ae24486b473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:881-895 | src/document_core/queries/cursor_nav.rs:989-1002 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:881\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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"6311d18c7aca4e21d89d11e70016a06117eee82bb764316859b5fc0489cc0fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:549-563 | src/document_core/queries/doc_tree_nav.rs:859-873 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/doc_tree_nav.rs:549\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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deae7082b02ed3323e042c9bfea4bcfd35870782d7edc65b044d81d21201acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/document_core/queries/rendering.rs:4570-4584 | src/document_core/queries/rendering.rs:4614-4628 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:4570\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":4570}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cfbcfadd4f5078c9819e410c61b4fa7a6d271df73904c2b965af748fd079e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): src/model/control.rs:369-379 | src/renderer/layout/text_measurement.rs:3238-3252 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/control.rs:369\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0cf407a5b2627d761cceb8e4b71e7b1930bd1f2d5f9c6b9ba22f64e43c6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/model/table.rs:1803-1817 | src/model/table.rs:1932-1946 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/table.rs:1803\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":"src/model/table.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a635f632cfe76b62604d16d4e0bb553feefe54e5e9df6e32b8470629cd1a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/native_host/gpu_d3d.rs:614-629 | src/native_host/gpu_metal.rs:405-420 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:614\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fd71b63eb3cd51b4a9bd2cba48d33b8516a7068be5960b7e1357e4905a8d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/native_host/presentation.rs:813-827 | src/native_host/presentation.rs:929-943 \u2014 both copies are in the same file, so extract the block 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 \u0060src/native_host/presentation.rs:813\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/presentation.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"4074a2b93e8d4fba51e40c4a5ac786ac13b75f47f37945ba7c536fb804465037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/paint/dot_leader.rs:126-140 | src/renderer/arrow.rs:94-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/dot_leader.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea04b02fb7d28c99eafa15fde345018bc0ed14c98c9efe1ff2bf7ae6a612454e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/cfb_reader.rs:1013-1027 | src/parser/cfb_reader.rs:1037-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"feefe861263e300fd5350a7340ad4b2e77e48945ca767d6b06bb030cda796fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/parser/control.rs:581-597 | src/parser/control.rs:606-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"128409dff394b20f3292032a10e898729e12e8bde11c1641ed8c4bc41e48297c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/parser/hwp3/mod.rs:2264-2277 | src/parser/hwp3/mod.rs:3059-3073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0155765e0cf8bc614c75ce345d90a97370d2bf9489cd31b1065abc4d0e5d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/hwp3/mod.rs:5613-5627 | src/parser/hwp3/mod.rs:5686-5700 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwp3/mod.rs:5613\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":5613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41688f2048c5300e620a78c37f83ed879b9a064aab305070f474341a3848c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/hwpx/section.rs:3379-3393 | src/parser/hwpx/section.rs:4003-4017 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3379\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72368ca08acbbd771070ef70fcc4a259a1c7cb0be03d6e1df06565fae10e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/hwpx/section.rs:7761-7775 | src/serializer/control.rs:2439-2453 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":7761}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e46ce4b9d6537a6438e3b4447d1ca6bc9ddd21e608588b33727af57ba467c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1463-1477 | tools/pdf-ir-poc/src/structured_lowering.rs:387-401 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1463\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc2ad056beddbba2222cd59e528ccabeb1005e523024ef81bfd60dfca43f766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1989-2003 | tools/pdf-ir-poc/src/structured_lowering.rs:657-670 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eeead987181078f54125cc82a94e335518d7f9800a1b1e3b8dab7b7a153a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2121-2135 | tools/pdf-ir-poc/src/structured_lowering.rs:777-791 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ba63d8bf921d860cc2c62f1842b507af1209e06dfa3d09545f92bd27c9227e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/composer/stored_lines_runs.inc.rs:493-507 | src/renderer/composer/stored_lines_runs.inc.rs:545-559 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/stored_lines_runs.inc.rs:493\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd6f8642bdbfd19ce6009425d27f43a535f4e1f036b6f8b058d3a4d98aad6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/equation/brace_stretch.rs:100-114 | src/renderer/equation/round_stretch.rs:33-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":"src/renderer/equation/brace_stretch.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac041af18f9d2192a0d2ef382726e27a1333e30c5fc48e97c56401a9e4566ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/float_placement.rs:2613-2627 | src/renderer/float_placement.rs:2654-2668 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:2613\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bba6f13c8d5032ce1096c5b1fafc35bb1f319a579378228e71496eb1eb2c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/renderer/float_placement.rs:3019-3033 | src/renderer/float_placement.rs:5779-5792 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:3019\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fe4b25219944f00125387ec5bb3619838598590a3640a296b9cbb10561e526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/renderer/float_placement.rs:4942-4956 | src/renderer/float_placement.rs:5143-5156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":4942}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d68b5a46c837d8e057088258f8dc8407430d9d263b1a782d14d75acdd4b3364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/html.rs:546-560 | src/renderer/svg.rs:5536-5550 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:546\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":"src/renderer/html.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"245345d81a1dfa31217c69af2b9c2f0585364f858f160ba75eb234c7df847f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1190-1204 | src/renderer/layout/border_rendering.rs:1644-1656 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1190\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"40299f336995342e0dd611b8017df234225f4071da8336c2bd1894a6118f5844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1203-1217 | src/renderer/layout/border_rendering.rs:1223-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/border_rendering.rs:1203\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c843882597edb911705bdba389e867b669d435da5ceaee5efa4bb4b95341325a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1210-1224 | src/renderer/layout/border_rendering.rs:1662-1674 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1210\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e3edf85e31322619fcc089ad6c13ee8fb6db03e35f64ed19cff706f6c7c3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/renderer/layout/border_rendering.rs:1230-1244 | src/renderer/layout/border_rendering.rs:1680-1692 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:1230\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b3b39e1b90e7d9a4d013d99f48e3348145ef2a5e83d46b1aece94fa77cd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:4197-4211 | src/renderer/layout/paragraph_layout.rs:4368-4382 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:4197\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d25a7b4a021190a8ea91b39e7a90417aca044cdca3f0bacdf0b209fd8032779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9762-9776 | src/renderer/layout/paragraph_layout.rs:10041-10055 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9762}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b144dd8c684ec799f7b86aef481bfa1da08f2eadb3a95c62a9e393d063cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:11834-11848 | src/renderer/layout/paragraph_layout.rs:11878-11892 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:11834\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e183084e942269b0c84f3e7ecf061c7de98bea92c90683b260266208398906"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4558-4572 | src/renderer/layout/table_layout.rs:9401-9415 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4558\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f233ff0c09c928072f32f71d4bb123e4136b11ba4d4b8fa632c824064f1bf6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/layout/table_layout.rs:8047-8061 | src/renderer/layout/table_partial.rs:3512-3526 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eafeaf33c1ae2c470b9d12885c9948b30142889b7639f7dea6f34a91cb08fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): src/renderer/layout/table_layout.rs:23852-23868 | src/renderer/layout/table_layout/row_block_cut.rs:205-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23852}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b74b46eb8ae2f788c76b50cbc09464c1cc06dc921035be114007773febac50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): src/renderer/layout/table_partial.rs:3534-3541 | src/renderer/layout/table_partial.rs:4750-4764 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:3534\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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a016bb14208d32d43d10b582dca1b5b42031377cc5eadb477bbdd2b24fcb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/renderer/layout/table_partial.rs:4782-4796 | src/renderer/layout/table_partial.rs:4798-4810 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:4782\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":4782}}}],"partialFingerprints":{"codehealthFindingId/v1":"902f3ad1ef62614073919a31eb7e53f0889d654c7e192948d57b8148a1f31f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/pagination/engine.rs:188-202 | src/renderer/typeset.rs:3214-3228 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"667f89302ec2730b7e558d412f8d6f1251cebd5777787f73f2dcfbf6608b6193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201315 lines \u00D7 4): src/renderer/char_overlap.rs:343-345 | src/renderer/char_overlap.rs:454-456 | src/renderer/svg.rs:1256-1270 | src/renderer/svg.rs:1317-1330 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/char_overlap.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d95e729176eeb463b8b02c95de0c054d79e5cbf4a872ce33da04f711403cc36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/renderer/svg.rs:3914-3927 | src/renderer/web_canvas.rs:3036-3050 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:3914\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":"src/renderer/svg.rs"},"region":{"startLine":3914}}}],"partialFingerprints":{"codehealthFindingId/v1":"957983b28ded4aef8ce0bf6b17a81cf14123208a67cdee1900fad649506f4599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/typeset.rs:1919-1933 | src/renderer/typeset.rs:1982-1996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/renderer/typeset.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36fda2b35feabd1da6d06334fc24ed6405c566c0ad64740f396e627dd17e1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/web_canvas.rs:3341-3355 | src/renderer/web_canvas.rs:3563-3577 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:3341\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":"src/renderer/web_canvas.rs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"672eb8bec3bc267b6c7c63647de39f09f51a9d653046dd052aa0983113963ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 23): src/document_core/commands/clipboard.rs:959-972 | src/document_core/commands/foreign_paste.rs:188-198 | src/document_core/commands/html_import.rs:266-278 | src/document_core/commands/object_ops/equation.rs:411-421 | src/document_core/commands/object_ops/picture.rs:648-658 | src/document_core/commands/object_ops/table.rs:1213-1223 | src/document_core/commands/table_ops.rs:554-564 | src/document_core/commands/table_ops.rs:3477-3487 | src/document_core/commands/table_ops.rs:3799-3809 | src/document_core/commands/text_editing.rs:1448-1458 | src/document_core/commands/text_editing.rs:1489-1499 | src/document_core/commands/text_editing.rs:1687-1697 | src/document_core/commands/text_editing.rs:1715-1725 | src/document_core/commands/text_editing.rs:1940-1950 | src/document_core/commands/text_editing.rs:1968-1978 | src/document_core/commands/text_editing.rs:4037-4047 | src/document_core/commands/text_editing.rs:4110-4120 | src/document_core/commands/text_editing.rs:4909-4919 | src/document_core/commands/text_editing.rs:4938-4948 | src/document_core/hyperlink.rs:560-570 | src/document_core/queries/field_query.rs:183-193 | src/document_core/queries/hwpctrl_sets.rs:2004-2014 | src/document_core/queries/memo_query.rs:1303-1313 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn stamp_caret(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/text_editing.rs:4920\u0060 calls \u0060remove_composed_paragraph\u0060 and \u0060src/document_core/commands/clipboard.rs:973\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c3327e7699b3be0655c81c629d8b26b61f80c0f9e0d15da6547073f52d2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 11): src/cli/commands/edit/cells.rs:846-859 | src/cli/commands/edit/tables/grid.rs:22-35 | src/cli/commands/edit/tables/grid.rs:130-143 | src/cli/commands/edit/tables/grid.rs:237-250 | src/cli/commands/edit/tables/grid.rs:346-359 | src/cli/commands/edit/tables/grid.rs:486-499 | src/cli/commands/edit/tables/grid.rs:593-606 | src/cli/commands/edit/tables/grid.rs:715-728 | src/cli/commands/edit/tables/layout.rs:123-136 | src/cli/commands/edit/tables/layout.rs:367-380 | src/cli/commands/edit/tables/structure.rs:22-35 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 189 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:846\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"033c12fc505cdc859789d66ff648b23df1c37ca4f5dcdd75909ffb66675b401d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 10): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:37-50 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:34-47 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:37-50 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:37-50 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:35-48 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:34-47 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:34-47 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:36-49 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:37-50 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:35-48 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d25d07855a65057e6dce767da56673b624d1cdad6554ca2cb1d17ec3cac3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8): src/cli/commands/edit/document_objects.rs:160-173 | src/cli/commands/edit/header_footer_content.rs:288-301 | src/cli/commands/edit/header_footer_content.rs:445-458 | src/cli/commands/edit/header_footer_content.rs:607-620 | src/cli/commands/edit/header_footer_content.rs:761-774 | src/cli/commands/edit/header_footer_content.rs:900-913 | src/cli/commands/edit/header_footer_content.rs:1047-1060 | src/cli/commands/edit/header_footer_properties.rs:429-442 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/header_footer_content.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 163 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7f2e50b256cd0a428c3960829f2f107eae2f37f62f7b7c1a17f91c6efde5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): src/bin/rhwp-q/kit/fn_selection_rects.rs:26-39 | src/bin/rhwp-q/kit/form_at.rs:23-36 | src/bin/rhwp-q/kit/hf_edit_target.rs:39-52 | src/bin/rhwp-q/kit/hit_fn_marker.rs:24-37 | src/bin/rhwp-q/kit/hit_in_footnote.rs:24-37 | src/bin/rhwp-q/kit/hit_in_hf.rs:41-54 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/fn_selection_rects.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/fn_selection_rects.rs:26\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf04962427a877bbf2d33f456bf3e3fb3d313ede4b6d4b2d0f08610130c230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): src/diagnostics/hwp5_cell_header_probe.rs:182-195 | src/diagnostics/hwp5_contract_analyze.rs:107-120 | src/diagnostics/hwp5_contract_probe.rs:130-143 | src/diagnostics/hwp5_ctrl_data_trace.rs:64-77 | src/diagnostics/hwp5_mel_personnel_probe.rs:128-141 | src/diagnostics/hwp5_table_probe.rs:134-147 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_analyze.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:182\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb076ae3dfb10f5eb217f0db301171267e7776089a61b458c36ed528303285d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 6): src/document_core/commands/text_editing.rs:4411-4421 | src/document_core/commands/text_editing.rs:4441-4451 | src/document_core/commands/text_editing.rs:4511-4524 | src/document_core/commands/text_editing.rs:4573-4585 | src/document_core/commands/text_editing.rs:4632-4642 | src/document_core/commands/text_editing.rs:4697-4709 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:4511\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/text_editing.rs:4410\u0060 calls \u0060reflow_paragraph\u0060 and \u0060src/document_core/commands/text_editing.rs:4511\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a732be38614a308157ce4882b60e61fab99cde4435c76b7cfc83171b32d58ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:123-136 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:124-137 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:123-136 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:124-137 | src/bin/rhwp-q/kit/footnote_footholds.rs:59-72 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-markdown.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 158 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:123\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:122\u0060 calls \u0060Some\u0060, \u0060to_string\u0060 and \u0060src/bin/rhwp-q/kit/footnote_footholds.rs:58\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610b10aaf09cfd54ee6dd117a6b2c40eb5b875bdaf0ab059362ec5a10a3b37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:87-100 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:153-166 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:87-100 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:116-129 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:87-100 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1766aab3fab5771851c80eb5f4a8c4eb755a9ff2290d1e0b3101706e5f607252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/cli/commands/edit/media.rs:300-313 | src/cli/commands/edit/privacy.rs:190-203 | src/cli/commands/edit/privacy.rs:621-634 | src/cli/commands/tabular_import.rs:216-229 | src/cli/commands/tabular_import.rs:565-578 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/media.rs\u0060 and \u0060src/cli/commands/edit/privacy.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d078dd66838db126a7d80ba7c6182910fd03979c2f91ac6bbc3287f3354ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 5): src/document_core/commands/object_ops/equation.rs:161-170 | src/document_core/commands/table_ops.rs:1005-1018 | src/document_core/commands/table_ops.rs:1041-1054 | src/document_core/commands/table_ops.rs:1215-1228 | src/document_core/commands/table_ops.rs:2954-2967 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/table_ops.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:161\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"99befd827252eb9346792c56ae77a66c040f8cce3f67721697e63981c79d2be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): src/bin/rhwp-agent/inspect.rs:113-126 | src/bin/rhwp-agent/inspect.rs:372-384 | src/bin/rhwp-agent/lookups.rs:119-131 | src/bin/rhwp-agent/lookups.rs:183-195 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/inspect.rs\u0060 and \u0060src/bin/rhwp-agent/lookups.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/inspect.rs:113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72a6c397f7863e690cf044e8134b140e31e3fb7ffa8fe93f0729af9d40449b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:215-228 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:190-203 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:193-206 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:198-211 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:215\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":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a78b4deca076ae508b784ff7c5a545b3e3c4d9e115a9b94aa8191f76a5aacf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:90-103 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:91-104 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:90-103 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:91-104 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-markdown.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 158 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:90\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5ce8c5d690139168c0c0d5e4c31401e04a57e7bfdf181a58bb47c22b8341db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): src/renderer/layout/picture_footnote.rs:633-644 | src/renderer/layout/shape_layout.rs:1311-1324 | src/renderer/layout/table_layout.rs:4917-4928 | src/renderer/layout/table_partial.rs:8294-8305 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/picture_footnote.rs:633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"636bccea6a0e6d475f01d0c04d3b1bc59e23b4dbef44545a026d5a222cc002e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:71-84 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:71-84 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:71-84 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:71\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc75b59593b09b646f14262e9eb0a87c6b7fad5b9e071f701a82078558bf200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/cli/commands/edit/formatting.rs:314-327 | src/cli/commands/edit/tables/grid.rs:360-373 | src/cli/commands/edit/tables/grid.rs:729-742 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/formatting.rs\u0060 and \u0060src/cli/commands/edit/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 167 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ad0c1c16c610359e7c968228c03bb49f2dea3b4da520168ad10da3768f24a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/cli/commands/edit/privacy.rs:102-115 | src/cli/commands/edit/text.rs:301-314 | src/cli/commands/tabular_import.rs:65-78 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/privacy.rs\u0060 and \u0060src/cli/commands/edit/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dbb720987e50842f219ef2152d2648662679dceae6e1b13e818327e0878479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/document_core/commands/clipboard.rs:107-120 | src/document_core/commands/document.rs:3916-3928 | src/model/paragraph.rs:831-844 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4efb46707d5b399e27a23a145d15884c61a72ff1b7c5567c881c6cc22ee625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/document_core/commands/object_ops/picture.rs:1431-1444 | src/document_core/commands/table_ops.rs:3757-3770 | src/document_core/commands/text_editing.rs:2919-2932 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/picture.rs\u0060 and \u0060src/document_core/commands/table_ops.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. 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bedb816049847e2357813a077c65fde36ef07d0f39ba75eb3f82b6d25a83247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/document_core/commands/section_ops.rs:33-46 | src/document_core/commands/text_editing.rs:5460-5473 | src/document_core/commands/text_editing.rs:5862-5875 \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":"src/document_core/commands/section_ops.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf5bd0e8129e91fed4f808368353a7496af8a77ca80856fad64ff0fb5bb87aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:317-330 | src/document_core/queries/cursor_rect.rs:5371-5384 | src/document_core/queries/cursor_rect.rs:5937-5950 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9039c14c686a154394d735774c4cbe235f15ad7d4102c82420ab7e2f4d551f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/document_core/queries/grep.rs:156-169 | src/document_core/queries/hidden_text.rs:541-554 | src/document_core/queries/injection_scan.rs:1227-1240 \u2014 before extracting anything, compare \u0060src/document_core/queries/grep.rs\u0060 and \u0060src/document_core/queries/injection_scan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/grep.rs:156\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa1c2744a34df578bf320437543e8a849cf8a3d42009befbf28eb6394be626d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/equation/canvas_render.rs:352-366 | src/renderer/equation/svg_render.rs:413-428 | src/renderer/skia/equation_conv.rs:484-497 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a329cebd44929d19b9c222707c5986f79d73df48d0aa2f6b7a31752c3c4b035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 3): src/renderer/height_measurer.rs:3961-3974 | src/renderer/height_measurer.rs:5001-5014 | src/renderer/height_measurer.rs:5797-5805 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:3961\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"71174dd866d945d3b85aafbab6a2a97409775d54cdda3f695b3c045bd9a7cbb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 3): src/renderer/height_measurer.rs:4109-4122 | src/renderer/height_measurer.rs:5125-5138 | src/renderer/height_measurer.rs:5836-5845 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:4109\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":"src/renderer/height_measurer.rs"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7917165c0413706c2c5ea11d6fc9bcc02dd7af6089ebadc6c36465d1f54f13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): src/renderer/layout.rs:15390-15403 | src/renderer/layout.rs:16445-16458 | src/renderer/layout.rs:16652-16663 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:15390\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":"src/renderer/layout.rs"},"region":{"startLine":15390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35261eac731ad8973feaed757b40379ac6c2800e6d804e7f5b7975295fc5f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/layout/picture_footnote.rs:2023-2036 | src/renderer/layout/table_layout.rs:9246-9259 | src/renderer/layout/table_layout.rs:10378-10391 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/picture_footnote.rs:2023\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"234152d8bb5fade0bd9f9e4223f3cc4043641ef31d5f9660c7ccba6c61c637a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/layout/shape_layout.rs:4556-4569 | src/renderer/layout/table_layout.rs:9399-9412 | src/renderer/layout/table_partial.rs:4437-4450 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d48f62d93d423c0178f1a5fcb7aef095e5713bc66339ef91ae64e3fbd88f9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/layout/table_cell_content.rs:945-958 | src/renderer/layout/table_layout.rs:4597-4610 | src/renderer/layout/table_partial.rs:7353-7366 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:945\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/table_layout.rs:4593\u0060 calls \u0060publish_table_paint_layer\u0060 and \u0060src/renderer/layout/table_cell_content.rs:941\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ef3f7f5860bbb89006e2dc3911b6a2f7501901f7008d0e4940c36a8ff5a94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/layout/table_partial.rs:813-826 | src/renderer/layout/table_partial.rs:900-913 | src/renderer/layout/table_partial.rs:1223-1236 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_partial.rs:813\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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7651c04c4305b551c60aed462443118ced40859ee8292b96c57b153873668a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): src/renderer/pagination/engine.rs:1018-1028 | src/renderer/typeset.rs:1353-1363 | src/renderer/typeset/controls/wrap_match.rs:29-42 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52cd197b062c4453cb745b6e44d58f4eacd81ec7f4bdd470efafc088f32da5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:171-184 | mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:87-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:185\u0060 calls \u0060dump_raw_records\u0060 and \u0060mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:101\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":"mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f084fafc1d6d216ccd02898b3f4775991988cc95aa54fcea3ad27c0d2cb483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:785-798 | src/cli/queries/security_inspection.rs:815-828 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/safety.rs:785\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":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"224909efed0d00999f9a7ba218796f5b9ea02aad840176980c32a263c26cbebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:148-161 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:149-162 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-text-layout.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:148\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":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcddfd0c345800dab02311c6a3667c22fae1742dc623c99d470915a2255f08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/commands/conversion.rs:326-339 | src/cli/commands/conversion.rs:527-540 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/conversion.rs:326\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d39b87828ef15acc2a14a9055a668f55fd3692dda37bbf7d8cfa50d3268fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/commands/edit/note_content.rs:465-478 | src/cli/commands/edit/note_content.rs:578-591 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/note_content.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f59466b4d7849f1225425063f5a746fac8da5b88fa41226ed54434ec00328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/outputs/text.rs:109-122 | src/cli/outputs/text.rs:571-584 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/text.rs:109\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c258a72aa72b4216eaceef3b3dedb990d2a16861403b1dbf7badc220228ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/protocol/exchange/settlement.rs:28-41 | src/cli/protocol/harness.rs:114-127 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/settlement.rs\u0060 and \u0060src/cli/protocol/harness.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/settlement.rs:28\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b14a7c662d0fc875087c4053c5eaa3fd4a3a2688bc791be99b37b90cd4a3a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/queries/diagnostics.rs:15-28 | src/cli/queries/diagnostics.rs:829-842 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/diagnostics.rs:15\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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bec963a697b7f26d64037ba65260e08c95e878a98af607eb909eba0593724f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/queries/diagnostics.rs:596-609 | src/cli/queries/page_dump.rs:68-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/diagnostics.rs:596\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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd754a2ff5959530c0c1f5118adcfcc8fe915be0ee37f452a52fe93dddc178da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/queries/digest.rs:255-268 | src/cli/queries/digest.rs:304-317 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/digest.rs:255\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":"src/cli/queries/digest.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a459e44c8de15e95915cc9a5b0a3b522207bcf11ebd21e611afc826c6a193402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201314 lines \u00D7 4): src/cli/queries/security_inspection.rs:648-661 | src/cli/queries/security_inspection.rs:920-933 | src/document_core/queries/memo_query.rs:913-916 | src/document_core/queries/search_query.rs:230-233 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/security_inspection.rs:648\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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"81314b09d5a57bd46616d84f55c4655cd521abbd70bfd592ea329f612bc4c744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/queries/structured_objects.rs:44-57 | src/cli/queries/structured_objects.rs:170-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/structured_objects.rs:44\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":"src/cli/queries/structured_objects.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be83d4e14fc2b0f010d9b575ce26e79f8da17163e6de97c1c053cbb44c525b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/cli/queries/structured_objects.rs:203-215 | src/cli/queries/structured_objects.rs:293-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/structured_objects.rs:203\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/structured_objects.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231f6a875eba30960ba327df48544fe244ea620d94659823454339c914a0187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:376-389 | src/diagnostics/layout_anomaly.rs:646-659 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/layout_anomaly.rs:376\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, \u0060src/diagnostics/layout_anomaly.rs:390\u0060 calls \u0060TextLine\u0060 and \u0060src/diagnostics/layout_anomaly.rs:660\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df81dc95e4213ca0f8ecaafc10d4770aa44702241d15f56e66e0b75430b679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/border_paint_structure.rs:324-337 | src/parser/pdf/table_paint/compound.rs:126-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/border_paint_structure.rs:324\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd9b3ad9a338a1a2910689674ed70840384dd11a8c7ae435628d615943cba34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/border_paint_structure.rs:605-618 | src/document_core/commands/border_paint_structure.rs:944-957 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/border_paint_structure.rs:605\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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"413aca8abac06808d9b2ee6d568f0d46139656d8165abcab32865ff085edb98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/document_core/commands/header_footer_ops.rs:402-415 | src/document_core/commands/header_footer_ops.rs:544-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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc8df0fe91118c5e4064697c6f5ac2ed28dceb3875ed788735724f1fa3aa093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:367-380 | src/document_core/commands/object_ops/picture.rs:741-754 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/picture.rs:367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"19366caa1e778d2ebe547ac0e62411a3f61ac9c1a48d1929b7918a61b324fffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:663-676 | src/document_core/commands/object_ops/picture.rs:1571-1580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"08008b8362d7088121419435ad467aa0de0f6e3d6903770841f7f90bd52b73bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:1080-1093 | src/scaffold/builder.rs:462-475 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/scaffold/builder.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:1080\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9d9b2f060bdd1e59d9f0aa71699c3979aa80ffbd17bfccde6d0a79837107ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/table_ops.rs:2468-2481 | src/document_core/queries/cursor_nav.rs:640-653 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/table_ops.rs:2468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"86427dee705dd264248f17693da757beb996d0cfe82cd4f4436de9b49fe8794f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/document_core/commands/text_editing.rs:5678-5691 | src/document_core/commands/text_editing.rs:5771-5783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b0c40c18ea49d821fc85b501820b7b0410f32d1d988936c106038d7e8f122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/text_editing.rs:6709-6722 | src/document_core/commands/text_editing.rs:6824-6837 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6709\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/text_editing.rs:6708\u0060 calls \u0060reflow_cell_paragraph_by_path\u0060 and \u0060src/document_core/commands/text_editing.rs:6823\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8e6282115f0686975b45b3229b64cefcb4641604eecf3e636f0e1e1aa63dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/text_editing.rs:6724-6737 | src/document_core/commands/text_editing.rs:6839-6852 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6724\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6724}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcf07b76a341be181a48748edf14e9bbca60b5f0487dc171c1a512e238173e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/queries/bookmark_query.rs:58-71 | src/document_core/queries/bookmark_query.rs:229-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/bookmark_query.rs:58\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":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f22d4711c959bbd244e6c8fe876765ebbe2b6a9a9b9fd58dc187025665fc7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:1958-1971 | src/document_core/queries/cursor_nav.rs:2108-2121 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:1958\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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a55f44d268523fddca03baba5b6c8025ecbc65d467ec894fec0b9de432318a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/parser/cfb_reader.rs:98-111 | src/parser/cfb_reader.rs:248-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/cfb_reader.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98e36f08b70c5f0d06cd19bfdffb336f8187688e3f0025a243d62449e294843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/hwpx/header.rs:1792-1805 | src/parser/hwpx/section.rs:4433-4446 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1792\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91f268ad092dbc2a5da3e0e9b96d8a095ae90b9de0614335f65b11e2efd239b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/hwpx/section.rs:4771-4784 | src/parser/hwpx/section.rs:5130-5143 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:4771\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b7376d388ecf562562a99ba30965c40c6ada738904d7fa5bab2c36a99ba0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2296-2309 | tools/pdf-ir-poc/src/structured_lowering.rs:817-830 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:2296\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f39049cdfd9229b3a97c0393201f7eca70760ef52e6707b781abd92574e73b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/composer/line_breaking.rs:590-603 | src/renderer/composer/line_breaking.rs:640-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/line_breaking.rs:590\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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53e515a0f591fc694aeb66d7920efe14c7a11046a35742b943d771efb17694b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/composer/stored_lines_runs.inc.rs:385-398 | src/renderer/composer/stored_lines_runs.inc.rs:458-471 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/stored_lines_runs.inc.rs:385\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84b8b3a38f969373967c6ceed1e9ae24f33621f0ee2d6cab29aba39a1613be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/composer/stored_tac_display.inc.rs:105-118 | src/renderer/layout/table_layout/stored_inline_row_frame.rs:70-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_tac_display.inc.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"62846b36b7d5de2eb81d46f79aa6c186b525a859de744c87198b2ce17a1f2388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): src/renderer/equation/canvas_render.rs:240-247 | src/renderer/equation/svg_render.rs:236-249 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:240\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e50ccc46458619718f415a77f421078f5f0957f331c24087b99df2fdb67fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/renderer/equation/canvas_render.rs:293-304 | src/renderer/equation/svg_render.rs:344-357 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"511fc473530679109c075e17ed5b9a0b217d63fbf78a20ec88b6d69d9da475e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/equation/canvas_render.rs:546-559 | src/renderer/equation/canvas_render.rs:561-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a67e0aa5a9d3a63b4f4cd99750aaf146ea54b976f5dd28f67ca7ef7fa3f009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/equation/multiplication_outline.rs:57-70 | src/renderer/equation/svg_render.rs:535-548 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/equation/multiplication_outline.rs:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/multiplication_outline.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b441ab2786a46a679ee831d1c761dbf6de04d202fc6fbdc1fee7fb19ddac495a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/float_placement.rs:3651-3664 | src/renderer/float_placement.rs:3709-3722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/renderer/float_placement.rs"},"region":{"startLine":3651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd7cefc2c2dd30a7e629cb216ecf873dd2cf7aa13fcacad658aee7e9148e193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/height_measurer.rs:3548-3561 | src/renderer/layout/table_layout.rs:11774-11787 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eba5e8ec637e75cefeab1bdaeda1eef01669012787ebb0816d399fe9d13f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/height_measurer.rs:4880-4893 | src/renderer/layout/table_layout.rs:5845-5857 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:4880\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":"src/renderer/height_measurer.rs"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cf3009c8524475f82763677fdbdd9e60b9ffee9d149e965f33f1c9c75481fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/height_measurer.rs:4940-4953 | src/renderer/layout/table_layout.rs:5896-5908 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:4940\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de744071655afa0bc551333afe5385be4551b9b2ca21b184dc7d5fa13da59f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/height_measurer.rs:6990-7003 | src/renderer/height_measurer.rs:7018-7031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":6990}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa197b8af286cb2548224f2aa5e344efede3d79c3a4d726590788d8418f9028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/layout.rs:2008-2020 | src/renderer/typeset.rs:1989-2002 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:2008\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"55888e0f1cc41d81d383db2ba31268f91d58cb90f42aa13914058d224d5df04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout.rs:2668-2681 | src/renderer/typeset/controls/decoration_host.rs:101-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ffcc6cc4ca50b2f78aa9aa42802bba885e3207268ec7d3a85f4531a4c739d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout.rs:6213-6226 | src/renderer/layout/picture_footnote.rs:391-404 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":6213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1f6c7c11ff15736cf276cc319ca381a9968db2bb00c62ae8461b6016fd2fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:4342-4355 | src/renderer/layout/paragraph_layout.rs:4443-4453 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:4342\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/paragraph_layout.rs:4442\u0060 calls \u0060with_stored_tabs\u0060 and \u0060src/renderer/layout/paragraph_layout.rs:4342\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4342}}}],"partialFingerprints":{"codehealthFindingId/v1":"355eac902fcb32b2492a1c289773eadda886b5c6537e7e95d3b6f626a3e69874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/layout/shape_layout.rs:1406-1418 | src/renderer/layout/shape_layout.rs:2346-2359 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:1406\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeb1595275109f570751cd88ebad7d036992ee6f934aa17bf215a0a7e3274a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:991-1004 | src/renderer/layout/table_layout.rs:10674-10687 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:991\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9673f8cb78753b780e4f5e53d87fec29d6bcb8184da11c801cf94c64e1a96db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:1113-1126 | src/renderer/layout/table_layout.rs:11269-11282 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:1113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"450f78d71cfbbc4ffedc3806802f5fac1841024cf546ec02f9089a8d6662a55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout/table_layout.rs:8130-8143 | src/renderer/layout/table_partial.rs:3585-3598 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:8130\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab39180dd7f7bcedde136e759bd76613ead0d7cd339d94842c03aa6ff06ef97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): src/renderer/layout/table_layout.rs:8276-8289 | src/renderer/layout/table_layout.rs:9114-9122 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:8276\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8276}}}],"partialFingerprints":{"codehealthFindingId/v1":"212680d0748d9415bda8f6445e5df52987c0c3252d05ea160350b4d162b40ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/layout/table_layout.rs:13153-13165 | src/renderer/layout/table_layout.rs:16294-16307 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:13153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13153}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cb01a495fafc1958cfd71f9633b206d5f49085dd5a54be4df95024f8ac94ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout/table_layout.rs:15542-15555 | src/renderer/layout/table_layout.rs:17509-17522 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:15542\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":15542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5219a0fd383b79dd68379a82a45c45b120377e9b40452ff740152bb5ca7901e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): src/renderer/layout/table_layout.rs:20959-20972 | src/renderer/layout/table_layout.rs:21935-21942 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:20959\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20959}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eba4b23f18f9d055ecc7b0aabfdc0a7a28573673dde512cd93863a9032e023b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/layout/table_layout.rs:21086-21099 | src/renderer/layout/table_layout.rs:21978-21991 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:21086\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21086}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc2c3fe7c057aec21f070533b27c9e7e94e939c33fc80ab611b151c96b2488d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/render_normalization/math_table.rs:192-205 | src/renderer/render_normalization/math_textbox.rs:148-161 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization/math_table.rs\u0060 and \u0060src/renderer/render_normalization/math_textbox.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/render_normalization/math_table.rs:192\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":"src/renderer/render_normalization/math_table.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"59431990d2e9dcc8a16b101ed0f718f77307c76385c7f26098de68bb7ba249ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201314 lines \u00D7 2): src/renderer/skia/glyph_replay.rs:466-472 | src/renderer/skia/renderer.rs:2235-2248 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/glyph_replay.rs:466\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/skia/glyph_replay.rs:463\u0060 calls \u0060into_iter\u0060, \u0060all\u0060 and \u0060src/renderer/skia/renderer.rs:2234\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"64250e058c15bd190089a8b527c6a2c543cf157769cf2449fa421f5086c8144f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/renderer/skia/text_replay.rs:191-204 | src/renderer/skia/text_replay/marks.rs:67-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/skia/text_replay.rs:187\u0060 calls \u0060script_draw_metrics\u0060 and \u0060src/renderer/skia/text_replay/marks.rs:66\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b44dd9e31159c0e27a25ca631ddb94eb40008bcc65d1abd853bb15b913750b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): src/renderer/svg.rs:4552-4581 | src/renderer/web_canvas.rs:338-369 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:4552\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dba80ae3517c6806bb8164c4842c6f93bbb59e842a2e7eddc07b5e8a651c7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:346-358 | src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:305-318 \u2014 before extracting anything, compare \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a36b6d6f777c649ff8d79701ddab1f4c7d204af6a9438c7cd4cea6ab9fdc1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/renderer/typeset/section/controls.rs:333-344 | src/renderer/typeset/section/controls.rs:394-407 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/section/controls.rs:333\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":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d243ac3cdf3978d859b9dfba55a307e16b26f144528d98bc512e20dd037d9645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/security_trailer.rs:188-209 | src/security_trailer.rs:435-456 \u2014 both copies are in the same file, so extract the block 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 \u0060src/security_trailer.rs:188\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security_trailer.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc40c7ffb5a003278dfedb7b998958363ccacdf032cc8917bb7afe81edada2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/serializer/control.rs:1167-1180 | src/serializer/control.rs:1199-1212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b68c1ac1ef256a4490f095e30900cf0d79a1ddd6e816d56221d730b521ad892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/serializer/hwpx/section.rs:4040-4065 | src/serializer/hwpx/section.rs:4950-4975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/section.rs:4040\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"19107e310222ce60323cdf3c3bb9d5fdd2080a727bc5bfc290d818b4470e6922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/serializer/mini_cfb.rs:374-387 | src/serializer/mini_cfb.rs:392-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/mini_cfb.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"026c1def0b82f4728cb741d37072b35c98e8ad5c2fcdc471face92bda963bc8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/wasm_api.rs:1256-1268 | src/wasm_api.rs:1359-1372 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:1256\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":"src/wasm_api.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3726c2c046b25fcb09026d66bfee81adbdeca9c3b347421d6b750770e0e1543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/wmf/converter/svg/mod.rs:1537-1550 | src/wmf/converter/svg/mod.rs:1604-1617 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wmf/converter/svg/mod.rs:1537\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060META_RECTANGLE\u0060 in one and \u0060META_ROUNDRECT\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2901335630c2903246665374ff499d7b85e429a878041a82f76a25869439546c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 70): src/cli/commands/edit/bookmarks.rs:65-77 | src/cli/commands/edit/bookmarks.rs:182-194 | src/cli/commands/edit/bookmarks.rs:300-312 | src/cli/commands/edit/cell_paragraphs.rs:73-85 | src/cli/commands/edit/cell_paragraphs.rs:229-241 | src/cli/commands/edit/cells.rs:280-292 | src/cli/commands/edit/cells.rs:560-572 | src/cli/commands/edit/cells.rs:729-741 | src/cli/commands/edit/cells.rs:899-911 | src/cli/commands/edit/controls.rs:54-66 | src/cli/commands/edit/document_objects.rs:56-68 | src/cli/commands/edit/document_objects.rs:327-339 | src/cli/commands/edit/document_objects.rs:468-482 | src/cli/commands/edit/document_objects.rs:613-625 | src/cli/commands/edit/document_text.rs:67-79 | src/cli/commands/edit/document_text.rs:673-685 | src/cli/commands/edit/document_text.rs:776-788 | src/cli/commands/edit/equations.rs:196-208 | src/cli/commands/edit/equations.rs:299-311 | src/cli/commands/edit/formatting.rs:68-80 | src/cli/commands/edit/formatting.rs:206-218 | src/cli/commands/edit/formatting.rs:636-648 | src/cli/commands/edit/formatting.rs:769-781 | src/cli/commands/edit/formatting.rs:930-942 | src/cli/commands/edit/header_footer_content.rs:73-85 | src/cli/commands/edit/header_footer_content.rs:193-205 | src/cli/commands/edit/header_footer_content.rs:340-352 | src/cli/commands/edit/header_footer_content.rs:490-502 | src/cli/commands/edit/header_footer_content.rs:670-682 | src/cli/commands/edit/header_footer_content.rs:813-825 | src/cli/commands/edit/header_footer_content.rs:945-957 | src/cli/commands/edit/header_footer_content.rs:1099-1111 | src/cli/commands/edit/header_footer_properties.rs:67-81 | src/cli/commands/edit/header_footer_properties.rs:219-231 | src/cli/commands/edit/header_footer_properties.rs:327-339 | src/cli/commands/edit/header_footer_properties.rs:474-486 | src/cli/commands/edit/media.rs:623-635 | src/cli/commands/edit/media.rs:848-860 | src/cli/commands/edit/media.rs:956-968 | src/cli/commands/edit/note_content.rs:65-77 | src/cli/commands/edit/note_content.rs:175-187 | src/cli/commands/edit/note_content.rs:287-299 | src/cli/commands/edit/note_content.rs:627-639 | src/cli/commands/edit/notes.rs:244-256 | src/cli/commands/edit/page.rs:57-69 | src/cli/commands/edit/page.rs:160-172 | src/cli/commands/edit/page.rs:285-297 | src/cli/commands/edit/shapes.rs:101-113 | src/cli/commands/edit/shapes.rs:226-238 | src/cli/commands/edit/shapes.rs:500-512 | src/cli/commands/edit/tables/grid.rs:59-71 | src/cli/commands/edit/tables/grid.rs:167-179 | src/cli/commands/edit/tables/grid.rs:273-285 | src/cli/commands/edit/tables/grid.rs:403-415 | src/cli/commands/edit/tables/grid.rs:522-534 | src/cli/commands/edit/tables/grid.rs:636-648 | src/cli/commands/edit/tables/grid.rs:780-792 | src/cli/commands/edit/tables/insert.rs:109-121 | src/cli/commands/edit/tables/layout.rs:46-58 | src/cli/commands/edit/tables/layout.rs:166-178 | src/cli/commands/edit/tables/layout.rs:292-304 | src/cli/commands/edit/tables/layout.rs:410-422 | src/cli/commands/edit/tables/layout.rs:524-536 | src/cli/commands/edit/tables/layout.rs:644-656 | src/cli/commands/edit/tables/structure.rs:64-76 | src/cli/commands/edit/tables/structure.rs:159-171 | src/cli/commands/edit/tables/structure.rs:254-266 | src/cli/commands/edit/tables/structure.rs:349-361 | src/cli/commands/tabular_import.rs:529-541 | src/cli/queries/structured_objects.rs:45-57 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:65\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"984cc168bde5ac9c36ac57c678bd193a1c1febbbb268d17e10a046b08b89182a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 57): src/cli/commands/edit/bookmarks.rs:196-208 | src/cli/commands/edit/cell_paragraphs.rs:88-100 | src/cli/commands/edit/cells.rs:575-587 | src/cli/commands/edit/cells.rs:744-756 | src/cli/commands/edit/controls.rs:68-80 | src/cli/commands/edit/document_objects.rs:70-81 | src/cli/commands/edit/document_objects.rs:228-239 | src/cli/commands/edit/document_text.rs:285-296 | src/cli/commands/edit/document_text.rs:395-406 | src/cli/commands/edit/document_text.rs:531-542 | src/cli/commands/edit/document_text.rs:687-698 | src/cli/commands/edit/document_text.rs:790-801 | src/cli/commands/edit/document_text.rs:893-904 | src/cli/commands/edit/document_text.rs:989-1000 | src/cli/commands/edit/document_text.rs:1084-1095 | src/cli/commands/edit/equations.rs:210-221 | src/cli/commands/edit/equations.rs:313-325 | src/cli/commands/edit/formatting.rs:650-661 | src/cli/commands/edit/formatting.rs:784-796 | src/cli/commands/edit/header_footer_content.rs:87-98 | src/cli/commands/edit/header_footer_content.rs:207-218 | src/cli/commands/edit/header_footer_content.rs:684-695 | src/cli/commands/edit/header_footer_content.rs:827-838 | src/cli/commands/edit/header_footer_content.rs:959-970 | src/cli/commands/edit/header_footer_content.rs:1113-1125 | src/cli/commands/edit/header_footer_properties.rs:91-103 | src/cli/commands/edit/header_footer_properties.rs:233-245 | src/cli/commands/edit/header_footer_properties.rs:341-352 | src/cli/commands/edit/media.rs:862-874 | src/cli/commands/edit/note_content.rs:79-90 | src/cli/commands/edit/note_content.rs:189-200 | src/cli/commands/edit/note_content.rs:301-312 | src/cli/commands/edit/note_content.rs:409-420 | src/cli/commands/edit/note_content.rs:524-535 | src/cli/commands/edit/notes.rs:68-79 | src/cli/commands/edit/notes.rs:163-174 | src/cli/commands/edit/notes.rs:258-270 | src/cli/commands/edit/page.rs:299-310 | src/cli/commands/edit/page.rs:414-425 | src/cli/commands/edit/shapes.rs:240-252 | src/cli/commands/edit/shapes.rs:514-526 | src/cli/commands/edit/tables/grid.rs:73-84 | src/cli/commands/edit/tables/grid.rs:181-192 | src/cli/commands/edit/tables/grid.rs:287-298 | src/cli/commands/edit/tables/grid.rs:424-435 | src/cli/commands/edit/tables/grid.rs:536-547 | src/cli/commands/edit/tables/grid.rs:651-663 | src/cli/commands/edit/tables/grid.rs:795-807 | src/cli/commands/edit/tables/layout.rs:60-71 | src/cli/commands/edit/tables/layout.rs:181-193 | src/cli/commands/edit/tables/layout.rs:306-317 | src/cli/commands/edit/tables/layout.rs:425-437 | src/cli/commands/edit/tables/layout.rs:659-671 | src/cli/commands/edit/tables/structure.rs:78-89 | src/cli/commands/edit/tables/structure.rs:173-184 | src/cli/commands/edit/tables/structure.rs:268-279 | src/cli/commands/edit/tables/structure.rs:363-374 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:196\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"765db197ff5b119420273ec58996c2641d6af7cce8a041362c3a86c36cb753f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 11): src/cli/outputs/tabular.rs:47-58 | src/cli/outputs/text.rs:300-312 | src/cli/queries/document_inventory.rs:36-46 | src/cli/queries/document_inventory.rs:101-111 | src/cli/queries/document_inventory.rs:173-183 | src/cli/queries/document_inventory.rs:245-256 | src/cli/queries/search.rs:90-102 | src/cli/queries/security_inspection.rs:58-69 | src/cli/queries/structure.rs:79-91 | src/cli/queries/structured_objects.rs:61-71 | src/cli/queries/structured_objects.rs:279-289 \u2014 before extracting anything, compare \u0060src/cli/outputs/tabular.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:47\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa0055d52ab17b956fd6137b8b38c7f4d51d1c01fbc6523e2faab1b5ceffdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 10): src/wmf/parser/records/drawing/line_to.rs:42-54 | src/wmf/parser/records/drawing/text_out.rs:91-103 | src/wmf/parser/records/state/move_to.rs:41-53 | src/wmf/parser/records/state/offset_clip_rgn.rs:41-53 | src/wmf/parser/records/state/offset_viewport_org.rs:41-53 | src/wmf/parser/records/state/offset_window_org.rs:41-53 | src/wmf/parser/records/state/set_viewport_ext.rs:41-53 | src/wmf/parser/records/state/set_viewport_org.rs:41-53 | src/wmf/parser/records/state/set_window_ext.rs:41-53 | src/wmf/parser/records/state/set_window_org.rs:41-53 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/state/move_to.rs\u0060 and \u0060src/wmf/parser/records/state/set_window_org.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/drawing/line_to.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/drawing/line_to.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8a004a6fb82fb2e24b163140431c7fff70cd86dc00d365a901924b4bc0390b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:124-136 | src/diagnostics/hwp5_cell_header_probe.rs:194-206 | src/diagnostics/hwp5_contract_analyze.rs:119-131 | src/diagnostics/hwp5_contract_probe.rs:146-158 | src/diagnostics/hwp5_ctrl_data_trace.rs:87-99 | src/diagnostics/hwp5_first_para_control_probe.rs:150-162 | src/diagnostics/hwp5_mel_personnel_probe.rs:140-152 | src/diagnostics/hwp5_table_probe.rs:146-158 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:124\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a933649e58832e031c6a7a81517d0df8503df9c8adb77732f9bea066dea9cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:129-141 | src/diagnostics/hwp5_cell_header_probe.rs:199-211 | src/diagnostics/hwp5_contract_probe.rs:151-163 | src/diagnostics/hwp5_ctrl_data_trace.rs:92-104 | src/diagnostics/hwp5_first_para_control_probe.rs:155-167 | src/diagnostics/hwp5_inventory_diff.rs:323-335 | src/diagnostics/hwp5_mel_personnel_probe.rs:145-157 | src/diagnostics/hwp5_table_probe.rs:151-163 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diagnostics/hwp5_contract_probe.rs:165\u0060 calls \u0060ok_or_else\u0060, \u0060to_string\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs:337\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d38ce50af6d8c049d63443e2610f0839e8bf644410a1c50004f3599560a6572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/document_core/commands/clipboard.rs:2090-2102 | src/document_core/commands/clipboard.rs:2134-2146 | src/document_core/commands/clipboard.rs:2157-2168 | src/document_core/commands/clipboard.rs:2176-2187 \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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5a36ad15487e65781987efaf3cffc8df170f8afc88af64d11fa955f13abf1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 4): src/document_core/queries/cursor_rect.rs:230-240 | src/document_core/queries/cursor_rect.rs:960-969 | src/document_core/queries/cursor_rect.rs:1004-1016 | src/document_core/queries/cursor_rect.rs:4789-4798 \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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"877028d87b481dc723414e024ed6b2c4f954957f6cff57ce074273533ca62909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/renderer/web_canvas/cubic_reduction.rs:29-41 | src/renderer/web_canvas/cubic_reduction.rs:100-112 | src/renderer/web_canvas/metafile_print.rs:30-42 | src/renderer/web_canvas/print_image_sampling.rs:73-85 \u2014 before extracting anything, compare \u0060src/renderer/web_canvas/cubic_reduction.rs\u0060 and \u0060src/renderer/web_canvas/metafile_print.rs\u0060 as WHOLE FILES: this scan already matched 3 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":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa563b67363ad053d6d57de42b7c161fa589edaa77a69e60fc78834e98b9d5ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/renderer/web_canvas/cubic_reduction.rs:47-59 | src/renderer/web_canvas/metafile_print.rs:52-64 | src/renderer/web_canvas/print_image_sampling.rs:100-112 | src/renderer/web_canvas/print_jpeg.rs:40-52 \u2014 before extracting anything, compare \u0060src/renderer/web_canvas/cubic_reduction.rs\u0060 and \u0060src/renderer/web_canvas/metafile_print.rs\u0060 as WHOLE FILES: this scan already matched 3 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas/metafile_print.rs:50\u0060 calls \u0060Some\u0060 and \u0060src/renderer/web_canvas/print_jpeg.rs:39\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a03bf2c0a54f95391244f4965ded57a2dd4409afab21d6d693f15d703a0330b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/wmf/parser/records/bitmap/stretch_dib.rs:100-112 | src/wmf/parser/records/drawing/arc.rs:81-92 | src/wmf/parser/records/drawing/chord.rs:84-95 | src/wmf/parser/records/drawing/pie.rs:83-94 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/stretch_dib.rs\u0060 and \u0060src/wmf/parser/records/drawing/arc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/stretch_dib.rs:100\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/stretch_dib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6392bc9765c0b8cf25ee665500c773a0c3f6a1f090e63c8cc4e71f0d99c79f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/cli/commands/edit/cells.rs:353-365 | src/cli/commands/tabular_import.rs:325-337 | src/cli/protocol/plan/execution.rs:375-387 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 177 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:353\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9465b85ae0bd2803eafd4685fd8e9d767293ddf82723ad5584630c4b11eafc5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/cli/commands/edit/document_text.rs:87-99 | src/cli/commands/edit/header_footer_content.rs:357-368 | src/cli/commands/edit/header_footer_content.rs:507-518 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/header_footer_content.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/document_text.rs:85\u0060 calls \u0060normalize_text_newlines\u0060, \u0060as_ref\u0060 and \u0060src/cli/commands/edit/header_footer_content.rs:356\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe80e3548176e51a9786c1296ef69e2858c52ddf13ee6153066c92e11bab4077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/cli/commands/edit/media.rs:161-173 | src/cli/commands/edit/text.rs:339-351 | src/cli/commands/tabular_import.rs:79-91 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/media.rs\u0060 and \u0060src/cli/commands/edit/text.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/media.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d28b35353bef9e645e1aa4901fd1fef309cf38a32b5cb3c08b4e09a8ccb34fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/document_core/queries/field_query.rs:945-957 | src/document_core/queries/field_query.rs:1016-1028 | src/document_core/queries/field_query.rs:1129-1141 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/field_query.rs:945\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":"src/document_core/queries/field_query.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"156fa78173a28323f972f88a8d20f6c5b28e08832f1f97f6605f2164905ea682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/render_backend/util.rs:29-41 | src/renderer/canvaskit_policy.rs:2180-2192 | src/renderer/pdf.rs:868-880 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/render_backend/util.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/util.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b4a79586e72000e630863856b57ce2af240ff893920d293e62c66200f835e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/renderer/composer/line_breaking.rs:736-748 | src/renderer/composer/line_breaking.rs:1005-1017 | src/renderer/composer/line_breaking.rs:1146-1158 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/line_breaking.rs:736\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eda4d2500a0b3aff3a3d82565ed4e1c2c066d051ea509b59d1f294b46e4e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 3): src/renderer/equation/canvas_render.rs:313-320 | src/renderer/equation/svg_render.rs:372-380 | src/renderer/skia/equation_conv.rs:431-443 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:313\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f1a4879cec9b920f315286e3ae74e5d5716a17caf8ae9b3211c82fcccab6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/renderer/typeset/controls/host_wrap.rs:94-105 | src/renderer/typeset/controls/wrap_match.rs:58-70 | src/renderer/typeset/controls/wrap_match.rs:165-177 \u2014 before extracting anything, compare \u0060src/renderer/typeset/controls/host_wrap.rs\u0060 and \u0060src/renderer/typeset/controls/wrap_match.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/controls/host_wrap.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/host_wrap.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc262c7d3d5dac0148c4f1de4146c3801e8f72cadda7d4a6f86a6e6439d8e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:214-227 | src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:235-248 | src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:254-267 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5850d593b7e385c8d1328dd8bc4c7a26d7dad9d8f7ab7a1682cf56a45fcea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/bin/rhwp-agent/chunkplan.rs:74-86 | src/bin/rhwp-agent/verify.rs:168-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/chunkplan.rs:74\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3518fd9bd015de005905fdfff07b221f53454f2ad6399f15a7ed0ba5073e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/bin/rhwp-q/kit/chart_csv.rs:103-115 | src/cli/outputs/tabular.rs:422-434 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/chart_csv.rs:103\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/chart_csv.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"854648f51d37054ad9f0d11aed14cdc625794b1e13bed4cd8e167a6e1e043951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/bin/rhwp-q/kit/flow_images.rs:26-35 | src/bin/rhwp-q/kit/overlay_images.rs:26-38 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 and \u0060src/bin/rhwp-q/kit/overlay_images.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/flow_images.rs:26\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/flow_images.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1f9fc9a086169242b3faaaa4f6781c1f5d4892d7e7c75cc61b8c9165a47524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/caption_validation.rs:91-103 | src/document_core/commands/object_ops/picture.rs:75-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/caption_validation.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/caption_validation.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e80f1494dbbf8fe5df112a7e9ffa44fadd5b46f863f8b741c21fd84dbc152f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/edit/document_text.rs:736-748 | src/cli/commands/edit/formatting.rs:24-36 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe647c3e56e69b211a194e60080a47134946bb46e284f2239303fe7fe3d89bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/edit/formatting.rs:90-102 | src/cli/commands/edit/formatting.rs:432-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/formatting.rs:90\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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb06159f95c24c99d8a3bf631b99697ff08bf3498996016d6db2adfa6bbb0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/edit/formatting.rs:97-109 | src/cli/commands/edit/formatting.rs:235-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/formatting.rs:97\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce5fbb092d5293d0c87c741ea5f6640312b23fbc8f99ca0fd613b19a00fe32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/edit/media.rs:161-173 | src/cli/commands/edit/privacy.rs:121-133 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/media.rs\u0060 and \u0060src/cli/commands/edit/privacy.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/media.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9b5765c3c902d6d6e51c96a6e22c1122a352fed6e3fec5e21bab913d06a24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/generation.rs:29-41 | src/cli/commands/generation.rs:214-226 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/generation.rs:29\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/generation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192ff6bc39b75ea9603cbd786e7ae3ceb7376ad81ad08051fec62a63110b40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/outputs/raster.rs:76-88 | src/cli/outputs/text.rs:432-444 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e66039bf83ffe0f0d97de2bff216d7e6b326635f0927ce75776859c5c9206d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/protocol/harness.rs:382-394 | src/cli/protocol/trust/governance.rs:247-259 \u2014 before extracting anything, compare \u0060src/cli/protocol/harness.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/harness.rs:382\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/harness.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcab9b83057dce2d8abc83d1bdfa552dba876c6de1db69f1fb7ca4cbdad6147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/queries/diagnostics.rs:286-298 | src/cli/queries/diagnostics.rs:325-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/diagnostics.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a491a3c64cf5e3de1e4be000a209e984d6f8de3a478f929b44781586626d0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/diagnostics/hwp5_char_shape_audit.rs:182-194 | src/diagnostics/hwp5_ctrl_data_trace.rs:54-66 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_char_shape_audit.rs\u0060 and \u0060src/diagnostics/hwp5_ctrl_data_trace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_char_shape_audit.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_char_shape_audit.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d5b3ce144da0fd2b6a0b06e65cfdd40cce867ed8875b89e50375052e188bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:1163-1175 | src/serializer/hwpx/roundtrip.rs:1810-1822 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/ir_field_sweep.rs:1163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060s\u0060 to \u0060\u0026ShapeObject\u0060 in one and \u0060\u0026crate::model::shape::ShapeObject\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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d14afad5881c5c060ba4035b3060ee7a54013c7659de8ceb1b124673690209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/document_core/commands/clipboard.rs:984-996 | src/document_core/commands/foreign_paste.rs:209-218 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:984\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb6f21fdef17b6c8dca0f9d51e4d26a3a3a70dbb262e0e7f29971317f331ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/document.rs:443-455 | src/document_core/mod.rs:600-612 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/document.rs:457\u0060 calls \u0060collect\u0060, \u0060repeat_n\u0060, \u0060map_err\u0060 and \u0060src/document_core/mod.rs:613\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"323309fac6e4c66bba728ca53e64cd9068ab8de9d5b7e9e6718654ad069ed7fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/document_core/commands/formatting.rs:189-199 | src/document_core/commands/text_editing.rs:2011-2023 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn reflow_paragraph(\u0026mut\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":"src/document_core/commands/formatting.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce560d0d02037731507811b0fe08df7adeb928205d800961d47abb2f74f507c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/header_footer_ops.rs:315-327 | src/document_core/commands/header_footer_ops.rs:1279-1291 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/header_footer_ops.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635dfcd752670d86d1c36684b0d5d655b815a98278b35c5a2000e721f3de6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:916-928 | src/document_core/commands/object_ops/chart.rs:1062-1074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/object_ops/chart.rs:1076\u0060 calls \u0060to_vec\u0060 and \u0060src/document_core/commands/object_ops/chart.rs:930\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac82d6da167aa8bd1748be735a739742d31b818320c6e6b76e12b39a5bcc39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/document_core/commands/object_ops/equation.rs:498-509 | src/document_core/commands/object_ops/picture.rs:1468-1480 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:498\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6783127911fb78fc9c3bfd5f6f8c1a659985fa73551e1ce84a2fbf9938807cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:928-940 | src/document_core/commands/object_ops/table.rs:220-232 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/picture.rs\u0060 and \u0060src/document_core/commands/object_ops/table.rs\u0060 as WHOLE FILES: this scan already matched 3 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d89966903968f4d6c107e9d7512afbb38b4fa2473f1ce61b586b7ec235d3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/object_ops/picture.rs:1728-1740 | src/document_core/commands/object_ops/table.rs:475-487 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/picture.rs\u0060 and \u0060src/document_core/commands/object_ops/table.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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 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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"978ceabfc77287e775ebd62d4995b50cf04e24a7f47f7a9dc40bc28a063a360e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/paragraph_block/import.rs:237-249 | src/document_core/commands/paragraph_block/repeat.rs:158-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/paragraph_block/import.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/paragraph_block/import.rs:250\u0060 calls \u0060clone\u0060, \u0060measure\u0060, \u0060to_vec\u0060 and \u0060src/document_core/commands/paragraph_block/repeat.rs:171\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1c504d8264daed0c01ab3f98a18480beadf7fb8b7b1347fa5ddcc4e08d16d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/document_core/commands/text_editing.rs:5534-5545 | src/document_core/commands/text_editing.rs:5553-5565 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:5534\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5534}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a1d365fea014eef79b1f5f6cd46032b1b5d64dcc879970466111169aaf6eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:6261-6268 | src/document_core/queries/cursor_rect.rs:6584-6596 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:6584\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1910f1a06bbf3407be9da3619f183d46f418261c909c0610c2f0213d9c6c09f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/queries/rendering.rs:1136-1148 | src/document_core/queries/rendering.rs:1150-1162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"014e2a23528eaffbc8ab410990bf4c73c33a21539048e6eee17a5e509ed597de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/queries/rendering.rs:5718-5730 | src/document_core/queries/rendering.rs:5741-5753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":5718}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ea1c128e4c29a98102c7483c68b4b443987fee10e6b64c1ab97592a77253e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/queries/rendering.rs:6311-6323 | src/document_core/queries/rendering.rs:6336-6348 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:6311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":6311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a6b13242b576218d828458b5d081211366993b9d70e801fd940653fb72c3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/queries/rendering.rs:7742-7754 | src/document_core/queries/rendering.rs:7824-7836 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:7742\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7742}}}],"partialFingerprints":{"codehealthFindingId/v1":"01135fd84482f10b6f0f603903e78c46b928c0b2d4228139fcfa102e1b936b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/model/page.rs:209-221 | src/renderer/page_layout.rs:110-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":"src/model/page.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d132d4432200fad06ab7f50d14aeb4eae9b06f872ae4c050aecd46906003155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/paint/paint_op.rs:1344-1356 | src/paint/paint_op.rs:1375-1387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/paint/paint_op.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5c36c180798c0a203479c6db61563b1150aaec9a633b3eb5765a878864064d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/parser/body_text.rs:318-328 | src/parser/hwpx/section.rs:173-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/body_text.rs:318\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":"src/parser/body_text.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20684175df702dde584471e8218558c2120db102843a093eaeeda964b3cff65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/parser/hwp3/johab.rs:144-156 | src/parser/hwp3/johab.rs:163-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/johab.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"65af358d816931924691e74e5a34f4e7f6895e8bdab1d1ffb0283eed8b954f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/parser/hwpx/section.rs:5749-5768 | src/parser/hwpx/section.rs:5778-5797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"3761708d41a23a3408cebdbbdc64c5b891b79dc07b15bba6d639a81b2c2f89f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/parser/hwpx/section.rs:7593-7605 | src/parser/hwpx/section.rs:7730-7740 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:7593\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":7593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d003f0532d7fc967e1198d15dfd3f2ea78a89ebf3d0092aca9f0e4ed0e98508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/composer/line_breaking.rs:4652-4664 | src/renderer/composer/line_breaking.rs:6331-6343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":4652}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9478275b5b3f4b92deb28e6ca8080453c07aa386fff1f326349b97f3453975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/composer/stored_cell_reflow.inc.rs:112-124 | src/renderer/typeset/paragraph.rs:763-775 \u2014 before extracting anything, compare \u0060src/renderer/composer/stored_cell_reflow.inc.rs\u0060 and \u0060src/renderer/typeset/paragraph.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. 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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0be864cd0636145f2b667e74e01306eefe94ec4560a54142b41181a6881dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/float_placement.rs:949-961 | src/renderer/float_placement/picture_box.rs:92-104 \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. 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":"src/renderer/float_placement.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f235e96f77893c37ed6b5fe7d4984df65d197d10b48196890990a97695067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/float_placement.rs:5472-5484 | src/renderer/float_placement.rs:5648-5660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/float_placement.rs:5486\u0060 calls \u0060checked_add\u0060, \u0060from\u0060 and \u0060src/renderer/float_placement.rs:5661\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48282e3e4d0200b16eaa39490167e399566015a181a92cca38cc294c5a56910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/height_measurer.rs:2439-2451 | src/renderer/layout/paragraph_layout.rs:7299-7311 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/paragraph_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/paragraph_layout.rs:7288\u0060 calls \u0060and_then\u0060, \u0060get\u0060 and \u0060src/renderer/height_measurer.rs:2438\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5d1562e6a7371a66be14f22fb96091ab81018bba59d7f0f4c8c488ce166e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/layout.rs:2220-2232 | src/renderer/layout.rs:2287-2299 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:2220\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":"src/renderer/layout.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fc182633d5620832e28389f4e1974729e99c0d533b10a8923c60cb36c8ba98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/layout.rs:3181-3193 | src/renderer/layout/shape_layout.rs:350-362 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:3181\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7688e20ac88e0acd0556504b581f24db483907604e0c92304ad446bfa88a8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:5594-5606 | src/renderer/layout/shape_layout.rs:352-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:5594\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4601ac591b48989c90e04d0c56901a2f58750b71b641103efb309da3ea4688bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9092-9104 | src/renderer/layout/paragraph_layout.rs:11219-11228 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:9092\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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0421465830dec91cac4697b8670ae245299492b67e79825f1ef3ae408e0ff47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:10985-10997 | src/renderer/layout/paragraph_layout.rs:11084-11096 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:10985\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":10985}}}],"partialFingerprints":{"codehealthFindingId/v1":"48585586f1c9ee09da5fd003f35778ac723412ee99902c0baa54da6b441cde24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2879-2889 | src/renderer/layout/shape_layout.rs:3062-3074 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2879\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8afc5e4e415ee8f15a9e366ec1701a6abf798498a4b28d1d3acde2af16b7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/renderer/layout/shape_layout.rs:5123-5134 | src/renderer/layout/shape_layout.rs:5302-5314 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:5123\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1e66dc8006a1f9da6ddb70aa790beb29d7aa2ff222d5f5e99d4abaedc24b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:1070-1082 | src/renderer/layout/table_layout.rs:10743-10755 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:1070\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":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c707f496e812a7b89915defed4f28dfac727e36d84897f1af513db26d5cf8b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/renderer/layout/table_layout.rs:18994-19006 | src/renderer/layout/table_layout.rs:21556-21566 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:18994\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b18ca3b2315e3315abff8137983c906760efdc7507916535e7ab86bf699a4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/mod.rs:3753-3765 | src/renderer/mod.rs:3788-3800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"c507dbde6973081be737dbd55882dc256399442e1568f256d6d57d848734bfc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/renderer/pagination/engine.rs:1614-1625 | src/renderer/typeset/paragraph/placement.rs:60-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:1614\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faf3001a3515c2918d1a5aa7b8f9218d406c01b257c77e9a9aa3737b783beb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/shaping_context.rs:852-864 | src/renderer/shaping_context.rs:927-939 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/shaping_context.rs:852\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/shaping_context.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"71003f68182bff8d2eb7bdeb693894191035ebd81ba2a86827e17b84d01ad1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/svg.rs:39-51 | src/renderer/web_canvas.rs:91-103 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eeaed7dabb89e560fb1a1eab3151bb478c7eb36439f7288300522d102355ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/svg.rs:1916-1928 | src/renderer/web_canvas.rs:986-998 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:1916\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":"src/renderer/svg.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d727516b3e62e8760865be4fa995ed8a861ed32d94d57e86927830316a84038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/svg.rs:2658-2670 | src/renderer/web_canvas.rs:3944-3956 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:3939\u0060 calls \u0060save\u0060 and \u0060src/renderer/svg.rs:2652\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613d11f1450907b6c947452c0fdd474929834c3fbd763dbc8ea39f2551fbe42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/svg.rs:2787-2799 | src/renderer/web_canvas.rs:4087-4099 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:4085\u0060 calls \u0060save\u0060 and \u0060src/renderer/svg.rs:2784\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"50beed849d4e4f838cd604aa3d6de2b16898bec284c9878d5f8b227db96f1a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/typeset/controls/deferred.rs:77-89 | src/renderer/typeset/controls/deferred.rs:97-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":"src/renderer/typeset/controls/deferred.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ba303233576a89681c4ec7dc096ce3111d2bb33f8158f3e9ffb0ae47d8326a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/typeset/table/continuation/fragment/scan.rs:543-555 | src/renderer/typeset/table/continuation/fragment/scan.rs:673-685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a42e2632724a3298b5f28c499520bdeac2aa0fa16005af746be9f38ba83b429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/typeset/table/scan/block_fragment.rs:80-92 | src/renderer/typeset/table/scan/block_fragment.rs:121-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. 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":"src/renderer/typeset/table/scan/block_fragment.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"98178fdabaa6161e7c393c6272dae2b09ba8ec2bb6a6d0d0c32a25a9c9afbf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serializer/control.rs:1184-1196 | src/serializer/control.rs:1215-1227 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/control.rs:1184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a66f3f2f01343cc27c2eeab0cd4d096c2ed515f2b20f8b37c9e7531cb72b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serializer/doc_info.rs:1217-1229 | src/serializer/doc_info.rs:1310-1322 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/doc_info.rs:1217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/doc_info.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ad69a3e4065cf09f4d256840fc7450f9837e72e2737f6a509c22e2cbbf9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1084-1096 | src/serializer/hwpx/roundtrip.rs:1129-1141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026crate::model::page::PageDef\u0060 in one and \u0060\u0026crate::model::document::SectionDef\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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bc48f6932b0a7e8908431ac34828bc04822b046b4d6e9df5963b91a930468c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/wasm_api.rs:8712-8723 | src/wasm_api.rs:8743-8755 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:8712\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":"src/wasm_api.rs"},"region":{"startLine":8712}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb01e402a9aa1fa5e64541fd4a165d6323a4786e1b7c223d713c17d6dc7a64e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/wmf/converter/svg/ternary_raster_operator.rs:450-460 | src/wmf/converter/svg/ternary_raster_operator.rs:471-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"956b9a67d09cebeb1289dec2350bf2002da83d679b7b828626cc096c44a8b456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/wmf/parser/records/state/animate_palette.rs:45-57 | src/wmf/parser/records/state/set_pal_entries.rs:36-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/state/animate_palette.rs:45\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":"src/wmf/parser/records/state/animate_palette.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b5395177ba3552426750e9e4611b22607dddadfc68c8be13ffc75e7e379c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/wmf/parser/records/state/set_bk_color.rs:37-49 | src/wmf/parser/records/state/set_text_color.rs:36-48 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/state/set_bk_color.rs\u0060 and \u0060src/wmf/parser/records/state/set_text_color.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/state/set_bk_color.rs:37\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":"src/wmf/parser/records/state/set_bk_color.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0d2ab33e43f3cd668771a4ffbd5cfbc292c25fa6d29bbda64e1f9c62aeeea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 23): src/cli/commands/edit/bookmarks.rs:84-94 | src/cli/commands/edit/bookmarks.rs:321-331 | src/cli/commands/edit/cell_paragraphs.rs:250-260 | src/cli/commands/edit/cells.rs:305-316 | src/cli/commands/edit/cells.rs:923-933 | src/cli/commands/edit/document_objects.rs:632-642 | src/cli/commands/edit/document_text.rs:89-100 | src/cli/commands/edit/equations.rs:81-91 | src/cli/commands/edit/formatting.rs:92-103 | src/cli/commands/edit/formatting.rs:230-241 | src/cli/commands/edit/formatting.rs:434-445 | src/cli/commands/edit/formatting.rs:956-967 | src/cli/commands/edit/header_footer_content.rs:359-369 | src/cli/commands/edit/header_footer_content.rs:509-519 | src/cli/commands/edit/header_footer_properties.rs:498-509 | src/cli/commands/edit/media.rs:977-987 | src/cli/commands/edit/note_content.rs:653-664 | src/cli/commands/edit/page.rs:76-86 | src/cli/commands/edit/page.rs:179-189 | src/cli/commands/edit/shapes.rs:124-134 | src/cli/commands/edit/shapes.rs:364-374 | src/cli/commands/edit/tables/insert.rs:128-138 | src/cli/commands/edit/tables/layout.rs:546-556 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:84\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2a28c8b2bdd993ec43abea2ba89bf1541e7de4ecf9c15b7a1eeb830a9ca791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 18): src/cli/outputs/tabular.rs:50-60 | src/cli/outputs/text.rs:304-314 | src/cli/outputs/text.rs:562-573 | src/cli/queries/data_extraction.rs:76-86 | src/cli/queries/diagnostics.rs:19-30 | src/cli/queries/diagnostics.rs:145-156 | src/cli/queries/diagnostics.rs:603-613 | src/cli/queries/diagnostics.rs:833-844 | src/cli/queries/document_inventory.rs:38-48 | src/cli/queries/document_inventory.rs:103-113 | src/cli/queries/document_inventory.rs:175-185 | src/cli/queries/document_inventory.rs:248-258 | src/cli/queries/search.rs:94-104 | src/cli/queries/security_inspection.rs:61-71 | src/cli/queries/structure.rs:83-93 | src/cli/queries/structured_objects.rs:63-73 | src/cli/queries/structured_objects.rs:191-201 | src/cli/queries/structured_objects.rs:281-291 \u2014 before extracting anything, compare \u0060src/cli/outputs/tabular.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/queries/structured_objects.rs:190\u0060 calls \u0060unwrap_or\u0060 and \u0060src/cli/outputs/tabular.rs:48\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8337d0cc54fa22efe956a3e6051d1daeecf746f5c29e8ce5f8aaa1afb8c634df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 16): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:313-324 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:255-266 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:28-39 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:286-297 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:34-45 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:308-319 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:203-214 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:28-39 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:251-262 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:239-250 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:30-41 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:294-305 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:29-40 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:28-39 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:205-216 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:244-255 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f844cc289f158515d0ec4594139c9623b8efd6d4a636f245774a45e9b6053cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 12): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:112-123 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:111-122 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:111-122 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:115-126 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:112-123 | src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:49-60 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:49-60 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:103-114 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:111-122 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:101-112 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:98-109 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:112-123 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cd3bea8e5a31398f61588e2b9f47c0308fed79109fdee5a2058c2e8e03491b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:231-242 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:164-175 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:206-217 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:209-220 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:166-177 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:183-194 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:181-192 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:136-147 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:214-225 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:157-168 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:165-176 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3a49935580acf447493297b49ee1b47b2db9f5bcb8f8a90c6a913e95e05125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:213-224 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:146-157 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:188-199 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:191-202 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:147-158 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:153-164 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:146-157 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:196-207 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:128-139 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:147-158 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:213\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/bin/rhwp-q/commands/rhwp-q-page-images.rs:158\u0060 calls \u0060as_bool\u0060, \u0060unwrap_or\u0060, \u0060as_u64\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-def.rs:165\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f9d3373983e101e2835d0a06c3ffa19a7cd36994f3a3ff7b0b538d28246a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8): src/cli/commands/edit/cell_paragraphs.rs:103-114 | src/cli/commands/edit/cell_paragraphs.rs:263-274 | src/cli/commands/edit/cells.rs:323-334 | src/cli/commands/edit/cells.rs:590-601 | src/cli/commands/edit/cells.rs:759-770 | src/cli/commands/edit/cells.rs:936-947 | src/cli/commands/edit/formatting.rs:806-817 | src/cli/commands/edit/formatting.rs:970-981 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c60b4c9b00006bfc1422dc8ed6f87a7b2fb5316132a8a0ed8ed50977e18b9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 8): src/wmf/parser/records/bitmap/bit_blt.rs:139-149 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:143-153 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:166-176 | src/wmf/parser/records/bitmap/stretch_blt.rs:163-173 | src/wmf/parser/records/drawing/ellipse.rs:53-64 | src/wmf/parser/records/drawing/rectangle.rs:52-63 | src/wmf/parser/records/state/scale_viewport_ext.rs:50-60 | src/wmf/parser/records/state/scale_window_ext.rs:50-60 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/bit_blt.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f8602c355d7a7fbe2ef2147edea3a4a0b31e2163582a6f2897603686e95712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): crates/rhwp-ooxml-chart/src/renderer.rs:229-241 | src/doclang/writer/escape.rs:56-67 | src/emf/converter/svg.rs:63-75 | src/ole_chart/svg_renderer.rs:415-427 | src/renderer/equation/svg_render.rs:776-788 | src/renderer/pdf.rs:1817-1829 | src/renderer/svg.rs:4417-4429 \u2014 before extracting anything, compare \u0060src/doclang/writer/escape.rs\u0060 and \u0060src/ole_chart/svg_renderer.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/renderer.rs:229\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc192e7e03f33dc2439982e5b494f8e2bc1e05e2005a2b1723f4b8f14fdc705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 7): src/cli/commands/edit/cells.rs:419-430 | src/cli/commands/edit/document_text.rs:163-173 | src/cli/commands/edit/media.rs:423-434 | src/cli/commands/edit/privacy.rs:268-278 | src/cli/commands/edit/text.rs:197-208 | src/cli/commands/tabular_import.rs:393-403 | src/cli/commands/tabular_import.rs:689-699 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:419\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30380fe34fe683668a78c18d0a4111ec4ab4517c8e2056f14d693d1c4437ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 7): src/document_core/commands/clipboard.rs:907-918 | src/document_core/commands/clipboard.rs:1329-1340 | src/document_core/commands/foreign_paste.rs:43-54 | src/document_core/commands/formatting.rs:1168-1176 | src/document_core/commands/formatting.rs:1248-1256 | src/document_core/commands/formatting.rs:1803-1811 | src/document_core/commands/html_import.rs:189-200 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 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 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09801562d2d1c2eec62a58b3e62b949754200fa618ac686ffbf3e3f46a0881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): src/document_core/commands/text_editing.rs:1699-1710 | src/document_core/commands/text_editing.rs:1952-1963 | src/document_core/commands/text_editing.rs:4268-4279 | src/document_core/commands/text_editing.rs:4424-4435 | src/document_core/commands/text_editing.rs:4922-4933 | src/document_core/commands/text_editing.rs:5144-5155 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:1699\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/text_editing.rs:1712\u0060 calls \u0060paragraph_flow_end\u0060 and \u0060src/document_core/commands/text_editing.rs:4280\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03f277a8f058508aac60bde9d3ae07e039dd55fdfc34daecddfd95f52c6d308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:120-131 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:60-71 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:108-119 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:88-99 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:60-71 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5f0028c917ee5ecc48a0b55c444269286365b9adf60f3e9515383a711246c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/bin/rhwp-q/kit/footnote_hit.rs:56-67 | src/bin/rhwp-q/kit/form_at.rs:13-24 | src/bin/rhwp-q/kit/hit_fn_marker.rs:14-25 | src/bin/rhwp-q/kit/hit_header.rs:56-67 | src/bin/rhwp-q/kit/hit_in_footnote.rs:14-25 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/footnote_hit.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_header.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/footnote_hit.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/footnote_hit.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd6fa65cc5623f7eda4e20f256ede24c786dd2733b3b1a6eff8720597cacb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/diagnostics/hwp5_cell_header_probe.rs:722-733 | src/diagnostics/hwp5_contract_probe.rs:640-651 | src/diagnostics/hwp5_first_para_control_probe.rs:1322-1333 | src/diagnostics/hwp5_mel_personnel_probe.rs:636-647 | src/diagnostics/hwp5_table_probe.rs:381-392 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"03af9233df8d54adbe1aa675baa3e4397e2a2a8e7e595f02f0a948b64fbc2270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): src/diagnostics/hwp5_cell_header_probe.rs:790-802 | src/diagnostics/hwp5_contract_probe.rs:708-720 | src/diagnostics/hwp5_first_para_control_probe.rs:1390-1402 | src/diagnostics/hwp5_mel_personnel_probe.rs:704-716 | src/diagnostics/hwp5_table_probe.rs:555-567 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diagnostics/hwp5_table_probe.rs:569\u0060 calls \u0060is_table_ctrl_header\u0060, \u0060read_u32\u0060, \u0060Some\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs:804\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2621977eab82187a246dffd330bca3ed1ebe0d4d6ad8b2a94c14978c59fd347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): src/document_core/commands/object_ops/common.rs:577-588 | src/document_core/commands/object_ops/equation.rs:528-539 | src/document_core/commands/object_ops/table.rs:1115-1126 | src/document_core/commands/text_editing.rs:4478-4489 | src/document_core/commands/text_editing.rs:4664-4675 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/equation.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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 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":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d36c2fea7fd5d03858f0e7f5cb3159d522b4ca843ffcef59507262cc1227ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): src/wmf/parser/records/bitmap/stretch_dib.rs:99-110 | src/wmf/parser/records/drawing/arc.rs:80-91 | src/wmf/parser/records/drawing/chord.rs:83-94 | src/wmf/parser/records/drawing/pie.rs:82-93 | src/wmf/parser/records/drawing/round_rect.rs:68-78 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/stretch_dib.rs\u0060 and \u0060src/wmf/parser/records/drawing/arc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/stretch_dib.rs:99\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/stretch_dib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bbf1802a9edfa6f5a90b138e7863fc5811d974adf1f16531b340976ac9b1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/bin/rhwp-agent/searchcmd.rs:18-29 | src/bin/rhwp-agent/searchcmd.rs:63-74 | src/bin/rhwp-agent/searchcmd.rs:98-109 | src/bin/rhwp-agent/searchcmd.rs:126-137 \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":"src/bin/rhwp-agent/searchcmd.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eb813c5a626408ba41f3241eb2f01154db65ae95a1f97da19a2c5be5e38310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/bin/rhwp-q/kit/cur_field_state.rs:19-30 | src/bin/rhwp-q/kit/field_info_at.rs:19-30 | src/bin/rhwp-q/kit/line_starts.rs:18-29 | src/bin/rhwp-q/kit/para_bounds.rs:18-29 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 and \u0060src/bin/rhwp-q/kit/field_info_at.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cur_field_state.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cur_field_state.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32781ae93b965688b711c5a7592d07b470f175fa92218ec1e339350da88f07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/cli/commands/edit/formatting.rs:38-49 | src/cli/commands/edit/formatting.rs:176-187 | src/cli/commands/edit/header_footer_properties.rs:37-48 | src/cli/commands/edit/note_content.rs:597-608 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/formatting.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/formatting.rs:38\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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed5ecc241b177ee66ee3feaf3a47ba7dc69a41045d64aee1dd10797b0f016ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): src/renderer/layout/table_layout.rs:10765-10776 | src/renderer/layout/table_layout.rs:13067-13077 | src/renderer/layout/table_layout.rs:13249-13259 | src/renderer/layout/table_layout.rs:14239-14249 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:10765\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":10765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2393715a000781517975a4c95398a63bbed9d9fcbaef79c93cafc13bae25c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/wmf/converter/bitmap.rs:34-45 | src/wmf/converter/bitmap.rs:54-65 | src/wmf/converter/bitmap.rs:89-100 | src/wmf/converter/bitmap.rs:145-156 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/bitmap.rs:34\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/bitmap.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1789c3b5dc8c91ec78bab9b6b860015a017c731dbe78c2583ed5dbe9e84a893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_cell.rs:33-44 | src/bin/rhwp-q/kit/cursor_in_note.rs:32-43 | src/bin/rhwp-q/kit/note_edit_info.rs:27-38 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_note.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:33\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3950c3ce46e6662d9f317eac539ba591723d99494f280ceb84b489134ed058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_cell.rs:91-102 | src/bin/rhwp-q/kit/cursor_in_note.rs:86-97 | src/bin/rhwp-q/kit/note_edit_info.rs:73-84 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_note.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:105\u0060 calls \u0060require\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_note.rs:100\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19f6710f98becd99aabbac23d9b4a517e4391b647c9e1d5780cdbc2712587c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/cli/commands/edit/equations.rs:71-82 | src/cli/commands/edit/formatting.rs:941-952 | src/cli/commands/edit/note_content.rs:638-649 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/equations.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/equations.rs:71\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":"src/cli/commands/edit/equations.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"384c37792529d2912c63a70216997a0202d50d454556931461968e94117147b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/cli/outputs/text.rs:100-111 | src/cli/queries/security_inspection.rs:628-638 | src/cli/queries/security_inspection.rs:900-910 \u2014 before extracting anything, compare \u0060src/cli/outputs/text.rs\u0060 and \u0060src/cli/queries/security_inspection.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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":"src/cli/outputs/text.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b15d64cfccacf649a3c15e42b3ee095c4c870e9f8bf64d2092d67329b01909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/cli/protocol/capsule/signing.rs:18-28 | src/cli/protocol/harness.rs:118-129 | src/cli/protocol/trust/governance.rs:459-469 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/harness.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:18\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8be3650b7d5ee52a6dc6254e8a8526a01e18bc53455bd6e9ba445d1a95ad4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/doclang/adapter/inline.rs:136-147 | src/doclang/adapter/inline.rs:157-168 | src/doclang/adapter/inline.rs:204-215 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/doclang/adapter/inline.rs:136\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/inline.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3f113d44dac98199c5a5a895b1a4885943de40b6bd8c4bae9f5329eeff8ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/document_core/queries/cursor_nav.rs:675-686 | src/document_core/queries/cursor_nav.rs:811-822 | src/document_core/queries/cursor_nav.rs:932-943 \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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edd17738a7a71604c7fe2b9be88ddfddafd1ae76ab1b6c07edbd63c0f90cbc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/document_core/queries/cursor_nav.rs:746-757 | src/document_core/queries/cursor_nav.rs:862-873 | src/document_core/queries/cursor_nav.rs:972-983 \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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b6d80d0a6bb969475f8a3a13915ff6b7c24e0926a4d827e23444ca29a5433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:4456-4467 | src/document_core/queries/cursor_rect.rs:4477-4488 | src/document_core/queries/cursor_rect.rs:4494-4505 \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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4456}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b5f51c10375b8be366ee663b65b9d3e4541eb2f64e6f68a2529dd3ea1fa89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/document_core/queries/field_query.rs:656-667 | src/document_core/queries/memo_query.rs:1434-1445 | src/document_core/queries/memo_query.rs:1501-1512 \u2014 before extracting anything, compare \u0060src/document_core/queries/field_query.rs\u0060 and \u0060src/document_core/queries/memo_query.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/field_query.rs:656\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0bb806d8e41c9823fe1a8ab33ca34560ecde03b72b8c1330ae47d5cc952599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/document_core/queries/rendering.rs:4569-4580 | src/document_core/queries/rendering.rs:4592-4603 | src/document_core/queries/rendering.rs:4613-4624 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/rendering.rs:4569\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74c6afe8df2ac6c0b2aa799f0fe912da340e8d488b0b64c35901cfc0849c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/parser/hwp3/mod.rs:4543-4554 | src/parser/hwp3/mod.rs:4575-4586 | src/parser/hwp3/mod.rs:4623-4634 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwp3/mod.rs:4543\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":"src/parser/hwp3/mod.rs"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af5e6a95db70e7ac5a5390f08b1db04bd7f994d6e636b8ad512d9fd8b0e770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/parser/hwpx/section.rs:761-772 | src/parser/hwpx/section.rs:978-989 | src/parser/hwpx/section.rs:2302-2313 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:2302\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec06c2c60033b62e2b1aced8aa82d5926789369f6022712a0c03126f79b247c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/renderer/composer/stored_row_projection.rs:48-59 | src/renderer/render_normalization/math_table.rs:194-205 | src/renderer/render_normalization/math_textbox.rs:150-161 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization/math_table.rs\u0060 and \u0060src/renderer/render_normalization/math_textbox.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_row_projection.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/render_normalization/math_table.rs:191\u0060 calls \u0060has_math_table\u0060 and \u0060src/renderer/composer/stored_row_projection.rs:47\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_row_projection.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b83024fe14971a5e76ccb9b6c0dfb5d214035e89a12cc356bdb9067102cbaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/renderer/composer/stored_tac_host_frame.rs:34-45 | src/renderer/typeset/controls/square_host_frame.rs:53-64 | src/renderer/typeset/state/paragraph_fragment.rs:78-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_tac_host_frame.rs:34\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":"src/renderer/composer/stored_tac_host_frame.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dd943903eab9a20c98ba791723539d5187263981be91f3430cbcab67e23a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 4): src/renderer/equation/brace_outline.rs:41-52 | src/renderer/equation/integral_outline.rs:48-59 | src/renderer/equation/multiplication_outline.rs:39-50 | src/renderer/equation/radical_outline.rs:51-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/brace_outline.rs:41\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":"src/renderer/equation/brace_outline.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c781bfa3c5cdda324e5f8e47a100cbee112b276a89e03cee46fcaac7439030fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/renderer/equation/canvas_render.rs:323-334 | src/renderer/equation/svg_render.rs:383-395 | src/renderer/skia/equation_conv.rs:455-466 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:323\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"44de33ac105f8e6fd32ed0baa61b22ff475c8f2444ea35f5ff824682c0f4ab6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): src/renderer/equation/canvas_render.rs:441-450 | src/renderer/equation/svg_render.rs:511-520 | src/renderer/skia/equation_conv.rs:605-616 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:441\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4ba223a2988c4f2a7fa1f6cd84fc8f64ba7e475f4600d88354d8a641cd1d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/renderer/layout.rs:3183-3194 | src/renderer/layout/paragraph_layout.rs:5594-5605 | src/renderer/layout/shape_layout.rs:352-363 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:3183\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b5cd8818df6a35b48656e086ecc31ba53c72397c045b4e15db4c795c164f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/renderer/layout/paragraph_layout.rs:9835-9846 | src/renderer/layout/paragraph_layout.rs:10024-10035 | src/renderer/layout/paragraph_layout.rs:10594-10605 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:9835\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9835}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c814d7d1baa2f1da92f02f3c63bc2caab144c6491f81a7b1f4348a6ab3ea21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/renderer/svg.rs:3123-3133 | src/renderer/svg.rs:3197-3208 | src/renderer/svg.rs:3233-3244 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:3123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"88371457f698a9363a70329ae85a15b9110f1f7a4195b1b32641254d5f84280b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): src/wmf/converter/svg/mod.rs:939-950 | src/wmf/converter/svg/mod.rs:953-964 | src/wmf/converter/svg/mod.rs:967-978 | src/wmf/converter/svg/mod.rs:980-990 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:939\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffc1b1452824cee6ab37245e59e916e4b1f6f0e95ba3686984356c7fd378244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/wmf/parser/records/bitmap/set_dib_to_dev.rs:103-114 | src/wmf/parser/records/bitmap/stretch_dib.rs:117-128 | src/wmf/parser/records/object/dib_create_pattern_brush.rs:65-76 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs\u0060 and \u0060src/wmf/parser/records/bitmap/stretch_dib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/set_dib_to_dev.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8f025c8d23541da5f35736001216dbfa42c79d1f63b1154dc2c438803398f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/chunkplan.rs:70-81 | src/bin/rhwp-agent/safety.rs:417-428 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/bin/rhwp-agent/chunkplan.rs:70\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6029b25479852a022c95840a9801984bd65faa496ce99aced8d5e60c0f0a340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/compare.rs:19-30 | src/bin/rhwp-agent/compare.rs:53-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/compare.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dec95e8003a2abceecbfd36a47dc1b525dce7cf4db43961ec0c869f306c8e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/difftext.rs:296-307 | src/bin/rhwp-agent/evidence.rs:104-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/bin/rhwp-agent/difftext.rs:296\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":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd230f4129113c8a4a4cbd4bd9c9bbcf8c7f897cf3cf57d313924c53bbcbe0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/envelope.rs:134-145 | src/cli/queries/scan.rs:112-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad83bdb16688d34d485461d79611291247d33197142a060d0b8f99e9a96c973f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:302-313 | src/bin/rhwp-agent/safety.rs:606-617 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/safety.rs:302\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2328ee9b0a1b1d3ce9aa14ff65dc4c373aea88bdc36a83928d0aa9765afa6033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/stats.rs:190-201 | src/bin/rhwp-agent/stats.rs:216-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4552dbda37d83fdf289b79302c7e86fb50b944426c3dfb0e3967cfa9072c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/cli/commands/edit/cells.rs:340-349 | src/mcp_serve.rs:2144-2155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:340\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9839431e4617ffc57f7b9860657e44e11408a61c6b95457f760d9ba28abd0499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cli/queries/control_dump/mod.rs:217-228 | src/cli/queries/control_dump/shape.rs:259-270 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/cli/queries/control_dump/mod.rs:217\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":"src/cli/queries/control_dump/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7060a289ae9d5a5357198d7ae8ff715d4cf3f5e00cad6bf4dccbc95075734cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:937-948 | src/diagnostics/hwp5_table_probe.rs:694-705 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_table_probe.rs\u0060 as WHOLE FILES: this scan already matched 33 separate duplicated blocks between them, totalling at least 462 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:937\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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c7ee1d404cc9fce580658f85b26b577cc4571b95eaf065d458c9d2eeb7311a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:830-841 | src/document_core/commands/object_ops/chart.rs:847-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/chart.rs:830\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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae489e55b30c4f4b5e0a6264f20e58b794e4009092a8de375558503c967db2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:902-915 | src/document_core/commands/object_ops/chart.rs:1047-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"49eb0546ff90a29303412d55fb7148fa661164d8c4be9e6fe581af79170fc238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:975-997 | src/document_core/commands/object_ops/chart.rs:1125-1147 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/chart.rs:975\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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c511f6c6535fe58e4f10f1a74773d1c66a951d0facb2b1e427ff29c788acdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:162-173 | src/document_core/commands/text_editing.rs:6383-6394 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/document_core/commands/text_editing.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c033dc65d515b188daac1f1535b57b158a2e04183e897734496bc16440f4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:1753-1764 | src/document_core/commands/object_ops/table.rs:1935-1946 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:1753\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9809af03bf3fbbb353d5856c4cc1eea73a5ce21d523cea13e16681d3c63cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/commands/text_editing.rs:822-833 | src/document_core/commands/text_editing.rs:1048-1059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec7393f731b2236e275779ef723ad1a2e66c35d500d94e0923c625a971074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/document_core/commands/text_editing.rs:6648-6659 | src/document_core/commands/text_editing.rs:6764-6774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6648}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e13c8b8085304a366287faf3a9861481e566657e41b242eef6fd5305f0ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/html_table_import.rs:784-795 | src/document_core/html_table_import.rs:928-939 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/html_table_import.rs:784\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"890e290d58aefdb2a5449000f2ee7a1e6f6af2f6fca90a48514d0e9283140f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/bookmark_query.rs:127-138 | src/document_core/queries/bookmark_query.rs:236-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/bookmark_query.rs:127\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":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a058f42bf7278e83d0b88bb2ca2b5d113b3770014202fd81e7364130e586e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:2050-2061 | src/document_core/queries/cursor_nav.rs:2094-2105 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:2050\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebc189f947fdd2c80bdc2917247d488ae44cdfcedbc765f8401abc70c3bcc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:207-218 | src/document_core/queries/cursor_rect.rs:3148-3159 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2359f4636cd5fcf29eb82ae52daadcd5a3220864c30d28a89197c964d1fcd6b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5694-5705 | src/document_core/queries/cursor_rect.rs:6116-6127 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5694\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284e53914bbedc0cd187bb3c9066b3a35e41043b431558c094b51ebfacb9835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:6242-6253 | src/document_core/queries/cursor_rect.rs:6569-6580 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:6242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96073ed54c2f0cf6ffcbceb53f32a6f2624d30a25ab91e50d0650d1df05f396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/form_action.rs:94-105 | src/document_core/queries/form_action.rs:162-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. 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":"src/document_core/queries/form_action.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"196597039b7ea704092bac1befab93957a99d263595b8f3c76df8a81440412ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/document_core/queries/hyperlink_geometry.rs:104-115 | src/document_core/queries/hyperlink_geometry.rs:228-239 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/hyperlink_geometry.rs:104\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/queries/hyperlink_geometry.rs:225\u0060 calls \u0060is_empty\u0060 and \u0060src/document_core/queries/hyperlink_geometry.rs:103\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c0cf2304385be852438d29dc4b49c3b0695479c0dc7800b5fdec88cfba9890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/document_core/queries/memo_query.rs:1254-1265 | src/document_core/queries/memo_query.rs:1338-1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/queries/memo_query.rs:1335\u0060 calls \u0060is_empty\u0060, \u0060Err\u0060, \u0060invalid_range\u0060 and \u0060src/document_core/queries/memo_query.rs:1253\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ee6874cbcf2b2aba125d8f40a4f698e56cc63ed38883f1f61e464700fb63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/model/paragraph.rs:2252-2263 | src/model/paragraph.rs:2634-2645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8119a56029991fa347fb945bb4580c91243184bf127cb627f95d3c19a5f3bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/paint/device_clip.rs:8-19 | src/paint/device_fill.rs:42-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 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":"src/paint/device_clip.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf8c702382c8921a7effc11be0d5e207b9ed8e660a001cd5d6c55e092e45346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/paint/shaping_glyph.rs:797-808 | src/paint/shaping_glyph.rs:1190-1201 \u2014 both copies are in the same file, so extract the block 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 \u0060src/paint/shaping_glyph.rs:797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0642f0bd50156af8dac52dbd358b1aa080ec1b315937e7cd527f1481d2a112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/control/shape.rs:1022-1033 | src/parser/doc_info.rs:718-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/control/shape.rs:1022\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":"src/parser/control/shape.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f8a41164536d7ae50b3c171c135b2d7fc8e91f5e74df1f8dafe8eb89e4eb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parser/hwp3/mod.rs:1350-1361 | src/parser/hwp3/mod.rs:1825-1835 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwp3/mod.rs:1350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc6a52bb7a144951056f8e7781c2f9478120c8b5ef4029030123feafe07e929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/parser/hwpx/header.rs:1760-1771 | src/parser/hwpx/section.rs:4413-4422 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67597be550b2e10b8a1f4ed287e9b31ae8c82c47ca7ef9c6916a1c3db988667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parser/mod.rs:889-900 | src/parser/mod.rs:1028-1038 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/mod.rs:889\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c84da100e51025db64f33fb18a8e340f6180b580e989aa4f20f0b90015b81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/recognition.rs:659-670 | tools/pdf-ir-poc/src/recognition.rs:410-421 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"5926e30454638975baf2279d783fa41ec40bc4cf22dd83af5cbb655351968379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1913-1924 | tools/pdf-ir-poc/src/structured_lowering.rs:602-612 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f778153f6c993c78a726c48d8ccc0a6b90cfa44cacb34c0b3b7ee5811a0d7a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2063-2074 | tools/pdf-ir-poc/src/structured_lowering.rs:731-741 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:2063\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab60c2e1f0f0195255216900f5d8056436b958c96d685f46bd10d426e0b90a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2338-2349 | tools/pdf-ir-poc/src/structured_lowering.rs:843-854 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:2338\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, \u0060src/parser/pdf/structured_lowering.rs:2351\u0060 calls \u0060borrow\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:856\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ab04694b7c1f69c85fed804b421942a70cff8d74f6c07947c33c91a6e5211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_detection/cell_regions.rs:119-130 | src/parser/pdf/table_detection/cell_regions.rs:208-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection/cell_regions.rs:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/table_detection/cell_regions.rs:118\u0060 calls \u0060push\u0060, \u0060map_err\u0060 and \u0060src/parser/pdf/table_detection/cell_regions.rs:207\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e30f9905fe970b33606d219c59652ba635b7bbc87502e69487e6c44ef7b027b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_topology.rs:133-144 | tools/pdf-ir-poc/src/table_topology.rs:97-108 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_topology.rs:133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/table_topology.rs:132\u0060 calls \u0060map_err\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs:96\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7026598311cb50d2c8e948c312066717ab3abe7abf7989d91d8f7da1747d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/bitmap_raster.rs:162-173 | src/renderer/bitmap_raster/cropped_window.rs:76-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/bitmap_raster.rs:162\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":"src/renderer/bitmap_raster.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8be415e4bc06b724a45f0a751c695fe04737e8517dba24495b823bd5d98fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/composer/pua_surface.inc.rs:556-567 | src/renderer/composer/pua_surface.inc.rs:607-618 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/pua_surface.inc.rs:556\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/pua_surface.inc.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d18f482eba0095f75553ad653120ce7ae0de8498324a97d38da9ea3ed5d9a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/composer/stored_lines_runs.inc.rs:657-668 | src/renderer/composer/stored_lines_runs.inc.rs:684-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_lines_runs.inc.rs:657\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb2ae7f2ff5da465bc2579efde93f48758b757b4d509e0011523a4c2c3eb65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/font_metric_contextual_scripts.rs:690-701 | src/renderer/font_metric_supplementary_pictographs.rs:256-267 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/font_metric_contextual_scripts.rs:690\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_contextual_scripts.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18f9ce79281fb3178f7995fbd952c0db506240dfceb47a16e7a12ffcd928882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/height_measurer.rs:3858-3869 | src/renderer/layout/table_layout.rs:5742-5753 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8e6a55d94652cde8966cf2bcff90477f3f51fd7f1fecbf42e0e8c0691c7ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/height_measurer.rs:4908-4925 | src/renderer/layout/table_layout.rs:5866-5883 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:4908\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4908}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6d3afede14a2e2b3c8f8bac67e9c0d886b4a24f137fc3782a5358c7a1bd024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/html.rs:164-175 | src/renderer/svg.rs:968-979 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/html.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"361cc4cea35dc6e3941ba100f6b6e4ffc8dd4cb451c92b9ea3ca092f4c0084d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout.rs:1928-1939 | src/renderer/layout.rs:2002-2013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/renderer/layout.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"9007dbfb381662fa284df0f5525b944a38f2217735af3c40549b357d28512e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/renderer/layout.rs:12023-12033 | src/renderer/layout.rs:12422-12433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":12023}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8536a4dcd7a7e55e308788382dfc09119a78ffe21145b7cba139412e42747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout.rs:16570-16581 | src/renderer/layout.rs:16582-16593 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:16570\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":"src/renderer/layout.rs"},"region":{"startLine":16570}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d860f4528a6893f658434d4b9458f836f9fc5c619c298007d83ac988796f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:5312-5323 | src/renderer/layout/paragraph_layout.rs:10493-10504 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:5312\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5312}}}],"partialFingerprints":{"codehealthFindingId/v1":"162c56b4a4d1b7aecbae30ab034c7f1dbe6483deac5de61b3e27f7074a53f2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:11820-11831 | src/renderer/layout/paragraph_layout.rs:11864-11875 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:11820\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":11820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9355c50882ac2ff92bd18d7cd87ab3372d487aba36ce2e47795002153425f92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2582-2593 | src/renderer/layout/tac_picture_item.inc.rs:275-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:2582\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, \u0060src/renderer/layout/tac_picture_item.inc.rs:283\u0060 calls \u0060Some\u0060 and \u0060src/renderer/layout/shape_layout.rs:2594\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a03d82183e5aa73e7333b800332a2fb9b6938a8cb8e9e921f4877ae96a79c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/shape_layout.rs:5051-5062 | src/renderer/layout/shape_layout.rs:5268-5279 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:5051\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63f23fde16123f7254aa9084534b747824a5fe1954e0133ea89e3fc7be8a319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:7488-7499 | src/renderer/layout/table_partial.rs:2675-2686 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7488}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1f560ea8aa347e1952e9c5c38e01fe874b986f3acb467eda2b1a2da9582246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:7839-7850 | src/renderer/layout/table_layout.rs:7981-7992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":7839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2229e955288117bd1c98806bd9de7c573886f8b71b786d5a21aa1e01b2d513e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:9042-9053 | src/renderer/layout/table_partial.rs:4262-4278 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:9042\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":9042}}}],"partialFingerprints":{"codehealthFindingId/v1":"04aed7fe2e99d61f45f8ff42b8a75bf51ab419ddf52ca3ad3206348f9d809f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:9225-9237 | src/renderer/layout/table_layout.rs:10358-10369 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:9225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":9225}}}],"partialFingerprints":{"codehealthFindingId/v1":"86239e380d64b6d9e6c5ee635a7d288386a72c45f55621925e3e7303c57c2b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:15435-15446 | src/renderer/layout/table_layout.rs:15461-15472 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:15435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":15435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46942e55cc553fccb5497e773a648ad3dfefee3db771c29f4475cdc07f2766b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:17382-17393 | src/renderer/layout/table_layout.rs:17695-17706 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:17382\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":17382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39aba96526ab8f94911b27df7c48fb3cc8a49479b3b4a6099403b6bb1cd084a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_layout.rs:17442-17453 | src/renderer/layout/table_layout.rs:17831-17842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":17442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0344a7dd2521f95f555420f69c54d866e0f6e90e1545206b618d26bcc68317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/renderer/layout/table_layout.rs:27361-27371 | src/renderer/layout/table_layout.rs:27380-27391 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:27361\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":27361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c049797d938a960ee5b0cfdc639a35b871561b2fe71698c8b26fb538e7ec6027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout/table_partial.rs:6337-6348 | src/renderer/layout/table_partial.rs:6354-6365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":6337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0632dfaf3b62186d9e474cb8176a31feef179a8b0189ee745af2093366e852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/mod.rs:2218-2229 | src/renderer/mod.rs:2351-2362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6282729556d03e8c3210e7e787545d954d240a409b4ac8a3ec99c63abe8671b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/pagination/engine.rs:3074-3085 | src/renderer/pagination/engine.rs:3105-3116 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/pagination/engine.rs:3074\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a9c6f6d5d06e8e101c65d891004d41fec12b0c2672917c3870c54b6d082707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/svg.rs:2197-2209 | src/renderer/web_canvas.rs:1474-1485 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:2197\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":"src/renderer/svg.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc625c902dd70774af7bbc6d2cfa04a9568e9a6f50720adc9ca4921a6cdea179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/typeset.rs:4358-4369 | src/renderer/typeset/table/block/whole_fit.rs:681-692 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e065a986afd642a55787dc1582a53832dd7c6bc00e33a4c58c6b975e94648031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:387-398 | src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs:402-414 \u2014 before extracting anything, compare \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/paragraph/new_note_fit.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"230acb6a25dc3269e782e7973f3415e7dba2f8953dc368519b4edaba13d63e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:729-740 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:761-772 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:729\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:727\u0060 calls \u0060line_advance\u0060 and \u0060src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:760\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"2601dc33f2cad48b3a8821c6a34494dd723a7f0dbb6e9d443fc64c0d6dd6ba5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/renderer/web_canvas.rs:157-168 | src/renderer/web_canvas/cubic_reduction.rs:134-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas.rs:157\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":"src/renderer/web_canvas.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"305f8d92aa3cc978e6c39ca2685b61459818595f3f161c54656fa534b1aabc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/renderer/web_canvas.rs:2836-2847 | src/renderer/web_canvas.rs:3700-3709 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:2836\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e980ce2132ba8ed6053881efefe073615d0750e492413ba7d50a18118922e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/serializer/hwpx/master_page.rs:85-96 | src/serializer/hwpx/section.rs:880-891 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/master_page.rs\u0060 and \u0060src/serializer/hwpx/section.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/master_page.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"033902bda046a20e16f2f114c775bb8d6c0c745aaaa3654289e180b63a572baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/serializer/hwpx/section.rs:4103-4114 | src/serializer/hwpx/section.rs:4132-4143 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:4103\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":4103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a8cb26b928da997e1e6f37dd2e2c0c235fd031e0e51d486a8e221b5f440e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/wasm_api/print_image_sampling.rs:32-43 | src/wasm_api/print_image_sampling.rs:59-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wasm_api/print_image_sampling.rs:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api/print_image_sampling.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e269c3c4bd8a5b8bfdd5d46c69c29ec9d2531e855d850e62dd9d51563c66ddd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/wmf/parser/records/bitmap/set_dib_to_dev.rs:68-79 | src/wmf/parser/records/bitmap/stretch_dib.rs:79-90 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs\u0060 and \u0060src/wmf/parser/records/bitmap/stretch_dib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/set_dib_to_dev.rs:68\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":"src/wmf/parser/records/bitmap/set_dib_to_dev.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"92735155727207693138245f9ed033a9238f48fd213bf0c6d6670f8c2247dadf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 84): src/cli/commands/edit/bookmarks.rs:86-96 | src/cli/commands/edit/bookmarks.rs:200-210 | src/cli/commands/edit/bookmarks.rs:323-333 | src/cli/commands/edit/cell_paragraphs.rs:92-102 | src/cli/commands/edit/cell_paragraphs.rs:252-262 | src/cli/commands/edit/cells.rs:308-318 | src/cli/commands/edit/cells.rs:579-589 | src/cli/commands/edit/cells.rs:748-758 | src/cli/commands/edit/cells.rs:925-935 | src/cli/commands/edit/controls.rs:72-82 | src/cli/commands/edit/document_objects.rs:73-83 | src/cli/commands/edit/document_objects.rs:231-241 | src/cli/commands/edit/document_objects.rs:357-367 | src/cli/commands/edit/document_objects.rs:508-518 | src/cli/commands/edit/document_objects.rs:634-644 | src/cli/commands/edit/document_text.rs:92-102 | src/cli/commands/edit/document_text.rs:288-298 | src/cli/commands/edit/document_text.rs:398-408 | src/cli/commands/edit/document_text.rs:534-544 | src/cli/commands/edit/document_text.rs:690-700 | src/cli/commands/edit/document_text.rs:793-803 | src/cli/commands/edit/document_text.rs:896-906 | src/cli/commands/edit/document_text.rs:992-1002 | src/cli/commands/edit/document_text.rs:1087-1097 | src/cli/commands/edit/equations.rs:83-93 | src/cli/commands/edit/equations.rs:213-223 | src/cli/commands/edit/equations.rs:317-327 | src/cli/commands/edit/formatting.rs:95-105 | src/cli/commands/edit/formatting.rs:233-243 | src/cli/commands/edit/formatting.rs:437-447 | src/cli/commands/edit/formatting.rs:653-663 | src/cli/commands/edit/formatting.rs:788-798 | src/cli/commands/edit/formatting.rs:959-969 | src/cli/commands/edit/header_footer_content.rs:90-100 | src/cli/commands/edit/header_footer_content.rs:210-220 | src/cli/commands/edit/header_footer_content.rs:361-371 | src/cli/commands/edit/header_footer_content.rs:511-521 | src/cli/commands/edit/header_footer_content.rs:687-697 | src/cli/commands/edit/header_footer_content.rs:830-840 | src/cli/commands/edit/header_footer_content.rs:962-972 | src/cli/commands/edit/header_footer_content.rs:1117-1127 | src/cli/commands/edit/header_footer_properties.rs:95-105 | src/cli/commands/edit/header_footer_properties.rs:237-247 | src/cli/commands/edit/header_footer_properties.rs:344-354 | src/cli/commands/edit/header_footer_properties.rs:501-511 | src/cli/commands/edit/media.rs:706-716 | src/cli/commands/edit/media.rs:866-876 | src/cli/commands/edit/media.rs:979-989 | src/cli/commands/edit/note_content.rs:82-92 | src/cli/commands/edit/note_content.rs:192-202 | src/cli/commands/edit/note_content.rs:304-314 | src/cli/commands/edit/note_content.rs:412-422 | src/cli/commands/edit/note_content.rs:527-537 | src/cli/commands/edit/note_content.rs:656-666 | src/cli/commands/edit/notes.rs:71-81 | src/cli/commands/edit/notes.rs:166-176 | src/cli/commands/edit/notes.rs:262-272 | src/cli/commands/edit/page.rs:78-88 | src/cli/commands/edit/page.rs:181-191 | src/cli/commands/edit/page.rs:302-312 | src/cli/commands/edit/page.rs:417-427 | src/cli/commands/edit/shapes.rs:126-136 | src/cli/commands/edit/shapes.rs:244-254 | src/cli/commands/edit/shapes.rs:366-376 | src/cli/commands/edit/shapes.rs:518-528 | src/cli/commands/edit/tables/grid.rs:76-86 | src/cli/commands/edit/tables/grid.rs:184-194 | src/cli/commands/edit/tables/grid.rs:290-300 | src/cli/commands/edit/tables/grid.rs:427-437 | src/cli/commands/edit/tables/grid.rs:539-549 | src/cli/commands/edit/tables/grid.rs:655-665 | src/cli/commands/edit/tables/grid.rs:799-809 | src/cli/commands/edit/tables/insert.rs:130-140 | src/cli/commands/edit/tables/layout.rs:63-73 | src/cli/commands/edit/tables/layout.rs:185-195 | src/cli/commands/edit/tables/layout.rs:309-319 | src/cli/commands/edit/tables/layout.rs:429-439 | src/cli/commands/edit/tables/layout.rs:548-558 | src/cli/commands/edit/tables/layout.rs:663-673 | src/cli/commands/edit/tables/structure.rs:81-91 | src/cli/commands/edit/tables/structure.rs:176-186 | src/cli/commands/edit/tables/structure.rs:271-281 | src/cli/commands/edit/tables/structure.rs:366-376 | src/cli/queries/page_dump.rs:75-85 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"53970e598d98751148389de55c71f7d0cb22fabf5249321992390f6bd1bf2f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 20): src/document_core/commands/clipboard.rs:956-966 | src/document_core/commands/foreign_paste.rs:185-192 | src/document_core/commands/html_import.rs:263-272 | src/document_core/commands/object_ops/equation.rs:408-415 | src/document_core/commands/table_ops.rs:551-558 | src/document_core/commands/table_ops.rs:3474-3481 | src/document_core/commands/table_ops.rs:3796-3803 | src/document_core/commands/text_editing.rs:1486-1493 | src/document_core/commands/text_editing.rs:1684-1691 | src/document_core/commands/text_editing.rs:1712-1719 | src/document_core/commands/text_editing.rs:1937-1944 | src/document_core/commands/text_editing.rs:1965-1972 | src/document_core/commands/text_editing.rs:4034-4041 | src/document_core/commands/text_editing.rs:4107-4114 | src/document_core/commands/text_editing.rs:4509-4518 | src/document_core/commands/text_editing.rs:4571-4579 | src/document_core/commands/text_editing.rs:4695-4703 | src/document_core/commands/text_editing.rs:4906-4913 | src/document_core/commands/text_editing.rs:4935-4942 | src/document_core/queries/field_query.rs:180-187 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:956\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn stamp_caret(\u0026mut\u0060 in one and \u0060\u0026mut\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c5d9ed71c38330b1e576a3fc6f5f4b12259dfc4548260d6980b2f196f5dceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 17): src/cli/commands/edit/bookmarks.rs:196-206 | src/cli/commands/edit/cell_paragraphs.rs:88-98 | src/cli/commands/edit/cells.rs:575-585 | src/cli/commands/edit/cells.rs:744-754 | src/cli/commands/edit/controls.rs:68-78 | src/cli/commands/edit/equations.rs:313-323 | src/cli/commands/edit/formatting.rs:784-794 | src/cli/commands/edit/media.rs:862-872 | src/cli/commands/edit/notes.rs:258-268 | src/cli/commands/edit/shapes.rs:240-250 | src/cli/commands/edit/shapes.rs:514-524 | src/cli/commands/edit/tables/grid.rs:651-661 | src/cli/commands/edit/tables/grid.rs:795-805 | src/cli/commands/edit/tables/layout.rs:181-191 | src/cli/commands/edit/tables/layout.rs:425-435 | src/cli/commands/edit/tables/layout.rs:659-669 | src/cli/queries/structured_objects.rs:59-69 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:196\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290938a40fa1a8aedefd7d6d8d7f2b20003b80941437ab44d74c0e72648a0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 11): src/bin/rhwp-agent/envlint.rs:10-20 | src/bin/rhwp-agent/envlint.rs:66-76 | src/bin/rhwp-agent/explorecmd.rs:16-26 | src/bin/rhwp-agent/files.rs:10-20 | src/bin/rhwp-agent/files.rs:55-65 | src/bin/rhwp-agent/inspect.rs:85-95 | src/bin/rhwp-agent/planlint.rs:10-20 | src/bin/rhwp-agent/safety.rs:13-23 | src/bin/rhwp-agent/safety.rs:52-62 | src/bin/rhwp-agent/safety.rs:673-683 | src/bin/rhwp-agent/stats.rs:157-167 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/inspect.rs\u0060 and \u0060src/bin/rhwp-agent/safety.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/bin/rhwp-agent/explorecmd.rs:27\u0060 calls \u0060detect_format\u0060 and \u0060src/bin/rhwp-agent/safety.rs:63\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envlint.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57d3795cb071e94e21fac04f1ca8c3af90e1fc5dc954c52845c854e3c8befa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 10): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:77-87 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:66-76 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:76-86 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:80-90 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:67-77 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:66-76 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:66-76 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:74-84 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:78-88 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:67-77 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d877e2e7be26bb75d47ed5b016fd23dacfcfd65f6e79ff0b31082223ce9f4ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): src/cli/protocol/capsule/signing.rs:85-95 | src/cli/protocol/exchange/bundle.rs:28-38 | src/cli/protocol/exchange/disclosure.rs:18-28 | src/cli/protocol/exchange/disclosure.rs:118-128 | src/cli/protocol/exchange/disclosure.rs:221-231 | src/cli/protocol/harness.rs:13-23 | src/cli/protocol/trust/anchor.rs:16-26 | src/cli/protocol/trust/anchor.rs:170-180 | src/cli/protocol/trust/governance.rs:596-606 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/exchange/bundle.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ad71b9cacc9d25209fe02d2248f6f4d4933d6b93ec72ad4503cceec7fa9b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): src/bin/rhwp-q/kit/caret_stops.rs:15-25 | src/bin/rhwp-q/kit/char_index.rs:17-27 | src/bin/rhwp-q/kit/cur_field_state.rs:17-27 | src/bin/rhwp-q/kit/field_info_at.rs:17-27 | src/bin/rhwp-q/kit/line_starts.rs:16-26 | src/bin/rhwp-q/kit/para_bounds.rs:16-26 | src/bin/rhwp-q/kit/word_end.rs:17-27 | src/bin/rhwp-q/kit/word_starts.rs:15-25 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d95ad4ff0617043ef76812488fd0e98cda51282440c47e5335daf40094d1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 8): src/wmf/parser/records/bitmap/dib_stretch_blt.rs:149-154 | src/wmf/parser/records/bitmap/stretch_blt.rs:146-151 | src/wmf/parser/records/bitmap/stretch_dib.rs:99-109 | src/wmf/parser/records/drawing/arc.rs:80-90 | src/wmf/parser/records/drawing/chord.rs:83-93 | src/wmf/parser/records/drawing/pat_blt.rs:62-67 | src/wmf/parser/records/drawing/pie.rs:82-92 | src/wmf/parser/records/drawing/round_rect.rs:68-78 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/stretch_blt.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs:149\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/dib_stretch_blt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dc7cb77e890ce32137b341edf65517bfc85cb4ff29e28f722284007942eacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): src/bin/rhwp-q/kit/caret_stops.rs:27-37 | src/bin/rhwp-q/kit/char_index.rs:29-39 | src/bin/rhwp-q/kit/cur_field_state.rs:29-39 | src/bin/rhwp-q/kit/line_starts.rs:28-38 | src/bin/rhwp-q/kit/para_bounds.rs:28-38 | src/bin/rhwp-q/kit/word_end.rs:29-39 | src/bin/rhwp-q/kit/word_starts.rs:27-37 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:27\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d23c66c65eea5446b9bb152dea5090ab90008ad924ae2ec04aa197acae2cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 7): src/cli/commands/edit/cells.rs:423-433 | src/cli/commands/edit/document_text.rs:166-175 | src/cli/commands/edit/fields.rs:323-333 | src/cli/commands/edit/media.rs:427-437 | src/cli/commands/edit/privacy.rs:271-280 | src/cli/commands/edit/text.rs:201-211 | src/cli/commands/tabular_import.rs:396-406 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:423\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e3921928d365677c2bafe2a5badf654ea1bdf4a7d001ea0be53dbf8c850927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/bin/rhwp-q/kit/cursor_in_footnote.rs:81-91 | src/bin/rhwp-q/kit/flow_images.rs:60-70 | src/bin/rhwp-q/kit/footnote_hit.rs:71-81 | src/bin/rhwp-q/kit/footnote_info.rs:67-77 | src/bin/rhwp-q/kit/hit_header.rs:71-81 | src/bin/rhwp-q/kit/overlay_images.rs:64-74 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:94\u0060 calls \u0060require\u0060 and \u0060src/bin/rhwp-q/kit/footnote_hit.rs:84\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_footnote.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5500b4e08c42775cb5000e5aa36a104bf80d4afb9cd15d512287083f6564bc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/cli/commands/edit/document_text.rs:344-354 | src/cli/commands/edit/document_text.rs:480-490 | src/cli/commands/edit/document_text.rs:1031-1041 | src/cli/commands/edit/notes.rs:15-25 | src/cli/commands/edit/notes.rs:110-120 | src/cli/commands/edit/shapes.rs:21-31 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/notes.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 250 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/shapes.rs:18\u0060 calls \u0060to_string\u0060 and \u0060src/cli/commands/edit/document_text.rs:343\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f706d154dafe59618d3976a3714a96c1fbc4c9c10e2e93ce13c0138f6fdd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:441-451 | src/diagnostics/hwp5_cell_header_probe.rs:705-715 | src/diagnostics/hwp5_contract_probe.rs:613-623 | src/diagnostics/hwp5_first_para_control_probe.rs:1305-1315 | src/diagnostics/hwp5_mel_personnel_probe.rs:619-629 | src/diagnostics/hwp5_table_probe.rs:364-374 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"242aaadd83f3ca1d290ed71e25b5c357fdb16255cd77308a39f64c87b015e44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:464-474 | src/diagnostics/hwp5_cell_header_probe.rs:736-746 | src/diagnostics/hwp5_contract_probe.rs:654-664 | src/diagnostics/hwp5_first_para_control_probe.rs:1336-1346 | src/diagnostics/hwp5_mel_personnel_probe.rs:650-660 | src/diagnostics/hwp5_table_probe.rs:395-405 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed0d125c7ac52ea4808e132033979699561c1b762e456f7b7ac3f395da20adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/diagnostics/hwp5_cell_header_probe.rs:178-188 | src/diagnostics/hwp5_contract_analyze.rs:103-113 | src/diagnostics/hwp5_contract_probe.rs:126-136 | src/diagnostics/hwp5_first_para_control_probe.rs:136-146 | src/diagnostics/hwp5_mel_personnel_probe.rs:124-134 | src/diagnostics/hwp5_table_probe.rs:130-140 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_analyze.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96615b264b861e75c08e26aec6f0d4442193cbae675bd3987d916b94c7f0827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 7): src/document_core/queries/grep.rs:150-160 | src/document_core/queries/grep.rs:185-188 | src/document_core/queries/hidden_text.rs:502-512 | src/document_core/queries/hidden_text.rs:535-545 | src/document_core/queries/hwpctrl_sets.rs:1577-1587 | src/document_core/queries/injection_scan.rs:1221-1231 | src/document_core/queries/rendering.rs:7036-7046 \u2014 before extracting anything, compare \u0060src/document_core/queries/grep.rs\u0060 and \u0060src/document_core/queries/injection_scan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/grep.rs:150\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/queries/grep.rs:148\u0060 calls \u0060iter\u0060, \u0060enumerate\u0060 and \u0060src/document_core/queries/grep.rs:185\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c659899612d9b1dc93a2c7932a52902f0e6d54247be8d96c01f79516bf34d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): src/wmf/parser/objects/graphics/font.rs:121-131 | src/wmf/parser/objects/structure/bitmap16.rs:77-87 | src/wmf/parser/records/drawing/arc.rs:69-79 | src/wmf/parser/records/drawing/chord.rs:72-82 | src/wmf/parser/records/drawing/pie.rs:71-81 | src/wmf/parser/records/drawing/round_rect.rs:59-69 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/drawing/arc.rs\u0060 and \u0060src/wmf/parser/records/drawing/chord.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/font.rs:121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/font.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee21a6f11ede0bef2ad7c8edce9b68a06f6de323dc3856b5f9349e67125e868a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/bin/rhwp-q/kit/caret_stops.rs:12-22 | src/bin/rhwp-q/kit/footnote_info.rs:54-64 | src/bin/rhwp-q/kit/line_starts.rs:13-23 | src/bin/rhwp-q/kit/para_bounds.rs:13-23 | src/bin/rhwp-q/kit/word_starts.rs:12-22 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/line_starts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e57a8bb2dc2b3b991eab586bdd8f4f1556a4c9b8b476474d3ce6e85a5a09ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/cli/commands/edit/document_text.rs:234-244 | src/cli/commands/edit/document_text.rs:838-848 | src/cli/commands/edit/document_text.rs:934-944 | src/cli/commands/edit/formatting.rs:158-168 | src/cli/commands/edit/page.rs:353-363 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"24812229300f46a319525110e31dcaca19da1275bc2426e826231b5aed691a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/renderer/pagination/engine.rs:1154-1164 | src/renderer/typeset/controls/host_wrap.rs:17-27 | src/renderer/typeset/controls/host_wrap.rs:92-102 | src/renderer/typeset/controls/wrap_match.rs:56-66 | src/renderer/typeset/controls/wrap_match.rs:163-173 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/controls/host_wrap.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"64090b01cc90750ab59f6f53b2e2458bec0317847fcfa3ce9cea07fb0b91c647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/bin/rhwp-q/kit/char_index.rs:41-51 | src/bin/rhwp-q/kit/cur_field_state.rs:41-51 | src/bin/rhwp-q/kit/field_info_at.rs:41-51 | src/bin/rhwp-q/kit/word_end.rs:41-51 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 and \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/char_index.rs:41\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"05645db6ab1b8c07b5daf8c28707ff7daeb62383411b289cb3c2f83522b6ce5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/bin/rhwp-q/kit/cursor_in_cell.rs:90-100 | src/bin/rhwp-q/kit/cursor_in_hf.rs:106-116 | src/bin/rhwp-q/kit/cursor_in_note.rs:85-95 | src/bin/rhwp-q/kit/note_edit_info.rs:72-82 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_hf.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/bin/rhwp-q/kit/cursor_in_hf.rs:105\u0060 calls \u0060Some\u0060, \u0060take_u32\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:89\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"81daf72f864e29bf7e0fcbea794d563ccc0c18a21b42666a1242cc8376b7f7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/bin/rhwp-q/pack/inventory.rs:85-95 | src/bin/rhwp-q/pack/inventory.rs:550-560 | src/bin/rhwp-q/pack/inventory.rs:991-1001 | src/bin/rhwp-q/pack/inventory.rs:1068-1078 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/pack/inventory.rs:85\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f618a33c9b177214b836df18a9f20ffb7f299f3ad56baf4a0e144e7ea785345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/bin/rhwp-q/pack/inventory.rs:731-741 | src/bin/rhwp-q/pack/inventory.rs:758-768 | src/bin/rhwp-q/pack/inventory.rs:1120-1130 | src/bin/rhwp-q/pack/inventory.rs:1271-1281 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/pack/inventory.rs:731\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c67bff73543676a7cbd6ee123eb9979f0bd6d89fb3fd4a395fec9b7347cf9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/cli/protocol/exchange/bundle.rs:225-235 | src/cli/protocol/harness.rs:337-347 | src/cli/protocol/trust/gate.rs:41-51 | src/cli/protocol/trust/governance.rs:201-211 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/bundle.rs\u0060 and \u0060src/cli/protocol/harness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/bundle.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a355df22439a3161f97b092a5dfea68e04000043645f2d093a4714ebd3a550f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/diagnostics/ir_field_sweep.rs:734-744 | src/diagnostics/ir_field_sweep.rs:746-756 | src/diagnostics/ir_field_sweep.rs:758-768 | src/diagnostics/ir_field_sweep.rs:770-780 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2239ec343dd943d27f2efc63877857654152eeb3c2f8f6c3cb3d8af64f5410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/document_core/commands/clipboard.rs:1022-1033 | src/document_core/commands/foreign_paste.rs:241-251 | src/document_core/commands/html_import.rs:374-388 | src/document_core/commands/html_import.rs:428-439 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1022\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e08d9ffe6f9ca4b31be98aaf3c8234b6f5c283ac62b3d35dd5930b1285378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 5): src/document_core/commands/object_ops/table.rs:1186-1193 | src/document_core/commands/text_editing.rs:1510-1519 | src/document_core/commands/text_editing.rs:1553-1563 | src/document_core/commands/text_editing.rs:1737-1747 | src/document_core/commands/text_editing.rs:1987-1996 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/document_core/commands/text_editing.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:1186\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ec8525a4f5f8b678daa2cca5dd22963e6495609b8c9da600b37d0b559fe717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/document_core/queries/rendering.rs:4569-4579 | src/document_core/queries/rendering.rs:4592-4602 | src/document_core/queries/rendering.rs:4613-4623 | src/document_core/queries/rendering.rs:4633-4643 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/rendering.rs:4569\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, \u0060src/document_core/queries/rendering.rs:4644\u0060 calls \u0060Some\u0060 and \u0060src/document_core/queries/rendering.rs:4580\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":4569}}}],"partialFingerprints":{"codehealthFindingId/v1":"73255683bf9b4b6dd70def007a3279c97974cfdb32d7fd02e1369894aea0b288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): src/parser/hwpx/section.rs:2844-2854 | src/parser/hwpx/section.rs:2908-2918 | src/parser/hwpx/section.rs:6706-6715 | src/parser/hwpx/section.rs:6818-6827 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:2844\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":"src/parser/hwpx/section.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2cfa3691a9b8346a18e254c8a5b9c8af7f14e11e685836e642b467d55f270e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/renderer/composer/line_breaking.rs:706-716 | src/renderer/composer/line_breaking.rs:735-746 | src/renderer/composer/line_breaking.rs:1004-1015 | src/renderer/composer/line_breaking.rs:1145-1156 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/line_breaking.rs:706\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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"8869ce9a98d2bdaf5baa4f94b69c6b4141db9d17e92979ebeb898e370ea9e22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/renderer/height_measurer.rs:4146-4156 | src/renderer/height_measurer.rs:5162-5172 | src/renderer/height_measurer.rs:5858-5868 | src/renderer/layout/table_layout.rs:6367-6377 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":4146}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f2669b1b9ed23f29ca2149c39b919c0575f288fc512fae3567cc452512a043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/renderer/layout/paragraph_layout.rs:9724-9734 | src/renderer/layout/paragraph_layout.rs:9821-9831 | src/renderer/layout/paragraph_layout.rs:10010-10020 | src/renderer/layout/paragraph_layout.rs:10580-10590 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:9724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71838ae3d1e7878790d2596077c712bdbc754f3caf883645133c26a0fb8c4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:572-582 | src/bin/rhwp-q/more/inventory.rs:599-609 | src/bin/rhwp-q/more/inventory.rs:626-636 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:572\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb902821b14244ea1997b51bb31963779b570336c50b0d13ca80e144fb03659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cli/outputs/raster.rs:300-310 | src/cli/outputs/text.rs:558-568 | src/cli/outputs/vector.rs:341-352 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/text.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/raster.rs:300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa49607d9a4ff4090ffd3245b52456fbb176a0bb4db717a9e3496654abda58c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cli/protocol/trust/gate.rs:29-39 | src/cli/protocol/trust/governance.rs:185-195 | src/cli/protocol/trust/governance.rs:580-590 \u2014 before extracting anything, compare \u0060src/cli/protocol/trust/gate.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/trust/gate.rs:29\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/gate.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9cb9fd5c650e9a9e8423113e4bf97860548a928b7bf2465a34bab77d3fe0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/document_core/commands/header_footer_ops.rs:610-620 | src/document_core/commands/header_footer_ops.rs:711-721 | src/document_core/queries/cursor_rect.rs:5569-5579 \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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"50251e577eace13a4cfab72a58b95a0c8890742237c09d167782698bb50c82fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/document_core/commands/text_editing.rs:4258-4268 | src/document_core/commands/text_editing.rs:4360-4370 | src/document_core/commands/text_editing.rs:5134-5144 \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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4258}}}],"partialFingerprints":{"codehealthFindingId/v1":"487faf6b3364650a1e03f875f7847cc4b44be4341008278ac4f679601d1d3739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/document_core/helpers.rs:523-533 | src/document_core/helpers.rs:544-554 | src/document_core/helpers.rs:565-575 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/helpers.rs:523\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":"src/document_core/helpers.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d481d5d68d581172666c31f0baf043c76f49dac2e87d5fa6766f2883f7c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:5693-5703 | src/document_core/queries/cursor_rect.rs:6115-6125 | src/document_core/queries/cursor_rect.rs:6227-6237 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:5693\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5693}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa34ab884ffb9ea42d22589c6460baba954e7fe0adcc6e0f207f04d167fa06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/native_host/gpu_d3d.rs:616-626 | src/native_host/gpu_gl.rs:668-678 | src/native_host/gpu_metal.rs:407-417 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:616\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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e9ef32973bdc9d249db677253214e1d24bbd7dc9b0d8c525b621ee2aefbe6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/paint/json.rs:2779-2789 | src/paint/json.rs:2805-2815 | src/paint/json.rs:2834-2844 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/json.rs:2779\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 \u0060gradient_path\u0060 to \u0060\u0026crate::paint::ColorPaintLinearGradientPathNode\u0060 in one and \u0060\u0026crate::paint::ColorPaintRadialGradientPathNode\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":"src/paint/json.rs"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd3deb9198da022e331bbbe1927f9e1db773c6224cf8b0a64d3abdbc7a0239b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/renderer/layout/paragraph_layout.rs:4176-4186 | src/renderer/layout/paragraph_layout.rs:4347-4357 | src/renderer/layout/paragraph_layout.rs:4445-4455 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:4176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/paragraph_layout.rs:4442\u0060 calls \u0060with_stored_tabs\u0060 and \u0060src/renderer/layout/paragraph_layout.rs:4342\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":4176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e137aa0bb8d4d15d960dcf94ea2472a2aad57b5061a0a53df7668eeaa098d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/renderer/layout/paragraph_layout.rs:10792-10802 | src/renderer/layout/paragraph_layout.rs:10973-10983 | src/renderer/layout/paragraph_layout.rs:11019-11029 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:10792\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":10792}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63e578e9f2431dbaee54aa5591467e3da488460c149a997e318dfda38227c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): src/renderer/pagination/engine.rs:1131-1141 | src/renderer/pagination/engine.rs:1172-1181 | src/renderer/typeset/section/post_flow.rs:425-435 \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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c870047441ee20d299c3176b344e33ce7adad3c89a68f87785c850eb5aaa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/renderer/skia/glyph_replay.rs:757-767 | src/renderer/skia/glyph_replay.rs:788-798 | src/renderer/skia/glyph_replay.rs:823-833 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/glyph_replay.rs:757\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c6efc6c1af983409b8fac121dedf056f57404171a956ec7210478922493c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/wmf/parser/objects/structure/log_color_space.rs:62-72 | src/wmf/parser/objects/structure/log_color_space_w.rs:62-72 | src/wmf/parser/records/bitmap/set_dib_to_dev.rs:70-80 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/log_color_space.rs:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/log_color_space.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f2e3996926435419d5e58ba68d5d1a7de3b9242d21309a56a2523117af354f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): bindings/Native/src/lib.rs:214-224 | bindings/Native/src/lib.rs:244-246 | bindings/Native/src/lib.rs:269-279 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/Native/src/lib.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060bindings/Native/src/lib.rs:213\u0060 calls \u0060from_bytes\u0060, \u0060map_err\u0060, \u0060page_count\u0060 and \u0060bindings/Native/src/lib.rs:244\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":"bindings/Native/src/lib.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0e514c4e5651f61f0a8ae379cadda348f8a5bebfc9ca01a774cfea3e2337b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): bindings/Native/src/lib.rs:499-509 | src/renderer/render_tree.rs:449-458 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/Native/src/lib.rs:499\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/render_tree.rs:459\u0060 calls \u0060push\u0060 and \u0060bindings/Native/src/lib.rs:509\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":"bindings/Native/src/lib.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be66134b7f3dd71fcfd19cda51a3cba179d2738108d24f1947235fe11ba4433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rhwp-contracts/src/ir_schema.rs:67-78 | src/capabilities_schema.rs:69-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-contracts/src/ir_schema.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f90ea513b8b512706b7c92aa3a11538a8420acdafa5aa9801744547fad6ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-agent/explorecmd.rs:64-74 | src/cli/queries/explore.rs:91-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/explorecmd.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/explorecmd.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"51423e9a9c382534c91fb554aafd6bc3a1684767849e56a3374f6b8f43a3f7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-agent/lookups.rs:257-267 | src/bin/rhwp-agent/lookups.rs:451-461 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/lookups.rs:257\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"61722221fd19ec650e6683e356f7f016a574eef44aebc2ffaa8245b3ff8d3556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:198-208 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:198-207 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-text-layout.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:198\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":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee16ef786a183aafe57396d1f99717ce401e3a88872d2187b06bb6089eab165f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/kit/covering_pages.rs:24-34 | src/bin/rhwp-q/kit/form_value.rs:30-40 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/covering_pages.rs:24\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/covering_pages.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5889b7a459403820e3e4f0683be5285effee50c3c850ccb67702ba1af5a317a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/kit/cursor_in_footnote.rs:32-42 | src/bin/rhwp-q/kit/footnote_info.rs:26-36 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 and \u0060src/bin/rhwp-q/kit/footnote_info.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:32\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_footnote.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10f9fb0ae53bd62c29c7bbcdb24e65f928717290513648c9454fd1d33c9d9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:14-28 | src/bin/rhwp-q/pack/inventory.rs:15-29 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5af1f0f78270de056e9b71e19be34dafc354fadb4a47fe26039eeb6f96612e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:31-41 | src/bin/rhwp-q/pack/inventory.rs:61-71 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafafbfae4bc20215137b4a8591e4a81a2f28adfc614af7fa346a804fa51e54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:518-528 | src/bin/rhwp-q/more/inventory.rs:545-555 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-q/more/inventory.rs:518\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea693eaf0828a535efc2641c569955417a6dee931e0826bf9b25bf40583e1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:523-533 | src/bin/rhwp-q/pack/inventory.rs:964-974 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-q/pack/inventory.rs:523\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"075bec01cd94b70bdbf70ff5ee0143d4244c1216f12b843ee742301bc4db0e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:602-612 | src/bin/rhwp-q/pack/inventory.rs:1219-1229 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-q/pack/inventory.rs:602\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb9e4a7f5bc9f3c88f0f21b11bab7dc28efd181e03431be5b058e8d54d4b1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cli/batch/mod.rs:406-416 | src/cli/commands/batch_fill.rs:222-231 \u2014 before extracting anything, compare \u0060src/cli/batch/mod.rs\u0060 and \u0060src/cli/commands/batch_fill.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/batch/mod.rs:406\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":"src/cli/batch/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac9eb223ba679e31be32a36894079f3c2ba12c9355c2d3841e101032e3eebbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cli/commands/edit/document_text.rs:19-29 | src/cli/commands/edit/note_content.rs:236-245 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/note_content.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 232 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b354e8ff24d0b0f2bb5521785310361243e716885cfc282d27f4bcb7420ea45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/commands/edit/tables/grid.rs:10-20 | src/cli/commands/edit/tables/grid.rs:118-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e674349d04ea94e40550e7e58b7675e018fec41d3b06ca0d31417e33913e8e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/commands/generation.rs:154-164 | src/cli/commands/generation.rs:291-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/generation.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/generation.rs:289\u0060 calls \u0060build_scaffold\u0060 and \u0060src/cli/commands/generation.rs:152\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/generation.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aa7736d4622b071d6d30c23e9d5b2fc5f92d6bb34723c7171169fc25305937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/outputs/doclang.rs:16-26 | src/cli/outputs/text.rs:427-437 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/cli/outputs/doclang.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/doclang.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3ad89988b6ebb5d62fddff2c88b0d6c368620e0c4e354a0652b45d3c47a6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/cli/outputs/pdf.rs:137-146 | src/cli/outputs/pdf.rs:154-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/pdf.rs:137\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"736f5904d7404eb15f945ccd05868d318c43975216be730c6b6e2ab20a95736b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/outputs/tabular.rs:120-130 | src/cli/outputs/tabular.rs:330-340 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e02abc92534e2361a87ef5af5a46a4fcc9b2b35590fdb2a5ce624ed2584259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/outputs/vector.rs:65-75 | src/cli/outputs/vector.rs:562-572 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/vector.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/vector.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0424c8203759a608501f0b70ca5929a0d095a1c41299dd6e18f92f8d42989bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/outputs/vector.rs:637-647 | src/cli/queries/explain.rs:167-178 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/vector.rs:637\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/vector.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dcab27d6c076d171a633bf5acbc7477d24ecf45f29137af2c704d524546089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/protocol/exchange/settlement.rs:103-113 | src/cli/protocol/trust/governance.rs:396-406 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/settlement.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/settlement.rs:103\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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fbfb01c8cea781aabc74834d2fa3f124c2a142ccbddac4eb99cbb8e7716c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/diagnostics/hwp5_anchor_trace.rs:89-99 | src/diagnostics/hwp5_first_para_control_probe.rs:141-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_anchor_trace.rs:89\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8111d2c3ce13672c193e93dca0566c678c0e2d369e728540a2786bc19b0756f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/diagnostics/hwp5_inventory.rs:166-176 | src/diagnostics/hwp5_inventory_diff.rs:313-323 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_inventory.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb45f21b1a63f1570c91d2480e46737469654c9f6f91102e9b1f60614965ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:822-832 | src/diagnostics/layout_anomaly.rs:1042-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e31cf2e6f4ed916338630881e29cb870e85add74ceb4628e7b053e6f0761de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:1810-1821 | src/diagnostics/render_geom_diff.rs:758-769 \u2014 before extracting anything, compare \u0060src/diagnostics/layout_anomaly.rs\u0060 and \u0060src/diagnostics/render_geom_diff.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/layout_anomaly.rs:1810\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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27f461100d96c9aeab81c998d94453b244e6d5028828e796e40becef55281f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/builders/exam_paper.rs:272-282 | src/document_core/builders/exam_paper.rs:301-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/builders/exam_paper.rs:272\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/builders/exam_paper.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d92577d98049f061c909d629fda9fe9167853c053d940261d1ac7d4152e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/border_paint_edit.rs:202-212 | src/document_core/commands/border_paint_edit.rs:279-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/border_paint_edit.rs:202\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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5f0f3661afa0ff49928fd93d0889afc8952e615a9381ccc874872d5b2e218e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/clipboard.rs:880-890 | src/document_core/commands/html_import.rs:164-174 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/html_import.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 191 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 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca97a8187386e7e0b972076fae64f63a151ae7febbd7ee2e7a2e44b47fbc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/document.rs:935-945 | src/document_core/commands/document.rs:2475-2485 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/document.rs:935\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":"src/document_core/commands/document.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954e2d0fc35d723375cf8b18a5d4ba36ad875071b9ffe611f44e9ab9d6139ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/document_core/commands/formatting.rs:1497-1507 | src/document_core/commands/formatting.rs:1579-1587 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc6b0de3599a55e89ec9838e82b4733e7848260ef6fa22453cd754ec9e3e3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/formatting.rs:1589-1599 | src/document_core/commands/formatting.rs:1652-1662 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:1589\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e6c04b4d3b549097678051ec2745362e9d082cbc80330b943139be6f0dd94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/formatting.rs:2470-2480 | src/document_core/commands/formatting.rs:2529-2539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"854efe33b7b08a50721c62436e2d6dd445603d2bb8ed130ad5d3de6423b6e120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/header_footer_ops.rs:182-192 | src/document_core/commands/header_footer_ops.rs:905-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caddfd69bb288bf160b95adc418c9d61767942a99a052cc43cee894e6c3c6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): src/document_core/commands/header_footer_ops.rs:420-430 | src/document_core/commands/header_footer_ops.rs:502-512 | src/document_core/commands/header_footer_ops.rs:1135-1138 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/header_footer_ops.rs:1135\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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed2246aebb864aa327996211cfe4380a3c9d1aff24502eb0a9bb0eb7086f650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/html_import.rs:1052-1062 | src/document_core/html_table_import.rs:953-963 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/html_import.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"7898f292db958ef9638f31251f74b904a432a3dab275a941f7a3173bde6098d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/object_ops/equation.rs:369-379 | src/document_core/commands/object_ops/equation.rs:381-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":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c9c37344149c8784a6e967723413c84ad8cee7d4107bffc1c7da1dbd8a491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:64-74 | src/document_core/queries/cursor_rect.rs:4356-4366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:64\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7a76de6f38da0b5f2b74579f6c59e9f014b1bc4cddd9c00e6223784343790e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:669-679 | src/document_core/commands/object_ops/table.rs:1060-1070 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:669\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa0849dd5336264800198d26686adfd49dba3da8b164fae9c1668037efeadf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:1416-1426 | src/document_core/queries/cursor_nav.rs:1498-1508 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:1416\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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"05187d0c2abf5b4c5900b7153fa1de01882e67be7114f1b2428822730c8a12d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5435-5449 | src/document_core/queries/cursor_rect.rs:5970-5980 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5435\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060run\u0060 to \u0060\u0026HfRunInfo\u0060 in one and \u0060\u0026FnRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5435}}}],"partialFingerprints":{"codehealthFindingId/v1":"010135d64942b085707bc49644f0da33977c0bb00b46128d030be784fdfccc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5815-5825 | src/document_core/queries/cursor_rect.rs:6465-6475 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5815\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9a33238baf1f84ec2878bd68c70fedc8fcd002052aed653f76b7dab4e8592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/document_core/queries/field_query.rs:252-262 | src/document_core/queries/field_query.rs:312-321 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/field_query.rs:252\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":"src/document_core/queries/field_query.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3204ec591669c8a7ae19cef5a705b44b1143eb9969e8e0026db70c53a22a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:638-648 | src/document_core/queries/hwpctrl_sets.rs:984-994 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/hwpctrl_sets.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0974ed07e78ea69d4eef8ec2eb9817179e7d5125ed86ca24c43f866db2af754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/hyperlink_geometry.rs:93-103 | src/document_core/queries/hyperlink_geometry.rs:214-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/hyperlink_geometry.rs:93\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, \u0060src/document_core/queries/hyperlink_geometry.rs:225\u0060 calls \u0060is_empty\u0060 and \u0060src/document_core/queries/hyperlink_geometry.rs:104\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c98236f01a5f44df724779e21674531ebee6fffa1ae52085ddd912f1768a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/document_core/queries/rendering.rs:4207-4217 | src/document_core/queries/rendering.rs:4388-4397 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:4207\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":4207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23e5665aa08a04ed81530d18ef182743c843ec44107593167beb037fa08821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/transformed_text.rs:9-19 | src/emf/emfplus/player.rs:310-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/transformed_text.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f82f10468e7b930cbc17b129995a60a657ffb8039f2826ebff276ffa36ac42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main.rs:872-882 | src/main.rs:983-993 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/main.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7789b3876289c85f263b163b77162dd2a99cc707a3da07c4e8696ad921e6ce54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/model/border_paint.rs:325-335 | src/model/border_paint.rs:564-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8057bc9f993b6a8ee0fc148a5c8ac80db2b4f21f54a01bf2347dd43cb1440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/model/document.rs:794-803 | src/wasm_api.rs:4576-4586 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/document.rs:794\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":"src/model/document.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb2ccd3e4ad8af626881cbe51258e4ca6243c3d9cc9208b07009f31896c8b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/model/table.rs:2305-2315 | src/model/table.rs:2325-2335 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/table.rs:2305\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":"src/model/table.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e7899a3ce411583a2327f6b1818a63d2285854255ea10911b25d0fb3a3a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/paint/builder.rs:768-778 | src/paint/text_shadow.rs:80-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":"src/paint/builder.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"40582c20dd7a685a970281db8824ada9951359aea343fc684726d456d57d9f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/paint/device_clip.rs:24-34 | src/paint/device_fill.rs:63-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/paint/device_clip.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/device_clip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407602c2ddd3e4d12ee176b0bde5a983c327459de139e510d2f18d6712a8e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/paint/json.rs:2572-2582 | src/paint/json.rs:2710-2722 \u2014 both copies are in the same file, so extract the block 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 \u0060src/paint/json.rs:2710\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":"src/paint/json.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd4362df1ed9aeea2e1939199a98273a3623866e4cc1af47c14c631297892e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/paint/shaped_measurement.rs:311-321 | src/paint/shaped_measurement.rs:373-383 \u2014 both copies are in the same file, so extract the block 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 \u0060src/paint/shaped_measurement.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaped_measurement.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fcbe8045d7dc4792e6ff13f822bf5856fdf3839fee54311da1ee36cd6cab8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/paint/shaping_glyph.rs:620-630 | src/paint/shaping_glyph.rs:636-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/shaping_glyph.rs:620\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c4e73c99cb80f7712e3ea8639a7acfba15b24a214b2d346a900aba51cbc90c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/cfb_reader.rs:65-75 | src/parser/cfb_reader.rs:91-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/cfb_reader.rs:102\u0060 calls \u0060by_ref\u0060, \u0060take\u0060, \u0060saturating_add\u0060 and \u0060src/parser/cfb_reader.rs:76\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a35c46ce4393ed9265606a4f50671aa989ef3a69a6176da1a2221ac2f5085a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/parser/control.rs:198-208 | src/parser/control/shape.rs:135-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/control.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40c159e159f30387913a0d68ad60b2ffc7d1eb3b5ae28f4dc32d477faf97e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): src/parser/control/shape.rs:182-201 | src/parser/control/shape.rs:792-807 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/control/shape.rs:182\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":"src/parser/control/shape.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"629e8af9e8bf07e569c79a4f235c70447ed8b670b9838feda7cf102d98495c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/hwpx/section.rs:7506-7516 | src/parser/hwpx/section.rs:7629-7639 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:7506\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":7506}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ec4f2f661b8b2d4750b0ca0af073fd019b56beec68210a160b8505a1ee3f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1882-1896 | tools/pdf-ir-poc/src/structured_lowering.rs:578-592 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/pdf/structured_lowering.rs:1898\u0060 calls \u0060bytes\u0060, \u0060map_err\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:593\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6c7d76fb973536e7e0f038b148497d58bfe06f0f274cb875672bb261740979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1962-1972 | tools/pdf-ir-poc/src/structured_lowering.rs:637-647 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/pdf/structured_lowering.rs:1974\u0060 calls \u0060bytes\u0060, \u0060map_err\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:648\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"123df678a67ebf0e0303b80cafead6dfd4efc215382d2a0350d6191413c60d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:144-155 | tools/pdf-ir-poc/src/table_hierarchy.rs:126-137 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_hierarchy.rs:144\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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"885dc0e7656ae5376bef4ff121035055f6a984213a8ed8780df4fd763780e75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/renderer/composer/line_breaking.rs:6690-6700 | src/renderer/typeset.rs:3366-3375 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":6690}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d78772cc41fa7815d7921d7c7a509cbbe1cd382fdb0217ade5a639f1ad7e722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/renderer/equation/logical_font_frame.rs:188-198 | src/renderer/equation/logical_font_frame.rs:219-226 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/equation/logical_font_frame.rs:188\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":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a1829f583bd56ad1165d7956974856731d2e3a990e08f89f721e2d5150c608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/float_placement.rs:4075-4085 | src/renderer/float_placement.rs:5791-5801 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:4075\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":4075}}}],"partialFingerprints":{"codehealthFindingId/v1":"031b1593735f0007e149b51c05365296c50a776778d3612fc0e3d1d9e9f6dd20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/float_placement.rs:5398-5408 | src/renderer/float_placement.rs:5471-5481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/renderer/float_placement.rs"},"region":{"startLine":5398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3c65f14293f8256568b74be6336a88f18b48ab5d34dddd83e92be4154745e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/float_placement/square_lane.rs:89-99 | src/renderer/float_placement/stored_square_top_band.rs:162-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement/square_lane.rs:89\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/square_lane.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee092afe9ab1ff7f7fd4003ea9c0359863cfe524a780d39ab53b02e58d49ff79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/renderer/float_placement/stored_column_spacing.rs:70-78 | src/renderer/layout/table_layout.rs:2734-2744 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_column_spacing.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb158f11f4c9677a6325f4c249cb550566b7b04d10b1b1482092b8f3c412c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/font_environment.rs:451-461 | src/renderer/font_environment.rs:487-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":"src/renderer/font_environment.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ec926b1655f626cd97decc7f5f58ba13dad0ca89f24ebd0bd4d3275217a127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 4): src/renderer/height_measurer.rs:2381-2391 | src/renderer/layout/paragraph_layout.rs:5722-5724 | src/renderer/layout/picture_footnote.rs:1945-1947 | src/renderer/typeset/paragraph/format.rs:445-453 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/paragraph_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a96e256cbcfec6cb99b38aa23f2e2339b47555d50025096949ee632c6b54a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/height_measurer.rs:3722-3732 | src/renderer/layout/table_layout.rs:11919-11930 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:11919\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":"src/renderer/height_measurer.rs"},"region":{"startLine":3722}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8dfc89f3b80a92e5655e636f9261af716a978d07b396fb8f854ae37723b6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/inline_flow.rs:406-416 | src/renderer/inline_flow.rs:471-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f321c3b7aa979d2a7e337636440cfb682078cfe6439ce84e371c0ce74c1aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/renderer/layout.rs:756-764 | src/renderer/layout/paragraph_layout.rs:3686-3696 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:756\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":"src/renderer/layout.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3c05452eae812c5b70f7c69e228e7f4680f92f0c3d0453714244e83ba98356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout.rs:2579-2589 | src/renderer/typeset/controls/decoration_host.rs:119-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:2579\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":"src/renderer/layout.rs"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a16796715c08569ed7b97e9bfdcc9cb2e3ca9b6eb97c4ed43a3403c3eb4c0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/renderer/layout.rs:15936-15946 | src/renderer/layout.rs:16049-16058 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:15936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":15936}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b6a7fce09e71deec4b4efe2333c68769404fa2c54dbc3d94e0f30fdedee15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:2514-2524 | src/renderer/layout/paragraph_layout.rs:2796-2806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"200c600c53610d39b1ebde1f23a6b2b305b8c24dece57b96a66595b11e9129e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9432-9442 | src/renderer/layout/paragraph_layout.rs:11421-11431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dd802abedb61eb07123ec584ae4ad3241b0e32cbffcb2fd10cd6d7ce887a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/renderer/layout/shape_layout.rs:1301-1311 | src/renderer/layout/table_layout.rs:4906-4915 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:1301\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ae9d9f05bc66944fc1face12da82147dd0d0021c76c5c7dd035e43cd56ed61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/renderer/layout/shape_layout.rs:3269-3278 | src/renderer/layout/shape_layout.rs:3289-3299 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:3269\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d7400362ab208d12f7c37a0bb06e95185b591bcadddf223162074affe3aca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/shape_layout.rs:3707-3717 | src/renderer/layout/table_layout.rs:10797-10810 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:3707\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f00495079d1083f54fd4b0f434b12526279a86c128980fea6dd558d11d3295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4506-4516 | src/renderer/layout/table_partial.rs:4402-4412 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4506\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37cc7ee866101f20fa7ab3d2c80e3cdb4cd01142934942da2ce0a99aba1aa9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4934-4944 | src/renderer/layout/table_cell_content.rs:566-576 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4934}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6be08671ef2cd8d82dd58893392926b398b9f7573a833884d04275dbd7f88b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/table_layout.rs:5075-5085 | src/renderer/layout/table_layout.rs:5878-5888 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:5075\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5075}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30c6169f2ef03d551ec62b43b7bb8dca7a867c4a0b19b28c1ef7303ac3c825e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/table_layout.rs:5680-5690 | src/renderer/layout/table_layout.rs:6031-6041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ef9e21096dfec5ec439d3c7345c4455743c453b2175b300c40ef302186c644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): src/renderer/layout/table_layout.rs:12181-12191 | src/renderer/layout/table_layout.rs:28626-28631 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:12181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3438d0dd55ee1ada2570c1d0b1321a385d12d72ebdc7638e7f5e0796bbcb6fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): src/renderer/layout/table_layout.rs:24959-24969 | src/renderer/layout/table_layout/reflow_nested_band.rs:84-90 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24959}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eea8722677c9204b9ade6a7cde1c19618300ff01fe847803fd3acd7ba9872af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/text_measurement.rs:805-815 | src/renderer/layout/text_measurement.rs:860-870 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9e0796697f239f67f9182db5273d64b4915430bf7e79461e37d129da966e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/utils.rs:463-473 | src/renderer/layout/utils.rs:522-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/utils.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee21194ddadf2e7bb38e307da78bb0417780463697ad9276a81f680d2735fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/native_pua_fonts.rs:86-96 | src/renderer/native_pua_fonts.rs:140-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/native_pua_fonts.rs:86\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":"src/renderer/native_pua_fonts.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa6d3585590dda0360888e18a80c54b5dd381c984803d6d621a14cb55a9979b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/pdf_synthetic_bold.rs:118-128 | src/renderer/pdf_synthetic_italic.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":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"52be783d5cd52bbe610e0da4c6de6d846f1a2e914784d371403c2cddd4ac88e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/renderer/skia/image_conv.rs:999-1009 | src/renderer/skia/image_conv.rs:1133-1141 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/skia/image_conv.rs:999\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_conv.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3116b1b31debfa9ad588e87370caa641fb81192321fa9f23bde1494b8a25e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/skia/text_replay/decorations.rs:14-24 | src/renderer/skia/text_replay/lines.rs:68-78 \u2014 before extracting anything, compare \u0060src/renderer/skia/text_replay/decorations.rs\u0060 and \u0060src/renderer/skia/text_replay/lines.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/text_replay/decorations.rs:14\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":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e9095938c53e28e2bc8495f6b2c93f632f930022202340340302c1bee07521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/svg.rs:427-437 | src/renderer/svg.rs:448-458 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/svg.rs:426\u0060 calls \u0060clear\u0060 and \u0060src/renderer/svg.rs:447\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7db4e35e9a74b7cf69b1d2a57917529378041ff4b390113ae42bfff95b092a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/svg.rs:2732-2742 | src/renderer/web_canvas.rs:4021-4031 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:2732\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":"src/renderer/svg.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce41dea666bf7d73efc842b74dd6907e3aa1086e3d1c1c804af58ee87be6182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/typeset/controls/shape_flow.rs:36-46 | src/renderer/typeset/controls/tac_reconcile.rs:234-244 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/typeset/controls/shape_flow.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6acc1087045f848d5018083b5cb0c27d6fa06cf18ef10ccca0b1e32f90b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/typeset/controls/stored_tac.rs:809-819 | src/renderer/typeset/controls/stored_tac.rs:900-910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf1ee3100ae88206b1cba726a66de3263b5899eec8a944ecdf8ab6987f671ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/typeset/notes/endnotes/measure.rs:250-260 | src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs:302-312 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/typeset/notes/endnotes/measure.rs:250\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"66683d96d4b561cbf06124d4d98db2c706864e2c3675117b281dbf2fbd583d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:276-286 | src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:353-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:276\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":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba6b8814ddbd6e78ad8d60bb04dd0b6078ce85a97f12337e5218a2f6d2941f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:922-934 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:943-953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac774f9470ebe9032efd7fb55e6791093c567f87b81060a986f7f0246fe38db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/web_canvas.rs:1968-1978 | src/renderer/web_canvas.rs:1991-2001 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:1968\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:1966\u0060 calls \u0060line_to\u0060, \u0060move_to\u0060 and \u0060src/renderer/web_canvas.rs:1990\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b424dc0905d91856c7cf6ffb850d16f570607dc6f5af4ec202a7fbf9d422bc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/web_canvas.rs:1964-1974 | src/renderer/web_canvas.rs:2002-2012 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:1964\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/web_canvas.rs:1975\u0060 calls \u0060line_to\u0060, \u0060move_to\u0060 and \u0060src/renderer/web_canvas.rs:2013\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f28b81434008792a7675f50e174b14622b6dde83a53cecaef001c3400381ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/web_canvas.rs:3355-3365 | src/renderer/web_canvas.rs:3423-3433 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:3355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":3355}}}],"partialFingerprints":{"codehealthFindingId/v1":"843a8fcee03477a63105ce467a2c483b64379d571f88664f78c84e9e113bfe85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/serializer/body_text.rs:1058-1068 | src/serializer/body_text.rs:1342-1357 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/body_text.rs:1342\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/body_text.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f369fa4a4ed6974366aa0f6fd47fbd516a92623c50bbd58a24a4d19f14b7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/serializer/control.rs:2269-2279 | src/serializer/control.rs:2299-2309 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/control.rs:2269\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f60a3768c27257925fe5401306e439a5ec7092cbd5c6857d1ea282bf794a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): src/wasm_api.rs:238-246 | src/wasm_api.rs:1210-1220 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:238\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":"src/wasm_api.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb77475c0404473a3bc0ff3a16640c542ac0cff0e38d13c70f8c07cf4febf981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/wmf/converter/svg/mod.rs:1555-1565 | src/wmf/converter/svg/mod.rs:1613-1623 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wmf/converter/svg/mod.rs:1555\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"664e6dd1d077a3e33138fa2c2867851a64aac60fc7a756d41d00648cfa9d92e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 28): src/cli/commands/edit/bookmarks.rs:196-206 | src/cli/commands/edit/cell_paragraphs.rs:88-98 | src/cli/commands/edit/cells.rs:575-585 | src/cli/commands/edit/cells.rs:744-754 | src/cli/commands/edit/controls.rs:68-78 | src/cli/commands/edit/document_objects.rs:70-79 | src/cli/commands/edit/equations.rs:313-323 | src/cli/commands/edit/formatting.rs:784-794 | src/cli/commands/edit/header_footer_content.rs:684-693 | src/cli/commands/edit/header_footer_content.rs:1113-1123 | src/cli/commands/edit/header_footer_properties.rs:233-243 | src/cli/commands/edit/media.rs:862-872 | src/cli/commands/edit/note_content.rs:301-310 | src/cli/commands/edit/notes.rs:258-268 | src/cli/commands/edit/shapes.rs:240-250 | src/cli/commands/edit/shapes.rs:514-524 | src/cli/commands/edit/tables/grid.rs:73-82 | src/cli/commands/edit/tables/grid.rs:181-190 | src/cli/commands/edit/tables/grid.rs:287-296 | src/cli/commands/edit/tables/grid.rs:536-545 | src/cli/commands/edit/tables/grid.rs:651-661 | src/cli/commands/edit/tables/grid.rs:795-805 | src/cli/commands/edit/tables/layout.rs:181-191 | src/cli/commands/edit/tables/layout.rs:306-315 | src/cli/commands/edit/tables/layout.rs:425-435 | src/cli/commands/edit/tables/layout.rs:659-669 | src/cli/commands/edit/tables/structure.rs:78-87 | src/cli/queries/structured_objects.rs:59-69 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:196\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ded09c4bd7004898a625c6465198b4275cce6d6d6be9f7938e37309874be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 9): src/cli/commands/edit/document_objects.rs:568-575 | src/cli/commands/edit/fields.rs:35-44 | src/cli/commands/edit/formatting.rs:17-24 | src/cli/commands/edit/formatting.rs:157-164 | src/cli/commands/edit/formatting.rs:865-872 | src/cli/commands/edit/header_footer_properties.rs:15-22 | src/cli/commands/edit/note_content.rs:576-583 | src/cli/commands/edit/page.rs:12-19 | src/cli/commands/edit/page.rs:115-122 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 217 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64c010dccb2d176362df8c4436815e47576f618c5da48df7add64e19b3fb365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): src/bin/rhwp-q/kit/auto_numbers.rs:11-20 | src/bin/rhwp-q/kit/equations.rs:11-20 | src/bin/rhwp-q/kit/hidden_comments.rs:11-20 | src/bin/rhwp-q/kit/hyperlinks.rs:11-20 | src/bin/rhwp-q/kit/index_marks.rs:11-20 | src/bin/rhwp-q/kit/page_hide.rs:11-20 | src/bin/rhwp-q/kit/pictures.rs:11-20 | src/bin/rhwp-q/kit/ruby.rs:11-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/auto_numbers.rs:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/auto_numbers.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd991aa5ca74c04e23ed6f4eff172a9367b0804560db9201556a01bfdb9d60d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): src/bin/rhwp-agent/inspect.rs:35-44 | src/bin/rhwp-agent/inspect.rs:113-122 | src/bin/rhwp-agent/inspect.rs:245-254 | src/bin/rhwp-agent/inspect.rs:282-291 | src/bin/rhwp-agent/inspect.rs:338-347 | src/bin/rhwp-agent/inspect.rs:372-381 | src/bin/rhwp-agent/lookups.rs:183-192 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/inspect.rs\u0060 and \u0060src/bin/rhwp-agent/lookups.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/inspect.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b3b012bedb9d5efd4271811aa833dd5e91d2d9644d8cc25c5920ada3ac018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 7): src/cli/protocol/capsule/signing.rs:88-97 | src/cli/protocol/exchange/bundle.rs:31-39 | src/cli/protocol/exchange/disclosure.rs:121-129 | src/cli/protocol/exchange/settlement.rs:325-333 | src/cli/protocol/trust/anchor.rs:19-27 | src/cli/protocol/trust/anchor.rs:173-181 | src/cli/protocol/trust/governance.rs:599-607 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/exchange/bundle.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:88\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":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92b6278b897429ec792356ae97145520fc98951de3cf1a831a958873fc1a384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:116-125 | src/diagnostics/hwp5_cell_header_probe.rs:175-184 | src/diagnostics/hwp5_contract_analyze.rs:100-109 | src/diagnostics/hwp5_contract_probe.rs:123-132 | src/diagnostics/hwp5_mel_personnel_probe.rs:121-130 | src/diagnostics/hwp5_table_probe.rs:127-136 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"674eb26bbbb83dde6ea93068b62510099ac9441508ab72966b8a80df60fd1356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/document_core/commands/html_import.rs:369-378 | src/document_core/commands/text_editing.rs:4257-4266 | src/document_core/commands/text_editing.rs:4281-4290 | src/document_core/commands/text_editing.rs:4359-4368 | src/document_core/commands/text_editing.rs:5133-5142 | src/document_core/commands/text_editing.rs:5157-5166 \u2014 before extracting anything, compare \u0060src/document_core/commands/html_import.rs\u0060 and \u0060src/document_core/commands/text_editing.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/html_import.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a8070ef86eb82bbb9c153e5719a81bf0f890a9e54d936a9d83fa447874a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/document_core/commands/table_ops.rs:1000-1009 | src/document_core/commands/table_ops.rs:1036-1045 | src/document_core/commands/table_ops.rs:1210-1219 | src/document_core/commands/table_ops.rs:2949-2958 | src/document_core/commands/text_editing.rs:5897-5906 | src/document_core/queries/cursor_nav.rs:1436-1445 \u2014 before extracting anything, compare \u0060src/document_core/commands/table_ops.rs\u0060 and \u0060src/document_core/commands/text_editing.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/table_ops.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cc56b75c3bb47337e8d3c9142ee82409b75f59abe7b062ac0ebd20c6a745a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/document_core/queries/hwpctrl_sets.rs:1024-1033 | src/document_core/queries/hwpctrl_sets.rs:1098-1107 | src/document_core/queries/hwpctrl_sets.rs:1302-1311 | src/document_core/queries/hwpctrl_sets.rs:1652-1661 | src/document_core/queries/hwpctrl_sets.rs:1708-1717 | src/document_core/queries/hwpctrl_sets.rs:1754-1763 \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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0aee987cfd2b7f5e75a79de5dbaf431420ef16ef4b4d0a3254f976e9f9dd60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/renderer/pagination/engine.rs:1154-1163 | src/renderer/typeset.rs:1190-1199 | src/renderer/typeset/controls/host_wrap.rs:17-26 | src/renderer/typeset/controls/host_wrap.rs:92-101 | src/renderer/typeset/controls/wrap_match.rs:56-65 | src/renderer/typeset/controls/wrap_match.rs:163-172 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:1154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81fda28ebfafc97eaa3819335384010509e631416bdd47579e776f5a84718bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/wmf/parser/objects/graphics/font.rs:118-127 | src/wmf/parser/objects/structure/bitmap_info_header/info.rs:99-108 | src/wmf/parser/objects/structure/log_color_space.rs:63-72 | src/wmf/parser/objects/structure/log_color_space_w.rs:63-72 | src/wmf/parser/records/bitmap/set_dib_to_dev.rs:71-80 | src/wmf/parser/records/bitmap/stretch_dib.rs:83-92 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/font.rs:118\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/wmf/parser/records/bitmap/stretch_dib.rs:93\u0060 calls \u0060parse\u0060 and \u0060src/wmf/parser/objects/graphics/font.rs:128\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/font.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd30f7b524b8b782f4754995fa61da4c30d88fb237937878754b79752358c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:231-240 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:176-185 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:257-266 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:205-214 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:152-161 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:231\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3074a30952dbfde436ce72055617d73df35c3ca1cdc77bf09a05d7b9b76ef642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/bin/rhwp-q/kit/caret_stops.rs:39-48 | src/bin/rhwp-q/kit/covering_pages.rs:36-45 | src/bin/rhwp-q/kit/line_starts.rs:40-49 | src/bin/rhwp-q/kit/para_bounds.rs:40-49 | src/bin/rhwp-q/kit/word_starts.rs:39-48 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e83a33dc3f5efe82e4941b4b30066cb23906bddf47325b9ee5012ea79ec1c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/bin/rhwp-q/kit/cell_shape.rs:46-55 | src/bin/rhwp-q/kit/field_by_id.rs:13-22 | src/bin/rhwp-q/kit/flow_images.rs:49-58 | src/bin/rhwp-q/kit/footnote_footholds.rs:37-46 | src/bin/rhwp-q/kit/overlay_images.rs:53-62 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cell_shape.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cell_shape.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"27597c5dee28377c244028f01525070483624d0313b5360d32b2279c3e1ac9d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/bin/rhwp-q/kit/fn_selection_rects.rs:21-30 | src/bin/rhwp-q/kit/form_at.rs:18-27 | src/bin/rhwp-q/kit/hit_fn_marker.rs:19-28 | src/bin/rhwp-q/kit/hit_in_footnote.rs:19-28 | src/bin/rhwp-q/kit/page_text.rs:15-24 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/fn_selection_rects.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/fn_selection_rects.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/fn_selection_rects.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fecbeba630108549de34858690e2730281532b8fa910c0eb291c2baf72a0940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 5): src/document_core/commands/text_editing.rs:1427-1435 | src/document_core/commands/text_editing.rs:1677-1686 | src/document_core/commands/text_editing.rs:1930-1939 | src/document_core/commands/text_editing.rs:4400-4409 | src/document_core/commands/text_editing.rs:4899-4908 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn stamp_caret(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/text_editing.rs:4411\u0060 calls \u0060reflow_paragraph\u0060 and \u0060src/document_core/commands/text_editing.rs:1688\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"172af9facb816a78b37b81303a7e21f4d3853e03635e349787fea0df7dd396d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/anchor_log.rs:35-44 | src/audit_standard.rs:30-39 | src/disclose.rs:30-39 | src/settle.rs:34-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/anchor_log.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a7e91d0dc6469ec29cf013ed6ba0b81396eefbae846cc81d8ee49761cf9119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:94-103 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:93-102 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:97-106 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:91-100 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a8d0498a87ee25e3dae9a5683289b86f96fb280e048f4842c5a7e00aa7f1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bin/rhwp-q/kit/bin_data.rs:11-20 | src/bin/rhwp-q/kit/chart_csv.rs:26-35 | src/bin/rhwp-q/kit/page_border_fill.rs:12-21 | src/bin/rhwp-q/kit/page_text.rs:12-21 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/chart_csv.rs\u0060 and \u0060src/bin/rhwp-q/kit/page_border_fill.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/bin_data.rs:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"42796e918576eec2919291350ce409301ae921b56fed2a45c214daaaa991c4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bin/rhwp-q/kit/char_index.rs:53-62 | src/bin/rhwp-q/kit/cur_field_state.rs:53-62 | src/bin/rhwp-q/kit/field_info_at.rs:53-62 | src/bin/rhwp-q/kit/word_end.rs:53-62 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 and \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/char_index.rs:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"735806c070614b74b5daad2bcfa5fe5ebe15df5185593fd2cc41be0745eb30d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bin/rhwp-q/more/inventory.rs:465-474 | src/bin/rhwp-q/more/inventory.rs:492-501 | src/bin/rhwp-q/more/inventory.rs:962-971 | src/bin/rhwp-q/more/inventory.rs:1294-1303 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:465\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910d6f28f1976d8d2125b09b0884d9cfa7fa3bd7cc3cefacb735759bb17edda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/cli/commands/edit/document_text.rs:38-47 | src/cli/commands/edit/document_text.rs:242-251 | src/cli/commands/edit/document_text.rs:352-361 | src/cli/commands/edit/document_text.rs:488-497 \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. 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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7a96e24e85e33033fea890b6b4df6954fb7373ad061f89e81efa8b8eef3e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/paint/json.rs:2741-2750 | src/paint/json.rs:2784-2793 | src/paint/json.rs:2810-2819 | src/paint/json.rs:2839-2848 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/json.rs:2741\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060gradient_path\u0060 to \u0060\u0026crate::paint::ColorPaintLinearGradientPathNode\u0060 in one and \u0060\u0026crate::paint::ColorPaintRadialGradientPathNode\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":"src/paint/json.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d4adf367108507a54d754b447a345debac952fdfca04ffc8abb2170548b3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/renderer/layout/shape_layout.rs:1869-1878 | src/renderer/layout/shape_layout.rs:2197-2206 | src/renderer/layout/shape_layout.rs:2303-2312 | src/renderer/layout/shape_layout.rs:2426-2435 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/shape_layout.rs:2302\u0060 calls \u0060has_saved_affine_geometry\u0060, \u0060is_some\u0060 and \u0060src/renderer/layout/shape_layout.rs:2196\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"81472b1242347c3bb17ec7b4d5344980621ba5c090261211a2f3d80d120e10d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/renderer/layout/table_layout.rs:6236-6245 | src/renderer/layout/table_layout.rs:13066-13075 | src/renderer/layout/table_layout.rs:13248-13257 | src/renderer/layout/table_layout.rs:14238-14247 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:6236\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e96cb11bb1b6539dd969cc698d0e86724cdd5238ed9ce0c8770fb8c832f7016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:484-493 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:732-741 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:764-773 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:856-865 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:484\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa77e3fdd33b13f53133d11c0683d5f8de1a4967c5ef1eae74a284203ed2d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/wmf/converter/svg/mod.rs:194-203 | src/wmf/converter/svg/mod.rs:272-281 | src/wmf/converter/svg/mod.rs:481-490 | src/wmf/converter/svg/mod.rs:563-572 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f916cf81821094c9395941ba8bf02a7e703a99931c8b4a60da80cf4ad0ea688e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-agent/chunkplan.rs:73-82 | src/bin/rhwp-agent/safety.rs:420-429 | src/bin/rhwp-agent/verify.rs:167-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/chunkplan.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb25efea79050c7b92867ca4a26d43be5b6bd62032eb89da55bef7bfd64d6649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-agent/harvest.rs:102-111 | src/bin/rhwp-agent/lookups.rs:227-236 | src/bin/rhwp-agent/lookups.rs:375-384 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/harvest.rs\u0060 and \u0060src/bin/rhwp-agent/lookups.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/harvest.rs:102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de92fc8904aad82ec7f5272c1a2019bf8bb27f9536caa78fff38a19b8311c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/kit/covering_pages.rs:13-22 | src/bin/rhwp-q/kit/form_value.rs:19-28 | src/bin/rhwp-q/kit/page_border_fill.rs:15-24 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/covering_pages.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/covering_pages.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f5b6c93d97c4854cb98cc7cff6ad4c1f9ba84d6230c8fbb76be7a900ec688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_cell.rs:76-86 | src/bin/rhwp-q/kit/cursor_in_note.rs:72-82 | src/bin/rhwp-q/kit/note_edit_info.rs:61-71 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_note.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:76\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, \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:89\u0060 calls \u0060Some\u0060, \u0060take_usize\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_note.rs: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":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a244a2384e58a948ccb79e3aee8dd8fde33cd145053c2028819dd7178310909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_cell.rs:89-98 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:80-89 | src/bin/rhwp-q/kit/cursor_in_note.rs:84-93 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:89\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":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ccc1bdb739d41e13b85a256535149ec244a67da0c7123d78da19a687650577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_hf.rs:78-87 | src/bin/rhwp-q/kit/hf_edit_target.rs:18-27 | src/bin/rhwp-q/kit/hit_in_hf.rs:20-29 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/hf_edit_target.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_in_hf.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_hf.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_hf.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac15c27e213f416fbb552c94cc5c831de17b0dfbecd71fa2b4f6a089dc2952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/kit/cursor_in_hf.rs:105-114 | src/bin/rhwp-q/kit/flow_images.rs:59-68 | src/bin/rhwp-q/kit/overlay_images.rs:63-72 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_hf.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_hf.rs:105\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":"src/bin/rhwp-q/kit/cursor_in_hf.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8486a5d8e751564b4483f216d8070f81854c796f7a3ee959132cb0fdb1c3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/kit/form_at.rs:90-99 | src/bin/rhwp-q/kit/hit_fn_marker.rs:91-100 | src/bin/rhwp-q/kit/hit_in_footnote.rs:91-100 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_fn_marker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 155 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/form_at.rs:90\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"06244c224f9eae931b716acf81b6403b1583875ec73b51e5019961979fa1c003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:679-688 | src/bin/rhwp-q/pack/inventory.rs:136-145 | src/bin/rhwp-q/pack/inventory.rs:1245-1254 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:679\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81d3ccbbaa7eb679aa5ac448e3b163794505a5c36bce75bee30dd9f24da7ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:756-765 | src/bin/rhwp-q/pack/inventory.rs:161-170 | src/bin/rhwp-q/pack/inventory.rs:809-818 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:756\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d93249b954fee145653eef3bb53b1addf81973cd6da9225d287e09954f762c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:781-790 | src/bin/rhwp-q/pack/inventory.rs:186-195 | src/bin/rhwp-q/pack/inventory.rs:834-843 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b0fd7114774c952c63d01ed30fec6234076e96fb0e18c1f2a0baf1b84671c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:806-815 | src/bin/rhwp-q/pack/inventory.rs:211-220 | src/bin/rhwp-q/pack/inventory.rs:859-868 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:806\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e716ee4b66ec17b2e7c11ad833c2a83cd1cf418584d8b6c45ee15459d9a96a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:831-840 | src/bin/rhwp-q/pack/inventory.rs:236-245 | src/bin/rhwp-q/pack/inventory.rs:884-893 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:831\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894cedd58f0c2273d67933568db236510830c317f49d04111ea9d2e6a307aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:856-865 | src/bin/rhwp-q/pack/inventory.rs:705-714 | src/bin/rhwp-q/pack/inventory.rs:1193-1202 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:856\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3000b9795e95fd74daa698d1144d4562ad2fd869f77a28a4025376bee40c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/cli/commands/edit/document_objects.rs:23-32 | src/cli/commands/tabular_import.rs:509-518 | src/cli/outputs/tabular.rs:341-350 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 3 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":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"058b8f319fa8aee092ac149343747ddb3acd8f20ba186715b47e8da4931b2d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/cli/commands/edit/document_objects.rs:153-162 | src/cli/commands/edit/document_text.rs:731-740 | src/cli/commands/edit/formatting.rs:19-28 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa94e920a2825eb541d172dd02e61a5c515f6598533f9886b0c8ce862cf8624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/cli/commands/edit/document_text.rs:15-24 | src/cli/commands/edit/document_text.rs:340-348 | src/cli/commands/edit/document_text.rs:476-484 \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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"447a3d128b06f2daca6a71f078a06ac15613833fddf42801d64192aa873c943c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/cli/protocol/trust/anchor.rs:9-18 | src/cli/protocol/trust/anchor.rs:84-93 | src/cli/protocol/trust/anchor.rs:159-168 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/trust/anchor.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/anchor.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9feb7d2c44d0c45c10165b257ed983120f4a5ca4a001628b658ec37e79f90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/diagnostics/hwp5_anchor_trace.rs:107-116 | src/diagnostics/hwp5_inventory.rs:164-173 | src/diagnostics/hwp5_inventory_diff.rs:311-320 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_anchor_trace.rs\u0060 and \u0060src/diagnostics/hwp5_inventory.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_anchor_trace.rs:107\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c6c2068501925700169f88262193eb5c6744e7a1648adc25d2a34323e96c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/diagnostics/hwp5_cell_header_probe.rs:894-903 | src/diagnostics/hwp5_mel_personnel_probe.rs:808-817 | src/diagnostics/hwp5_table_probe.rs:657-665 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:894\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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf79dc1afadf03e552b9c540afeebdccb33f9a06e81bbd78fb00bb66e6c78b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/document_core/commands/document.rs:957-965 | src/document_core/commands/document.rs:2133-2141 | src/renderer/composer/reflow_helpers.inc.rs:83-92 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/document.rs:957\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":"src/document_core/commands/document.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"31edf4b5a254b9edcadc4d9744b277ddb02ebfa3041a8717202f670abcb89b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): src/document_core/commands/header_footer_ops.rs:409-415 | src/document_core/commands/header_footer_ops.rs:486-495 | src/document_core/commands/header_footer_ops.rs:550-556 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/header_footer_ops.rs:486\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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc69559ffb2288b4f93f7368a12f8b00ea72e3b73ed4fe4a77d460021688af0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/document_core/hyperlink.rs:416-425 | src/document_core/queries/bookmark_query.rs:183-192 | src/document_core/queries/field_query.rs:2661-2670 \u2014 before extracting anything, compare \u0060src/document_core/queries/bookmark_query.rs\u0060 and \u0060src/document_core/queries/field_query.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hyperlink.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baa74143d2fb78fb67df80e92edcbfc670f7eb8654c6c7b9ea7ff31cc9259db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/document_core/queries/hwpctrl_sets.rs:1028-1035 | src/document_core/queries/hwpctrl_sets.rs:1102-1109 | src/document_core/queries/hwpctrl_sets.rs:1974-1983 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/hwpctrl_sets.rs:1028\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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bfc23f17e99d55fbb72fc31d4d831276e973da6c0016e8083a4beadb8effb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/model/document.rs:793-802 | src/wasm_api.rs:394-403 | src/wasm_api.rs:4575-4584 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/document.rs:793\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3650dadfe63ece5aa4c9bcbf90f9dd3f8bff830452ab2487fd043b8d3ae308e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/native_host/gpu_d3d.rs:370-379 | src/native_host/gpu_gl.rs:445-454 | src/native_host/gpu_metal.rs:256-265 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc6987c4cfe71c299bdef6ee637ccdfd62e3a6f1c2523c2b7aaf78f416e99f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/paint/paper_viewport.rs:107-116 | src/paint/paper_viewport.rs:173-181 | src/paint/paper_viewport.rs:445-453 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paper_viewport.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0ad85863cd654cce02e3dbcbf7c7debc273947baf6b081aab8ddc1b876f872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/parser/hwp3/drawing.rs:350-360 | src/parser/hwp3/drawing.rs:403-413 | src/parser/hwp3/drawing.rs:456-466 \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":"src/parser/hwp3/drawing.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea829f942e58ec1a7b4c810f0062a880245cfd0bcd39990cc1aeb344d8c2c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/parser/hwpx/header.rs:1868-1877 | src/parser/hwpx/section.rs:3417-3425 | src/parser/hwpx/section.rs:4505-4512 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1868\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/hwpx/header.rs:1867\u0060 calls \u0060Some\u0060 and \u0060src/parser/hwpx/section.rs:3416\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed4793c49ce46ffc84efaab058df9f49df342a56445924b484c46327201f126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/renderer/float_placement.rs:3808-3815 | src/renderer/float_placement/stored_header_frame.rs:27-36 | src/renderer/float_placement/stored_header_frame.rs:82-89 \u2014 before extracting anything, compare \u0060src/renderer/float_placement.rs\u0060 and \u0060src/renderer/float_placement/stored_header_frame.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:3808\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":"src/renderer/float_placement.rs"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0b70ed9df1f6ae0a2a3da0277b660e88d6f08e42c54484e37f45fe6dd3b53d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/renderer/svg.rs:3662-3671 | src/renderer/svg.rs:3738-3747 | src/renderer/web_canvas.rs:2792-2801 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:3662\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":"src/renderer/svg.rs"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad308fa108a6e3eae420c6b25c6be0a2bdaa1d52156d197f8b297c64981b528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/serializer/hwpx/master_page.rs:88-97 | src/serializer/hwpx/section.rs:4042-4051 | src/serializer/hwpx/section.rs:4952-4961 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/master_page.rs\u0060 and \u0060src/serializer/hwpx/section.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/serializer/hwpx/master_page.rs:87\u0060 calls \u0060check_storage\u0060 and \u0060src/serializer/hwpx/section.rs:4041\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/master_page.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b97f9875980f880e45212eb386b6cef7a6dabbf29cae9e7bc095cdda265608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:219-228 | src/bin/rhwp-agent/safety.rs:524-533 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/safety.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fffac089e3cfbf91220144175b552209a51f25776a9a09bc25606e3977b1deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:371-380 | src/bin/rhwp-agent/tables.rs:70-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/bin/rhwp-agent/safety.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"addbcdd0c4c94fe71cf81fb69e60fbf6c10ab06d13a68f8a9cb163d82bba9b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/kit/cursor_in_footnote.rs:69-78 | src/bin/rhwp-q/kit/footnote_info.rs:57-66 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 and \u0060src/bin/rhwp-q/kit/footnote_info.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:69\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, \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:79\u0060 calls \u0060Some\u0060, \u0060take_usize\u0060 and \u0060src/bin/rhwp-q/kit/footnote_info.rs:67\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_footnote.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7962ffb97a5414c5db9ae50b39d2f934fad03f7d2be78c3aeb95ad00870fba56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:706-715 | src/bin/rhwp-q/more/inventory.rs:1159-1168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:706\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"da55c87eddc83d1d36acf374d155f00c304e802cb382f9035a0d33a2d199731e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/more/main.rs:42-51 | src/bin/rhwp-q/pack/main.rs:42-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/main.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/main.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b002fc6df636daf10c4937c32f5c8787768c680f494008a01be94b54c0ee3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/cli/commands/edit/fields.rs:224-242 | src/mcp_serve.rs:2239-2254 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/fields.rs\u0060 and \u0060src/mcp_serve.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/fields.rs:224\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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dd544a24e6e7574892b77403d2dac376018665d07dc448e9da431b70a2d3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/commands/edit/privacy.rs:583-592 | src/cli/outputs/preview.rs:19-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:583\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fd7833755c3283516c204b1a5bff740d25cccc4a0c84cd263de5d1fdf81a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/commands/edit/tables/grid.rs:701-710 | src/cli/commands/edit/tables/layout.rs:353-362 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/grid.rs\u0060 and \u0060src/cli/commands/edit/tables/layout.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c01451a343f98b457b87386403b53c365d4a253fb9b9cb6ad0118a21d4fa6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/commands/tabular_import.rs:597-606 | src/cli/commands/tabular_import.rs:638-647 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/tabular_import.rs:597\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/tabular_import.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a1c286cd4fea1021131701d39dd22dcb5fd4ed729d460517ed83d981925835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/outputs/kitty.rs:159-168 | src/cli/outputs/sixel.rs:154-163 \u2014 before extracting anything, compare \u0060src/cli/outputs/kitty.rs\u0060 and \u0060src/cli/outputs/sixel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/kitty.rs:159\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":"src/cli/outputs/kitty.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffa7ebc819d823056d83b330426d4ebb40162073d9c70bac17b008434e81be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/outputs/tabular.rs:222-231 | src/cli/outputs/tabular.rs:462-471 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:222\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a811594fd832ed644430212e07120181d5130421bd8a002f8e6247c00300289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/outputs/tabular.rs:250-259 | src/cli/outputs/tabular.rs:490-499 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:250\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e07c9a2254ebd9aa79090e783fac4208693f4aaf0b843715788f251096d92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/capsule/replay.rs:102-111 | src/cli/protocol/harness.rs:146-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/replay.rs:102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/replay.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"444de42af8dc9da60e06d245786bdd8b146b7559f08fad39655bcc99019c14c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/capsule/signing.rs:7-16 | src/cli/protocol/harness.rs:6-15 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/harness.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6479e67c2981db2e01e24447ec76a9aa23d16e604f445d18b77b27b41ee1d4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/exchange/bundle.rs:9-18 | src/cli/protocol/exchange/disclosure.rs:7-16 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/bundle.rs\u0060 and \u0060src/cli/protocol/exchange/disclosure.rs\u0060 as WHOLE FILES: this scan already matched 6 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/bundle.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52122401bd2410fa84e9316901ca3c34d01c4bdf90de6fa3bb0059c71a5a681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/exchange/disclosure.rs:217-226 | src/cli/protocol/trust/governance.rs:197-206 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/disclosure.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/disclosure.rs:217\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"41573a2fd5e5d3430ecee8f4e380338aab0351b6adcdeb9d9aad978e0f67b919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/exchange/settlement.rs:77-86 | src/cli/protocol/trust/governance.rs:380-389 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/settlement.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/cli/protocol/exchange/settlement.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e31cb4278cedb6a0b7328c199c73c86a6f2d0ab0594b739ca728c760c9488af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/cli/queries/digest.rs:116-124 | src/cli/queries/info.rs:34-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/cli/queries/digest.rs:116\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/digest.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a1699456b007c060cb26a3b6edc818ee98418700082cd798116ac4cb80f52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/queries/security_inspection.rs:578-587 | src/cli/queries/security_inspection.rs:850-859 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:578\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/security_inspection.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"01021ad47fddc2b91f4cce8fc14d5d9c07e0bb18760b3ca3bc96659db217f8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:678-687 | src/diagnostics/hwp5_mel_personnel_probe.rs:587-596 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_mel_personnel_probe.rs\u0060 as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 503 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23a6408fabed3df5d442bf182d15abcbf85e5b6132538391ea0c4fa72caff5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/border_paint_edit.rs:142-151 | src/document_core/commands/border_paint_structure.rs:648-657 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/document_core/commands/border_paint_edit.rs:142\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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc74c037b62b7a80ce559daa1a78f2effb4ad2bd67934174a7bb9cc46058e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/document_core/commands/bullet_create.rs:142-152 | src/document_core/commands/numbering_char_shape.rs:42-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/bullet_create.rs:142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/bullet_create.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22f3c9ed68430ec6b7b9d7910c4205fa0da0ab4c5ba127b00e6de5cfaa092c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/document_core/commands/document.rs:3174-3182 | src/document_core/commands/document.rs:3203-3212 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/document.rs:3174\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":"src/document_core/commands/document.rs"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d693eaf6c01fc2f4560fee6f6d09752e12bf238edf6060f8f624090cb9260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/formatting.rs:2378-2387 | src/document_core/commands/formatting.rs:2484-2493 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:2378\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb5cf61e01fc485e5af908e75285f316ae0f3b88c83f52793379d29e442b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/formatting.rs:2582-2591 | src/document_core/commands/formatting.rs:2624-2633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/document_core/commands/formatting.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab7267992b0cc6b7df6b8c3337e338335bf439708d2fd1e943271f5bba111b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:938-950 | src/document_core/commands/object_ops/chart.rs:1085-1097 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/chart.rs:938\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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c31c38dc74fe700d30fc4659098f9faf1c8ec3474425b419363734d95b3b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:1690-1699 | src/document_core/commands/object_ops/table.rs:1761-1771 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:1690\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0386665f9d445889f4f06d1f0444a5a6e5791a1317fb3c32dea4dff56fbc778b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:1796-1805 | src/document_core/commands/object_ops/table.rs:1960-1969 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:1796\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"90138329e812c447fb41f6ac0d6928fad19083e9e1b8b918c45b655579cd0c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/document_core/commands/text_editing.rs:51-60 | src/document_core/commands/text_editing.rs:146-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:51\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb7f994073230e41a9accae2146c73d7984c7f681a49bfe6b3395be04717e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/hyperlink.rs:415-424 | src/document_core/queries/memo_query.rs:1964-1973 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hyperlink.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc42799d7768ecc71157aaeb5b017098985114527f76db0b110786361014aed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/bookmark_query.rs:461-470 | src/document_core/queries/field_query.rs:2754-2763 \u2014 before extracting anything, compare \u0060src/document_core/queries/bookmark_query.rs\u0060 and \u0060src/document_core/queries/field_query.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/bookmark_query.rs:461\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d91fea2949bc83b27392071922f36c0fc44bb3e56c975403dce1d9c5c3c34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:4467-4476 | src/document_core/queries/cursor_rect.rs:4591-4600 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:4467\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":4467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac7b6950ecb5fd06ea686704526edba66062c845594b7913528341df140efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5420-5429 | src/document_core/queries/cursor_rect.rs:5958-5967 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5420\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 \u0060run\u0060 to \u0060\u0026HfRunInfo\u0060 in one and \u0060\u0026FnRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f094550eda5071e63529123fccee43b1a495584aead6cc69cbbb40361b5b80b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/extract_data.rs:438-447 | src/document_core/queries/extract_data.rs:458-467 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/extract_data.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/extract_data.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6f201623c9a5eeb13e642d669df712039af4106545331189aeb037b95d8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/form_query.rs:71-80 | src/document_core/queries/form_query.rs:194-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/form_query.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/form_query.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"944362efaa50a14f1ba33f5354148474d4ffa35ae3c22a313d91b406cdd4f093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/grep.rs:109-118 | src/document_core/queries/injection_scan.rs:253-262 \u2014 before extracting anything, compare \u0060src/document_core/queries/grep.rs\u0060 and \u0060src/document_core/queries/injection_scan.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/grep.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f869a0e1c73302be91f3bc6aae816020ed7798b0301d0f0a938c83abcbf1b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/document_core/queries/grep.rs:340-348 | src/document_core/queries/grep.rs:431-440 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/grep.rs:340\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2c4612f4a39abe6b4961d339a87259eb6f3f6290b8c7445390bf511f91967e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/rendering.rs:1984-1994 | src/document_core/queries/rendering.rs:2071-2081 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:1984\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, \u0060src/document_core/queries/rendering.rs:1995\u0060 calls \u0060push\u0060, \u0060render_layer_tree_svg\u0060 and \u0060src/document_core/queries/rendering.rs:2082\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5ccc42785df42ae613b551cecea93a550812dc14dc74b44bc76a00126eb6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/rendering.rs:7738-7748 | src/document_core/queries/rendering.rs:7781-7790 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:7738\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7738}}}],"partialFingerprints":{"codehealthFindingId/v1":"603e427f54e7e9c3391a6aa5c4fd9f4c986f749ee4ff4681792b85a4d21eebc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/stego_scan.rs:326-335 | src/document_core/text_security.rs:543-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/stego_scan.rs:326\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deba085c2f07dbb28cfdd8f63b598a931c4756ca5ebff96b169e3cd4954ccc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main.rs:444-453 | src/service/query.rs:317-326 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8343131ddff8a823bfe22a8be208905049d8bf92828f4f5991e2148ce2b00f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_serve.rs:1640-1649 | src/mcp_serve.rs:2222-2231 \u2014 both copies are in the same file, so extract the block 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 \u0060src/mcp_serve.rs:1640\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":"src/mcp_serve.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcefd9423f5121f605b255453d949c44d1bddba014a3038e5aef09091112ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/mcp_serve.rs:1863-1872 | src/mcp_serve.rs:2022-2031 \u2014 both copies are in the same file, so extract the block 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 \u0060src/mcp_serve.rs:1863\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mcp_serve.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69b7d4f62f41b78ed3637ac4f39f364088bbea6809fadb633f4d10ac237d312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/model/paragraph.rs:880-889 | src/model/paragraph.rs:3453-3462 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/paragraph.rs:880\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":"src/model/paragraph.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa598c63f69f1e07b05d6cebd170323bcc9fb2e406dc02debeda01d36bb2f821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/parser/body_text.rs:1193-1201 | src/parser/control.rs:466-475 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/parser/body_text.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e3ac689fc68465dbd54464f47692dc8d4b03302e316301d19b6c3caa6441f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/cfb_reader.rs:875-884 | src/parser/cfb_reader.rs:906-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/parser/cfb_reader.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"682bfe2507004ac2dd4df38a153ad5fe3765f3690e287f78c99e079ccded6e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/control.rs:343-352 | src/parser/control.rs:461-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":"src/parser/control.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdb3d292113ee6344a6525a7e28d83c090f6a20b61b7b2b5978d8a2f0fd3768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/control/shape.rs:155-164 | src/parser/control/shape.rs:771-780 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/control/shape.rs:155\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":"src/parser/control/shape.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb7583bce1785cc0d6a6dd0acf0dea53da2bbf1aa9b607838a2dd3331b3c539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/doc_info.rs:594-603 | src/parser/doc_info.rs:606-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1a3bfaef650b225aac8bbcb704e9d9a57e4ea7da195a818eca14bd55e8ebae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/hml/reader.rs:270-279 | src/parser/hml/reader.rs:303-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hml/reader.rs:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/hml/reader.rs:302\u0060 calls \u0060pop\u0060 and \u0060src/parser/hml/reader.rs:269\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/reader.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51cdc40a8f8bc6a6fa9e317cb013ab65242ebac3bd566b2644a0f6f81fcf8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/hwp3/mod.rs:1308-1317 | src/parser/hwp3/mod.rs:2497-2506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfbe664099b24ef0dc733e93dcde23e4306ea393c2c9a53574a6437efafac3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/parser/hwpx/header.rs:1353-1359 | src/parser/hwpx/header.rs:2020-2029 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:1353\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":"src/parser/hwpx/header.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6412e7a3f7e0a18b446eb5e34e207ab972848b732d272571d497ae80d44fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/ingest/schema.rs:216-225 | src/scaffold/schema.rs:291-300 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/ingest/schema.rs:226\u0060 calls \u0060is_some\u0060, \u0060Err\u0060, \u0060custom\u0060 and \u0060src/scaffold/schema.rs:301\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/ingest/schema.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fefe3dbebb66983d3435ed8ef1859962d6875fb6403fcf0e2402012f96cd4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/lowering.rs:263-272 | src/parser/pdf/structured_lowering/native_borders.rs:135-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd0ebc5dd21b12963d7c49ee00d762b7d5ad7f5466a1ec876819552fbe0e063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/pdf/path_paint.rs:222-235 | src/parser/pdf/path_paint.rs:278-291 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/path_paint.rs:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/path_paint.rs:221\u0060 calls \u0060check\u0060, \u0060map_err\u0060, \u0060to_string\u0060 and \u0060src/parser/pdf/path_paint.rs:277\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/path_paint.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4819c14661889e255e12da23794a485b15d3983be68a25f096cc6f3b0a446141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/recognition.rs:153-162 | tools/pdf-ir-poc/src/recognition.rs:116-125 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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. 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd4761e2523562460303fa75db5237a40a0fb93d7896bdbf9a9a8931f7dfd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/recognition.rs:691-700 | tools/pdf-ir-poc/src/recognition.rs:436-445 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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. 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"38469586c88ae65bdb22f226cd8950acf995ef1d225973048cbe624ef8fabf5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:781-791 | tools/pdf-ir-poc/src/structured_lowering.rs:57-67 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f94cbd491dcf4a0e64a4ccf324fa1d49864c3509ec3c87c6592fae547668843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:817-824 | src/parser/pdf/structured_lowering.rs:859-868 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/structured_lowering.rs:817\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a3383e15e654e3327669ea25d71dd29fe66399718dbf2d15fd8fe3da0cd198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2044-2053 | tools/pdf-ir-poc/src/structured_lowering.rs:705-713 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:2044\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcbdcdac2fdbd1f580887740c876bfeae0180ce209259ee303e3bdd1017c8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/table_detection.rs:952-961 | tools/pdf-ir-poc/src/table_detection.rs:523-532 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pdf-ir-poc/src/table_detection.rs:523\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3e3dc7ee48b4d32cd911533c99c0b2f1084518a244b23476aa2126bd090a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_detection.rs:1130-1141 | tools/pdf-ir-poc/src/table_detection.rs:640-651 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:1130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5af59c6009a368e04df6508d046a31f70d03b4f9069b76e54c3a5fcfcb64fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:78-90 | tools/pdf-ir-poc/src/table_hierarchy.rs:76-88 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_hierarchy.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d974e14f1e63df2b6daf930a86e1a39d9287ab9657ba042fd64183467227c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/table_paint.rs:245-254 | src/parser/pdf/table_paint.rs:256-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a50d4e5f127dd59b3721b86a0e8da0155da0fdefe17f41fea60b450ae55377a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/table_topology.rs:37-46 | tools/pdf-ir-poc/src/table_topology.rs:26-35 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_topology.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7195c161fc8e614a3784b5c4100dcc0b38d7b3bc25c9d3f24aa36171a02b1203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/pdf/table_topology.rs:117-126 | tools/pdf-ir-poc/src/table_topology.rs:84-93 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_topology.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba3e7735ba613cb759d5307b53f309a74a72071b8b611c14e3d3c8dd84c695b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/render_backend/caps.rs:95-104 | src/render_backend/honesty.rs:64-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/caps.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63ddfcbe9e7772c3818b6e1c27619cb17f117b133375b1ba849f016950396a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/anisotropic_sampling.rs:62-71 | src/renderer/cubic_sampling.rs:73-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/anisotropic_sampling.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6501e401a8e53a536abac0f5b63612149c4c5e46614f019db002c8a474f44e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/char_overlap.rs:318-327 | src/renderer/char_overlap.rs:391-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/char_overlap.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85ca389cebcf94937b328d1cbb27b312faad590faacec838f4fed1bb643e640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/renderer/composer/inline_control_projection.inc.rs:38-47 | src/renderer/layout/textless_shape_host.rs:15-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/inline_control_projection.inc.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d2e5b3dad4840bdc40846f2e98722b306073cae2f7054485bf077cb4f5189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/float_placement.rs:449-458 | src/renderer/float_placement.rs:1769-1778 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:449\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64ca202e19080d34e77541310db029628e2ffd72221d68a5bca01f871e76985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/renderer/float_placement.rs:2978-2984 | src/renderer/float_placement/stored_header_frame.rs:25-34 \u2014 before extracting anything, compare \u0060src/renderer/float_placement.rs\u0060 and \u0060src/renderer/float_placement/stored_header_frame.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:2978\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":"src/renderer/float_placement.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"627cc77d7c1110bc3683ccce3d14e7205d766ab219e5a935efe5a2de2914d375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/renderer/float_placement.rs:5140-5149 | src/renderer/float_placement.rs:5786-5793 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:5140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b486e3e71d41f1b16ebadfa30e5c836e38fabdec9b726ebae3ef4dddb77da7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/renderer/height_cursor.rs:714-723 | src/renderer/layout/paragraph_layout.rs:4854-4861 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:4854\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_cursor.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d3ba89a9d38a6547ea5ed10ce2597eb3255f712ccd1e6dcb3da5062f269750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout.rs:1803-1812 | src/renderer/layout.rs:1831-1840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502574ad631c1b9e12f26f32bf87044808d430fa10df276af20f7926329c454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout.rs:8733-8742 | src/renderer/layout.rs:14363-14372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":8733}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8920a999024352190cb159905d52d68642182e9495294c05d0bc69fdb593b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:1158-1167 | src/renderer/typeset/paragraph/line_queries.rs:13-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8296862f0a4d75d4b750f1893dd554f19b9cd259435702ab5559150e751646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/shape_layout.rs:1402-1411 | src/renderer/layout/shape_layout.rs:1476-1485 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:1402\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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aabca77866b2e6d14c540e9464245cc939e5148a143c01ec613edecd45561a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4756-4765 | src/renderer/layout/table_cell_content.rs:102-111 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cf4156b047425cc369a65f8b11fe08d9490bb8cb79cd5e806ca47f0d70bc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:979-988 | src/renderer/layout/table_layout.rs:10661-10670 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_cell_content.rs:979\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"56991f706d2f5684e69c0d10ed22b1277bc2116143ba47b55081dd1b331f3070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/table_layout.rs:809-818 | src/renderer/layout/table_layout.rs:827-836 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:809\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9d4675ab7f6b32933524f2754cb35a4954f7bb54adcc32d5e6ee260905e123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/renderer/layout/table_layout.rs:2489-2498 | src/renderer/layout/table_layout.rs:2537-2545 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:2489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9775d3640ada29e5956f719d5a34fbbfecc10cc9e2eb9919a64f3850b9ad5173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/table_layout.rs:4494-4503 | src/renderer/layout/table_partial.rs:7261-7270 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:4494\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":4494}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f3f2421f2fef5a6b93a8a035b2cb0cb90ea13486f4f9a9caccb8215a33ada2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/renderer/layout/table_layout.rs:5777-5784 | src/renderer/layout/table_layout.rs:5912-5921 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:5777\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5777}}}],"partialFingerprints":{"codehealthFindingId/v1":"30890435a7522410b1ad8d58292c7bebf1a37e2780bed709dd734746df5116c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/table_layout.rs:19983-19992 | src/renderer/layout/table_layout.rs:20044-20053 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:19983\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19983}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4631b820825d331a42e84987a2f367f21bcf330279e430d21d41fee4c8d12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/layout/table_layout.rs:22278-22287 | src/renderer/layout/table_layout.rs:22338-22347 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:22278\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e909e03e09fac804412f3f1bd664444936b10f7ab995d575b6dbef532a8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/mod.rs:2344-2353 | src/renderer/typeset.rs:5047-5056 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/mod.rs:2344\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":"src/renderer/mod.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed47dc36927bd3d8dd9945fc713c9ecb1d3f0db33f2d6e2a4cd41dc99e3a136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/skia/anisotropic_image.rs:72-81 | src/renderer/skia/print_image_sampling.rs:12-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/anisotropic_image.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8a23cf3ca83b658174bc3b8d46f18639d4b38d836ae9e38f9128a3ddb8a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/typeset.rs:3603-3612 | src/renderer/typeset/notes/endnotes/measure.rs:696-705 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset.rs:3603\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":"src/renderer/typeset.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4c5cda318bdaef580f6bdcd699d1e87c1970c8afcc7d21d5791cc8f7394c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:467-475 | src/renderer/typeset/notes/endnotes/paragraph/tail_fit.rs:792-801 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs:467\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":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a88cfe6e1fa6dd8cd3e204e27ea541f1b408d8edb76719b915ce878ad281ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:66-77 | src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs:422-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a65fc269796967a92fe0e3a209eb911f52e0f4e1020a0a97eff75e5cf52f3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/typeset/paragraph/format.rs:158-167 | src/renderer/typeset/paragraph/metrics.rs:261-270 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2462159cc13d0e65384a2010cc9a5a56bb6e5b7d9656d71d1a6d7547882b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/typeset/table/continuation/fragment/physical_rows.rs:41-50 | src/renderer/typeset/table/scan/row.rs:293-302 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/table/continuation/fragment/physical_rows.rs:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/typeset/table/scan/row.rs:303\u0060 calls \u0060Footnote\u0060, \u0060Endnote\u0060, \u0060Unknown\u0060 and \u0060src/renderer/typeset/table/continuation/fragment/physical_rows.rs:51\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e718337d9598942e5a2331769f9431f6387835ecb8977cb4f5122a14b24b44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/serializer/control.rs:1236-1245 | src/serializer/control.rs:1258-1264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"82067da5324529d7501452fad483c9d26da0bf1d3e50d3590baf53f61f397973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/serializer/control.rs:1721-1730 | src/serializer/control.rs:1733-1742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"57549899f7cd882fa4c6248026e75ccc9de70d0fb9d109f08ce7705feba28ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/serializer/hwpx/picture.rs:370-379 | src/serializer/hwpx/table.rs:311-325 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/table.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/picture.rs:370\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fdf54ee741f95309b9db102078ee882a3beca1c59388921cb22f4de5381954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): src/serializer/hwpx/picture.rs:748-757 | src/serializer/hwpx/section.rs:5118-5121 | src/serializer/hwpx/shape.rs:1661-1670 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/picture.rs:748\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aab8cefd177107bb423454d775a6f8bced5c05377282d6a8a243d36eb5e968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 17): src/bin/rhwp-agent/envelope.rs:46-54 | src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:313-321 | src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:255-263 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:28-36 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:286-294 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:34-42 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:308-316 | src/bin/rhwp-q/commands/rhwp-q-markdown.rs:203-211 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:28-36 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:251-259 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:239-247 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:30-38 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:294-302 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:29-37 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:28-36 | src/bin/rhwp-q/commands/rhwp-q-text-file.rs:205-213 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:244-252 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/envelope.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdecc8c4929bc4add34b1803e036257a73f1e649677d466e9bfb9b110ae78fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 16): src/cli/commands/edit/bookmarks.rs:142-149 | src/cli/commands/edit/controls.rs:14-21 | src/cli/commands/edit/document_text.rs:729-736 | src/cli/commands/edit/equations.rs:259-266 | src/cli/commands/edit/formatting.rs:596-603 | src/cli/commands/edit/formatting.rs:713-720 | src/cli/commands/edit/media.rs:808-815 | src/cli/commands/edit/note_content.rs:16-23 | src/cli/commands/edit/notes.rs:204-211 | src/cli/commands/edit/shapes.rs:186-193 | src/cli/commands/edit/shapes.rs:460-467 | src/cli/commands/edit/tables/layout.rs:11-18 | src/cli/commands/edit/tables/structure.rs:124-131 | src/cli/commands/edit/tables/structure.rs:219-226 | src/cli/commands/edit/tables/structure.rs:314-321 | src/cli/commands/tabular_import.rs:37-45 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e529c1f4ba4d046ecb82cc15b46c4a940fd4cb51f1250f273b8abdf73158b867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 14): src/wmf/parser/objects/graphics/font.rs:123-131 | src/wmf/parser/objects/structure/bitmap16.rs:79-87 | src/wmf/parser/records/bitmap/bit_blt.rs:140-148 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:144-152 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:167-175 | src/wmf/parser/records/bitmap/stretch_blt.rs:164-172 | src/wmf/parser/records/drawing/arc.rs:71-79 | src/wmf/parser/records/drawing/chord.rs:74-82 | src/wmf/parser/records/drawing/ellipse.rs:54-62 | src/wmf/parser/records/drawing/pie.rs:73-81 | src/wmf/parser/records/drawing/rectangle.rs:53-61 | src/wmf/parser/records/drawing/round_rect.rs:61-69 | src/wmf/parser/records/state/scale_viewport_ext.rs:51-59 | src/wmf/parser/records/state/scale_window_ext.rs:51-59 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/font.rs:123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/font.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"265149974dad630282a0ce2935bbae517219d66f95a4cd8dd649440935d278c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): src/bin/rhwp-agent/locate.rs:213-221 | src/bin/rhwp-q/kit/char_index.rs:16-24 | src/bin/rhwp-q/kit/covering_pages.rs:11-19 | src/bin/rhwp-q/kit/cur_field_state.rs:16-24 | src/bin/rhwp-q/kit/cursor_in_cell.rs:75-83 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:68-76 | src/bin/rhwp-q/kit/cursor_in_note.rs:71-79 | src/bin/rhwp-q/kit/field_info_at.rs:16-24 | src/bin/rhwp-q/kit/form_value.rs:17-25 | src/bin/rhwp-q/kit/note_edit_info.rs:60-68 | src/bin/rhwp-q/kit/word_end.rs:16-24 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 and \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/locate.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:77\u0060 calls \u0060Some\u0060, \u0060take_u32\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:84\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/locate.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b937c4603f5c85ac4fc04e5783b27d83eb567f0750d4b53ab089f4653722d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): src/cli/commands/edit/bookmarks.rs:155-163 | src/cli/commands/edit/bookmarks.rs:273-281 | src/cli/commands/edit/controls.rs:27-35 | src/cli/commands/edit/document_objects.rs:290-298 | src/cli/commands/edit/equations.rs:272-280 | src/cli/commands/edit/media.rs:821-829 | src/cli/commands/edit/media.rs:919-927 | src/cli/commands/edit/notes.rs:217-225 | src/cli/commands/edit/shapes.rs:199-207 | src/cli/commands/edit/shapes.rs:473-481 | src/cli/queries/structured_objects.rs:30-38 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:155\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bfdb37aedbd34f6a414e81d4a406fc945c25da96850e223244090376b2b6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): src/cli/commands/edit/document_text.rs:739-747 | src/cli/commands/edit/document_text.rs:1040-1048 | src/cli/commands/edit/formatting.rs:27-35 | src/cli/commands/edit/formatting.rs:606-614 | src/cli/commands/edit/note_content.rs:26-34 | src/cli/commands/edit/note_content.rs:255-263 | src/cli/commands/edit/note_content.rs:363-371 | src/cli/commands/edit/note_content.rs:473-481 | src/cli/commands/edit/notes.rs:24-32 | src/cli/commands/edit/notes.rs:119-127 | src/cli/commands/edit/shapes.rs:30-38 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:739\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, \u0060src/cli/commands/edit/note_content.rs:264\u0060 calls \u0060Some\u0060 and \u0060src/cli/commands/edit/document_text.rs:1049\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e6adfe4292f720c3d1c0b8ec5d48aec6fed924c8b30067ab23cec994c370ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): src/cli/commands/edit/header_footer_content.rs:14-22 | src/cli/commands/edit/header_footer_content.rs:134-142 | src/cli/commands/edit/header_footer_content.rs:258-266 | src/cli/commands/edit/header_footer_content.rs:415-423 | src/cli/commands/edit/header_footer_content.rs:587-595 | src/cli/commands/edit/header_footer_content.rs:741-749 | src/cli/commands/edit/header_footer_content.rs:880-888 | src/cli/commands/edit/header_footer_content.rs:1013-1021 | src/cli/commands/edit/header_footer_properties.rs:146-154 | src/cli/commands/edit/header_footer_properties.rs:281-289 | src/cli/commands/edit/header_footer_properties.rs:399-407 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"34319a33559f564e85eb8ceec57724e00677acbec03dca71537e5783ef2efb48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): src/cli/commands/edit/bookmarks.rs:144-152 | src/cli/commands/edit/controls.rs:16-24 | src/cli/commands/edit/document_objects.rs:279-287 | src/cli/commands/edit/equations.rs:15-23 | src/cli/commands/edit/equations.rs:261-269 | src/cli/commands/edit/media.rs:810-818 | src/cli/commands/edit/media.rs:908-916 | src/cli/commands/edit/notes.rs:206-214 | src/cli/commands/edit/shapes.rs:188-196 | src/cli/commands/edit/shapes.rs:462-470 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29448d47f60a1b3819a8e7bd39a1590cfe7291f5ac583a159dad875e651b7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 7): src/cli/commands/edit/document_text.rs:18-26 | src/cli/commands/edit/document_text.rs:233-240 | src/cli/commands/edit/document_text.rs:343-350 | src/cli/commands/edit/document_text.rs:479-486 | src/cli/commands/edit/document_text.rs:614-621 | src/cli/commands/edit/equations.rs:127-134 | src/cli/commands/edit/header_footer_properties.rs:280-287 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/equations.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 163 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e176f37704f680bc5b91db984022a1649aea9d6c989f6529ba80d89672a40bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): src/document_core/queries/hwpctrl_sets.rs:1026-1034 | src/document_core/queries/hwpctrl_sets.rs:1100-1108 | src/document_core/queries/hwpctrl_sets.rs:1304-1312 | src/document_core/queries/hwpctrl_sets.rs:1654-1662 | src/document_core/queries/hwpctrl_sets.rs:1710-1718 | src/document_core/queries/hwpctrl_sets.rs:1756-1764 | src/document_core/queries/hwpctrl_sets.rs:1972-1980 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"914ae567634925993065e77254862c823a74dc973a0c6b554e13f22a60a8503d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/cli/commands/edit/document_text.rs:1045-1055 | src/cli/commands/edit/equations.rs:161-169 | src/cli/commands/edit/notes.rs:29-39 | src/cli/commands/edit/notes.rs:124-134 | src/cli/commands/edit/shapes.rs:35-45 | src/cli/commands/edit/tables/insert.rs:56-64 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/equations.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 163 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96fb2ca94fa0e05e921a4ecc0c8df58e9985ca32afc361371f68e354b493691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/renderer/layout/table_layout.rs:12212-12221 | src/renderer/layout/table_layout.rs:12267-12276 | src/renderer/layout/table_layout.rs:28652-28661 | src/renderer/layout/table_layout.rs:28703-28712 | src/renderer/layout/table_layout.rs:28748-28757 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12212}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c8a8f1a1f3a4f7d10480d698fb79903937701456ebd7c5aaaacefb07310c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/bin/rhwp-agent/locate.rs:214-222 | src/bin/rhwp-q/kit/covering_pages.rs:12-20 | src/bin/rhwp-q/kit/form_value.rs:18-26 | src/bin/rhwp-q/kit/page_border_fill.rs:14-22 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/covering_pages.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/locate.rs:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/locate.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fa6be37cd0083c55643e40282c24ded58cf443ae493d96cf60d54ab19fc490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/cli/protocol/harness.rs:327-335 | src/cli/protocol/trust/gate.rs:19-27 | src/cli/protocol/trust/governance.rs:175-183 | src/cli/protocol/trust/governance.rs:570-578 \u2014 before extracting anything, compare \u0060src/cli/protocol/harness.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/harness.rs:327\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/harness.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68b7d14d5f72cb466b0d1c9edae7f54ba7d963e5988cc78c32cd8326f7aa103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/diagnostics/hwp5_cell_header_probe.rs:857-865 | src/diagnostics/hwp5_contract_probe.rs:775-783 | src/diagnostics/hwp5_mel_personnel_probe.rs:771-779 | src/diagnostics/hwp5_table_probe.rs:626-634 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"297b720f4142c4f4c59e0d51c939b7c413f92863e748eb50d29f00e395382c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/document_core/commands/formatting.rs:1191-1199 | src/document_core/commands/formatting.rs:1268-1276 | src/document_core/commands/formatting.rs:1744-1752 | src/document_core/commands/formatting.rs:1827-1835 \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":"src/document_core/commands/formatting.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0d9196036830c6a4df80ccf1d8232ee9fccbdbdb4a77e7aba2f7bfbc22aa30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/renderer/layout/shape_layout.rs:2101-2109 | src/renderer/layout/shape_layout.rs:2129-2137 | src/renderer/layout/shape_layout.rs:2149-2157 | src/renderer/layout/shape_layout.rs:2447-2455 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:2101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ffc717e9874abd85e2c15b394e08ad13252cb4658ac8017d66aa6775ba4248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/renderer/typeset.rs:3564-3572 | src/renderer/typeset/notes/endnotes/measure.rs:247-255 | src/renderer/typeset/notes/endnotes/measure.rs:655-663 | src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs:299-307 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46dfc398b275fbb2dd053dfef42ec476c3fcd8e27bb34312794e32751502979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/bin/rhwp-agent/harvest.rs:19-27 | src/bin/rhwp-agent/safety.rs:220-229 | src/bin/rhwp-agent/safety.rs:525-534 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/harvest.rs\u0060 and \u0060src/bin/rhwp-agent/safety.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/harvest.rs:19\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":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3c52744e22409f8f29073a4247a4c7eab741b98d8c6fa7109d673a3e759c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/bin/rhwp-q/kit/form_at.rs:77-85 | src/bin/rhwp-q/kit/hit_fn_marker.rs:78-86 | src/bin/rhwp-q/kit/hit_in_footnote.rs:78-86 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_fn_marker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 155 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e794641711a1d63a53f472db2490e80b79c32b9790a61122373b807eec3287ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cli/commands/edit/tables/grid.rs:226-234 | src/cli/commands/edit/tables/grid.rs:475-483 | src/cli/commands/edit/tables/structure.rs:11-19 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/grid.rs\u0060 and \u0060src/cli/commands/edit/tables/structure.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bb4116b6a7834c380f930545e7e999974cb82f820478cd42eb28cb26848007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/diagnostics/hwp5_contract_analyze.rs:251-261 | src/diagnostics/hwp5_contract_analyze.rs:472-482 | src/diagnostics/hwp5_contract_analyze.rs:544-554 \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":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a404160bf3043414b1b837fa92287682b579013d313119477c6d927f43ddcb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): src/document_core/commands/clipboard.rs:590-598 | src/document_core/commands/clipboard.rs:678-686 | src/document_core/commands/clipboard.rs:739-745 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:590\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6821cb3f141bdabd8c1c819dd6f6f4f0880ca85f848e5c026488b2c6e4cf05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/document_core/commands/object_ops/equation.rs:472-480 | src/document_core/commands/object_ops/picture.rs:1425-1433 | src/document_core/commands/text_editing.rs:2913-2921 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:472\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":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454293861182c25baf645678814f2aed4462a5f743972589fe6846bb3b8d416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/document_core/commands/text_editing.rs:6560-6568 | src/document_core/commands/text_editing.rs:6724-6732 | src/document_core/commands/text_editing.rs:6839-6847 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:6560\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6560}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b1c6997ebcfb2a5b568084b18169a68eb1470da7ade7c5a54fc567a1a55bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/document_core/queries/bookmark_query.rs:64-72 | src/document_core/queries/bookmark_query.rs:126-134 | src/document_core/queries/bookmark_query.rs:235-243 \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":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe27d6b4114b80acec4161b45ea94e2824080bcfb4619ba7e360ce6ac499244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/document_core/queries/bookmark_query.rs:459-467 | src/document_core/queries/field_query.rs:2752-2760 | src/renderer/render_tree.rs:446-454 \u2014 before extracting anything, compare \u0060src/document_core/queries/bookmark_query.rs\u0060 and \u0060src/document_core/queries/field_query.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/bookmark_query.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"92395c6a29ba07b2c160327f182f154d2dad681dad6fb61ac6a9e0bb70c91728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): src/model/control.rs:565-571 | src/parser/hwpx/section.rs:6193-6201 | src/renderer/html.rs:585-592 \u2014 before extracting anything, compare \u0060src/model/control.rs\u0060 and \u0060src/parser/hwpx/section.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/control.rs:565\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/control.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fb0fe9484fedd4edafd5541f611d8b1c9bb0a4f784299bd57d9c28756ed3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/native_host/gpu_d3d.rs:556-563 | src/native_host/gpu_metal.rs:363-371 | src/native_host/presentation.rs:855-863 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:556\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 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd107f70a541d7b7139680fe53ac1eb38d67629f3f95fc09de9f11abcba5480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/parser/hwpx/section.rs:4619-4627 | src/parser/hwpx/section.rs:6945-6952 | src/parser/hwpx/section.rs:7802-7810 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:4619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4619}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae0cc26ff3aff73139313a7e070ec4768736c50f312fab022aad0605cd61e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/render_backend/util.rs:20-27 | src/renderer/canvaskit_policy.rs:2160-2168 | src/renderer/pdf.rs:859-866 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/render_backend/util.rs:20\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":"src/render_backend/util.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2799fc0db2cf533fc90f5a849496d935780493223e873bc9f91f45dd6b8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/renderer/float_placement.rs:7018-7026 | src/renderer/float_placement.rs:7051-7059 | src/renderer/float_placement.rs:7091-7099 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:7018\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":7018}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca9c685ba8968fbf478091a43b46d7a5f6b9574ea8db2f1cc3d8e0a7532f6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): src/renderer/layout/paragraph_layout.rs:9303-9309 | src/renderer/layout/paragraph_layout.rs:9444-9452 | src/renderer/layout/paragraph_layout.rs:11200-11206 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/paragraph_layout.rs:9303\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9303}}}],"partialFingerprints":{"codehealthFindingId/v1":"361fa80ffa43cb24d22baead8e5e720a7106ac62c6641885bda2a99b18e733c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/renderer/web_canvas.rs:2285-2293 | src/renderer/web_canvas.rs:2367-2375 | src/renderer/web_canvas.rs:2491-2499 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas.rs:2285\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:2283\u0060 calls \u0060clear_shadow\u0060 and \u0060src/renderer/web_canvas.rs:2364\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67038ed3cac69336bc0d19a8fa4908d8837aca5948d0cd489632d9ad123e5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-agent/explorecmd.rs:46-54 | src/bin/rhwp-agent/safety.rs:695-703 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/bin/rhwp-agent/explorecmd.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"189de7de0009181128865dac90d167ecb4fb7f4006ee142bb492a184f13b446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-agent/fingerprint.rs:148-157 | src/bin/rhwp-q/kit/source_image_bytes.rs:13-21 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/fingerprint.rs:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/fingerprint.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"992821d632cd79122638448aa16bb59b6dd0a8709bbb9f1eea1c76298fecbea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:92-100 | src/bin/rhwp-q/more/inventory.rs:1084-1092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba8fe04ff860182419d82c7cbe53bfb97770145c1d01c223f1a4e29d9b71a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-q/more/probe.rs:78-86 | src/bin/rhwp-q/pack/probe.rs:78-86 \u2014 \u0060src/bin/rhwp-q/more/probe.rs\u0060 and \u0060src/bin/rhwp-q/pack/probe.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 5 separate duplicated blocks between them, totalling at least 113 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/probe.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be1814d80768e079f5f7ff472717c2d7ba28c9f7aa6995eccd824e2de22ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/cells.rs:210-222 | src/cli/commands/tabular_import.rs:486-494 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 177 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"df63320ce5ae1c1ddd5cbc10327f9974760b67aeea73d973fbc74390e41b9688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cli/commands/edit/fields.rs:243-251 | src/cli/protocol/plan/execution.rs:266-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/fields.rs:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/fields.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"203b52909ccb3f8c3cfd784dab33df2d988ec0f8de59bd4f2510788f546f9071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/formatting.rs:244-252 | src/cli/commands/edit/formatting.rs:671-679 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/formatting.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a9220a02cf8e877ddb62fe57a612782d443275100f029eacaf5906cd7d33ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/media.rs:106-115 | src/cli/commands/edit/media.rs:531-539 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/media.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e475dd99a68b49c288ae858ae399a7cb637530ef12eacc828f808b3ecafc4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/media.rs:352-361 | src/cli/commands/edit/media.rs:733-741 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/media.rs:352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/media.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c194441f5c05be1846d83e0d7ffc041fadc7bddd7ae615e27fcc38b712ac0e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/page.rs:350-358 | src/cli/commands/edit/tables/layout.rs:109-117 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/page.rs\u0060 and \u0060src/cli/commands/edit/tables/layout.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 131 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/page.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/page.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3188396e624d8126bb8abd7cbdae10a9083ab3d7123c09fd5d8fadd17f3cff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/tables/layout.rs:112-120 | src/cli/commands/edit/tables/layout.rs:357-365 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/tables/layout.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab4d7210b3543c7c579c45d3be53f63f498b029765f632ca572679e1f924910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/outputs/tabular.rs:279-287 | src/cli/outputs/tabular.rs:520-530 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/outputs/tabular.rs:279\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ce86f7d93086fc4626ca246acc6e6310d3d4491ce7d08dd68152069010d1ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/protocol/exchange/disclosure.rs:112-120 | src/cli/protocol/exchange/disclosure.rs:211-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/disclosure.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1779bd125f8ddfd51a434bee0b70ba0891f1d96937c88e3168d1e7f28b9aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/protocol/trust/governance.rs:329-337 | src/cli/protocol/trust/governance.rs:781-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/trust/governance.rs:329\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":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d369877ce6c42dbc5f70aefd6b4d2a4613784c86c79871663593c5a3f7de933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/diagnostics/hwp5_inventory_diff.rs:1274-1282 | src/diagnostics/hwp5_inventory_diff.rs:1322-1330 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/hwp5_inventory_diff.rs:1274\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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f007d997a54bae1fb0b156cfd0ff0c44f695718a8f3999ac1ba1a3ab8a77cd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:589-597 | src/diagnostics/hwpx_roundtrip_batch.rs:425-433 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf76d9213b4086d707458e00b2d7d30cf5a6d628c3dc391346ba7bcd4c9aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/builders/exam_paper.rs:204-212 | src/scaffold/builder.rs:264-272 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060page_size\u0060 to \u0060crate::parser::ingest::schema::PageSize\u0060 in one and \u0060PageSize\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":"src/document_core/builders/exam_paper.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0edca3db35a0c36097874351debcb94812d3660e2afa09c1089ef029fa84e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/document_core/commands/clipboard.rs:505-513 | src/document_core/commands/text_editing.rs:3785-3791 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/text_editing.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/clipboard.rs:503\u0060 calls \u0060Ok\u0060, \u0060store_clipboard\u0060 and \u0060src/document_core/commands/text_editing.rs:3783\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f849dee635466031672611ed2f5de7cb3365501926c8103b10b363e41957e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/clipboard.rs:735-743 | src/document_core/commands/header_footer_ops.rs:755-763 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c19d9485c28c21aabcaea80ec2a49d5c35f5e6ddb9f796640e386d900bc3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/document_core/commands/clipboard.rs:923-930 | src/document_core/commands/html_import.rs:224-232 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/html_import.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:923\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"53366617d26a630cb8b1768fe82dc1c3a2c95eb4479157245c0de93ee39dc6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/document_core/commands/clipboard.rs:1391-1398 | src/document_core/commands/object_ops/table.rs:817-825 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/document_core/commands/object_ops/table.rs:826\u0060 calls \u0060Some\u0060, \u0060get_mut\u0060, \u0060shift_for_insert\u0060 and \u0060src/document_core/commands/clipboard.rs:1399\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a9006482bdd92acbd06a41dbf9fb23e2a1df3d261fbe428df4885c38c572a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/clipboard.rs:1564-1572 | src/document_core/commands/formatting.rs:261-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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fd997ac55d221073e28ed80f7143a6c4e18ec4c7c5fc6bc71a2c6faa6ca459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/formatting.rs:2094-2102 | src/document_core/commands/formatting.rs:2537-2545 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/formatting.rs:2094\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/formatting.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bd0199cc1a1d3c5de44189bc086e0dcdebb51d8b2b3e7c3db9bfd5bc4ae034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/header_footer_ops.rs:294-302 | src/document_core/commands/header_footer_ops.rs:343-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"957248ef82ec23730789a562952f169098123b4df4da5302827440f6bd37d249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:641-647 | src/scaffold/builder.rs:425-433 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/scaffold/builder.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/object_ops/table.rs:640\u0060 calls \u0060copy_from_slice\u0060, \u0060to_le_bytes\u0060 and \u0060src/scaffold/builder.rs:424\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"207765f0ef5d175c952fe76342ade9c5586f107debc6bbc2d1c3404841d2e247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:1346-1352 | src/document_core/html_table_import.rs:675-683 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:1346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c7084d77f1a547c84e6d1503c36438943f789c0a707bc94785020b5be84bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/document_core/commands/text_editing.rs:436-444 | src/renderer/typeset.rs:596-602 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f45b8c131a31ffc7aa08096bec88354eec6463318a868abdf0058dd46d1a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/text_editing.rs:5995-6003 | src/document_core/commands/text_editing.rs:6874-6882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"f870211449197857ad775941c261bed3a333d2a6d792310b82a28ee8d47fc91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/text_editing.rs:6018-6026 | src/document_core/commands/text_editing.rs:6236-6244 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:6018\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":6018}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78a56c973ab2b0d5369d7531d4e307b23362b6275fa55f0a82a9693def6b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/converters/hwpx_master_page_slots.rs:31-39 | src/document_core/converters/hwpx_master_page_slots.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":"src/document_core/converters/hwpx_master_page_slots.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c2a67a3ced7c3d33d4eb41788737a95e446baff3dfb4a462cf9152fc740a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:1985-1993 | src/document_core/queries/cursor_rect.rs:5953-5961 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:1985\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060run\u0060 to \u0060\u0026RunInfo\u0060 in one and \u0060\u0026FnRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c11b5fbd548c5b7620a6631bd152a917d73d7c79b009d5d2673040af1a3058d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5337-5345 | src/document_core/queries/cursor_rect.rs:5876-5883 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b89562aadc72089660e8192c234fb2c6bab957b12fce7c84f8aa989e0797da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5484-5492 | src/document_core/queries/cursor_rect.rs:6000-6008 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5484\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5484}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdc89a94fdc74408bd8784c1faf2c428bfd6237faa4c3855808ff9f6eb5fea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:1137-1145 | src/document_core/queries/doc_tree_nav.rs:1168-1176 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/doc_tree_nav.rs:1137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1d2dea20d0d0fa63f425713062552ec2d622f5307ecda0b2b6a787b3f5bcf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/rendering.rs:1895-1903 | src/document_core/queries/rendering.rs:2180-2188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"835241085f39216942d55c6a976f069776dfc78e71785b9f41e9c192ca16db87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/rendering.rs:5096-5104 | src/document_core/queries/rendering.rs:5688-5696 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:5096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":5096}}}],"partialFingerprints":{"codehealthFindingId/v1":"e019975464500678693b3d51fd36156d0d444dd01eef333e6b0c47b6846374cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/search_query.rs:611-619 | src/document_core/queries/search_query.rs:648-656 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/queries/search_query.rs:609\u0060 calls \u0060resolve_cell_paragraph_mut\u0060, \u0060Some\u0060 and \u0060src/document_core/queries/search_query.rs:647\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/search_query.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"263531c23ab1509bdfe0f2fa9fcfa1a102e77c746a9325c1f6f7e0b53af094c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/search_query.rs:639-647 | src/document_core/queries/search_query.rs:669-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/search_query.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e9e3f3677437652d1a2fd8530eba14c4c10a533ef9a428ad1c9776074c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/stego_scan.rs:281-289 | src/document_core/text_security.rs:661-669 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c9420010da5b7ebcc8dbb0b3fa374d0c39ff8199af216c75c000c7293fddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/model/paragraph.rs:805-814 | src/model/paragraph.rs:3278-3286 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/paragraph.rs:805\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e704a00bacccd8940d7bd7736e086a2a8bd5a4f01aae322117fc1aba089419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/native_host/gpu_d3d.rs:695-703 | src/native_host/gpu_metal.rs:465-473 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d4f1c37f20af06d540b33ff2f7f4f9e2ea95af2cc258bc6f57d186f31cb6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/json.rs:796-804 | src/paint/json.rs:847-855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4778ce702681be875dccdbce34455d820e4a4a2b414c53e9027386f051da640d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/metafile.rs:57-65 | src/paint/metafile_surface.rs:93-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/metafile.rs:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330f3a0f29c91597b85ca8dbaf5903cd5861681b68ca19900801b2b45f69139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/metafile_print.rs:32-40 | src/renderer/image_resolver/print_alpha.rs:24-32 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/image_resolver/print_alpha.rs:33\u0060 calls \u0060is_finite\u0060 and \u0060src/paint/metafile_print.rs:41\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_print.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e4987888e93f4570bf84ffb5d52688823a3b12f8b9c37bf211ed1df66a7751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/shaping_glyph.rs:1270-1278 | src/paint/text_shape.rs:198-206 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/paint/shaping_glyph.rs:1270\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":"src/paint/shaping_glyph.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"022eed62847012812fab0dcf736571cc9046a3574f31bdd52380cc0e44833abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/hml/reader.rs:830-838 | src/parser/hml/reader.rs:881-889 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hml/reader.rs:830\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/reader.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9c808a78262698b2417c13852c9473a886986bfd4680d1fda8c0723217797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/parser/hwpx/section.rs:2505-2512 | src/parser/hwpx/section.rs:7237-7245 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:2505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe31614c22b06809ee2b2df8faa1ab16a9f8b4e9d2379d35ce0ac410817c3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/hwpx/section.rs:3033-3042 | src/parser/hwpx/section.rs:6606-6614 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3033\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889224da0a8d0875391340eb47f285f767513eace0cea8c970943059c3eb02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/hwpx/section.rs:4877-4886 | src/parser/hwpx/section.rs:4888-4897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/section.rs:4899\u0060 calls \u0060default\u0060 and \u0060src/parser/hwpx/section.rs:4888\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6af215fad0aed90e5f4a16f23d4101333705c5c659bade535cb62b4572c2ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:236-244 | src/parser/pdf/structured_lowering.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1cba8cf426303330c9e75335a20709a6b439973382e144fcf1061c960ab1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:806-814 | tools/pdf-ir-poc/src/structured_lowering.rs:45-53 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:806\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060indices\u0060 to \u0060\u0026[usize]\u0060 in one and \u0060\u0026[usize]) -\u003E (String\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"411c82890326c7a20b41609c84e3a171a10728c044730bc076fbb2a82cd3ee7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1061-1069 | src/parser/pdf/structured_lowering.rs:1073-1080 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/structured_lowering.rs:1061\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedb552d06869a6964ad6e6d0ddea9da8464e1b1ed280dbbaf7153cd2e4afcb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1526-1534 | tools/pdf-ir-poc/src/structured_lowering.rs:443-451 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1526\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e374c736734c6bb06020c8dd0e2c5812efae162052ef2c9cb4e616e0d8ca7643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/pdf/table_detection.rs:940-948 | src/parser/pdf/table_detection.rs:987-995 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:940\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b48776114f5cf64c4cf51da46e035511f62aede10b63f0a71de32d075d15e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/equation/svg_render.rs:596-604 | src/renderer/equation/svg_render.rs:606-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bd87de7b52b4ffda5f1c4fd38d6e7663bdaee56eccc1988f15fa58929e01b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/float_placement.rs:512-520 | src/renderer/float_placement/stored_opening_row_frame.rs:32-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e93b553e88e748f3f7ad3c1d87c4b1decc9d5fd1d17414107f1f3ca85074839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/float_placement.rs:3806-3814 | src/renderer/float_placement/stored_cut_outer_frame.rs:33-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:3806\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":"src/renderer/float_placement.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3204b36dbee8b3b41624967495f355abb8dffe61a1bf128c01f9a1edb66d55b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/float_placement.rs:4636-4644 | src/renderer/layout/table_layout.rs:12526-12534 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:4636\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"57068fdda19318a1d8031bdc574b85afdd5be055e923751bbffd264b94108a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/float_placement.rs:5303-5311 | src/renderer/float_placement.rs:5382-5390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5303}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a29a162341eed6fded4cae5b9eb953782e40caa58ad43291ae283767561392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/renderer/float_placement.rs:6657-6664 | src/renderer/float_placement.rs:6780-6788 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:6657\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, \u0060src/renderer/float_placement.rs:6668\u0060 calls \u0060shares_float_anchor\u0060, \u0060then_some\u0060 and \u0060src/renderer/float_placement.rs:6789\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":6657}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47df7b17f12a3a665db222a34c69aa12f440addb26036933ead76d3acf6b876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/height_cursor.rs:2668-2676 | src/renderer/height_cursor.rs:2678-2686 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_cursor.rs:2678\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":"src/renderer/height_cursor.rs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da45e09a69bc60776a5965032dc0bab9c43b6d9afb7a0c09a16bee545b087f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/inline_flow/table_rows.rs:17-25 | src/renderer/inline_flow/table_rows.rs:52-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow/table_rows.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6076e4b1a6a8e5b8b98286086b7d537da3143d3e76dc21aa4b5b06adaf221be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout.rs:1122-1130 | src/renderer/typeset.rs:1312-1320 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40aae9e1750abfa83e341fd8a3c96debe8d472c112f696612661911fec26f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/renderer/layout.rs:6816-6823 | src/renderer/layout.rs:10089-10097 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:6816\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":6816}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf312a53879e8c57d1fccad7f007b38e54cd39542dfe900205a36dfa3fc5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9015-9032 | src/renderer/layout/paragraph_layout.rs:11181-11197 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:9015\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9015}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5bb8eccd6e9761e49c38614c2b3d48118c7ebf9cae3a4cc542b86419aad9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2063-2071 | src/renderer/layout/shape_layout.rs:2279-2287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ed3323395c399eac3a6c55503894400e8672115b79a92a70cb98dc168b70af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2869-2877 | src/renderer/layout/shape_layout.rs:3049-3059 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/shape_layout.rs:2869\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70537679240914d61e644300e4c097e90843cb93ee68073d799efaf8cf20533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/renderer/layout/table_layout.rs:8989-8995 | src/renderer/layout/table_partial.rs:4193-4201 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:8989\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8989}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd4ae6991bb3a8016659f40f846732c0018b96e26d411770fa1212ee6e60078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/table_layout.rs:10078-10086 | src/renderer/layout/table_partial.rs:4957-4965 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":10078}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e01a6bb0158342dd2034353c5e398f22bdd404aa572efcdf69592a81b4419f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/table_layout.rs:20932-20940 | src/renderer/layout/table_layout/stored_zero_origin.rs:61-69 \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. 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, \u0060src/renderer/layout/table_layout.rs:20929\u0060 calls \u0060is_empty\u0060 and \u0060src/renderer/layout/table_layout/stored_zero_origin.rs:60\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20932}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ad52a3a8dfef680fc0297ec59c91a600fa63f8a3f09999106c933110bfc8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/table_layout.rs:22406-22414 | src/renderer/layout/table_layout.rs:22544-22552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22406}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30f9a921ba97adc369756b61e9f2dee6c8d3065d9c4e359cc26dd9b97eed10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): src/renderer/layout/table_layout.rs:24447-24452 | src/renderer/layout/table_layout.rs:28506-28514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e8f924d36e3fbd2bb351d915d78bde6fac228d394a366c05a049f73876f2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/table_layout/stored_deferred_picture_frame.rs:10-18 | src/renderer/layout/table_layout/stored_mixed_opening_frame.rs:288-296 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/layout/table_layout/stored_deferred_picture_frame.rs:10\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_deferred_picture_frame.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"907afc82c8d6e4570ee340a5a39ad3b1e5177e7d3c657d359de859c855e7b67b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/renderer/native_webfonts.rs:370-378 | src/renderer/native_webfonts.rs:444-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/native_webfonts.rs:370\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":"src/renderer/native_webfonts.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1768252ae0de094a2fef27947765c8bcde9df691a14e0baf9164ea409eab8f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/pagination/engine.rs:1120-1128 | src/renderer/typeset/section/post_flow.rs:396-404 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:1120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f84cda6964d814e0567e8da90d85b5029ade46a4c379782853dff2877043328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/skia/anisotropic_image.rs:12-20 | src/renderer/skia/metafile_print.rs:9-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"98febe7e70aeacd5ff836a776e72f70e0723f4079deb85fd87b9b03f9e58aa50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/skia/prepared_page.rs:154-162 | src/renderer/skia/renderer.rs:950-958 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/prepared_page.rs:154\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":"src/renderer/skia/prepared_page.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9ffa5f446163018d9ba71e01e2c77796564dd0bdcdd78cb80e18e05c6ff5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/skia/renderer.rs:2120-2128 | src/renderer/skia/renderer.rs:2194-2202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/renderer.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"406e0966d69a52f0a060125b8fb23373aefa3247fc66c9a82a7ac2992840d087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/typeset.rs:3578-3586 | src/renderer/typeset/notes/endnotes/measure.rs:437-445 \u2014 before extracting anything, compare \u0060src/renderer/typeset.rs\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 123 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/typeset.rs:3588\u0060 calls \u0060available_height\u0060 and \u0060src/renderer/typeset/notes/endnotes/measure.rs:446\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30900b0b3f0b53320d9f6da61dfb119a461cfee95a2e605d6cf6fb78c1435e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/typeset/controls/shape_flow.rs:293-301 | src/renderer/typeset/controls/shape_flow.rs:334-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/typeset/controls/shape_flow.rs:343\u0060 calls \u0060stored_text_partition_is_dirty\u0060 and \u0060src/renderer/typeset/controls/shape_flow.rs:302\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/shape_flow.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6401fc7ca1b25fb55a77c415d3749348f4334539ace937c1401b084efa4dc12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/renderer/typeset/controls/wrap_absorption.rs:41-49 | src/renderer/typeset/controls/wrap_absorption.rs:84-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/controls/wrap_absorption.rs:41\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/typeset/controls/wrap_absorption.rs:83\u0060 calls \u0060take\u0060 and \u0060src/renderer/typeset/controls/wrap_absorption.rs:40\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/wrap_absorption.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d9d845ea333db7bb9264d22d5f3c2af616aa927ddc34f0e35eadc64e6d5525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/typeset/notes/endnotes/emit.rs:15-23 | src/renderer/typeset/notes/endnotes/paragraph/rewind_tail.rs:145-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/emit.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e072ad3982595b85f6d6d197f24d217314f83f5818643837be9bcbd460088e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/typeset/notes/endnotes/measure.rs:527-535 | src/renderer/typeset/notes/endnotes/measure.rs:543-551 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/notes/endnotes/measure.rs:527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c989b479b82c8a8db1eb172bc524e1f77c878f44ce23c59fbe8fb8969c131f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/web_canvas.rs:1265-1273 | src/renderer/web_canvas.rs:2512-2520 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:1265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"075dcf7bb399cb94a7334ccd05f5e5c209f0e210d53a9d662b04980352c55ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/serializer/hwpx/section.rs:900-909 | src/serializer/hwpx/table.rs:525-534 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/section.rs\u0060 and \u0060src/serializer/hwpx/table.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/section.rs:900\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7f5c676025b64898105073b1d57aab6f7d48c0bd54319510af03078399cfc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/serializer/hwpx/shape.rs:129-136 | src/serializer/hwpx/shape.rs:320-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/serializer/hwpx/shape.rs:127\u0060 calls \u0060write_rect_pts_with_storage\u0060 and \u0060src/serializer/hwpx/shape.rs:318\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/shape.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e4e9c16d6061d1e1c1cded28b7c52a6c3fe7c884fcdc6e06dac326a6b19bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 25): src/cli/commands/edit/bookmarks.rs:151-158 | src/cli/commands/edit/controls.rs:23-30 | src/cli/commands/edit/document_objects.rs:286-293 | src/cli/commands/edit/document_objects.rs:424-431 | src/cli/commands/edit/document_text.rs:738-745 | src/cli/commands/edit/document_text.rs:1039-1046 | src/cli/commands/edit/equations.rs:268-275 | src/cli/commands/edit/formatting.rs:26-33 | src/cli/commands/edit/formatting.rs:166-173 | src/cli/commands/edit/formatting.rs:605-612 | src/cli/commands/edit/header_footer_properties.rs:24-31 | src/cli/commands/edit/media.rs:817-824 | src/cli/commands/edit/media.rs:915-922 | src/cli/commands/edit/note_content.rs:25-32 | src/cli/commands/edit/note_content.rs:254-261 | src/cli/commands/edit/note_content.rs:362-369 | src/cli/commands/edit/note_content.rs:472-479 | src/cli/commands/edit/note_content.rs:585-592 | src/cli/commands/edit/notes.rs:23-30 | src/cli/commands/edit/notes.rs:118-125 | src/cli/commands/edit/notes.rs:213-220 | src/cli/commands/edit/shapes.rs:29-36 | src/cli/commands/edit/shapes.rs:195-202 | src/cli/commands/edit/shapes.rs:469-476 | src/cli/queries/structured_objects.rs:26-33 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c968d3a72deca5163fd8a810f1e97fe15242d455f0252543599cd4c6191e8bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 20): src/cli/commands/edit/bookmarks.rs:15-22 | src/cli/commands/edit/cell_paragraphs.rs:17-24 | src/cli/commands/edit/cell_paragraphs.rs:174-181 | src/cli/commands/edit/cells.rs:494-501 | src/cli/commands/edit/cells.rs:664-671 | src/cli/commands/edit/document_text.rs:837-844 | src/cli/commands/edit/document_text.rs:933-940 | src/cli/commands/edit/document_text.rs:1030-1037 | src/cli/commands/edit/header_footer_content.rs:257-264 | src/cli/commands/edit/header_footer_content.rs:414-421 | src/cli/commands/edit/header_footer_content.rs:586-593 | src/cli/commands/edit/header_footer_content.rs:740-747 | src/cli/commands/edit/header_footer_content.rs:879-886 | src/cli/commands/edit/header_footer_content.rs:1012-1019 | src/cli/commands/edit/header_footer_properties.rs:398-405 | src/cli/commands/edit/note_content.rs:235-242 | src/cli/commands/edit/note_content.rs:353-360 | src/cli/commands/edit/note_content.rs:463-470 | src/cli/commands/edit/notes.rs:14-21 | src/cli/commands/edit/notes.rs:109-116 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f544adb5affaed41a890ec68ed1d2adf79b99c066df42176f20572358cf7400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17): src/bin/rhwp-agent/fields.rs:8-15 | src/bin/rhwp-agent/fields.rs:42-49 | src/bin/rhwp-agent/harvest.rs:101-108 | src/bin/rhwp-agent/harvest.rs:251-258 | src/bin/rhwp-agent/locate.rs:18-25 | src/bin/rhwp-agent/lookups.rs:13-20 | src/bin/rhwp-agent/lookups.rs:51-58 | src/bin/rhwp-agent/lookups.rs:178-185 | src/bin/rhwp-agent/lookups.rs:226-233 | src/bin/rhwp-agent/lookups.rs:256-263 | src/bin/rhwp-agent/lookups.rs:299-306 | src/bin/rhwp-agent/lookups.rs:326-333 | src/bin/rhwp-agent/lookups.rs:374-381 | src/bin/rhwp-agent/lookups.rs:450-457 | src/bin/rhwp-agent/lookups.rs:487-494 | src/bin/rhwp-agent/tables.rs:8-15 | src/bin/rhwp-agent/tables.rs:45-52 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/harvest.rs\u0060 and \u0060src/bin/rhwp-agent/lookups.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/fields.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d51c246b9bc684376b1223bb105e25b6d7aa8cc53e97d051f4f79111b7a8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): src/cli/commands/edit/bookmarks.rs:146-153 | src/cli/commands/edit/controls.rs:18-25 | src/cli/commands/edit/document_objects.rs:281-288 | src/cli/commands/edit/equations.rs:17-24 | src/cli/commands/edit/equations.rs:263-270 | src/cli/commands/edit/media.rs:812-819 | src/cli/commands/edit/media.rs:910-917 | src/cli/commands/edit/notes.rs:208-215 | src/cli/commands/edit/shapes.rs:190-197 | src/cli/commands/edit/shapes.rs:464-471 | src/cli/queries/structured_objects.rs:21-28 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca63c4b6a7e77ce813c55d178e07bd817b9ae82711fbb166b8943c89b2521c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): src/bin/rhwp-q/kit/cursor_in_cell.rs:14-21 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:15-22 | src/bin/rhwp-q/kit/cursor_in_hf.rs:14-21 | src/bin/rhwp-q/kit/cursor_in_note.rs:14-21 | src/bin/rhwp-q/kit/flow_images.rs:14-21 | src/bin/rhwp-q/kit/footnote_hit.rs:14-21 | src/bin/rhwp-q/kit/footnote_info.rs:14-21 | src/bin/rhwp-q/kit/hit_header.rs:14-21 | src/bin/rhwp-q/kit/note_edit_info.rs:15-22 | src/bin/rhwp-q/kit/overlay_images.rs:14-21 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e10dee3e887432bf3b300a32ab3955938be0790a9dd95b72010e9d80bb52d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): src/cli/commands/edit/bookmarks.rs:311-318 | src/cli/commands/edit/cells.rs:571-578 | src/cli/commands/edit/cells.rs:740-747 | src/cli/commands/edit/cells.rs:910-917 | src/cli/commands/edit/document_objects.rs:338-345 | src/cli/commands/edit/equations.rs:71-78 | src/cli/commands/edit/formatting.rs:780-787 | src/cli/commands/edit/formatting.rs:941-948 | src/cli/commands/edit/media.rs:967-974 | src/cli/commands/edit/note_content.rs:638-645 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:311\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":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84b7381df81097b9a1fc825faed7571b58191e9a8f3f71d5e43c8824317169c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 10): src/wmf/parser/records/bitmap/bit_blt.rs:144-150 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:148-154 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:171-177 | src/wmf/parser/records/bitmap/stretch_blt.rs:168-174 | src/wmf/parser/records/drawing/ellipse.rs:58-65 | src/wmf/parser/records/drawing/rectangle.rs:57-64 | src/wmf/parser/records/state/exclude_clip_rect.rs:50-55 | src/wmf/parser/records/state/intersect_clip_rect.rs:50-55 | src/wmf/parser/records/state/scale_viewport_ext.rs:55-61 | src/wmf/parser/records/state/scale_window_ext.rs:55-61 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/bit_blt.rs:144\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":"src/wmf/parser/records/bitmap/bit_blt.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dfdca1db566dbb90bf4df3d4c254c9c6b87e69697d4b0f4b24947a8524f77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): src/cli/commands/edit/bookmarks.rs:250-257 | src/cli/commands/edit/cells.rs:837-844 | src/cli/commands/edit/document_objects.rs:15-22 | src/cli/commands/edit/document_objects.rs:277-284 | src/cli/commands/edit/document_objects.rs:415-422 | src/cli/commands/edit/formatting.rs:297-304 | src/cli/commands/edit/media.rs:906-913 | src/cli/commands/edit/note_content.rs:130-137 | src/cli/commands/edit/tables/layout.rs:479-486 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:250\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46443ea4498765f799c348e136a5286aa44d1b91a72f405f080db5559bba5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): src/document_core/queries/cursor_rect.rs:514-521 | src/document_core/queries/cursor_rect.rs:524-531 | src/document_core/queries/cursor_rect.rs:535-542 | src/document_core/queries/cursor_rect.rs:545-552 | src/document_core/queries/cursor_rect.rs:555-562 | src/document_core/queries/cursor_rect.rs:565-572 | src/document_core/queries/cursor_rect.rs:575-582 | src/document_core/queries/cursor_rect.rs:586-593 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:514\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c893fb9205a5bf3a7b7e187ad02e2f0c580e81bb6a0665a00f9b12aed0b3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): src/wmf/converter/svg/mod.rs:761-768 | src/wmf/converter/svg/mod.rs:817-824 | src/wmf/converter/svg/mod.rs:1226-1233 | src/wmf/converter/svg/mod.rs:1258-1265 | src/wmf/converter/svg/mod.rs:1385-1392 | src/wmf/converter/svg/mod.rs:1435-1442 | src/wmf/converter/svg/mod.rs:1534-1541 | src/wmf/converter/svg/mod.rs:1601-1608 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:761\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/wmf/converter/svg/mod.rs:815\u0060 calls \u0060from\u0060, \u0060selected_pen\u0060, \u0060clone\u0060 and \u0060src/wmf/converter/svg/mod.rs:1223\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dfb285db845e7c81474e0c699cdde7b4db2c3c8a98ae8639fd1ac69fadfed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): src/bin/rhwp-q/kit/cursor_in_footnote.rs:70-77 | src/bin/rhwp-q/kit/flow_images.rs:52-59 | src/bin/rhwp-q/kit/footnote_footholds.rs:40-47 | src/bin/rhwp-q/kit/footnote_hit.rs:61-68 | src/bin/rhwp-q/kit/footnote_info.rs:58-65 | src/bin/rhwp-q/kit/hit_header.rs:61-68 | src/bin/rhwp-q/kit/overlay_images.rs:56-63 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:70\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, \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs:78\u0060 calls \u0060Some\u0060, \u0060take_usize\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs:60\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_footnote.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b97cd15c0ed001d46a3681fbc87827c5ac3904da2c6473cfdcc1e38a6385960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): src/cli/commands/edit/page.rs:352-359 | src/cli/commands/edit/shapes.rs:20-27 | src/cli/commands/edit/tables/grid.rs:13-20 | src/cli/commands/edit/tables/grid.rs:121-128 | src/cli/commands/edit/tables/grid.rs:704-711 | src/cli/commands/edit/tables/layout.rs:111-118 | src/cli/commands/edit/tables/layout.rs:356-363 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/page.rs\u0060 and \u0060src/cli/commands/edit/shapes.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/page.rs:352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/page.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7218d3576eaee3f4e3315aefc8f2d6f3ada66eb1fdeef2c8a077599d127934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/cli/batch/query.rs:16-23 | src/cli/batch/query.rs:67-74 | src/cli/batch/query.rs:105-112 | src/cli/batch/query.rs:121-128 | src/cli/batch/query.rs:135-142 | src/cli/batch/query.rs:153-160 \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":"src/cli/batch/query.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"88689eb19025b33d3e0b0c0fedb59825c6ae185d60e3dd5cba13ffb02d9c3c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:431-438 | src/diagnostics/hwp5_cell_header_probe.rs:690-697 | src/diagnostics/hwp5_contract_probe.rs:598-605 | src/diagnostics/hwp5_first_para_control_probe.rs:1295-1302 | src/diagnostics/hwp5_mel_personnel_probe.rs:604-611 | src/diagnostics/hwp5_table_probe.rs:349-356 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb174d58a082dea66167d195f4f229a5e76e489935a112840e67fd041f4381e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/bin/rhwp-agent/inspect.rs:108-115 | src/bin/rhwp-agent/inspect.rs:240-247 | src/bin/rhwp-agent/inspect.rs:277-284 | src/bin/rhwp-agent/inspect.rs:304-311 | src/bin/rhwp-agent/inspect.rs:367-374 \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":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa392c1f29ae4d8bd8fb46fec54aef8f4e5031bab5c2fbb23af92708d1979f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/cli/commands/edit/tables/grid.rs:228-235 | src/cli/commands/edit/tables/grid.rs:337-344 | src/cli/commands/edit/tables/grid.rs:477-484 | src/cli/commands/edit/tables/grid.rs:584-591 | src/cli/commands/edit/tables/structure.rs:13-20 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/tables/grid.rs\u0060 and \u0060src/cli/commands/edit/tables/structure.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/grid.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ca1cb4fdd17e9138563fef444330d7aca50f69ced007a987379286fffafaa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/bin/rhwp-q/kit/chart_list.rs:13-20 | src/bin/rhwp-q/kit/empty_doc.rs:9-16 | src/bin/rhwp-q/kit/overflow_cells.rs:11-18 | src/bin/rhwp-q/kit/table_overlaps.rs:11-18 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/bin/rhwp-q/kit/chart_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4bda1a2eafeb5144d22129c93c3485e99e17877409ae7fb8b1e076a393000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/bin/rhwp-q/kit/form_at.rs:90-97 | src/bin/rhwp-q/kit/hit_fn_marker.rs:91-98 | src/bin/rhwp-q/kit/hit_in_footnote.rs:91-98 | src/bin/rhwp-q/kit/hit_in_hf.rs:109-120 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_fn_marker.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 155 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/form_at.rs:90\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d5f0bba8fd530a249ea88dda62ceef653dbb5a6a43a907a30ec34995a4664a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/parser/hwpx/section.rs:4799-4806 | src/parser/hwpx/section.rs:4808-4815 | src/parser/hwpx/section.rs:4817-4824 | src/parser/hwpx/section.rs:4826-4833 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc70725f5a17a49a111400fa0cc39e6b152617b9061206f656cc4a5f6116c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/renderer/float_placement/stored_nested_before_host.rs:17-24 | src/renderer/layout/table_layout/stored_deferred_picture_frame.rs:9-16 | src/renderer/layout/table_layout/stored_mixed_opening_frame.rs:287-294 | src/renderer/render_normalization/stored_nested_text_frames.rs:45-52 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement/stored_nested_before_host.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_nested_before_host.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f85cf8fb0ec643d703e0300e92683a2a4a9d95275b0d0fe36a2b6fc07cc7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/serializer/hwpx/master_page.rs:91-100 | src/serializer/hwpx/section.rs:4045-4054 | src/serializer/hwpx/section.rs:4955-4964 | src/serializer/hwpx/section.rs:5008-5017 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/master_page.rs\u0060 and \u0060src/serializer/hwpx/section.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/master_page.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/serializer/hwpx/master_page.rs:90\u0060 calls \u0060effective_style_id\u0060 and \u0060src/serializer/hwpx/section.rs:5007\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/master_page.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88b93a64735998ff5ad6f8036e8d86e09ea89ddcdf0c5f0482d04e3e5f92c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): src/serializer/hwpx/section.rs:3480-3486 | src/serializer/hwpx/section.rs:5001-5007 | src/serializer/hwpx/shape.rs:733-740 | src/serializer/hwpx/table.rs:510-517 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/section.rs\u0060 and \u0060src/serializer/hwpx/shape.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee76480eb8495396df85285bcb7a0a0e64d8232ef3fb81d698f692699a02d3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/bin/rhwp-agent/stats.rs:25-32 | src/bin/rhwp-agent/stats.rs:70-77 | src/bin/rhwp-agent/stats.rs:132-139 \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":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e57ced1f81ae93ddbd139d58d8cb4a2bc2c9cf71ee850bd59668524004604c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:124-131 | src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:24-31 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:24-31 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:124\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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d630ab7f0ff9fc4a1cf6d03baedda82f5a06de690a811cf344187f087fe55167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-markdown.rs:53-60 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:52-59 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:53-60 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-markdown.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-images.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 166 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-markdown.rs:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-markdown.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8834f00c59010bbd8bd645ff1ccfb0f8f29bda26f7eeee8b2dd4fcda7e85355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/bin/rhwp-q/pack/inventory.rs:419-426 | src/bin/rhwp-q/pack/inventory.rs:1019-1026 | src/bin/rhwp-q/pack/inventory.rs:1044-1051 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/pack/inventory.rs:419\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c3eba6192a9aee473360b3103a972e327c9c586492f9697a707cd5959a44da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/cli/protocol/exchange/disclosure.rs:21-28 | src/cli/protocol/exchange/disclosure.rs:224-231 | src/cli/protocol/exchange/settlement.rs:175-182 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/disclosure.rs\u0060 and \u0060src/cli/protocol/exchange/settlement.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/disclosure.rs:21\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":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d5f827070a0fbdc0881173cd0b3758853659fb5b81d0cc553342b238fa1c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/document_core/commands/clipboard.rs:925-931 | src/document_core/commands/foreign_paste.rs:164-170 | src/document_core/commands/html_import.rs:226-233 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:925\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"65819b8a1fcaf434ee33224e6d41cb22e477706af31240bbda512384ec7e0f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/document_core/commands/text_editing.rs:5281-5289 | src/document_core/commands/text_editing.rs:6563-6571 | src/document_core/commands/text_editing.rs:6613-6620 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/text_editing.rs:5281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1a9bea2b586baa851cfcdd51203381430f7a42d32d594796c68815c7f7d926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:1989-1996 | src/document_core/queries/cursor_rect.rs:5419-5426 | src/document_core/queries/cursor_rect.rs:5957-5964 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:1989\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 \u0060run\u0060 to \u0060\u0026RunInfo\u0060 in one and \u0060\u0026HfRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e658d23c0a1f9ba9067b7cbfacb09e5a28c38f8f45264117e2b68c18162804f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/document_core/queries/hwpctrl_sets.rs:1031-1038 | src/document_core/queries/hwpctrl_sets.rs:1105-1112 | src/document_core/queries/hwpctrl_sets.rs:1172-1179 \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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1481d9c31df5f14244b91de0c22ace7bc87e75be889d843248a2ee8c0bd64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/parser/hwpx/section.rs:2610-2619 | src/parser/hwpx/section.rs:2950-2959 | src/parser/hwpx/section.rs:3075-3084 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/section.rs:2621\u0060 calls \u0060default\u0060 and \u0060src/parser/hwpx/section.rs:2962\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"835262daf5f6a2c2eff9a6d30940ba85dfe6cd15d630001e922efa6a74596102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/parser/pdf/table_detection.rs:1033-1041 | src/parser/pdf/table_hierarchy.rs:152-161 | tools/pdf-ir-poc/src/table_hierarchy.rs:134-142 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:1033\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f1a587b3e2fd39a8f05a521589e43d2a79bdfa5a46565719e5f4e180ec073f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/canvas.rs:333-340 | src/renderer/svg.rs:1487-1494 | src/renderer/web_canvas.rs:1810-1817 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"56118b60a3d5343b9333325de686a0ec6db9911d4929f58ce17c5eaa042c4dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/renderer/equation/canvas_render.rs:431-437 | src/renderer/equation/svg_render.rs:501-507 | src/renderer/skia/equation_conv.rs:586-593 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:431\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"87abcc94a030379f6c406aa3b044d1df5130266f76c4e9e95d3b3f0553022e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): src/renderer/float_placement/stored_column_spacing.rs:71-76 | src/renderer/layout/table_layout.rs:2735-2742 | src/renderer/layout/table_layout.rs:14852-14858 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement/stored_column_spacing.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_column_spacing.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebf758181bf54cade8f137cb33cf8854b4f0ebdf159731d232e46dd78b0bfb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/html.rs:497-504 | src/renderer/svg.rs:4238-4245 | src/renderer/web_canvas.rs:3378-3385 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:497\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":"src/renderer/html.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c250acd8b93cd36f811b9b8c13f510439deaf74f314e08945c70c270cf45df08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): src/renderer/layout/table_layout.rs:2492-2498 | src/renderer/layout/table_layout.rs:2539-2545 | src/renderer/layout/table_layout/empty_line_flow.rs:266-273 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:2492\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1d1bf0eeeee1d9616db8e451ffceec2071b448520a2edc7433f2944fbfb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/layout/table_layout.rs:20959-20966 | src/renderer/layout/table_layout.rs:21046-21053 | src/renderer/layout/table_layout.rs:21935-21942 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:20959\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":20959}}}],"partialFingerprints":{"codehealthFindingId/v1":"def2782f4537edae03525f95fb92afd3b822c264042600f07785539dac197e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/layout/table_layout.rs:21376-21383 | src/renderer/layout/table_layout.rs:24205-24212 | src/renderer/layout/table_layout/stored_inline_row_frame.rs:24-31 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21376}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ce16c838bd4f88730deb72a10e08460de79504c9624a7f808e4c9565e42c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/layout/table_layout.rs:22241-22248 | src/renderer/layout/table_layout.rs:22278-22285 | src/renderer/layout/table_layout.rs:22338-22345 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:22241\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22241}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ebaee3ee40b7dfb3b20c93d988a43c244eaa81dc1892bcd9faeb41d54dc299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/pagination/engine.rs:1127-1136 | src/renderer/pagination/engine.rs:1170-1177 | src/renderer/typeset/controls/host_wrap.rs:32-39 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/controls/host_wrap.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:1127\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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba7143a0f95eb64f5b9b43ecae29940bd99e29c491f615f1693494745cf68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/wmf/converter/svg/mod.rs:720-727 | src/wmf/converter/svg/mod.rs:1186-1193 | src/wmf/converter/svg/mod.rs:1363-1370 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:720\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4811c80bbcc614e992862258fb49224c508cef065e7d3eebbeb7d7d55c44a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rhwp-password-crypto/src/lib.rs:776-783 | crates/rhwp-password-crypto/src/lib.rs:971-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-password-crypto/src/lib.rs:776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-password-crypto/src/lib.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2042e750f0b252766b0cd85c1b32a1d356bf7afcc6a13cb9636e7556ddb3c2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-agent/envelope.rs:228-235 | src/bin/rhwp-agent/inspect.rs:411-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/envelope.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9473061e9828646c5dcb033eb94746e05952de26e4fda684987e89aeca9c6171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-agent/fingerprint.rs:65-72 | src/bin/rhwp-agent/inspect.rs:45-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":"src/bin/rhwp-agent/fingerprint.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d10b5fae6d5cbac6adac3cb86e63cd83bf7d08e85fa23dc10d0c0e334946351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-agent/stats.rs:112-119 | src/bin/rhwp-agent/stats.rs:242-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8135dec1f3c11af0e78648449a04b2ff1c7e1e0425b9c763ba9ce259fe7768e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:73-80 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:73-80 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cffce21e80e3b255363742608f6be8100328ca4c72c58574e85f1e9c5881103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/kit/cell_shape.rs:13-20 | src/bin/rhwp-q/kit/footnote_footholds.rs:9-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fee18107658224a7f97fa215d0eb107fb0e99b24303aec736b0713cf5dbacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:113-120 | src/bin/rhwp-q/pack/inventory.rs:786-793 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-q/pack/inventory.rs:113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc42db4ff28fbeb06c6d51b2ae1b8c0eccf413a0053816e197144f07d32bb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:682-689 | src/bin/rhwp-q/pack/inventory.rs:1326-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/pack/inventory.rs:682\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"74718d7b5f6de5bacf362905edd9d24bc38ed820d43206ac84d167a2bbaea803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/commands/edit/bookmarks.rs:34-41 | src/cli/commands/edit/bookmarks.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670fcb5b1a1b457198fc3e52af4ed7ecbbe62767a3a194d18e2bab6826337e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/commands/edit/formatting.rs:81-88 | src/cli/commands/edit/formatting.rs:219-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/cli/commands/edit/formatting.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"65293cfba93c5d9f8b6590fc351e70eeb9353c229aaf7ac6a12a5877472f9c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/protocol/harness.rs:166-174 | src/cli/protocol/harness.rs:372-380 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/harness.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/harness.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523e10a6f32841736d7b4f1d8f523a5d0f57054e4151b540e1a6429bbf9531f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/queries/control_dump/story.rs:127-142 | src/cli/queries/control_dump/story.rs:259-274 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/control_dump/story.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/control_dump/story.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"500491c40020a7acfb32dd8407cb7d1ef86403b6b55c40c6f92c68c0b5af8b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/diagnostics/hwp5_inventory_diff.rs:387-393 | src/diagnostics/hwp5_inventory_diff.rs:443-450 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/hwp5_inventory_diff.rs:387\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c27f46c322bbf57532196a8eb7ce0c2b9ec0c4bba4f6a1a36ccd01f7681e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:640-647 | src/diagnostics/hwpx_roundtrip_batch.rs:476-483 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:640\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c6832bc4dfadec85345a1c3e40356023398247fe1e2def8847ea3e46a18cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/commands/clipboard.rs:627-634 | src/document_core/commands/clipboard.rs:1573-1580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"613cebb2b45365b7a754a54a0a739ff86ad2902a88262d34daab5967556c6175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/commands/document.rs:772-779 | src/document_core/commands/document.rs:2364-2371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"636fda8d49675934fba2daf617e1949baf54924fe3bfdd437a7fd251c5327fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:482-489 | src/document_core/commands/object_ops/table.rs:1121-1128 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/table.rs:482\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fa752c3915571a4029f11f8f70ae1a87a92af9600c348a9b5339775671cf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/commands/text_editing.rs:4550-4557 | src/document_core/commands/text_editing.rs:4606-4613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d497dc35089c407909fd8f4aecea6b68df96f3ab921a5f341f0f33dc366a4427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/html_table_import.rs:689-696 | src/document_core/html_table_import.rs:1001-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2358ae3e9f5cbe4e48a5622fee50d6fa18a70af68acc4c5d1b6c2aedc26c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/document_core/inline_control.rs:235-240 | src/document_core/inline_control.rs:783-790 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/inline_control.rs:235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/inline_control.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f011b21849d67779e137c56ab08a382c0e9d5a49dbda7cb16b00269125b686d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/native_pua_fonts.rs:297-304 | src/document_core/queries/rendering.rs:5044-5051 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn rebuild_derived_state(\u0026mut\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":"src/document_core/native_pua_fonts.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"971042522fe490a2927ca0ed57b88812511fd2c9f9317e8868b101b3603a59ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/queries/injection_scan.rs:168-175 | src/document_core/queries/injection_scan.rs:195-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/injection_scan.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bb2aa286090681e0c0caf77b0af4f11183da1514fa7bc9e4521f878c55fd02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/queries/injection_scan.rs:566-575 | src/document_core/queries/injection_scan.rs:613-620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbac71bc4678200d75cc9fdaf5ff97146853ea108b3b702d5290b6eebeedace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/queries/rendering.rs:1803-1810 | src/document_core/queries/rendering.rs:2581-2588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c996b957c54f106b1d7c8f49b7b5eeb91c3851e45b99813214ab7753f1388e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/model/hyperlink.rs:40-47 | src/model/hyperlink.rs:148-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":"src/model/hyperlink.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37af1acfdccbc831ca36efa73ffdac2533fd302075537753dc490d2157afcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/model/table.rs:2268-2275 | src/model/table.rs:2400-2407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f57bd213467c6200dcd01a52560854fa958f7e454dcd7e682682f2c19c94ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/native_host/gpu_d3d.rs:645-652 | src/native_host/gpu_metal.rs:427-434 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9a6288b154bed7827602f19857538c6428ad08ae7530765aa4965e0dce3388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/paint/equation_print_frame.rs:13-19 | src/paint/paper_viewport.rs:267-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/paint/equation_print_frame.rs:13\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sources\u0060 to \u0060\u0026HashSet\u003CNodeId\u003E\u0060 in one and \u0060\u0026std::collections::HashSet\u003Cu32\u003E\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":"src/paint/equation_print_frame.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcf13272f6c9db44be9cec93493efbee6df389044ed6e340319b833ad91b887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/paint/metafile_print/replay.rs:169-176 | src/paint/metafile_print/text.rs:195-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/paint/metafile_print/replay.rs:169\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile_print/replay.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5e2e399c68b6aba79e8b9bf7d5cf08f83fdbe2f9d318b7fbdd1ee514d92db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/control/shape.rs:172-180 | src/parser/control/shape.rs:784-791 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/control/shape.rs: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":"src/parser/control/shape.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb802ba49831fbb885124132fdd7e2fae8e95a991a4aa96fcb77d5b8ba63288d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/hwp3/mod.rs:1488-1495 | src/parser/hwp3/mod.rs:1496-1503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae1b050d6a9da0f2d502e6d9c0b03a414265290d676feb544c23e7b6aa6827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/parser/hwp3/mod.rs:2438-2444 | src/parser/hwp3/mod.rs:2448-2455 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwp3/mod.rs:2438\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":"src/parser/hwp3/mod.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb6f4f1f33f0bdfc48fe4577ce37e5e11829f038149468c375ddc5258c32cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/parser/hwp3/mod.rs:2659-2668 | src/parser/hwp3/mod.rs:2673-2682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea857f0f66bb125fd53c6376a7e9d0ea08e33abd4ee452382ab9117d5d668da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/hwpx/section.rs:269-276 | src/parser/hwpx/section.rs:285-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb4005bdd746df83b92dcee6c7b9712ec9acca2b10b056ff9da14dca4bba89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/hwpx/section.rs:3172-3179 | src/parser/hwpx/section.rs:3827-3834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6317990fb1a61b4acd6d61cf125b846560ad0a8b1883bfdddf19838dd6a8eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/lowering.rs:654-661 | tools/pdf-ir-poc/src/lowering.rs:342-349 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/lowering.rs:654\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9ed1a616c7f7587ec8e088300aacfd5926575d88ec3cfe7a7e5e00109988a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/lowering.rs:843-850 | tools/pdf-ir-poc/src/lowering.rs:269-276 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/lowering.rs:843\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82825a4c6ca51026fcdbe17b4196e67b3e3208cff538955b4721a74ff89d529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/parser/pdf/recognition.rs:812-819 | tools/pdf-ir-poc/src/recognition.rs:554-559 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:812\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"f736b0354fa7c0ba7a55fe64ae7d5ac9d2d337ef1777be3d8209384442e5b5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2277-2284 | tools/pdf-ir-poc/src/structured_lowering.rs:800-807 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce59dc8394eb88e3f1ecb20af3f1fb131fffd72a3c3f6e0b3546220c816600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/structured_lowering/body.rs:59-66 | src/parser/pdf/structured_lowering/body.rs:136-143 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/structured_lowering/body.rs:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering/body.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f9edcf3bdec70c3e482f8b8d04814247484d593641e95c874f226ef3eafe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/table_detection.rs:723-730 | tools/pdf-ir-poc/src/table_detection.rs:430-437 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:723\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a1c6e449abec775f206b0e0e4fa57888da61adfd40f9238f9c223655c42875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/table_topology.rs:28-35 | tools/pdf-ir-poc/src/table_topology.rs:17-24 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. 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":"src/parser/pdf/table_topology.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cf2820ed544c9533cfe81f8ed8c6f0b6020f10660ac2e78541cd219a476bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/bitmap_raster.rs:250-257 | src/renderer/bitmap_raster.rs:268-275 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/bitmap_raster.rs:250\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":"src/renderer/bitmap_raster.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb8ec0ef8d8e0f613f164dbcd9f33efdf5f7fc6479959b1a31f6f3ec7b7f840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/canvas.rs:138-145 | src/renderer/svg.rs:1022-1029 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/canvas.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9699380c055a1460782a6d47e7ed2e9ac77b61ab5d65d58249fac93414d126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/composer/equation_line_metrics.rs:123-130 | src/renderer/composer/equation_line_metrics.rs:139-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f320d17ae71892e215ffb76349f03e9a0062eea687e6473cacc9609c19a6a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/composer/equation_line_metrics.rs:172-179 | src/renderer/composer/equation_line_metrics.rs:301-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/equation_line_metrics.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/composer/equation_line_metrics.rs:300\u0060 calls \u0060filter\u0060, \u0060is_empty\u0060 and \u0060src/renderer/composer/equation_line_metrics.rs:171\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace44439fa07fdc7db59b188b8e1bac51a7573ba74e5db1e3e6268a0847caca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/composer/equation_line_metrics.rs:182-189 | src/renderer/composer/equation_line_metrics.rs:449-456 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/composer/equation_line_metrics.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e1b77dcfeae1ce4a74705820eab7ce8ce85df285f6d81406513135cd1f8355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/composer/inline_control_projection.inc.rs:124-131 | src/renderer/composer/inline_control_projection.inc.rs:179-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/inline_control_projection.inc.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"566816bfc07bf50c27ff3a8925735ae86d79488147ea91ae49bdb2d5bd5108fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/float_placement.rs:4775-4782 | src/renderer/float_placement.rs:5167-5174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"27130caa9527d2897a08f3d31282520f5e67ce72581a6e5a6042581cbc20148e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/float_placement.rs:5017-5024 | src/renderer/float_placement.rs:5327-5334 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/float_placement.rs:5017\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5017}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d678be9ca77d9466114be2883d6e43f2ad0add9df4667780520e79a7f85909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/float_placement.rs:5313-5320 | src/renderer/float_placement.rs:5393-5400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/float_placement.rs:5401\u0060 calls \u0060is_some\u0060 and \u0060src/renderer/float_placement.rs:5321\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":5313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146f03c3b64dac5b39dd2a2e711be62aa6dd952f0b81e0b32811b458879ebb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/renderer/float_placement.rs:8413-8418 | src/renderer/float_placement.rs:8430-8437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":8413}}}],"partialFingerprints":{"codehealthFindingId/v1":"896a0525776524e07013ca720a39e57827c53595c6173a68bade4ca7d57ee73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/float_placement/stored_header_frame.rs:111-118 | src/renderer/layout/table_layout/stored_text_frame_owner.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":"src/renderer/float_placement/stored_header_frame.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"594057c8759976cfbb8efcb99b66314c91f4066234abb81547f6fc39dca8689b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:736-743 | src/renderer/height_measurer.rs:763-770 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:736\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":"src/renderer/height_measurer.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"668c51e808d808b6997520fed305cee19ecc7279dc658edd058a34ef7a7c7e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:1214-1221 | src/renderer/layout/table_layout.rs:13422-13429 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f707b4126e243d6220b3ee75cd58db9d3b109b35c86b1fea9b40d694dbcde60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:2326-2333 | src/renderer/typeset/paragraph/format.rs:349-358 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/typeset/paragraph/format.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2326\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":"src/renderer/height_measurer.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"775d69391118f873a8ddb82d12b1b5edabcdbd374c6ceeec44e78a3b791777aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/height_measurer.rs:2540-2546 | src/renderer/height_measurer.rs:2553-2560 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:2540\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/height_measurer.rs:2538\u0060 calls \u0060skip\u0060 and \u0060src/renderer/height_measurer.rs:2551\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61007b432f9502a903a65a7d240e095acc0264c5cf198c03feadc1527612e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:2843-2850 | src/renderer/height_measurer.rs:5529-5536 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:2843\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6445d305e5f2165c9b821f9292515185ee0b0aa96894ea2eb12480641c75d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:4338-4345 | src/renderer/height_measurer.rs:5271-5278 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:4338\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c982eb285745fe689cbf132f7e489bc45e0fe4d4a9813bc701482809ca50d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/height_measurer.rs:5531-5538 | src/renderer/table_row_frame.rs:271-277 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"990da8b8b72ebdbdc6dd6fb657e16b67238cd907fe2b26a21e78a79c00f1594c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_measurer.rs:6771-6778 | src/renderer/layout/table_layout.rs:5109-5116 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:6771\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":"src/renderer/height_measurer.rs"},"region":{"startLine":6771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7136da653ee676c08c42d8552f8a93445bb473b6222e7dab13193672f008a150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout.rs:14378-14385 | src/renderer/typeset.rs:5773-5779 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":14378}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a3785917feef0d95530dc78c1bacdcfcfba79e59c5bf1e6aed283be004773f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout.rs:14790-14797 | src/renderer/layout.rs:16905-16912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":14790}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1e0a64fdbd958723b5c22e74d57482704c9fc44cb11f5c7809b69c674ac5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/anchor_box_flow.rs:29-36 | src/renderer/layout/fixed_textbox_flow.rs:12-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/layout/anchor_box_flow.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4ad77c856a4bf3b7e6c2ab4fcd2cbde5d0af20f62db0204d8e99a2c83ed361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/border_rendering.rs:678-685 | src/renderer/layout/border_rendering.rs:763-770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c95a00fe5093471559a43ca32b750c57479b6b46f3a30a5632f7573b46133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/border_rendering.rs:810-817 | src/renderer/layout/border_rendering.rs:818-825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef0ab418d6e9e55a6c2ee8f6746e78d7a2b87c4d78ae944dec11d25d0890697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/border_rendering.rs:878-885 | src/renderer/layout/border_rendering.rs:889-895 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:878\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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b67b4128a3eabfaaf1574eacbed2fea70463be30769f5c6f0ceafaa9eb7e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/border_rendering.rs:918-925 | src/renderer/layout/border_rendering.rs:1078-1085 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bfd30480bdbff7b276ae4ddfff6863cbf414e51b1429793c13859bb3645d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/border_rendering.rs:940-947 | src/renderer/layout/border_rendering.rs:952-959 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/border_rendering.rs:940\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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bd54a39027b35b5c8647fc1795069fc6561eefe763eab58f103327f96c2bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:1264-1271 | src/renderer/typeset.rs:1482-1489 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b084d66a187e9807e74f69351c8f19f4cff3900931f5711f3f16722a2f801cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:1487-1494 | src/renderer/layout/paragraph_layout.rs:9444-9450 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:9444\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"df490c13dedabbdfe94e983933d50051e0bca77696a7a9bc09c59a93287b7198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:9703-9712 | src/renderer/layout/paragraph_layout.rs:9799-9806 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/paragraph_layout.rs:9703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/paragraph_layout.rs:9798\u0060 calls \u0060min\u0060, \u0060saturating_sub\u0060, \u0060is_some\u0060 and \u0060src/renderer/layout/paragraph_layout.rs:9703\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":9703}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7bc6c1ef54194d3ad2dbed4a24ed271a7df4f18c37d6ccbe364b9f9144c8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/picture_footnote.rs:529-536 | src/renderer/layout/table_cell_content.rs:701-707 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/layout/picture_footnote.rs:529\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":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34aec88789b81ea4e95d0f603239aacde847f7057ff41a6b36a302364ec00ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/renderer/layout/table_layout.rs:5633-5640 | src/renderer/layout/table_layout.rs:5642-5649 | src/renderer/layout/table_layout.rs:5650-5663 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:5633\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5633}}}],"partialFingerprints":{"codehealthFindingId/v1":"244243b14c1b0b97f667d3b01a0b638e2b79c711d3287044c582cf23bf2dd2ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:6894-6901 | src/renderer/layout/table_layout.rs:6922-6929 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:6922\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/layout/table_layout.rs:6935\u0060 calls \u0060hwpunit_to_px\u0060 and \u0060src/renderer/layout/table_layout.rs:6905\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":6894}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc947757fd2cc3a3f326a6523397b6be88656eefe5d429f1768aca2fc85f938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:10403-10410 | src/renderer/layout/table_partial.rs:5562-5569 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":10403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05be133a3be00f0126a4fc6325ad6161468ef0e02dd9472c7ad4e29f4b9bb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:13803-13810 | src/renderer/layout/table_layout.rs:13816-13823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13803}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d1e439889bea0479c4020d90651ecf578f1ebd95b7c97dca29fee782030d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:23174-23181 | src/renderer/layout/table_layout.rs:23856-23863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23174}}}],"partialFingerprints":{"codehealthFindingId/v1":"34da4d336eac9e35edbcb3b6ad7dfeccf1947eb0c5ce1be071878fc67a46b4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/table_layout.rs:24265-24272 | src/renderer/layout/table_layout/stored_text_frame_owner.rs:242-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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3287a5b3ac23c1b04d086a3fafca0967cb70517c38167ba43e7d575265f56892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:28174-28181 | src/renderer/layout/table_layout.rs:28327-28334 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:28174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28174}}}],"partialFingerprints":{"codehealthFindingId/v1":"da72f75faacd1089926cb3f5f0fbd00ec7c543336372d0e04253481c32bbaa9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout.rs:28449-28456 | src/renderer/layout/table_layout.rs:28479-28486 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:28449\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/table_layout.rs:28478\u0060 calls \u0060max\u0060 and \u0060src/renderer/layout/table_layout.rs:28448\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":28449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b520fddc8488ded12b1980e29087d994b7bb228cdbe7bad9818dd78cc09b7ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/table_layout/empty_line_flow.rs:56-63 | src/renderer/stored_page_origin.rs:292-298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb177f361d719d070113e60b293b43baa1c561c248379be3d6e8976ec5fb0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_layout/row_physical_band.rs:144-151 | src/renderer/layout/table_layout/row_physical_band.rs:277-284 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout/row_physical_band.rs:144\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, \u0060src/renderer/layout/table_layout/row_physical_band.rs:285\u0060 calls \u0060unit_owns_stored_inline_table_frame\u0060 and \u0060src/renderer/layout/table_layout/row_physical_band.rs:152\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/row_physical_band.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"153b0a9f01109b2d0c366dc30141dc81ca429bb9827b7e823a8ed01b07a49c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/layout/text_measurement.rs:604-611 | src/renderer/layout/text_measurement.rs:785-791 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/text_measurement.rs:604\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":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab2233a1c2d3fdb988bcdab5f5eae341ac0569ea7f64ba251a620668c2c6e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/skia/glyph_replay.rs:463-470 | src/renderer/skia/glyph_replay.rs:484-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcc22fcfe0014b6239f701f1fbf28f8ed81c6e1fc1edf088e62432662e45241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/skia/metafile_print.rs:61-68 | src/renderer/skia/print_image_sampling.rs:113-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/skia/metafile_print.rs:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/metafile_print.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a054bee0301b8b1103e1d2743771f030deb03435c72897b9f17bc5517c3cb295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/skia/synthetic_typeface.rs:104-111 | src/renderer/skia/synthetic_typeface.rs:151-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/skia/synthetic_typeface.rs:103\u0060 calls \u0060to_font_bytes\u0060 and \u0060src/renderer/skia/synthetic_typeface.rs:150\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/synthetic_typeface.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d37c330a7b898ea12c747b1e8d072ef25dba0d29cac082b6c79aaa7850bcad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/skia/text_replay/decorations.rs:60-77 | src/renderer/skia/text_replay/lines.rs:110-127 \u2014 before extracting anything, compare \u0060src/renderer/skia/text_replay/decorations.rs\u0060 and \u0060src/renderer/skia/text_replay/lines.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/text_replay/decorations.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb73ac012bc50054568da0e93dc0b3353df22da156fdb9616aadb912667dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/renderer/svg.rs:1297-1304 | src/renderer/svg.rs:1344-1350 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:1297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaadc2729cf2edfb857fcc789aae8d6cc0860b29c84e9aaab4aec1794b0ef9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/svg.rs:2515-2523 | src/renderer/web_canvas.rs:4440-4447 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:2515\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4e0e8b592c3ab13989987b474c9e2e6f27f3f01092c2a2ef3921dfa3e96fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/svg.rs:3433-3441 | src/renderer/web_canvas.rs:2689-2696 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b96472fee03bff0313f5c041ccbd71b273c9df105a5ab71cc3f111a428299f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/svg_layer.rs:96-103 | src/renderer/svg_layer.rs:144-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg_layer.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg_layer.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da0460bc943668f2db5863dff219fd38512a99856cc1ac18508e1477b93c7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/security_trailer.rs:248-255 | src/security_trailer.rs:472-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":"src/security_trailer.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"874231e7e144e8c533296948405097859b69d07c3ce31809ced4d4dd70681888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/serializer/body_text.rs:1164-1171 | src/serializer/body_text.rs:1242-1249 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/body_text.rs:1164\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":"src/serializer/body_text.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b38799c6509db80cf5476b2d99d14d64d532be9f1174f626e519b833170f4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/serializer/hwpx/writer.rs:78-85 | src/serializer/hwpx/writer.rs:90-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/writer.rs:78\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/writer.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ea4874c7bbd94a16a6e89b9d4cd87f8750cbeb27a40dfe2122340d7168a27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/wmf/parser/objects/structure/color_ref.rs:31-38 | src/wmf/parser/objects/structure/rgb_quad.rs:34-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/color_ref.rs:31\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":"src/wmf/parser/objects/structure/color_ref.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77c9a1139e93cdd6c9ab9cbb12abf8fd4ef8ce8b69c6b7fa1322fa03a84bed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 17): src/cli/commands/edit/bookmarks.rs:143-149 | src/cli/commands/edit/controls.rs:15-21 | src/cli/commands/edit/document_objects.rs:278-284 | src/cli/commands/edit/document_objects.rs:416-422 | src/cli/commands/edit/document_text.rs:730-736 | src/cli/commands/edit/equations.rs:260-266 | src/cli/commands/edit/formatting.rs:18-24 | src/cli/commands/edit/formatting.rs:158-164 | src/cli/commands/edit/formatting.rs:597-603 | src/cli/commands/edit/header_footer_properties.rs:16-22 | src/cli/commands/edit/media.rs:809-815 | src/cli/commands/edit/media.rs:907-913 | src/cli/commands/edit/note_content.rs:17-23 | src/cli/commands/edit/note_content.rs:577-583 | src/cli/commands/edit/notes.rs:205-211 | src/cli/commands/edit/shapes.rs:187-193 | src/cli/commands/edit/shapes.rs:461-467 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4a1136aa31d9d892c24fa82aa3afaabe608d0f878e891d3018bb1f7aaa6fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 14): src/cli/commands/edit/bookmarks.rs:143-149 | src/cli/commands/edit/controls.rs:15-21 | src/cli/commands/edit/document_objects.rs:278-284 | src/cli/commands/edit/equations.rs:260-266 | src/cli/commands/edit/header_footer_properties.rs:16-22 | src/cli/commands/edit/media.rs:809-815 | src/cli/commands/edit/media.rs:907-913 | src/cli/commands/edit/note_content.rs:17-23 | src/cli/commands/edit/note_content.rs:354-360 | src/cli/commands/edit/note_content.rs:464-470 | src/cli/commands/edit/note_content.rs:577-583 | src/cli/commands/edit/notes.rs:205-211 | src/cli/commands/edit/shapes.rs:187-193 | src/cli/commands/edit/shapes.rs:461-467 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec97c70b44ce81c86140c94cfc3d1a5e382ae112e3d285341dbeb060ba712f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13): src/cli/commands/edit/document_objects.rs:152-158 | src/cli/commands/edit/document_text.rs:234-240 | src/cli/commands/edit/document_text.rs:344-350 | src/cli/commands/edit/document_text.rs:480-486 | src/cli/commands/edit/document_text.rs:615-621 | src/cli/commands/edit/document_text.rs:838-844 | src/cli/commands/edit/document_text.rs:934-940 | src/cli/commands/edit/document_text.rs:1031-1037 | src/cli/commands/edit/equations.rs:128-134 | src/cli/commands/edit/note_content.rs:354-360 | src/cli/commands/edit/note_content.rs:464-470 | src/cli/commands/edit/notes.rs:15-21 | src/cli/commands/edit/notes.rs:110-116 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd28ce20a93f23f5869a31eedf04d6fdbf4f0ea6795f6b091333484816ab6a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/cli/commands/edit/cell_paragraphs.rs:18-24 | src/cli/commands/edit/cell_paragraphs.rs:175-181 | src/cli/commands/edit/cells.rs:495-501 | src/cli/commands/edit/cells.rs:665-671 | src/cli/commands/edit/cells.rs:838-844 | src/cli/commands/edit/formatting.rs:298-304 | src/cli/commands/edit/formatting.rs:714-720 | src/cli/commands/edit/formatting.rs:866-872 | src/cli/commands/edit/tables/grid.rs:338-344 | src/cli/commands/edit/tables/grid.rs:585-591 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a896bb969a39ba4e8615436496d21c68a5dc886db34a71523eb5d3fe10f6b79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/cli/commands/edit/document_objects.rs:152-158 | src/cli/commands/edit/document_text.rs:344-350 | src/cli/commands/edit/document_text.rs:480-486 | src/cli/commands/edit/document_text.rs:730-736 | src/cli/commands/edit/document_text.rs:1031-1037 | src/cli/commands/edit/equations.rs:128-134 | src/cli/commands/edit/formatting.rs:18-24 | src/cli/commands/edit/notes.rs:15-21 | src/cli/commands/edit/notes.rs:110-116 | src/cli/commands/edit/shapes.rs:21-27 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/shapes.rs:18\u0060 calls \u0060to_string\u0060 and \u0060src/cli/commands/edit/document_objects.rs:151\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab4aa1cb23b42557f0daca7e104b6ba85487613bc2dc9e0e0e20c65fa896028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/cli/protocol/capsule/signing.rs:6-12 | src/cli/protocol/exchange/bundle.rs:8-14 | src/cli/protocol/exchange/bundle.rs:217-223 | src/cli/protocol/exchange/disclosure.rs:6-12 | src/cli/protocol/exchange/disclosure.rs:209-215 | src/cli/protocol/harness.rs:5-11 | src/cli/protocol/trust/anchor.rs:8-14 | src/cli/protocol/trust/anchor.rs:83-89 | src/cli/protocol/trust/anchor.rs:158-164 | src/cli/protocol/trust/governance.rs:443-449 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/exchange/bundle.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:6\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"34652801edfb10d9cba46740687ad7693844b101b62025881bcac43f4be62983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): src/doclang/writer/escape.rs:50-56 | src/document_core/hwpjson/ctx.rs:203-209 | src/eps.rs:1930-1936 | src/model/control.rs:564-570 | src/ole_chart/svg_renderer.rs:409-415 | src/parser/hwpx/section.rs:6192-6198 | src/renderer/equation/svg_render.rs:770-776 | src/renderer/html.rs:584-590 | src/renderer/pdf.rs:1811-1817 | src/renderer/svg.rs:4411-4417 \u2014 before extracting anything, compare \u0060src/doclang/writer/escape.rs\u0060 and \u0060src/ole_chart/svg_renderer.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/doclang/writer/escape.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/doclang/writer/escape.rs:57\u0060 calls \u0060push_str\u0060 and \u0060src/model/control.rs:571\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/escape.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7639ce078f5c7353ee9ad14f097f806bc6717246ac7dfac9c0a364a82403435c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): src/bin/rhwp-q/kit/field_by_id.rs:93-100 | src/bin/rhwp-q/kit/field_info_at.rs:107-114 | src/bin/rhwp-q/kit/form_at.rs:107-114 | src/bin/rhwp-q/kit/form_value.rs:117-124 | src/bin/rhwp-q/kit/hf_edit_target.rs:104-111 | src/bin/rhwp-q/kit/hit_fn_marker.rs:108-115 | src/bin/rhwp-q/kit/hit_in_footnote.rs:108-115 | src/bin/rhwp-q/kit/hit_in_hf.rs:132-139 | src/bin/rhwp-q/kit/para_bounds.rs:88-95 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/field_by_id.rs\u0060 and \u0060src/bin/rhwp-q/kit/field_info_at.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/field_by_id.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"06289919494c63cfb470c6f8f888b4c1fbb229f803369e39ec70ae9b1c81c369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): src/bin/rhwp-q/more/inventory.rs:220-226 | src/bin/rhwp-q/more/inventory.rs:247-253 | src/bin/rhwp-q/more/inventory.rs:274-280 | src/bin/rhwp-q/more/inventory.rs:1211-1217 | src/bin/rhwp-q/more/inventory.rs:1238-1244 | src/bin/rhwp-q/pack/inventory.rs:495-501 | src/bin/rhwp-q/pack/inventory.rs:909-915 | src/bin/rhwp-q/pack/inventory.rs:936-942 | src/bin/rhwp-q/pack/inventory.rs:1297-1303 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb3662ce15ed17afb3d13d4f000cc57f452a24503120adb31d6b9a9c951807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): src/cli/commands/edit/cells.rs:838-844 | src/cli/commands/edit/formatting.rs:298-304 | src/cli/commands/edit/formatting.rs:714-720 | src/cli/commands/edit/formatting.rs:866-872 | src/cli/commands/edit/tables/grid.rs:229-235 | src/cli/commands/edit/tables/grid.rs:338-344 | src/cli/commands/edit/tables/grid.rs:478-484 | src/cli/commands/edit/tables/grid.rs:585-591 | src/cli/commands/edit/tables/structure.rs:14-20 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 232 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:838\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d87d0045258c89247cbe7bd5537fd5bee9f821312d76a0cc86428f18a563b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): src/document_core/queries/hwpctrl_sets.rs:1024-1030 | src/document_core/queries/hwpctrl_sets.rs:1098-1104 | src/document_core/queries/hwpctrl_sets.rs:1158-1164 | src/document_core/queries/hwpctrl_sets.rs:1302-1308 | src/document_core/queries/hwpctrl_sets.rs:1652-1658 | src/document_core/queries/hwpctrl_sets.rs:1708-1714 | src/document_core/queries/hwpctrl_sets.rs:1754-1760 | src/document_core/queries/hwpctrl_sets.rs:2059-2065 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa454533329bb8bd0ffa4833adcb2a38f1a4e1c5bebf8c2b5b4ec9046c2512c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 7): src/bin/rhwp-q/more/inventory.rs:463-469 | src/bin/rhwp-q/more/inventory.rs:490-496 | src/bin/rhwp-q/more/inventory.rs:960-966 | src/bin/rhwp-q/more/inventory.rs:1292-1298 | src/bin/rhwp-q/pack/inventory.rs:417-422 | src/bin/rhwp-q/pack/inventory.rs:1017-1022 | src/bin/rhwp-q/pack/inventory.rs:1042-1047 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:463\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"033482ef651f1d410f5d8b72f7ed948260acfbbd413a4262baa22fda8b30c07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): bindings/Native/src/lib.rs:498-504 | src/document_core/queries/bookmark_query.rs:461-467 | src/document_core/queries/field_query.rs:2754-2760 | src/render_backend/fixture.rs:90-96 | src/renderer/render_tree.rs:448-454 \u2014 before extracting anything, compare \u0060src/document_core/queries/bookmark_query.rs\u0060 and \u0060src/document_core/queries/field_query.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/Native/src/lib.rs:498\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":"bindings/Native/src/lib.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c9b424a8ac2e1a82227699ed6af0adbd0bd4dd441e02a3d6fc1a0d09423c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/bin/rhwp-q/more/inventory.rs:54-60 | src/bin/rhwp-q/more/inventory.rs:72-78 | src/bin/rhwp-q/more/inventory.rs:108-114 | src/bin/rhwp-q/more/inventory.rs:123-129 | src/bin/rhwp-q/more/inventory.rs:1068-1074 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecb88c1b0a801da74d6f6424c882082a31a4b1cae5c27e7c5d7d5cca8a37aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cli/commands/edit/bookmarks.rs:13-19 | src/cli/commands/edit/document_text.rs:1028-1034 | src/cli/commands/edit/notes.rs:12-18 | src/cli/commands/edit/notes.rs:107-113 | src/cli/commands/edit/tables/insert.rs:14-20 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"82659f05291cf2403759de4845765474490b79ef3e248b5c0a5011a8c7b2ec6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 5): src/document_core/queries/rendering_metafile_resources.rs:203-208 | src/renderer/layout.rs:1122-1128 | src/renderer/layout.rs:6816-6821 | src/renderer/layout.rs:10090-10095 | src/renderer/typeset.rs:1312-1318 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:1122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering_metafile_resources.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"faba0bf96b001623876f9551b6924d04af0b0d3c3e5f0554002621b70b832d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/renderer/height_measurer.rs:3999-4005 | src/renderer/height_measurer.rs:5034-5040 | src/renderer/height_measurer.rs:5824-5830 | src/renderer/layout/table_layout.rs:6334-6344 | src/renderer/layout/table_layout.rs:28606-28616 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:3999\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3999}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aa6b37b97fb1da1b62699bd205de73262e9e74e654be9a6e6b0f223bce4a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/renderer/layout/table_layout.rs:25061-25067 | src/renderer/layout/table_layout.rs:26796-26802 | src/renderer/layout/table_layout.rs:28000-28006 | src/renderer/layout/table_layout.rs:28516-28522 | src/renderer/layout/table_layout/reflow_external_cut.rs:65-71 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25061}}}],"partialFingerprints":{"codehealthFindingId/v1":"3440e3c5c591873193e06ef2570a3b00c2c66f3362dccbcc1f77f762a4b1f300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/bin/rhwp-q/kit/char_index.rs:72-78 | src/bin/rhwp-q/kit/cur_field_state.rs:72-78 | src/bin/rhwp-q/kit/field_info_at.rs:72-78 | src/bin/rhwp-q/kit/word_end.rs:72-78 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/char_index.rs\u0060 and \u0060src/bin/rhwp-q/kit/cur_field_state.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/char_index.rs:72\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/char_index.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9118672ba63083955d83b509d627b3ab6b2c1c1fc9e416685dd4a345d980903e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/document_core/commands/text_editing.rs:4551-4557 | src/document_core/commands/text_editing.rs:4607-4613 | src/document_core/queries/cursor_rect.rs:6355-6361 | src/document_core/queries/cursor_rect.rs:6403-6409 \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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d4e6f90aa09da416c1b42774322456f99147fc4bc7f587bdab9daae37a346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 4): src/renderer/layout/table_layout.rs:22241-22247 | src/renderer/layout/table_layout.rs:22278-22284 | src/renderer/layout/table_layout.rs:22338-22344 | src/renderer/layout/table_layout.rs:24952-24956 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:22241\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":22241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5272016ff8fafaa9baef85585519468955a9a1a6c1ba7ec1e42251b66dffbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201313 lines \u00D7 4): src/bin/rhwp-agent/envelope.rs:33-39 | src/bin/rhwp-q/kit/envelope.rs:17-29 | src/bin/rhwp-q/more/envelope.rs:13-25 | src/bin/rhwp-q/pack/envelope.rs:13-25 \u2014 \u0060src/bin/rhwp-q/kit/envelope.rs\u0060 and \u0060src/bin/rhwp-q/more/envelope.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 4 separate duplicated blocks between them, totalling at least 56 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/envelope.rs:33\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"863695333b5225b8a8520dc129a5212818edad13fd0488f92168f490327c3706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:704-710 | src/bin/rhwp-q/more/inventory.rs:1157-1163 | src/bin/rhwp-q/pack/inventory.rs:576-581 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:704\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"43437c4fb3330c0239297a552e3eadc7ec288b67a5485f42b0a3be042cb7a6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:1041-1047 | src/bin/rhwp-q/pack/inventory.rs:680-685 | src/bin/rhwp-q/pack/inventory.rs:1324-1329 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:1041\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0fd155c2a51bc2d97f00b244a666c1685de24fcc0ca29bce552160c87c1cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/cli/commands/edit/fields.rs:222-228 | src/cli/protocol/plan/execution.rs:591-597 | src/mcp_serve.rs:2237-2243 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/fields.rs\u0060 and \u0060src/mcp_serve.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/fields.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/fields.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5c40b08adc41db9966aaf065f52b727d49e92c459354727d4f9128a214412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/cli/commands/edit/fields.rs:269-275 | src/cli/protocol/plan/execution.rs:283-292 | src/mcp_serve.rs:2282-2288 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/fields.rs\u0060 and \u0060src/mcp_serve.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/fields.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f57b0c250b652ebd2691ff6d84ccbe136a0d7dd682c554475c6419665730c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/cli/protocol/exchange/disclosure.rs:110-116 | src/cli/protocol/exchange/settlement.rs:8-14 | src/cli/protocol/harness.rs:102-108 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/disclosure.rs\u0060 and \u0060src/cli/protocol/exchange/settlement.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/disclosure.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec064c183f0d6675a223b902c0d7f024cfeef6693b8b8ddc97ef7aae732421da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/diagnostics/hwp5_inventory_diff.rs:763-773 | src/diagnostics/hwp5_inventory_diff.rs:865-875 | src/diagnostics/hwp5_inventory_diff.rs:931-941 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/diagnostics/hwp5_inventory_diff.rs:863\u0060 calls \u0060as_str\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs:761\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e9c47e5b90574bef3b8105d22453153eae1290c1859e068d2aff1b625d98ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:2848-2854 | src/document_core/queries/cursor_rect.rs:5485-5492 | src/document_core/queries/cursor_rect.rs:6001-6008 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:2848\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdde2c03049217dbdcfcc947d6cea6518eff2f6c54c2edfb3482a00a2dbc6142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/document_core/queries/rendering.rs:6159-6166 | src/renderer/pagination/engine.rs:3177-3184 | src/renderer/typeset/state/finalize.rs:137-144 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/state/finalize.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/rendering.rs:6159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":6159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd7a349d54bb4731c464b7f2ca936afeef80241f9407a3ef769f22f2eae8da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/paint/text_v2_export.rs:47-53 | src/paint/text_v2_slots.rs:150-156 | src/renderer/skia/cache.rs:198-204 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/text_v2_export.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/text_v2_export.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e59f9f8ce002c1cd40cc9c536c6943b2228510dc1da30cfbb1749b68b46850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/renderer/composer/inline_control_flow.rs:28-34 | src/renderer/composer/inline_control_projection.inc.rs:125-131 | src/renderer/composer/inline_control_projection.inc.rs:180-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":"src/renderer/composer/inline_control_flow.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3537768d20b4295553bddaa2e6363a9bc99e38787acb829fdf8c58cb6147cc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/renderer/composer/stored_tac_display.inc.rs:107-115 | src/renderer/layout/table_layout/stored_inline_row_frame.rs:71-79 | src/renderer/layout/table_layout/stored_inline_row_frame.rs:221-227 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_tac_display.inc.rs:107\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fe0bb1ecb4fb5d4840ed40ce7bea64bac822bbf05b0b537b9b037627809a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/renderer/equation/operator_outline.rs:97-103 | src/renderer/equation/relation_outline.rs:160-166 | src/renderer/equation/relation_outline.rs:192-198 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/operator_outline.rs:97\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/operator_outline.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e50b2c3c578f0dcdc3956fdf993504c2df5dcdb16d5d982ecc7991ef3e4a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/renderer/height_measurer.rs:2845-2851 | src/renderer/height_measurer.rs:5531-5537 | src/renderer/table_row_frame.rs:271-277 \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":"src/renderer/height_measurer.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d33d200f99d045b28a5093902b5d295a227ab55b0db115ead8e7b9f20215e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/renderer/layout/table_layout.rs:21001-21006 | src/renderer/layout/table_layout.rs:21060-21066 | src/renderer/layout/table_layout.rs:21950-21956 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21001}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f89a27941a10f87fe1babcd6e324c7bff2341c22990d364900fe1c997ea6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/renderer/web_canvas.rs:2400-2406 | src/renderer/web_canvas.rs:2409-2415 | src/renderer/web_canvas.rs:2418-2424 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas.rs:2400\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"42818f3f1cc0e274b1fcaeeb1180eef754d6d462d227c363650a163b690167b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/wasm_api/print_image_sampling.rs:92-98 | src/wasm_api/print_image_sampling.rs:107-113 | src/wasm_api/print_image_sampling.rs:126-132 \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":"src/wasm_api/print_image_sampling.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"38768ab0a47bebb86cc6d9ee12774c08ccee34b1b966f19572c20a225b2fce1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bindings/Native/src/gpu_gl.rs:262-268 | bindings/Native/src/gpu_gl.rs:445-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_gl.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4653cbf2e2022865ccc5ac3aaeac7002dd85ae72d20231d3454588de6fa9f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:777-784 | crates/rhwp-ooxml-chart/src/renderer.rs:809-816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/renderer.rs:777\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aada72056d8df98009a01f0ee3c1a7242accbae37d02cecd054f7caf2f31c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:874-881 | crates/rhwp-ooxml-chart/src/renderer/chart_3d.rs:537-544 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/renderer.rs:874\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc9e4ba1b1364b4ac1b61330f3aa4631fac2434779a304fa2129588451c37b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/commands/edit/document_text.rs:194-200 | src/cli/commands/tabular_import.rs:426-432 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"583f514dacb4c7309468cf2862e9f9dbfc7f87c4df8ccf7af876a5abdd6aae61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/commands/edit/equations.rs:121-127 | src/cli/commands/edit/media.rs:521-527 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/equations.rs\u0060 and \u0060src/cli/commands/edit/media.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/equations.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69aec0d3849b72acf25b196d83eb289b25b672d421e31f27d5db537c54c5750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/outputs/tabular.rs:14-20 | src/cli/protocol/exchange/settlement.rs:144-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/tabular.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0252aa55dcd4d10f3be84d47ea444db805f34547d5b57f2ea21f601f103ad8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/outputs/vector.rs:50-56 | src/cli/outputs/vector.rs:556-562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/vector.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcad8c0d7a602e1e909c34aa351153bed5ff4b6563bb08289bde22ffc05128a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/diagnostics/hwp5_cell_header_probe.rs:433-439 | src/diagnostics/hwp5_table_probe.rs:423-429 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_table_probe.rs\u0060 as WHOLE FILES: this scan already matched 33 separate duplicated blocks between them, totalling at least 462 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_cell_header_probe.rs:433\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ae76814742b4520299e945b68009aa1efa63665eea75fe65be8ebb9b3d45a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:507-515 | src/diagnostics/hwpx_roundtrip_batch.rs:296-304 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_roundtrip_batch.rs:507\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ee2b9f6b734748625c4bdef88aa551001d115fd4c4d52d8eefa52a4f4b6288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/commands/document.rs:2671-2677 | src/renderer/layout/table_layout.rs:452-458 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/document.rs:2671\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eedbc32c05b003e895a507da2b41b9ce0e056fb866b96a153c736762eb82dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/commands/document/grown_table_heights.rs:60-66 | src/document_core/queries/rendering.rs:5519-5525 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document/grown_table_heights.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e087e43f369be5befcec51fc09ee2a3e4f921824caa0be489d543268a490157b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5265-5271 | src/document_core/queries/cursor_rect.rs:5558-5564 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1069398ff1842cd5d2f261e3c65fbb4d98177cc33235d3e83ff2f4d005ec0cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): src/document_core/queries/cursor_rect.rs:5493-5499 | src/document_core/queries/cursor_rect.rs:5918-5919 | src/document_core/queries/cursor_rect.rs:6009-6015 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:5493\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79e6276fb69a79ea320bf63f84049bd19754acdb275ed3ccb4e55dd0a00e7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5709-5715 | src/document_core/queries/cursor_rect.rs:6132-6138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00081294fccec0cea06a37e938e8be51835f10e597751f4594e035970ab40e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/queries/grep.rs:280-286 | src/document_core/queries/grep.rs:341-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bec9971934f0de7d169d97e00c97198cd6018c36a824a358487af95912dac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:700-708 | src/document_core/queries/hwpctrl_sets.rs:730-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"35054e90a08cbdabc4a0f6ad438fa1d4aa3a6e6ccaec48f59c2e18a9007e4c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/queries/injection_scan.rs:393-400 | src/document_core/queries/injection_scan.rs:972-979 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/injection_scan.rs:393\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2df2a62f1fa8d5b907c6e5733b2956e6d53dec869c48cb72a55ec89b496961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/emf/converter/player.rs:573-579 | src/emf/converter/player.rs:627-633 \u2014 both copies are in the same file, so extract the block 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 \u0060src/emf/converter/player.rs:573\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":"src/emf/converter/player.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2c01b6ba307b51376d8dbb3a03241b3d63c5522c0ee97e84709c061fa6d174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/paint/resources.rs:179-185 | src/paint/resources.rs:216-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/resources.rs:179\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/resources.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"25800dcb295ffb27f5c950eb97278912326dee8bd0e0ae14bd59de52a714a1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwp3/mod.rs:1905-1911 | src/parser/hwp3/mod.rs:2170-2176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5537d2414163f738182425a97f54384950c4db4618c2dfd19790fa62681fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:225-231 | src/parser/hwpx/header.rs:2006-2012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec08cc6258ad5ada0085f2e664ce3991a731eaf57c14c42e57d6abdf4079eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:2150-2156 | src/parser/hwpx/header.rs:2285-2295 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:2150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6793dcd97fdad396f9fd407849f7e1b00a2485514f9da6bd0cef03d37dc26394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/section.rs:1299-1305 | src/parser/hwpx/section.rs:1331-1337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:1299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b27442c1a308cbb0008b4b6debc7c71e97cdcc3541ac2e285ab178a3da205b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/recognition.rs:651-657 | tools/pdf-ir-poc/src/recognition.rs:402-408 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d7ab523c2ea7a262c56b91a99b4aaedb72e329ae6a59f19acf7c282eccaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/recognition.rs:857-863 | tools/pdf-ir-poc/src/recognition.rs:579-587 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pdf-ir-poc/src/recognition.rs:579\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":"src/parser/pdf/recognition.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7f8f70b9bd6a543671560e96e90979284c0475670b51bfa8b24c36630a203a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/recognition.rs:1005-1011 | tools/pdf-ir-poc/src/recognition.rs:706-712 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:1005\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df9485b9fb61656bbfcc8fea5e127812b086050876b602ea90cd9e627f17e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/parser/pdf/recognition.rs:1174-1184 | tools/pdf-ir-poc/src/recognition.rs:830-839 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:1174\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":"src/parser/pdf/recognition.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24f5fa8abf95257fe287c773098a43c7fe7876471cea51eaabcb497ac58e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:836-843 | tools/pdf-ir-poc/src/structured_lowering.rs:86-93 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/structured_lowering.rs:835\u0060 calls \u0060Allocation\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:85\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa19fce2794b6cdc06be3df47b8cd3327dcbcca50eed0d3352d608e47e5bbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_detection.rs:1054-1060 | tools/pdf-ir-poc/src/table_detection.rs:574-580 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:1054\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"16541cb781bed3a414d92cd258493c2c3611fa9c567204f27148a307e956358d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_detection.rs:1098-1104 | src/parser/pdf/table_detection/cell_regions.rs:82-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c86f225ffd6479a9fc1c9601fe8d7e9078941532257077fc45d4fcc01527adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_detection/cell_regions.rs:349-355 | src/parser/pdf/table_detection/cell_regions.rs:357-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":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efca9fd42104b7c6a7395f86b621fd30805538c10bb4e967254fd3ff7a30df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:59-70 | tools/pdf-ir-poc/src/table_hierarchy.rs:55-66 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd4a6003d278a4eea739dcfbda5626a09f4031babfa63f7c09d750cbe1cabcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:133-139 | tools/pdf-ir-poc/src/table_hierarchy.rs:119-124 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_hierarchy.rs:133\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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8ae77ea4a2a244bc2dbb4d5149d3544de52f7fa0bc4a974fd2e383e0d65422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_topology.rs:88-94 | tools/pdf-ir-poc/src/table_topology.rs:59-65 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_topology.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab75111745a3f0148ff9cb1ba5855028d47cfcb19d02ed6fcca2748942c960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/parser/pdf/table_topology.rs:108-113 | tools/pdf-ir-poc/src/table_topology.rs:74-80 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_topology.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_topology.rs\u0060 as WHOLE FILES: this scan already matched 6 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_topology.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_topology.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d6c088ede4832905fe5a5ecb3d19fc76f67a398170c5e073c5ffc0341fd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/composer/stored_cell_reflow.inc.rs:547-554 | src/renderer/composer/supplemental_clusters.rs:197-203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/composer/stored_cell_reflow.inc.rs:547\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5911a38393f287ea6f969861a81ac39dc97ff2554c6a74afc72faf716bb4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/composer/stored_word_tail.rs:325-331 | src/renderer/composer/stored_word_tail.rs:430-436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4817704fe3ab5cbfe0e7d677a8b694e60bea69ebf416b95dbafb28184c7bafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): src/renderer/equation/font_frame_metrics.rs:187-193 | src/renderer/equation/font_frame_metrics.rs:220-226 | src/renderer/equation/script_fraction_frame.rs:31-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/font_frame_metrics.rs:187\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/font_frame_metrics.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aa7cfc1ae78f4b5905341e33b5c80d8d9d6a997237003c22402e92f848fd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/equation/hancom_glyphs.rs:94-103 | src/renderer/equation/layout/source_greek_symbol.rs:97-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":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee955f582fe5c7d881a9f63b90e943949e3d3555f2ba09d7ceb1e6a8608b8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/renderer/float_placement.rs:6854-6860 | src/renderer/layout/paragraph_layout.rs:1026-1030 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":6854}}}],"partialFingerprints":{"codehealthFindingId/v1":"471d3762a26c76baca5409fd197a33dfe7af3b4dec8710465483b16f5695221f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/float_placement.rs:9312-9318 | src/renderer/float_placement.rs:9409-9415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":9312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a09c2191f99360d8b308fad915cb4793a4009619005fc4e02236ad936eee914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/float_placement/stored_square_top_band.rs:143-149 | src/renderer/typeset/table/block/deferred_float.rs:120-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement/stored_square_top_band.rs:143\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_square_top_band.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29b3d3ac59b37b9e8d8d1ca5dfc78fb8df374aac6345da19c9e54a72cfa803e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/height_measurer.rs:1214-1220 | src/renderer/layout/table_layout.rs:12839-12845 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecc62b7cddce67e0ed3033d9dc316f57a954dc2bc47aadc39d5f2c80fb7e9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/renderer/height_measurer.rs:1458-1464 | src/renderer/height_measurer.rs:1631-1635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5b7a07ae9e161b097b9fa9680922401fd813476f757a5477ba51b885ed6c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/html.rs:503-509 | src/renderer/svg.rs:4249-4255 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:503\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":"src/renderer/html.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a717e250b22f94d613ed3568e7d311de50444b036de86e3e83ab45cdb1f807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/image_resolver/print_alpha_2024.rs:26-32 | src/renderer/image_resolver/print_picture_resample.rs:52-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/image_resolver/print_alpha_2024.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_alpha_2024.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"112bb30606519e5d81c0000a84256936effcff3b6791255d5566f2eb50ba267d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout.rs:17486-17492 | src/renderer/layout/picture_footnote.rs:1209-1215 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":17486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfb58cae74ea41c82684808cd50fef5e625a0d0e3e0dbf0926eb0597a8b4d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:3962-3966 | src/renderer/layout/tac_picture_item.inc.rs:181-187 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee49517f89c9400ca2cfadd93ff375edfbd1caff4ddd0f5a8e43041d2014f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4266-4272 | src/renderer/layout/table_cell_content.rs:888-893 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4266\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddf0e64674fae27e898b2420340b0ed60486030af20c164551706819b270ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/shape_layout.rs:4775-4781 | src/renderer/layout/table_cell_content.rs:157-163 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:4775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c630b8b0e1c3087dbdfaf14af040ee9d1038fc329e38f2845728e1fc612941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/layout/table_cell_content.rs:858-865 | src/renderer/layout/table_layout.rs:4233-4240 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_cell_content.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"646bd189103f6abfd0ff284ad1fdffed942cce5ecfd94ecf4a041d1ee91a13e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_layout.rs:2493-2499 | src/renderer/typeset/paragraph/format.rs:553-560 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:2493\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee10ea8ff190d1e5c6c63907242a9be839f25f87a2214dad8260ba53f54517f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_layout.rs:16591-16597 | src/renderer/layout/table_layout.rs:27165-27171 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:16591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":16591}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f06fe13fd2ac70e5778684e03529a494c049a2ef0235fe172d497934e36cda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_layout.rs:19972-19978 | src/renderer/layout/table_layout.rs:20035-20041 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:19972\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19972}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fdc913c6d67c33df2067b0e07ba5df65f457f517be923621c366349b42c010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): src/renderer/layout/table_layout/reflow_nested_band.rs:33-39 | src/renderer/layout/table_layout/reflow_nested_band.rs:78-84 | src/renderer/layout/table_layout/row_physical_band.rs:142-143 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout/reflow_nested_band.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/reflow_nested_band.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea12b335eb1555a7400d33f0fbb0958dcaa262fb50c5e51692a7e0103f61200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_partial.rs:3498-3504 | src/renderer/layout/table_partial.rs:3533-3539 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_partial.rs:3498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75f2ced2c411aad9ec3e4f7cca44ef436f73935c4bbc33c1a8930c022e637d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/text_measurement.rs:1154-1160 | src/renderer/layout/text_measurement.rs:1182-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/text_measurement.rs:1154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7c05c8e865b79104fcb079502a15412beaacc3652a2e8798bcea976fbe52b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/pagination.rs:842-848 | src/renderer/pagination.rs:1372-1378 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/pagination.rs:842\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/pagination.rs:1369\u0060 calls \u0060try_clone\u0060 and \u0060src/renderer/pagination.rs:841\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6ba72175d9d7b30f56b2db0426d936720aef04b741c3b7fb2bbc4666fd5fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/skia/text_replay/marks.rs:96-102 | src/renderer/web_canvas.rs:1120-1126 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/text_replay/marks.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/marks.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72a1c1632e3ac2020f4d0db1b6a4ef6685b7974f143be0407fdf81b84d8ccde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/svg.rs:1193-1199 | src/renderer/svg.rs:1202-1208 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:1193\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33aaa0cee93a427b8a1d081516faf845904fc68650fbcd3d1f18368066f13ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20137 lines \u00D7 3): src/document_core/html_table_import.rs:1105-1105 | src/renderer/svg.rs:4527-4533 | src/renderer/web_canvas.rs:315-321 \u2014 before extracting anything, compare \u0060src/renderer/svg.rs\u0060 and \u0060src/renderer/web_canvas.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 321 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/svg.rs:4527\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eaf81c8dfcb5ca53e6413fdbfc4e3c2d4104d86d5c8a8f50f7f33878846828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/typeset/table/scan/row.rs:207-213 | src/renderer/typeset/table/scan/runner/row_step.rs:1037-1044 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/table/scan/row.rs:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/row.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aa2ea8dbc23d8b162cb0c26aa33316c53017326b6b5d464ce12874da233dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/typeset/table/scan/runner/row_step.rs:1491-1497 | src/renderer/typeset/table/scan/source_tail/extension.rs:69-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":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc66319a1e7fb6a937c6b0f17bd8d2e0497d2caca0b9e8f1a17f2c8a9daee3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/web_canvas.rs:2283-2289 | src/renderer/web_canvas.rs:2311-2317 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/web_canvas.rs:2283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"125ff48b1eb0ef732bf5ad55e7f94d433178a2ddb5f02d510f1c215ae91a608e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/serializer/hwpx/section.rs:3345-3351 | src/serializer/hwpx/section.rs:3360-3367 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/section.rs:3345\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":"src/serializer/hwpx/section.rs"},"region":{"startLine":3345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3707dafd65d48fa700cef1736598b61d3c8a54b6341dc960a4310571ece63f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/serializer/hwpx/shape.rs:392-399 | src/serializer/hwpx/shape.rs:801-807 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/shape.rs:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/shape.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faa332a86007e9ca8d66b33daec42c7af5264850e81b2726e0a421953abc819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): src/wasm_api.rs:4190-4193 | src/wasm_api.rs:8583-8589 | src/wasm_api.rs:8604-8610 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wasm_api.rs:4190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6f4d9cd1b76b6e90db46c6bacf2a5e13dffc0fdb74e685ebc7d9fb304058eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): src/bin/rhwp-q/more/inventory.rs:139-144 | src/bin/rhwp-q/more/inventory.rs:166-171 | src/bin/rhwp-q/more/inventory.rs:193-198 | src/bin/rhwp-q/more/inventory.rs:906-911 | src/bin/rhwp-q/more/inventory.rs:933-938 | src/bin/rhwp-q/more/inventory.rs:1103-1108 | src/bin/rhwp-q/pack/inventory.rs:386-391 | src/bin/rhwp-q/pack/inventory.rs:730-735 | src/bin/rhwp-q/pack/inventory.rs:757-762 | src/bin/rhwp-q/pack/inventory.rs:1119-1124 | src/bin/rhwp-q/pack/inventory.rs:1270-1275 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac43f3911630caeb1bd42a44d12c7b58f64dbb18320a75668d7b1ed4ae1758b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): src/renderer/layout/table_layout.rs:16615-16620 | src/renderer/layout/table_layout.rs:20958-20963 | src/renderer/layout/table_layout.rs:21045-21050 | src/renderer/layout/table_layout.rs:21934-21939 | src/renderer/layout/table_layout.rs:22240-22245 | src/renderer/layout/table_layout.rs:22277-22282 | src/renderer/layout/table_layout.rs:22337-22342 | src/renderer/layout/table_layout.rs:24951-24956 | src/renderer/layout/table_layout.rs:28174-28179 | src/renderer/layout/table_layout.rs:28327-28332 | src/renderer/layout/table_partial.rs:6650-6655 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":16615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c563d16c97f32a0de9b80020901c648680c13fafcadef494a019c2429e653f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): src/bin/rhwp-q/more/inventory.rs:382-387 | src/bin/rhwp-q/more/inventory.rs:409-414 | src/bin/rhwp-q/more/inventory.rs:436-441 | src/bin/rhwp-q/more/inventory.rs:987-992 | src/bin/rhwp-q/more/inventory.rs:1130-1135 | src/bin/rhwp-q/more/inventory.rs:1265-1270 | src/bin/rhwp-q/pack/inventory.rs:84-89 | src/bin/rhwp-q/pack/inventory.rs:549-554 | src/bin/rhwp-q/pack/inventory.rs:990-995 | src/bin/rhwp-q/pack/inventory.rs:1067-1072 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa2ffb2b7bc72206c4ea060fb38f9b3f4d2155c3f821f62b2aa25f4b4fb6776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): src/bin/rhwp-q/more/inventory.rs:301-306 | src/bin/rhwp-q/more/inventory.rs:328-333 | src/bin/rhwp-q/more/inventory.rs:355-360 | src/bin/rhwp-q/more/inventory.rs:1014-1019 | src/bin/rhwp-q/more/inventory.rs:1184-1189 | src/bin/rhwp-q/pack/inventory.rs:522-527 | src/bin/rhwp-q/pack/inventory.rs:963-968 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:301\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f04387b6c4061797e2def593e1c8a83185af67aa222b3bc15ab15214d055e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:124-129 | src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:24-29 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:24-29 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:241-246 | src/cli/outputs/preview.rs:93-98 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:124\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/bin/rhwp-q/commands/rhwp-q-page-def.rs:239\u0060 calls \u0060document\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:123\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4a46705c703a5dd05796450479115ed508e2674957ec91273cb4c5fdf6dbb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/cli/commands/edit/cells.rs:455-460 | src/cli/commands/edit/document_text.rs:196-201 | src/cli/commands/edit/media.rs:460-465 | src/cli/commands/tabular_import.rs:428-433 | src/cli/commands/tabular_import.rs:713-718 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/cells.rs:454\u0060 calls \u0060clone\u0060, \u0060unwrap_or_default\u0060 and \u0060src/cli/commands/edit/document_text.rs:195\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd240c7ac969bc7a9692543bf9d41b4114606c8bcc42b97d8df7af029ed891e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/document_core/queries/cursor_rect.rs:1532-1537 | src/document_core/queries/cursor_rect.rs:1539-1544 | src/document_core/queries/cursor_rect.rs:1546-1551 | src/document_core/queries/cursor_rect.rs:1553-1558 | src/document_core/queries/cursor_rect.rs:1560-1565 \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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07f7e104321c54bb632ecceda9ffa689cc87def1b0b0142ae13a6c6dd149f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/document_core/queries/hwpctrl_sets.rs:607-613 | src/document_core/queries/hwpctrl_sets.rs:651-657 | src/document_core/queries/hwpctrl_sets.rs:997-1003 | src/document_core/queries/hwpctrl_sets.rs:2106-2112 | src/document_core/queries/hwpctrl_sets.rs:2426-2432 \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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c434715cd6fe10078839a1e7a1a02c392f56e0f9a225fdb22894f409da96935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/parser/hwpx/section.rs:2457-2462 | src/parser/hwpx/section.rs:3148-3153 | src/parser/hwpx/section.rs:3802-3807 | src/parser/hwpx/section.rs:7534-7539 | src/parser/hwpx/section.rs:7667-7672 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:2457\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/section.rs:3154\u0060 calls \u0060parse_u32\u0060 and \u0060src/parser/hwpx/section.rs:7540\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0a0a1c66e19bb11083499e952735a07536956dfed64e7d101cd9e4d0e73374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/parser/hwpx/section.rs:2467-2472 | src/parser/hwpx/section.rs:3185-3190 | src/parser/hwpx/section.rs:3814-3819 | src/parser/hwpx/section.rs:7514-7519 | src/parser/hwpx/section.rs:7637-7642 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:2467\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/section.rs:2475\u0060 calls \u0060attr_str\u0060 and \u0060src/parser/hwpx/section.rs:3191\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"94825d2d40c2f1fddd46344db5e8698e33f9053eb020c9ccb258b7c02428345d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/renderer/float_placement.rs:2979-2984 | src/renderer/float_placement.rs:3807-3814 | src/renderer/float_placement/stored_cut_outer_frame.rs:34-43 | src/renderer/float_placement/stored_header_frame.rs:26-34 | src/renderer/float_placement/stored_header_frame.rs:81-88 \u2014 before extracting anything, compare \u0060src/renderer/float_placement.rs\u0060 and \u0060src/renderer/float_placement/stored_header_frame.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:2979\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/float_placement/stored_header_frame.rs:35\u0060 calls \u0060Footnote\u0060, \u0060Endnote\u0060 and \u0060src/renderer/float_placement/stored_cut_outer_frame.rs:44\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c55db7d09ef5f7ae912174af3ce368be8c615a4ccb26e4b6b5f720d9990c5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/renderer/pagination/engine.rs:1018-1024 | src/renderer/pagination/engine.rs:1131-1136 | src/renderer/pagination/engine.rs:1172-1177 | src/renderer/typeset/controls/wrap_match.rs:29-35 | src/renderer/typeset/section/post_flow.rs:425-430 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/controls/wrap_match.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d694fdf0567563fcc2cf3ee4047eb7d3c595a7c4ee99d591a179b15466fbe53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs:33-38 | mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:119-124 | mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs:130-135 | mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:46-51 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs\u0060 and \u0060mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"mydocs/tech/investigations/issue-1061/probes/dump_eqedit_raw.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5757bfb5a889b33bea8232c6dfeeb8c83f17b33158288f6a75ecd5de361c542e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/bin/rhwp-q/more/inventory.rs:517-522 | src/bin/rhwp-q/more/inventory.rs:544-549 | src/bin/rhwp-q/pack/inventory.rs:601-606 | src/bin/rhwp-q/pack/inventory.rs:1218-1223 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:517\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cd88c911fa322371f2083542036e296c64d292048405569974cd0ba5f03277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/bin/rhwp-q/more/inventory.rs:571-576 | src/bin/rhwp-q/more/inventory.rs:598-603 | src/bin/rhwp-q/more/inventory.rs:625-630 | src/bin/rhwp-q/pack/inventory.rs:628-633 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cee29223d3f83385cfb9551a21bb485b4f58867e68d281a88c14b2b7048753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/cli/outputs/pdf.rs:81-86 | src/cli/outputs/text.rs:445-450 | src/cli/outputs/vector.rs:79-84 | src/cli/outputs/vector.rs:576-581 \u2014 before extracting anything, compare \u0060src/cli/outputs/pdf.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/pdf.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e0fcaac866ce6eb3cadb8c6739eb51d24b38beeb7c6b8d53c0e534a5b321a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/document_core/commands/clipboard.rs:590-597 | src/document_core/commands/clipboard.rs:678-685 | src/document_core/commands/clipboard.rs:739-744 | src/document_core/commands/header_footer_ops.rs:759-764 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:590\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7e697089e3c2f5ed0a869b62fa6e268f5f1c2192cee781c9290ce59e07819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/document_core/helpers.rs:516-521 | src/document_core/helpers.rs:537-542 | src/document_core/helpers.rs:558-563 | src/document_core/helpers.rs:787-792 \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":"src/document_core/helpers.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"91197368e12f9ca368c7508be0d20b2fcae00074fa16f309aa3fecc44ff38e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/document_core/queries/cursor_rect.rs:6248-6253 | src/document_core/queries/cursor_rect.rs:6263-6268 | src/document_core/queries/cursor_rect.rs:6575-6580 | src/document_core/queries/cursor_rect.rs:6591-6596 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:6248\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6248}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f98310c056eb2ecf6572bfa819ba9cdbe989472c6d71157a82e2b2c9b3d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/paint/json.rs:550-555 | src/paint/text_v2_export.rs:46-51 | src/paint/text_v2_slots.rs:149-154 | src/renderer/skia/cache.rs:197-202 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/json.rs:550\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cf00a473e777e287326bc58941b50d71118f1547ef1a2344cd4bae0c1363aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/renderer/layout/table_layout.rs:8268-8275 | src/renderer/layout/table_partial.rs:3499-3504 | src/renderer/layout/table_partial.rs:3658-3669 | src/renderer/layout/table_partial.rs:3755-3764 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:8268\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, \u0060src/renderer/layout/table_layout.rs:8278\u0060 calls \u0060Some\u0060, \u0060get\u0060 and \u0060src/renderer/layout/table_partial.rs:3672\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e8a576cd4d9df9a98b1d12615ca5274b64760e393e63a7b95ed0b944221091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/renderer/layout/table_layout.rs:12192-12198 | src/renderer/layout/table_layout.rs:13109-13115 | src/renderer/layout/table_layout.rs:17781-17787 | src/renderer/layout/table_layout.rs:28632-28638 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:12192\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb3a736dc443c271777cee35df6a62f33a283d86b0b7ffdacd6e6dacd2e28e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/renderer/web_canvas.rs:2284-2289 | src/renderer/web_canvas.rs:2312-2317 | src/renderer/web_canvas.rs:2366-2371 | src/renderer/web_canvas.rs:2490-2495 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/web_canvas.rs:2284\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:2283\u0060 calls \u0060clear_shadow\u0060 and \u0060src/renderer/web_canvas.rs:2364\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"db472de3b73d849438a2c02964e9cddbee86ef9e0a4beffb376671590f2378dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/serializer/body_text.rs:1163-1168 | src/serializer/body_text.rs:1190-1195 | src/serializer/body_text.rs:1218-1223 | src/serializer/body_text.rs:1241-1246 \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":"src/serializer/body_text.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2cae38dd7c615f42e91ab705d3764d3b8973bb8be126a1e6375eb76dd5757a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/bin/rhwp-q/more/inventory.rs:881-886 | src/bin/rhwp-q/pack/inventory.rs:111-116 | src/bin/rhwp-q/pack/inventory.rs:784-789 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:881\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"583285a612ad4cfd42c7f3fd042ca11ca9c0956932318b74dd8ec4bdf335a1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cli/commands/edit/header_footer_content.rs:251-256 | src/cli/commands/edit/header_footer_content.rs:409-414 | src/cli/commands/edit/header_footer_properties.rs:393-398 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fdca000ed5840ee7a9f73c71ff3307c39591546f1afe8670234484c765763f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/document/grown_table_heights.rs:61-66 | src/document_core/queries/rendering.rs:5123-5128 | src/document_core/queries/rendering.rs:5520-5525 \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":"src/document_core/commands/document/grown_table_heights.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81821879712968cf4aaae7446814a7fb8bc5633ddb1172bb4c4e592e5dd3a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/document/stored_table_tail.rs:39-44 | src/renderer/float_placement/stored_header_frame.rs:254-259 | src/renderer/layout/table_layout.rs:12386-12391 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/document/stored_table_tail.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document/stored_table_tail.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d4830104739ef2faa6d5bbb9292f02535a6be379d11cf20f656f9809a3baa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/object_ops/common.rs:308-313 | src/document_core/commands/object_ops/picture.rs:393-398 | src/document_core/commands/table_ops.rs:3024-3029 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"912c09cc9fb5f22011b6d2004a75720b47aeba2e1305a3254f62efa3c2d30d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/object_ops/common.rs:321-326 | src/document_core/commands/object_ops/picture.rs:406-411 | src/document_core/commands/table_ops.rs:3037-3042 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7df1077952c2b19ce72384343e422b5de5bfa2e3c9c50d0a6f4f4fb73bcd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/object_ops/table.rs:641-646 | src/document_core/commands/object_ops/table.rs:1042-1047 | src/scaffold/builder.rs:425-432 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/scaffold/builder.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/object_ops/table.rs:640\u0060 calls \u0060copy_from_slice\u0060, \u0060to_le_bytes\u0060 and \u0060src/scaffold/builder.rs:424\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27d048442953f614a0705c915a8fb9e14cc8826dec3cddafebb0de960f2a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/helpers.rs:807-812 | src/document_core/helpers.rs:824-829 | src/document_core/helpers.rs:892-897 \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":"src/document_core/helpers.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab95dee9e80fd7ca385469fa5cb06fac5edbcf1e39171d565cf344e80d597682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/queries/doc_tree_nav.rs:1384-1389 | src/renderer/layout/shape_layout.rs:855-860 | src/renderer/layout/shape_layout.rs:3597-3602 \u2014 before extracting anything, compare \u0060src/document_core/queries/doc_tree_nav.rs\u0060 and \u0060src/renderer/layout/shape_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/doc_tree_nav.rs:1384\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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871c9544158ae0d66bbb9f037945a71f394266fbcd6d4c224b75373e501a115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/queries/rendering.rs:6233-6238 | src/renderer/layout.rs:8524-8529 | src/renderer/pagination/engine.rs:3228-3233 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/rendering.rs:6233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":6233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1527cbc36f3d7c4a4f1e4339c030787c4f8a546aa1e726ef3c612dccba8aeedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/parser/control.rs:294-299 | src/parser/control.rs:391-396 | src/parser/control/shape.rs:945-950 \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":"src/parser/control.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dee5a3d869672220cb504d766f29921273cc945bffb693d8f4f4c082aecccc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/parser/hml/reader.rs:829-834 | src/parser/hml/reader.rs:880-885 | src/parser/hml/reader.rs:1357-1362 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hml/reader.rs:829\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":"src/parser/hml/reader.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7e25c9dc04198413a2eca6ad85c6dbf2a3a71d90b5aaaaa5c7ffff9cfb1750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/parser/hwpx/header.rs:693-698 | src/parser/hwpx/header.rs:1690-1695 | src/parser/hwpx/section.rs:4398-4403 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:693\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc93e1a339a310bb4831f0de58523eadd430c0d00bcf6b24bea0bf1bb26e15c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/parser/hwpx/section.rs:3198-3203 | src/parser/hwpx/section.rs:4756-4763 | src/parser/hwpx/section.rs:5116-5121 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:3198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7602532228d3fbd47176c216442ae8594b374777b43fb89b9a4e0c656d148980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/parser/hwpx/section.rs:6360-6366 | src/parser/hwpx/section.rs:6391-6397 | src/parser/hwpx/section.rs:6425-6431 \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":"src/parser/hwpx/section.rs"},"region":{"startLine":6360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b2e6ad644b20b3dde6ce323060a819306913ac887b1310d2d067589e5288cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/float_placement.rs:1704-1709 | src/renderer/float_placement.rs:4638-4645 | src/renderer/layout/table_layout.rs:12528-12535 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:1704\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":"src/renderer/float_placement.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"873837821ee979a61e6445e3b9cffd0e469f3efefcdeb1e1e020d69326f3e698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/layout/picture_footnote.rs:530-535 | src/renderer/layout/shape_layout.rs:4121-4126 | src/renderer/layout/table_cell_content.rs:702-707 \u2014 before extracting anything, compare \u0060src/renderer/layout/shape_layout.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d70760f3d78eba92ff8eaa37b76e993ba02e2178125b7dda55c1b95301229e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/typeset/section/controls.rs:311-316 | src/renderer/typeset/section/controls.rs:333-338 | src/renderer/typeset/section/controls.rs:394-399 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/section/controls.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"521d098f7f1328c3405a6056990999b2ba298479a9da8e69a5523862719bce4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/serializer/hwpx/shape.rs:109-114 | src/serializer/hwpx/shape.rs:391-396 | src/serializer/hwpx/shape.rs:800-805 \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":"src/serializer/hwpx/shape.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb2fc48413930ef626289025a9d754eee29fd78b1c4cc0a15676ee6c21ca057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/wasm_api.rs:5901-5906 | src/wasm_api.rs:5959-5964 | src/wasm_api.rs:6011-6016 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wasm_api.rs:5901\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/wasm_api.rs:5957\u0060 calls \u0060json_bool\u0060, \u0060unwrap_or\u0060 and \u0060src/wasm_api.rs:5899\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":5901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3521d749571c45778b72d535704979bcd8f333041c4292c36c7f59ef58c61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bindings/Native/src/gpu_d3d.rs:205-210 | bindings/Native/src/gpu_metal.rs:214-219 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:205\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ca74761ca679208821f10e0a677079c27392fe23de6bd7350024d928f2728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mydocs/tech/investigations/issue-1058/probes/repro_1058_footnote_insert.rs:69-75 | mydocs/tech/investigations/issue-1061/probes/repro_1061_equation_save.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":"mydocs/tech/investigations/issue-1058/probes/repro_1058_footnote_insert.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5010f89e58cd4b4d7fe147feea692a01dc392f00cb76c11fc80cce8fc85148b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mydocs/tech/investigations/issue-595/probes/inspect_595.rs:45-50 | mydocs/tech/investigations/issue-595/probes/inspect_595.rs:56-61 \u2014 both copies are in the same file, so extract the block 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 \u0060mydocs/tech/investigations/issue-595/probes/inspect_595.rs:45\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":"mydocs/tech/investigations/issue-595/probes/inspect_595.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f966460d632507742d448835290d161238fd0a3aa63bd598d90c68e11221ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bin/rhwp-agent/envelope.rs:180-186 | src/cli/metadata/capabilities/mod.rs:455-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":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f7e2d8d787ef9b2b461572bf60b83855637d59e74c58b512f46af6d8adcc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bin/rhwp-agent/explorecmd.rs:39-45 | src/cli/queries/explore.rs:76-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/explorecmd.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38199f4d74836f90bba45611ffd5b365b59f2f3628c798ec2188f916d47ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:652-657 | src/bin/rhwp-q/pack/inventory.rs:655-660 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:652\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14773aef2c5f3a8a773641442ce5c80a3a9c4d744bd067f8ddcecfedb52a3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:731-736 | src/bin/rhwp-q/pack/inventory.rs:442-447 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:731\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"912b4c50f50e57f0cab2322e78f41ad68c3c1ccd98dc2eb166429c2bf600c878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bin/rhwp-q/pack/inventory.rs:286-291 | src/bin/rhwp-q/pack/inventory.rs:1168-1173 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-q/pack/inventory.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c76ae78ca4857623b88a3e97674def8cc4e1ac5a4e4ccd1ffc978270b14d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): src/cli/batch/query.rs:80-85 | src/cli/queries/data_extraction.rs:86-93 | src/mcp_serve.rs:1968-1971 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/batch/query.rs:80\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":"src/cli/batch/query.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48fd10e5be0124a58fd442c969404c18854a8f1bf477566cd1cd4c5b33f2dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/cells.rs:163-168 | src/document_core/commands/text_editing.rs:463-468 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:163\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe5961005cf970580d3aa77df692d62901a0f32de7072c164273a9ef91053c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/tables/grid.rs:332-337 | src/cli/commands/edit/tables/grid.rs:697-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":"src/cli/commands/edit/tables/grid.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476c4d47505e93c0cd1ac724a570b1860e7ac598be667f88be71eb5d3ff2227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/tables/layout.rs:105-110 | src/cli/commands/edit/tables/layout.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":"src/cli/commands/edit/tables/layout.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ad6c191365fe4de7dff44e5b9d9adee2b28dc4b13f1b967c231afcaecdc98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/outputs/tabular.rs:267-272 | src/cli/outputs/tabular.rs:507-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/tabular.rs:267\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":"src/cli/outputs/tabular.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"daefed9b6cfcf4f68030ee3d000dc0ddfb82b1797c71bbf42093c9f3d4c7b865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/queries/ir_comparison.rs:212-217 | src/cli/queries/ir_comparison.rs:457-463 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/ir_comparison.rs:212\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"429034b43a640d90d1a9457f9ec5195debd81ffb9a4ec61fbc01b3b2528a1fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/diagnostics/hwp5_contract_probe.rs:803-809 | src/diagnostics/hwp5_table_probe.rs:654-659 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 and \u0060src/diagnostics/hwp5_table_probe.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 377 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_contract_probe.rs:803\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":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"517966ac69ec9100c05db622652ccba2d33b68b5d96bd9237567ea4335c5df3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:1148-1159 | src/serializer/hwpx/roundtrip.rs:1793-1804 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/ir_field_sweep.rs:1148\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060s\u0060 to \u0060\u0026ShapeObject\u0060 in one and \u0060\u0026crate::model::shape::ShapeObject\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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f95791b22d2867202859862af260cb1664f7383f153ef8a3f95ebad38485d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/diagnostics/render_geom_diff.rs:1016-1021 | src/diagnostics/render_geom_diff.rs:1029-1034 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/render_geom_diff.rs:1016\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/render_geom_diff.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd9b5313e0979ce77166f9b72cb26d015382d3e2fcf2ce4779bdffbe8a39706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/commands/clipboard.rs:1116-1122 | src/document_core/commands/html_import.rs:590-596 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/html_import.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1985c724d69a2f6cecb764dfaf186de67b35c9d63e303bec76918c4784a4b9b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/clipboard.rs:1442-1447 | src/document_core/commands/object_ops/table.rs:1345-1350 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe2e598ac001081acdd912428c19efd48342e02e909876520d8d72a590b2d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:930-936 | src/document_core/commands/object_ops/chart.rs:1077-1083 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/object_ops/chart.rs:930\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/document_core/commands/object_ops/chart.rs:1076\u0060 calls \u0060to_vec\u0060 and \u0060src/document_core/commands/object_ops/chart.rs:929\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2d2bb13e610b18959cef214d1bf4c4d5e8a7f97d3388114329150871cef9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/object_ops/common.rs:437-442 | src/document_core/commands/object_ops/picture.rs:1018-1023 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/common.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d104a68a22be361f64ab33a0a57bc3f059951a3fc7c3f4eafb1c9219a0290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:616-622 | src/scaffold/builder.rs:406-411 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/scaffold/builder.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/table.rs:616\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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"865d1acfe9e810ab00078b0bb7cace97a6ef170a2e5063aa5e8b0e0b77d8c901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/object_ops/table.rs:680-685 | src/scaffold/builder.rs:453-458 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/table.rs\u0060 and \u0060src/scaffold/builder.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. 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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0e9051023a6cc0ee1b1a6709eccaa065b0d0002609c9db2159ab136f0cce37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/table_ops.rs:3960-3965 | src/document_core/commands/table_ops.rs:4037-4042 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/table_ops.rs:3960\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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf5ff18fbf79f698502a641dc224e86b5b480604ed7ec5c1a889f73ad71c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/hwpjson/body.rs:164-169 | src/document_core/hwpjson/body.rs:190-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/hwpjson/body.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/body.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66bac9dd7b0eaab16fa4c1caae0732e24324d4699947639a935a7cad1496bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/document_core/queries/cursor_nav.rs:585-592 | src/document_core/queries/cursor_nav.rs:601-608 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_nav.rs:585\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fceaafcaf411212f797097ec77839762dfbb8a86577cd8156a62726fbf88bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:108-113 | src/document_core/queries/cursor_rect.rs:3200-3205 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d170546ff8a7d07e633e64279c46fc043ac46b889c978472cbfe705fa8efbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5464-5469 | src/document_core/queries/cursor_rect.rs:5988-5993 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5464\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 \u0060run\u0060 to \u0060\u0026HfRunInfo\u0060 in one and \u0060\u0026FnRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5464}}}],"partialFingerprints":{"codehealthFindingId/v1":"689adc1efa86fe86f35610c51346a194ac3553c51bd50d4193f3af5ff0dc779f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:459-464 | src/document_core/queries/hwpctrl_sets.rs:1601-1606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c763ad0e7fd1e7723c6b7f1476bed3b2a22204d75ad2c79299e08bf2c26dc77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/memo_query.rs:488-493 | src/document_core/queries/memo_query.rs:546-551 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/memo_query.rs:488\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"6627d0db610c7084dab4a1cf4fd68b947680f67d7163b70d9f21727c748ba368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/rendering.rs:5483-5488 | src/renderer/typeset/table/block.rs:83-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"243da16f5f4eea50dd1477c0e485cc5dd6406848a5884534a4f3a74bcefb351e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/document_core/queries/rendering.rs:6235-6239 | src/renderer/pagination.rs:1547-1552 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination.rs:1547\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ba8581ad3f5cbf84752f341cf8b68e48809f38cdf99e2553f87a13ce38295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/rendering.rs:7291-7296 | src/document_core/queries/rendering.rs:7549-7556 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/rendering.rs:7291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":7291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ad2054bf221fce704b09484fc41061b6d77e8fef1d48319ba0e26e52a805d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/search_query.rs:95-100 | src/document_core/queries/search_query.rs:119-124 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/search_query.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/search_query.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26b87f006cd255f313cf6cdfdba2f82c7ba8b53c6a23510208bb28bf192bc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/table.rs:371-376 | src/renderer/layout/table_layout.rs:12540-12545 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/model/table.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac41ef0d81223a597547dbdb6b5c3bd87fa849b6a7e431146ad3d6bb9da53f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/table.rs:2235-2241 | src/model/table.rs:2343-2348 \u2014 both copies are in the same file, so extract the block 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 \u0060src/model/table.rs:2235\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":"src/model/table.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b750f5e05880113aac54f2c3938574f2c87e4591ee3b12b9051bf80febae82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/native_host/gpu_d3d.rs:654-659 | src/native_host/gpu_metal.rs:436-441 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db229d119e6a78e876133ecaff04cda3b7403d7178a5c5548e51d1cef6503cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/paint/font_glyph.rs:824-829 | src/paint/shaping_glyph.rs:1131-1136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/paint/font_glyph.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5497b63298219379610bf6cc80619c6dc2b51825bc3b81c5805eee9aa0df9899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/cfb_reader.rs:1176-1181 | src/parser/cfb_reader.rs:1228-1233 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/cfb_reader.rs:1176\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/cfb_reader.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"244b1c2dd5b99d64f64468d6a000d4071838b6b2a34447cae62dbb9c691688b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 8): src/document_core/commands/object_ops/common.rs:37-39 | src/document_core/commands/object_ops/common.rs:41-42 | src/emf/converter/device_stroke.rs:10-12 | src/emf/converter/device_stroke.rs:13-14 | src/parser/control/shape.rs:554-559 | src/parser/control/shape.rs:562-563 | src/parser/hwpx/section.rs:4158-4163 | src/parser/hwpx/section.rs:4166-4167 \u2014 there are 8 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 8 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/common.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38c02772bfe608ec6fa3e1bb163fa365e39f1d589a45c9770597a269ac03c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/header.rs:2241-2246 | src/parser/hwpx/header.rs:2359-2364 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:2241\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":"src/parser/hwpx/header.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59890c4d2bf958371b61cfe235243c1637ce41ee6fcd5b96caa3d6782bd9b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/section.rs:1383-1388 | src/parser/hwpx/section.rs:7435-7440 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:1383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a84302a4dc816ea703924f1493e12bee9ceccaa81888a038bf9c2f70f704d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/section.rs:1382-1387 | src/parser/hwpx/section.rs:6087-6092 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:1382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1565130051d07e0c3f8d2546ea0e6871e169a48f7dbf2da5237796dfab89bc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/section.rs:6151-6156 | src/parser/hwpx/section.rs:6545-6550 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:6151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":6151}}}],"partialFingerprints":{"codehealthFindingId/v1":"186993b6ac5568a3dedf31b2599f311b42a3673688825115947b168d44e75ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/allocation.rs:395-400 | src/parser/pdf/allocation.rs:512-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/allocation.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43aa78c956734b5d1a8a3c533ddd9de3f5fa501f77d307cb444fe8a906cea2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1400-1406 | tools/pdf-ir-poc/src/structured_lowering.rs:333-338 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f14f8cd77ac10fa2e4e03deba9ba124eee46c213523d5208dc1c433bc3ed91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1646-1651 | tools/pdf-ir-poc/src/structured_lowering.rs:521-526 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1646\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8befa31ccfd808280aa20ce39c3be0d6230bb8f934405a1fd9c630c2b720c60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1670-1675 | tools/pdf-ir-poc/src/structured_lowering.rs:537-542 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1670\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"2432a971b4f33e6cd0d4efbb02a30caa07d0498f0c7c8dd8ccddba78b5ad8c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2037-2043 | tools/pdf-ir-poc/src/structured_lowering.rs:690-696 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:2037\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5f3a00f6baa02654234468e0ad00f2d8b9e98379bcb3f367f79fbe0542b94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/table_detection.rs:654-661 | tools/pdf-ir-poc/src/table_detection.rs:346-353 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:654\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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b1c0e82e4f93239120c1b3c6b47f99bf44348c8bfec919542b0e308ac67b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:95-101 | tools/pdf-ir-poc/src/table_hierarchy.rs:100-107 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/pdf-ir-poc/src/table_hierarchy.rs:100\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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"757e685f5b82cee9282dee4d97423dd63b97070464e1769d459a62457022d952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/equation/canvas_render.rs:215-224 | src/renderer/equation/canvas_render.rs:497-506 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/equation/canvas_render.rs:215\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bac173b298b3b2c943128dcea788f0fd198c95be17ddcf0e8fc2f58aebb1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/float_placement/stored_span_opening.rs:18-23 | src/renderer/layout/table_layout.rs:11230-11235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement/stored_span_opening.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_span_opening.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc40f1a8eac3eb2383a0c25423cbf8cf8f77015448c9165c075e3c3e4ac5dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/height_measurer.rs:362-367 | src/renderer/layout/table_layout.rs:22207-22216 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:362\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":"src/renderer/height_measurer.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61517a825d4999de56299f1220c14a25f14c48aa92bf221a514311991a37c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/height_measurer.rs:1574-1579 | src/renderer/layout/table_layout.rs:2122-2127 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01a2a3e856e676bc7b5544c8a59d3f9ba070724966204d1a8006a1a9f2e4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/height_measurer.rs:2027-2032 | src/renderer/layout/table_layout.rs:3229-3234 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 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":"src/renderer/height_measurer.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c435b918a6e3c10d3ea90e5bdc9f5350fb17b9444473c86fc462fcf5423b4f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/kerning.rs:884-890 | src/renderer/kerning.rs:2227-2233 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/kerning.rs:884\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/kerning.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"318f5334c946fb4c8e3f08db27774210f8a219ac19011bc7cb14ba17d89aebfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:1278-1283 | src/renderer/layout.rs:1386-1391 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:1278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e421cb468f0c4105f6be45e27b0f1f2b32cff3d347eb6d1cc3b7e1bdc92c38ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:6050-6055 | src/renderer/layout.rs:6250-6255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b694e62ced1f3da9e5fbcc8b636ccfdab873efd6dd3c86cc2d9f44bdbb2b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:9109-9114 | src/renderer/layout.rs:9986-9992 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:9109\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":9109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7a82ed2b5ebe0ed66fd4d61f1c6e8d0c20f4928e56f00d3232d7357142d21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:9538-9544 | src/renderer/typeset/section/post_flow.rs:101-106 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:9538\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":9538}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2dfc9662fc9002dfd4d67fec73b7dd779d6c0c376a79760195a59a4a9480e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:13536-13541 | src/renderer/layout/table_layout/stored_nested_host_flow.rs:36-44 \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. 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":"src/renderer/layout.rs"},"region":{"startLine":13536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b60fc81e13749a2a72f32bb26ec9ab9a7b1bdb814780a0979143de251f71ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:1026-1031 | src/renderer/layout/picture_footnote.rs:509-514 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d870646e07b9e816065c480f4336627fc44d3e5e236728911826825b30fc7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/shape_layout.rs:1394-1399 | src/renderer/layout/shape_layout.rs:1468-1473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eff285b5e098fa11f840e50fd50cec43fe66d4a8a55de0249393582b1ba97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/shape_layout.rs:2372-2377 | src/renderer/layout/shape_layout.rs:2444-2449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d60ce690259907045ffaa34ac70b012b434211153f6042dc63cf8f8579c62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/shape_layout.rs:5277-5282 | src/renderer/typeset.rs:6729-6734 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/shape_layout.rs:5277\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"545948d4938113dcbab3ef09093f422420249a8ab2af0f9d8ec70a4c46efa581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/table_layout.rs:13048-13053 | src/renderer/layout/table_layout.rs:14362-14367 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:13048\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13048}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0545201d8caab1ffa87959527395eb2cc45786a561be50cf00fd682d510ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/table_layout.rs:23132-23137 | src/renderer/layout/table_layout/reflow_nested_band.rs:111-116 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/layout/table_layout.rs:23128\u0060 calls \u0060get\u0060 and \u0060src/renderer/layout/table_layout/reflow_nested_band.rs:110\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d7385f7014765e72b8a029350870682a9292f503e63a7452682bb6ade3b18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/renderer/pagination/engine.rs:3184-3189 | src/renderer/typeset/state/finalize.rs:144-148 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/state/finalize.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:3184\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":3184}}}],"partialFingerprints":{"codehealthFindingId/v1":"24489f9f3064d4ef7344c37d982ce1bb6aa8be14a69885c218508968e9e53280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/svg.rs:1268-1277 | src/renderer/svg.rs:1328-1337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f6ee1a282120e5617d5b5032814275558c3cd3ab410f97eb53f23c90111b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/renderer/svg/font_file_lookup.rs:200-204 | src/renderer/svg/system_fonts.rs:124-129 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/svg/font_file_lookup.rs:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg/font_file_lookup.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec269fdde62c9dbf1a020a3991cbc1d15d5d51194ea4d615b0167d367d1d0586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/text_decoration.rs:120-125 | src/renderer/web_canvas.rs:4244-4249 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/text_decoration.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/text_decoration.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37a245b160009b0c973c0025b463bb2bcc9caa39e5bb21b21a5e7dba3b089df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/typeset/controls/shape_flow.rs:80-85 | src/renderer/typeset/section/controls.rs:588-593 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/controls/shape_flow.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/shape_flow.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71e35c7a2678dfe0cdccfbf09b4e15b536e1d6e30ae1bb631ca50efe9273aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/serializer/control.rs:1987-1992 | src/serializer/control.rs:2016-2021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e9bc22e9d42ed5010ca83d059cd577d3b7d4af1eae5fda03bce5c7d4c22534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/serializer/hwpx/char_shapes.rs:120-125 | src/serializer/hwpx/header.rs:316-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/char_shapes.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/char_shapes.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d62f984286487b97caf394a7bce6a6de55ee8250db64dc2425d56203250016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/serializer/hwpx/shape.rs:742-749 | src/serializer/hwpx/table.rs:532-539 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/shape.rs\u0060 and \u0060src/serializer/hwpx/table.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/shape.rs:742\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":"src/serializer/hwpx/shape.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"998636025ce6915d960045a6cd5457a19425844eee28ad4c8d71cab8ddd515cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:1764-1769 | src/wasm_api.rs:1806-1811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/wasm_api.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b279257e8fe5e673ba7fba44b95061470b0fbe7c7962d2cbc9ed4dae6554f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:1787-1792 | src/wasm_api.rs:1827-1832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/wasm_api.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a17bfd7dc0568b6690e9f5443b270e34ad2b15cd77b8be33ddeaa2bc1589c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:2073-2078 | src/wasm_api.rs:3326-3331 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:2073\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e96bc281d0d4ba84527c202700652dd39a593062150ea1810428cb8e7f7fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:6359-6364 | src/wasm_api.rs:6490-6495 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:6359\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":6359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcffabaf2e86775a1fb3fb2ee302acde56902baa6861f551dabc2dce569e4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:9494-9499 | src/wasm_api.rs:9710-9715 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:9494\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":9494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75a8fd1b0c55fc407dbe060e0649d0c7ff6569d536e0da84a53fc39cd71bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/wmf/converter/bitmap.rs:216-223 | src/wmf/converter/bitmap.rs:255-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/bitmap.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e969d579eaa99631a588b678062efad530e63f5e0ae55c8e248c8fe09c7058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wmf/converter/svg/ternary_raster_operator.rs:594-599 | src/wmf/converter/svg/ternary_raster_operator.rs:652-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/ternary_raster_operator.rs:594\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":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68e4b34ff8d28a3c2517fbef1693e63c1dbfdd47939f79dcc5cdbb0bc26faa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 18): src/wmf/parser/records/bitmap/bit_blt.rs:145-149 | src/wmf/parser/records/bitmap/dib_bit_blt.rs:149-153 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:149-154 | src/wmf/parser/records/bitmap/dib_stretch_blt.rs:172-176 | src/wmf/parser/records/bitmap/stretch_blt.rs:146-151 | src/wmf/parser/records/bitmap/stretch_blt.rs:169-173 | src/wmf/parser/records/bitmap/stretch_dib.rs:99-107 | src/wmf/parser/records/drawing/arc.rs:80-88 | src/wmf/parser/records/drawing/chord.rs:83-91 | src/wmf/parser/records/drawing/ellipse.rs:59-64 | src/wmf/parser/records/drawing/pat_blt.rs:62-67 | src/wmf/parser/records/drawing/pie.rs:82-90 | src/wmf/parser/records/drawing/rectangle.rs:58-63 | src/wmf/parser/records/drawing/round_rect.rs:68-76 | src/wmf/parser/records/state/exclude_clip_rect.rs:50-54 | src/wmf/parser/records/state/intersect_clip_rect.rs:50-54 | src/wmf/parser/records/state/scale_viewport_ext.rs:56-60 | src/wmf/parser/records/state/scale_window_ext.rs:56-60 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/bitmap/bit_blt.rs\u0060 and \u0060src/wmf/parser/records/bitmap/dib_bit_blt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/bitmap/bit_blt.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/wmf/parser/records/bitmap/dib_stretch_blt.rs:148\u0060 calls \u0060parse\u0060 and \u0060src/wmf/parser/records/bitmap/bit_blt.rs:144\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/records/bitmap/bit_blt.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f409a088528cdfef1777f90bd9cae79946f020855aa33f1a5d9a92aae893b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): src/cli/commands/edit/bookmarks.rs:139-143 | src/cli/commands/edit/bookmarks.rs:246-250 | src/cli/commands/edit/controls.rs:11-15 | src/cli/commands/edit/document_objects.rs:273-277 | src/cli/commands/edit/equations.rs:256-260 | src/cli/commands/edit/media.rs:805-809 | src/cli/commands/edit/media.rs:902-906 | src/cli/commands/edit/notes.rs:201-205 | src/cli/commands/edit/shapes.rs:183-187 | src/cli/commands/edit/shapes.rs:457-461 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/controls.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e682e0229da1daec19b04e29c69e55fa5f86892fbc8583d75664fa04723fec52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): src/diagnostics/hwp5_anchor_trace.rs:149-153 | src/diagnostics/hwp5_borderfill_diagonal_probe.rs:432-436 | src/diagnostics/hwp5_cell_header_probe.rs:691-695 | src/diagnostics/hwp5_char_shape_audit.rs:359-363 | src/diagnostics/hwp5_char_shape_audit.rs:385-389 | src/diagnostics/hwp5_contract_probe.rs:599-603 | src/diagnostics/hwp5_first_para_control_probe.rs:1296-1300 | src/diagnostics/hwp5_mel_personnel_probe.rs:605-609 | src/diagnostics/hwp5_table_probe.rs:350-354 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d044a17b3066119ad5f06af885e7e3eff11abc46fc16b1300a484588b10c0f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): src/cli/commands/edit/cells.rs:396-400 | src/cli/commands/edit/document_text.rs:140-144 | src/cli/commands/edit/media.rs:400-404 | src/cli/commands/edit/runtime.rs:220-224 | src/cli/commands/edit/text.rs:158-162 | src/cli/commands/tabular_import.rs:370-374 | src/cli/commands/tabular_import.rs:666-670 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/document_text.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:396\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5565787e2c8fe1d8ab489af6b2bb77bf3d15dd3d4083362e80ea33397af182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/parser/hwp3/mod.rs:2001-2005 | src/parser/hwp3/mod.rs:2007-2011 | src/parser/hwp3/mod.rs:2013-2017 | src/parser/hwp3/mod.rs:2019-2023 | src/parser/hwp3/mod.rs:2025-2029 | src/parser/hwp3/mod.rs:2031-2035 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d22d186936177b354d06c9170b6b255a20b5ed4409b498cb49b0eb354da5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/bin/rhwp-q/more/inventory.rs:304-312 | src/bin/rhwp-q/more/inventory.rs:331-339 | src/bin/rhwp-q/more/inventory.rs:358-366 | src/bin/rhwp-q/more/inventory.rs:1017-1025 | src/bin/rhwp-q/more/inventory.rs:1187-1195 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:304\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861ac6078e47807190e05dbebe707a8ec37110f303155ef1485197c3db1cb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/document_core/queries/cursor_rect.rs:1989-1995 | src/document_core/queries/cursor_rect.rs:5419-5425 | src/document_core/queries/cursor_rect.rs:5957-5963 | src/document_core/queries/cursor_rect.rs:6246-6250 | src/document_core/queries/cursor_rect.rs:6573-6577 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/cursor_rect.rs:6246\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060run\u0060 to \u0060\u0026RunInfo\u0060 in one and \u0060\u0026HfRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"47977828694b838f315b6387cc4ed4ec9dffe0c2ac2feae40b6207844b90c689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/renderer/layout/table_layout.rs:24959-24967 | src/renderer/layout/table_layout.rs:25061-25065 | src/renderer/layout/table_layout.rs:26796-26800 | src/renderer/layout/table_layout.rs:28000-28004 | src/renderer/layout/table_layout.rs:28516-28520 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d9a55c6db9a3fb3753baa005cc002131b68bed81f4001bee97c1b39e3e7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/cli/protocol/exchange/bundle.rs:6-10 | src/cli/protocol/trust/gate.rs:17-21 | src/cli/protocol/trust/governance.rs:173-177 | src/cli/protocol/trust/governance.rs:568-572 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/bundle.rs\u0060 and \u0060src/cli/protocol/trust/governance.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 60 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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f043888cc6fef362a4a19a35bf3bb2c70ce4e846304f932bbb2ebbdcc274f116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 5): src/diagnostics/hwp5_inventory_diff.rs:758-761 | src/diagnostics/hwp5_inventory_diff.rs:857-861 | src/diagnostics/hwp5_inventory_diff.rs:921-925 | src/diagnostics/hwp5_inventory_diff.rs:980-984 | src/diagnostics/hwp5_inventory_diff.rs:1043-1047 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/diagnostics/hwp5_inventory_diff.rs:1039\u0060 calls \u0060table_probe_axes\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs:976\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6e70d1da8a8ea79fdf2cbdf90719adcabac65a69bdf6f8420ce274f7a85bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 6): src/document_core/commands/document/grown_table_heights.rs:70-74 | src/document_core/commands/header_footer_ops.rs:947-949 | src/document_core/queries/hwpctrl_sets.rs:1598-1600 | src/document_core/queries/rendering.rs:4963-4967 | src/document_core/queries/rendering.rs:6737-6741 | src/renderer/render_normalization.rs:134-138 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/document/grown_table_heights.rs:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/renderer/render_normalization.rs:139\u0060 calls \u0060top_level\u0060 and \u0060src/document_core/commands/document/grown_table_heights.rs:75\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document/grown_table_heights.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"652bd4cce6befaf068df7149bf427eec88c117abc73ca15a8427eaf315ce2086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/document_core/queries/rendering.rs:6234-6238 | src/renderer/layout.rs:8525-8529 | src/renderer/pagination.rs:1546-1550 | src/renderer/pagination/engine.rs:3229-3233 \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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54682097d67adab66af0341b99ae519e2521c163e8a2cc563c93daf583626d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): bindings/Native/src/gpu_d3d.rs:258-262 | bindings/Native/src/gpu_gl.rs:356-360 | bindings/Native/src/gpu_metal.rs:267-271 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2856ed01227d4f569f1e70d9f55fb3485972b0312a8fb457bc63bf756eaefd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cli/batch/query.rs:89-94 | src/cli/queries/data_extraction.rs:97-102 | src/mcp_serve.rs:1974-1978 \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":"src/cli/batch/query.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86aee979af0182d56a26fc62d49935ce39d0cc4aa896166fcf5e2bd225c9335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cli/commands/edit/cell_paragraphs.rs:170-174 | src/cli/commands/edit/formatting.rs:708-712 | src/cli/commands/edit/formatting.rs:860-864 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb1ef163d3e5b1b3715c1ee459ee34fd8d5f4e534d8ecf01214fcc35d0e7491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cli/commands/edit/cells.rs:162-166 | src/document_core/commands/text_editing.rs:462-466 | src/document_core/commands/text_editing.rs:6202-6206 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:162\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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f254e3a97ceeeeddcd519a2f69c4303c3593bfdc6b13989ee23eb2388ddb33f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:538-542 | src/diagnostics/hwp5_cell_header_probe.rs:888-892 | src/diagnostics/hwp5_mel_personnel_probe.rs:802-806 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:538\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d3d2387e1330ffccf5645bee4258177e148b3c79b06ac152dfabddb9156b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/diagnostics/hwp5_inventory.rs:559-563 | src/diagnostics/hwp5_inventory_diff.rs:1511-1515 | src/diagnostics/hwp5_inventory_diff.rs:2237-2241 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00df9151f65f419b861bf026341de739991f11f59c20467f3af212a9cd29359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/border_paint_edit.rs:133-138 | src/document_core/commands/border_paint_edit.rs:166-171 | src/document_core/commands/border_paint_edit.rs:231-236 \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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c55ae38f365c63b6885400e4e378ed4da12b1e657d633c0113efd27c49ecc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/document_core/commands/clipboard.rs:989-996 | src/document_core/commands/foreign_paste.rs:214-218 | src/document_core/commands/html_import.rs:397-406 \u2014 before extracting anything, compare \u0060src/document_core/commands/clipboard.rs\u0060 and \u0060src/document_core/commands/foreign_paste.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/html_import.rs:397\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da33eb593216466b24e43ca8669e495bc3b0407645f7c943b7e23250b12a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/paint/metafile_surface.rs:164-168 | src/paint/metafile_surface.rs:242-246 | src/paint/metafile_surface.rs:378-382 \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":"src/paint/metafile_surface.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9687e0d28c5766e6afa3e9fd2eb373b30eca60d269c597aee31a46399b42d2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/composer/line_breaking.rs:360-365 | src/renderer/layout/text_measurement.rs:2977-2981 | src/renderer/layout/text_measurement.rs:3149-3153 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/text_measurement.rs:2977\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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974e710cb24b5a63036e3970b36083e8ebf41c23ae620cfb8061b63aecb58d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/height_measurer.rs:1458-1462 | src/renderer/height_measurer.rs:1631-1635 | src/renderer/height_measurer.rs:1709-1713 \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":"src/renderer/height_measurer.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4437f7897774ceb7c10761c7f773ca18c86fce078b48b185e17b0b638c1e20b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/image_resolver/print_alpha_2024.rs:26-32 | src/renderer/image_resolver/print_codec.rs:57-63 | src/renderer/image_resolver/print_picture_resample.rs:52-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/image_resolver/print_alpha_2024.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_alpha_2024.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd89457536ce405847b84a4a28b9892a6a5e5cd43a6de03fa7d42801d1f3013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/layout/shape_layout.rs:5059-5064 | src/renderer/layout/shape_layout.rs:5276-5281 | src/renderer/typeset.rs:6728-6733 \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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5059}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bd180732dc30818d4beb7a09435437f89dc2ba9ec91b2b5083103864abcafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/layout/table_layout.rs:5664-5668 | src/renderer/layout/table_layout.rs:14493-14497 | src/renderer/layout/table_layout.rs:14568-14572 \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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f24233ac5799d779935c2003445de2ba8faac0acc209d40f30cd70ed6e77270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/pagination/engine.rs:3166-3170 | src/renderer/pagination/engine.rs:3184-3188 | src/renderer/typeset/state/finalize.rs:144-148 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset/state/finalize.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:3166\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9119af410a9bcf33764fac557ed736b58bd6df761ec89266587c87cc125dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/serializer/hwpx/picture.rs:369-374 | src/serializer/hwpx/table.rs:310-315 | src/serializer/hwpx/table.rs:700-705 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/table.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/picture.rs:369\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0244a44cb6f5b99911c1aa2cd2041a291c318c59f1003b0c5c975a62813469bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/wmf/converter/svg/mod.rs:719-724 | src/wmf/converter/svg/mod.rs:1186-1190 | src/wmf/converter/svg/mod.rs:1316-1320 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/converter/svg/mod.rs:719\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/wmf/converter/svg/mod.rs:1321\u0060 calls \u0060push_element\u0060 and \u0060src/wmf/converter/svg/mod.rs:726\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8ef9421480f0ec118b904bcff030b1f25d65f9054b51b99bf26235f3efc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:167-171 | src/wmf/parser/objects/structure/log_color_space.rs:78-82 | src/wmf/parser/objects/structure/log_color_space_w.rs:78-82 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:167\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/wmf/parser/objects/structure/log_color_space.rs:76\u0060 calls \u0060parse\u0060 and \u0060src/wmf/parser/objects/structure/bitmap_info_header/v4.rs:165\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/bitmap_info_header/v4.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b40f82220f34aa9e58f17ec67a53fb465df32946fecb767964f871d4c07932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/wmf/parser/objects/structure/rect.rs:29-33 | src/wmf/parser/records/state/exclude_clip_rect.rs:50-54 | src/wmf/parser/records/state/intersect_clip_rect.rs:50-54 \u2014 before extracting anything, compare \u0060src/wmf/parser/records/state/exclude_clip_rect.rs\u0060 and \u0060src/wmf/parser/records/state/intersect_clip_rect.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/rect.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/rect.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb87713792520dd2976c3313fa41217742a29f489e096aabcfbffa11b3ab18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs:6-18 | mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwpx_slice.rs:7-19 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs\u0060 and \u0060mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwpx_slice.rs\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"mydocs/tech/investigations/issue-4969/probes/scratch_r6_hwp5_slice.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcbb2076f00ff5a34fe3a5981adfd8fa0a22b66a6e307509c68639c83793d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mydocs/tech/investigations/issue-671/probes/inspect_task671.rs:7-12 | mydocs/tech/investigations/issue-671/probes/inspect_task671_v2.rs:11-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"mydocs/tech/investigations/issue-671/probes/inspect_task671.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3932e9e4b48272067ed69452715e2612bca30a6a39f011d8d4a62390e2e662db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): pdf/issue7998/cell-regions/generate_sources.rs:20-24 | pdf/issue7998/local-regions/generate_sources.rs:34-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/issue7998/cell-regions/generate_sources.rs:20\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":"pdf/issue7998/cell-regions/generate_sources.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ceb44af4ae1a8935c8f59ef5e3cd7638810c545718f4790c376c2ca0bd66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/anchor_log.rs:126-131 | src/anchor_log.rs:150-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":"src/anchor_log.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5886fe3e9c1faabcec5323944f60bdad6d237bf8b21eb968ed313bb818d9d58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/commands/edit/cells.rs:205-209 | src/cli/commands/edit/cells.rs:488-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2f954612d4e988c1e720ebb6ca8e6c3e0374a6a0183a7570793d6f92383644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/commands/edit/cells.rs:658-662 | src/cli/commands/edit/formatting.rs:281-285 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 232 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5694b78ff199efa97e572c3bfbb925c0ec37ed9fcfc1ed76d831c6ca05066de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/commands/edit/cells.rs:833-837 | src/cli/commands/edit/tables/grid.rs:581-585 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/edit/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 189 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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e27f7b23d45ab452c749c7c9bac3bdfa9cb68369be992b160482b3e67406977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/commands/edit/document_objects.rs:408-412 | src/cli/commands/edit/header_footer_properties.rs:9-13 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ed251cac2ef78e56db37666cb0f656e6069541d6914a68e149a22a2748807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/commands/edit/tables/coordinates.rs:39-43 | src/cli/commands/tabular_import.rs:235-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/tables/coordinates.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/tables/coordinates.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dc5ece05fc9c976d31a19843d288e081d689d3ed8676ecec8f0404a91ffef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/diagnostics/hwp5_contract_probe.rs:411-416 | src/diagnostics/hwp5_contract_probe.rs:577-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_contract_probe.rs:411\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_probe.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"219bcf096afd679ae5f78cd858420145575141ac8fe02cce5d973843ec1bd0a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/diagnostics/hwp5_inventory_diff.rs:1402-1407 | src/diagnostics/hwp5_inventory_diff.rs:1958-1963 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/hwp5_inventory_diff.rs:1402\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":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc60e47fd71a5af227ca2eb4d9ba5727bfc449fa2c647bf280f79d767563e60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:615-619 | src/diagnostics/ir_field_sweep.rs:716-720 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/ir_field_sweep.rs:615\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026[Paragraph]\u0060 in one and \u0060\u0026[Control]\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":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1588717e9de748a74196d4ffcf35b84006c2cb46beb00755397e4a9d28afb3da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/diagnostics/ir_field_sweep.rs:1187-1192 | src/diagnostics/ir_field_sweep.rs:1218-1223 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/ir_field_sweep.rs:1187\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/ir_field_sweep.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"774c6b7eb22305fa4fe00bf6b9a3b869c73d16a00c20d1f6f6ffb4cedb2b13ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/border_paint_edit.rs:99-104 | src/document_core/commands/border_paint_edit.rs:105-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":"src/document_core/commands/border_paint_edit.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d191152e69648760203ca317945aeb6f0f0dd0a2ef14639ea36af552b77c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:1227-1232 | src/document_core/commands/object_ops/equation.rs:53-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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2863ef0f79de2f52031bdb28c4917f5ec8105fd24107e77527b4023356cb0699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/commands/object_ops/equation.rs:216-220 | src/document_core/commands/object_ops/table.rs:330-334 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/object_ops/table.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b478681ec3caa4944f8e21bfe354b1b07d9cb76d1b060cdd0d2f042c430ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/commands/table_ops.rs:4105-4110 | src/document_core/commands/table_ops.rs:4134-4138 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/table_ops.rs:4105\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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":4105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b092b19893d07849c27d13466ff4d584939492e314fd885bf60206f881fe02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:3997-4001 | src/document_core/queries/cursor_rect.rs:4011-4015 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:3997\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":3997}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba008d51d8c8c6cc82cf18f7e492e7bb19ddf5c9980be736d2b2f011a7b9539c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:5501-5507 | src/document_core/queries/cursor_rect.rs:6017-6023 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:5501\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 \u0060run\u0060 to \u0060\u0026HfRunInfo\u0060 in one and \u0060\u0026FnRunInfo\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":5501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb46b7fc1b92a5bb4a4603c7c94a8a96277570cac095a9086a75093487b6192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/queries/doc_tree_nav.rs:1422-1426 | src/renderer/layout/shape_layout.rs:893-897 \u2014 before extracting anything, compare \u0060src/document_core/queries/doc_tree_nav.rs\u0060 and \u0060src/renderer/layout/shape_layout.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/doc_tree_nav.rs:1422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6573f5a48c09b8354dc29f15c80155b6e2785b3b85e3b8c4a603c7a83a9bf65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/eps.rs:1177-1181 | src/eps.rs:1624-1628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/eps.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0939a2ed7185bf1120eb2addaf87a6b5efcafeb3809e848ecd9ed2cc1b305fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/model/paragraph.rs:3648-3652 | src/model/paragraph.rs:3728-3732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"733cea74558bb3876e9af92fb42cbbb3ef666e66ebced28cd760709bdacf72c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/model/style.rs:678-684 | src/model/style.rs:687-693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e57d1379f873c9ff1e1dd6192b820238dd795116fdaef268f1cb9cd0ef1e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/native_host/gpu_d3d.rs:129-133 | src/native_host/gpu_gl.rs:98-100 | src/native_host/gpu_metal.rs:70-74 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:129\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/native_host/gpu_d3d.rs:128\u0060 calls \u0060contains\u0060 and \u0060src/native_host/gpu_gl.rs:98\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf702ce5a5b61a7d126544a29cd7d6db263bdce9d0242e951a5424fea12e66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/native_host/gpu_d3d.rs:149-153 | src/native_host/gpu_metal.rs:90-94 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060target\u0060 to \u0060NativeD3dTarget\u0060 in one and \u0060NativeMetalTarget\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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8971df1ecf912bec507177928001eb6aa273fa2211c0a0df4e186d0689d3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/ole_chart/legacy_presentation.rs:370-375 | src/ole_chart/legacy_presentation.rs:574-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd37d8059f68566788e165d9f90bc88c8e9bfd6b211884b35a5c7a247ae315d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/paint/metafile_print/catalog.rs:72-77 | src/paint/metafile_print/replay.rs:37-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":"src/paint/metafile_print/catalog.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b1c99968096f2ec7f01fb65515b758534065bc61cc341536244100dc96f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 7): src/diagnostics/layout_anomaly.rs:603-605 | src/document_core/queries/rendering.rs:2740-2742 | src/native_host/view.rs:296-298 | src/paint/paint_bounds.rs:332-336 | src/parser/pdf/table_detection.rs:39-41 | src/parser/pdf/table_detection/cell_regions.rs:154-156 | src/renderer/hyperlinks.rs:43-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/paint_bounds.rs:332\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 \u0060a\u0060 to \u0060\u0026BoundingBox\u0060 in one and \u0060BoundingBox\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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f085e8926860de2f2762c2b3fdd8c180a67d19082a2ded3f45ff7feab4387e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/paint/paint_bounds.rs:381-386 | src/renderer/svg.rs:4298-4303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_bounds.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"835ed5ab7d3bedbf941d5e5e645f40ae103685006f31939ceb007724cd095b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/section.rs:3214-3220 | src/parser/hwpx/section.rs:4768-4774 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc98af4005906556aab7332d67eef01995ec9ec32ba12e6ea3ad074dc8a088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/mod.rs:1907-1912 | src/parser/mod.rs:1952-1957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"db58bb90adf8f572e3f8fcd3b292e90aee73c52bb1bef3812a6e2668957f3e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/recognition.rs:914-919 | tools/pdf-ir-poc/src/recognition.rs:636-641 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/recognition.rs:914\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ecf7360d56f834dd26157f5fdb261246b6c960b13a8e0d8d508517b8d286c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/table_detection.rs:448-452 | tools/pdf-ir-poc/src/table_detection.rs:226-230 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4a8b7d795badfb055a3ccda64f8b02365127ee0bf38d238ef50b861321fb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_detection.rs:1105-1111 | tools/pdf-ir-poc/src/table_detection.rs:615-621 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection.rs:1105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44380d7349e6cdf707494915b4d039183abae720c43c90c7d960f76c3c2f213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/render_backend/png_adapter.rs:151-156 | src/render_backend/skia_adapter.rs:175-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/png_adapter.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d0cbad15aacdc96a4db4c5e17eed2a6c8e20be6ddccd9990a4a9493385ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/composer/line_breaking.rs:5111-5115 | src/renderer/composer/line_breaking.rs:5980-5984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5111}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1f4615cf873eed3b96617377474285e62ef344431fbe50dfa872060da6e4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/equation/canvas_render.rs:203-210 | src/renderer/equation/svg_render.rs:208-215 \u2014 before extracting anything, compare \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 198 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:203\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c4042b12eaadb2390d476df69f7f99eb8db15b2a3ddcfccc9f68b8c124e42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/equation/canvas_render.rs:478-482 | src/renderer/equation/canvas_render.rs:528-532 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/equation/canvas_render.rs:478\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3e23e7313a5d853a157f067d019b349be3ffc8b2e48abf62a7fdebc2b3a591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/font_metric_math_symbols.rs:78-82 | src/renderer/font_metrics_technical_symbols.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/font_metric_math_symbols.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_math_symbols.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"504ec9d7cddcb0391b6fcd9a97e54e5cb57eff9f5df1e181f27e1a14100bc9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/font_metrics_data.rs:413-419 | src/renderer/layout/text_measurement.rs:1296-1302 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/font_metrics_data.rs:413\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metrics_data.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ebecb139ea2dd781f9b473bcb354cdd94ab25c336588fb0f6856d3aa64f910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/height_measurer.rs:1004-1008 | src/renderer/height_measurer.rs:1256-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"04036db71c5aa7bf62f08d48b41b2335dd517ba04ab2b5acc327a1b0815b67c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/height_measurer.rs:3884-3888 | src/renderer/height_measurer.rs:4473-4479 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/height_measurer.rs:3884\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":"src/renderer/height_measurer.rs"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dcef7f98cc1191ff9d08963500d64b39b7561566edf3445d84b24f193ff3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/height_measurer.rs:3994-3998 | src/renderer/height_measurer.rs:5029-5033 | src/renderer/height_measurer.rs:5819-5823 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:3994\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3994}}}],"partialFingerprints":{"codehealthFindingId/v1":"36caca648f3821b3f3cd5577c2c9f938b5789a2dfaed60104b9476ee38f7d5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/image_resolver/picture_adjustments.rs:114-119 | src/renderer/image_resolver/wmf_picture.rs:114-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/image_resolver/picture_adjustments.rs:114\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":"src/renderer/image_resolver/picture_adjustments.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea19f41dea6ad4446e0af515e759d6cf0a9f81141edbdaf0ead78c5a70df249d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/inline_flow/table_rows.rs:92-97 | src/renderer/inline_flow/table_rows.rs:147-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/inline_flow/table_rows.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow/table_rows.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56a8684922d35edaa8f36b5f918b25d63425e54ce4955d860b8185d3f3dc20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/layout.rs:14604-14609 | src/renderer/layout.rs:14677-14681 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout.rs:14604\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":14604}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dbef186da7944121e742093614f449ea66b3b7e81f687bd62747f590e6c409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout.rs:17562-17567 | src/renderer/layout/table_partial.rs:3180-3185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":17562}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5df4600e23709cf940a53dded0031f82528dbe0bf7e33a45048793d453f988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:3657-3661 | src/renderer/typeset/controls/empty_float.rs:114-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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":3657}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf03f63f73fa6541bfe26367db282b0ed34e988822af5c9958ce7658dae36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_layout.rs:2821-2827 | src/renderer/layout/table_layout.rs:2857-2863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dcd9da460743e3b15c4d42cb0304a08291e38c8719b847e8a989fed8b3756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/layout/table_layout.rs:24448-24452 | src/renderer/layout/table_layout.rs:24952-24956 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:24448\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24448}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce2b355e1f107544343f0c6a0cda3f6e558f6413b564b12a928060fdf3d0a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/layout/table_layout.rs:25971-25975 | src/renderer/layout/table_layout.rs:27224-27228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":25971}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a95868746fcc31a53b02553bd1cb31df5ee2116c0b8c14148336c33d174ee23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/table_layout/reflow_external_cut.rs:64-69 | src/renderer/layout/table_layout/reflow_nested_band.rs:83-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":"src/renderer/layout/table_layout/reflow_external_cut.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bc46ac5c725da1938a40bbc175fbbef24bc6f62de3382210ab3cf6c3338ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_partial.rs:603-609 | src/renderer/layout/table_partial.rs:620-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_partial.rs:603\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":"src/renderer/layout/table_partial.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d987fb102896dce72207a8bb9e139ac094eb91d50d90b26a79d160b8724a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/mod.rs:3166-3170 | src/renderer/mod.rs:3204-3211 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/mod.rs:3166\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":"src/renderer/mod.rs"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6bd16554cc3183a9645fe5bfbe17a50029d145221fb712b589a9bf649bdf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/pagination.rs:822-826 | src/renderer/pagination.rs:1372-1376 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/pagination.rs:822\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/pagination.rs:1369\u0060 calls \u0060try_clone\u0060 and \u0060src/renderer/pagination.rs:820\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c1bc62ce99131ead507f2be22512d7c98a4d614bdc7fe94afd222f1b118a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/pdf_synthetic_bold.rs:43-47 | src/renderer/pdf_synthetic_italic.rs:39-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/pdf_synthetic_bold.rs:43\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":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb1ad2ae6bb63148031c6cf44dd09a09af988f6ea217bc49fdf2c86285b880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/pdf_synthetic_bold.rs:135-140 | src/renderer/pdf_synthetic_italic.rs:165-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pdf_synthetic_bold.rs:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf_synthetic_bold.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2bb41f45f671ec5b3388f0e3d66fd7f18146ffbf43cf079f7699937b348554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/renderer/skia/print_image_sampling.rs:19-28 | src/renderer/skia/print_image_sampling.rs:61-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/print_image_sampling.rs:19\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/print_image_sampling.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3b66efdc50b142685ed5ca1e9409715f22131927a0eed7e804268e4d0a3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/skia/renderer.rs:1942-1946 | src/renderer/web_canvas.rs:872-876 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/renderer.rs:1942\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/renderer.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"add51f908678af2854b2a0c0b8e612cf7d1dc28f51d455de9b9e968c8c4a2585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/skia/text_replay/decorations.rs:54-58 | src/renderer/skia/text_replay/lines.rs:104-108 \u2014 before extracting anything, compare \u0060src/renderer/skia/text_replay/decorations.rs\u0060 and \u0060src/renderer/skia/text_replay/lines.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/skia/text_replay/decorations.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/decorations.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc49b4628653db0c13383cdb023905834f0f88c0c43a510574cc95ec6b54a2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/typeset/paragraph.rs:635-639 | src/renderer/typeset/paragraph.rs:862-866 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8599757e3ff0be9c6c8713327e0ecbc28c4d81114b2d89feb46e315edb6a71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/web_canvas.rs:1609-1613 | src/renderer/web_canvas.rs:1656-1660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba886d6692b7e9a42d9780f91e1221c96313b904a1f905caf74ce6618453760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): src/wmf/converter/bitmap.rs:107-111 | src/wmf/converter/bitmap.rs:163-167 | src/wmf/converter/bitmap.rs:177-180 \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":"src/wmf/converter/bitmap.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92b5be8c4eb6d5f1443dd451bac8a07b703e1f9f691d59d2d674a6813863be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/wmf/converter/svg/ternary_raster_operator.rs:571-575 | src/wmf/converter/svg/ternary_raster_operator.rs:601-605 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wmf/converter/svg/ternary_raster_operator.rs:571\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":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4a4dc03221965c071333127b8fb49a1ad3e3a2abe36b232a067879189270ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bindings/Native/src/gpu_d3d.rs:308-317 | bindings/Native/src/gpu_metal.rs:308-317 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a384842e5112a94d54f3febb60305fe1d30ac039befdafbff0e3b883241f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pdf/issue7998/cell-regions/generate_sources.rs:6-12 | pdf/issue7998/local-regions/generate_sources.rs:6-12 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pdf/issue7998/local-regions/generate_sources.rs:15\u0060 calls \u0060create_dir_all\u0060, \u0060join\u0060, \u0060unwrap\u0060 and \u0060pdf/issue7998/cell-regions/generate_sources.rs:15\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":"pdf/issue7998/cell-regions/generate_sources.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d566f2537214838eb12cf55e5df1ef0c0ac9c455204deea5bdd39e4d503ad4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bin/rhwp-agent/compare.rs:9-15 | src/bin/rhwp-agent/searchcmd.rs:8-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/bin/rhwp-agent/compare.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20422ca35c9e5d5139fc36cdb36b6ea2df56be8ba007ea90bb14c842dbdeaf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/bin/rhwp-agent/contextcost.rs:46-52 | src/diagnostics/hwp5_ctrl_data_trace.rs:371-377 | src/parser/control.rs:1073-1079 \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":"src/bin/rhwp-agent/contextcost.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c773cb49c568731fb281c862206fafb7d2ecb431c13c92b87c85a4be8765540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-agent/scan.rs:20-28 | src/cli/queries/scan.rs:92-100 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\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":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f2780609da01304243fa22288067f9f9e22adc78caab5f8ebbc3966866f932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:157-164 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:156-163 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:160-167 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:140-147 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1a7ac7abc50c21bf00bf1008d29f697a5be78dbab732c49a00951aa1b199fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:171-180 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:170-179 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:174-183 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:154-163 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb173157d066214440920d9727d1232d8fb200465c546a40c2379070c8df3010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:182-189 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:165-172 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-para-shape.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 221 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb003fc56e6710dc17f8168277561889c14c68c544255b79d7c8c799ab543c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:196-205 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:179-188 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-para-shape.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 221 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6774c8eb9b68387c3053981388d77353b3e0345b3c4a74f2ce7b0d022ac45ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:304-310 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:299-305 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:285-291 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-form-info.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"297f5813814fea3858e49c3c948b8f41bc7946e36328f15930d0a453589824dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:247-252 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:236-241 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-text-layout.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6360531b801a1609ab079b0190ece354a4c048ae77240308ebfe69acda39d06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:41-46 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:47-52 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:41-46 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:43-48 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:42-47 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:41-46 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3363b21ca548cdd2329b0b76ed62f917562da0609ed51373f46e366a84eacb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:54-63 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:50-59 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-items.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-font-trace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"835a6c00a083840eb9c06210ecbd3b567f0270eddb3badfee99fff9d7a6ac75d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:33-41 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:33-41 | src/bin/rhwp-q/kit/envelope.rs:31-39 | src/bin/rhwp-q/more/envelope.rs:27-35 | src/bin/rhwp-q/pack/envelope.rs:27-35 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3512a9ce4074aec264dc4998ea7c93136a4facf540ae2a3d7a1b58d39f9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11): src/bin/rhwp-q/kit/cell_shape.rs:77-86 | src/bin/rhwp-q/kit/cursor_in_cell.rs:115-124 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:110-119 | src/bin/rhwp-q/kit/cursor_in_hf.rs:148-157 | src/bin/rhwp-q/kit/cursor_in_note.rs:109-118 | src/bin/rhwp-q/kit/flow_images.rs:80-89 | src/bin/rhwp-q/kit/footnote_hit.rs:99-108 | src/bin/rhwp-q/kit/footnote_info.rs:94-103 | src/bin/rhwp-q/kit/hit_header.rs:99-108 | src/bin/rhwp-q/kit/note_edit_info.rs:94-103 | src/bin/rhwp-q/kit/overlay_images.rs:84-93 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cell_shape.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fc5658fb65da0e4cd441b60de0c6cee628d20d1b5134d3658bb9fbdc8217fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): src/bin/rhwp-q/kit/cell_shape.rs:104-111 | src/bin/rhwp-q/kit/cursor_in_cell.rs:142-149 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:137-144 | src/bin/rhwp-q/kit/cursor_in_hf.rs:175-182 | src/bin/rhwp-q/kit/cursor_in_note.rs:136-143 | src/bin/rhwp-q/kit/flow_images.rs:107-114 | src/bin/rhwp-q/kit/footnote_hit.rs:126-133 | src/bin/rhwp-q/kit/footnote_info.rs:121-128 | src/bin/rhwp-q/kit/hit_header.rs:126-133 | src/bin/rhwp-q/kit/note_edit_info.rs:121-128 | src/bin/rhwp-q/kit/overlay_images.rs:111-118 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cell_shape.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"232a4ace1db65bbb73a8fc62c92d525c659ae7f37e8a89490414587b0c21d406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 11): src/bin/rhwp-q/kit/cell_shape.rs:119-125 | src/bin/rhwp-q/kit/cursor_in_cell.rs:157-163 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:152-158 | src/bin/rhwp-q/kit/cursor_in_hf.rs:190-196 | src/bin/rhwp-q/kit/cursor_in_note.rs:151-157 | src/bin/rhwp-q/kit/flow_images.rs:122-128 | src/bin/rhwp-q/kit/footnote_hit.rs:141-147 | src/bin/rhwp-q/kit/footnote_info.rs:136-142 | src/bin/rhwp-q/kit/hit_header.rs:141-147 | src/bin/rhwp-q/kit/note_edit_info.rs:136-142 | src/bin/rhwp-q/kit/overlay_images.rs:126-132 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cell_shape.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"77424807ca15e1870d867692095617afe4795755caf2ab3d06c370e83f799e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/bin/rhwp-q/kit/envelope.rs:41-49 | src/bin/rhwp-q/more/envelope.rs:37-45 | src/bin/rhwp-q/pack/envelope.rs:37-45 \u2014 \u0060src/bin/rhwp-q/kit/envelope.rs\u0060 and \u0060src/bin/rhwp-q/more/envelope.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 4 separate duplicated blocks between them, totalling at least 56 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":"src/bin/rhwp-q/kit/envelope.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"162c7b7ea826108b28ee3ff27c0f74f6b2971c6c33e24d35cad535c51d2dc3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/more/envelope.rs:47-56 | src/bin/rhwp-q/pack/envelope.rs:47-56 \u2014 \u0060src/bin/rhwp-q/more/envelope.rs\u0060 and \u0060src/bin/rhwp-q/pack/envelope.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 7 separate duplicated blocks between them, totalling at least 125 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":"src/bin/rhwp-q/more/envelope.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ede912f5bc23c4223a76355604a6a47d3d31fa528469434eb201629df5887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bin/rhwp-q/more/inventory.rs:46-50 | src/bin/rhwp-q/pack/inventory.rs:76-80 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:46\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75da240f58c6bd6ea8a196dbd8468ec8778332d504ed2bfefe652f6b6c4de5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bin/rhwp-q/more/probe.rs:69-73 | src/bin/rhwp-q/pack/probe.rs:69-73 \u2014 \u0060src/bin/rhwp-q/more/probe.rs\u0060 and \u0060src/bin/rhwp-q/pack/probe.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 5 separate duplicated blocks between them, totalling at least 113 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":"src/bin/rhwp-q/more/probe.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bb961ae258a93ff6372a27e13793ab3a9329f567339d178cc3f9060ea5ad25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/capabilities_schema.rs:514-520 | src/plan_schema.rs:451-457 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/capabilities_schema.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"837fd8f42250a899896218bff37986680bc2ab847721ac42f3bc4bef605ffdee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/diagnostics/hwp5_anchor_trace.rs:450-459 | src/diagnostics/hwp5_ctrl_data_trace.rs:402-411 | src/diagnostics/hwp5_inventory.rs:503-512 | src/diagnostics/hwp5_inventory_diff.rs:1812-1821 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_anchor_trace.rs\u0060 and \u0060src/diagnostics/hwp5_inventory.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":"src/diagnostics/hwp5_anchor_trace.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5314114fbf0a8b4dc848972fa75adf38b10d5d18206c0c63528efaa0e750e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:453-461 | src/diagnostics/hwp5_contract_probe.rs:625-633 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 258 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c7d2041d0c49094393904cc254d8b313b2a92aede4907788a2433f1b05565d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:513-517 | src/diagnostics/hwp5_inventory_diff.rs:1794-1798 | src/renderer/image_header.rs:250-254 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9c7e9acfad8efbcea98a187b2592015e1360cd13fc06bea155d5b08f921857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:519-523 | src/diagnostics/hwp5_cell_header_probe.rs:867-871 | src/diagnostics/hwp5_contract_probe.rs:785-789 | src/diagnostics/hwp5_first_para_control_probe.rs:1404-1408 | src/diagnostics/hwp5_inventory_diff.rs:1800-1804 | src/diagnostics/hwp5_mel_personnel_probe.rs:781-785 | src/diagnostics/hwp5_table_probe.rs:636-640 | src/renderer/image_header.rs:262-266 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"20de902e9d9b7c06eea551795b4191cd4fe3a108c1621cce11c6db0b1ca650f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/diagnostics/hwp5_inventory.rs:29-35 | src/diagnostics/hwp5_inventory_diff.rs:21-27 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f54a6913fb20a31b84a3491c7a5f0a288afc76a8e25c9ec724a17d928d9cac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/diagnostics/hwp5_inventory.rs:514-523 | src/diagnostics/hwp5_inventory_diff.rs:744-753 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_inventory.rs\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 112 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ab53328a43c29364f570c96fd8f3c66c3304deeba55f588063d43524662ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/diagnostics/hwp5_inventory_diff.rs:1806-1810 | src/renderer/image_header.rs:268-272 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"4605475801acc98e8fc1ffbdc19fd9510457493725653860515859a19911095c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): src/document_core/helpers.rs:314-319 | src/renderer/canvas.rs:476-481 | src/renderer/html.rs:575-580 | src/renderer/layout/paragraph_layout.rs:13112-13117 | src/renderer/svg.rs:4321-4326 | src/renderer/web_canvas.rs:4568-4573 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/web_canvas.rs:4561\u0060 calls \u0060restore\u0060 and \u0060src/renderer/canvas.rs:472\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f271a04274dcadd6605629713592632abf20b5af77831989673261645f4dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/hwpjson/ctx.rs:266-271 | src/document_core/hwpjson/pack.rs:54-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/ctx.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d896ade4e9cef33f08996fd4a6e732ae49b97070a800c285a2d652581e710b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/queries/font_metric_coverage.rs:314-323 | src/document_core/queries/hwpctrl_sets.rs:56-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"25edb8905eb5967f734644f8671bea014b56573469385b7101126abc99dcf1dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/queries/memo_query.rs:183-193 | src/parser/body_text.rs:244-254 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/memo_query.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"145095cf1d94fd78df5f313aa3ef06a2d4e02f593e11e69d2652a3ceb2b459fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/queries/stego_scan.rs:161-165 | src/document_core/text_security.rs:528-532 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/stego_scan.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd574686b67789ab2bf8cfad68eae4fd27acf50bb72674127d408fcf1fd0a453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/native_host/gpu_d3d.rs:111-121 | src/native_host/gpu_metal.rs:52-62 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"35db06489cf2664dc56c0becd3d717e339a6ba244b9987a6e736f41c80f9b2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/native_host/render_snapshot.rs:35-42 | src/paint/json.rs:3798-3805 | src/renderer/canvaskit_policy.rs:1155-1162 \u2014 before extracting anything, compare \u0060src/paint/json.rs\u0060 and \u0060src/renderer/canvaskit_policy.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"src/native_host/render_snapshot.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e2aa4f4ecddd9cbf4199a36a439391e2dabca2945221b85b12e7537799ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/json.rs:1850-1858 | src/renderer/canvaskit_policy.rs:2219-2227 \u2014 before extracting anything, compare \u0060src/paint/json.rs\u0060 and \u0060src/renderer/canvaskit_policy.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"src/paint/json.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"465336a59a5d9eed26b04572cdf8723dded269db67d751428720f461b7488379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/paint/json.rs:3755-3762 | src/renderer/canvaskit_policy.rs:2404-2411 \u2014 before extracting anything, compare \u0060src/paint/json.rs\u0060 and \u0060src/renderer/canvaskit_policy.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"src/paint/json.rs"},"region":{"startLine":3755}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bb224e854ce48e9a8442adc8dfc30462885472583e47da2d2a60cfc3a80a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/paint_op.rs:1953-1961 | src/paint/text_shape.rs:83-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/paint/paint_op.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbe20f919193bb041c8bde3098cba1600314b6b94e5fa84419e6a9e2b3b2a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/paint/shaping_glyph.rs:323-327 | src/renderer/shaping_composition.rs:486-490 | src/renderer/shaping_vertical.rs:839-843 \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":"src/paint/shaping_glyph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa747d09b88ad6c6c82ab302021692a2a6e2553a74f63381a40ae887f5d853d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/lowering.rs:28-33 | tools/pdf-ir-poc/src/lowering.rs:23-28 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 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":"src/parser/pdf/lowering.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f01ae3e8903552616cc1523ca1491e720b56a7888c646fe61081f0118a1f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/parser/pdf/lowering.rs:111-123 | tools/pdf-ir-poc/src/lowering.rs:35-47 \u2014 before extracting anything, compare \u0060src/parser/pdf/lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/lowering.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 119 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":"src/parser/pdf/lowering.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"abef4cd669bb8dd7403df70acfbecfe45377a6ab8e9181f02cd50de67b325700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/recognition.rs:671-675 | tools/pdf-ir-poc/src/recognition.rs:422-426 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed224bb435337038024a539266205cd087282e44bc7b79579eec2bd5e3bc918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:743-748 | tools/pdf-ir-poc/src/structured_lowering.rs:21-26 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a61cbc61d359f94e2cf9f2d44730969bcd6300f78f5da77689509587e0be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:749-753 | tools/pdf-ir-poc/src/structured_lowering.rs:27-31 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fd3d6c8c83652f2fa037d2b296e881ec8ba8354eb600288d54b4a3f6b9e59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:758-764 | tools/pdf-ir-poc/src/structured_lowering.rs:36-42 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a90b97fe9d0dc718febb4afd5f3ba52e9e0ffca5935951fd497da5d9b9b39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_detection.rs:69-75 | tools/pdf-ir-poc/src/table_detection.rs:31-37 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c4688c11c3ab95c8b1689ce0650c82c33832531bb694b24287aa947a4e1ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/table_detection.rs:76-80 | tools/pdf-ir-poc/src/table_detection.rs:38-42 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b5ece59e8076ab12ec540bf291447fce718150bd887b604de750010dcb8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/pdf/table_detection.rs:368-376 | tools/pdf-ir-poc/src/table_detection.rs:158-166 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e33de698d54c5230f6d92cdf50f5a3f98b598f21c28c51322f8b938422e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/parser/pdf/table_detection.rs:562-567 | src/parser/pdf/table_inference.rs:67-72 | tools/pdf-ir-poc/src/table_detection.rs:302-307 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d07b9afbd5442f64c814f2918c288d61c9c30ea21cbc2997e92c0213c2c15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:23-30 | tools/pdf-ir-poc/src/table_hierarchy.rs:22-29 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fdd982bceaa2d3150c883b1c6878221a5364e63c8817da356b0e645e19f58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:44-49 | tools/pdf-ir-poc/src/table_hierarchy.rs:43-48 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f0788821cc14cf0e3916dd2bf99477c96f3193c42a5a429a79f945a3939f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser/pdf/table_hierarchy.rs:177-188 | tools/pdf-ir-poc/src/table_hierarchy.rs:155-166 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_hierarchy.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_hierarchy.rs\u0060 as WHOLE FILES: this scan already matched 9 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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d699960f69d7159228215f8029ac7f5779f36a5d7bc951afd5f34be31935570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/table_paint.rs:101-107 | src/renderer/layout.rs:4458-4464 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_paint.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea20771b18c76d8c7f8658cfc76f12afc92474a0a65690a5cb1ba03383f3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/render_backend/png_adapter.rs:53-61 | src/render_backend/skia_adapter.rs:65-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/render_backend/png_adapter.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2a23d1616be6f390919fdc477623b41e1bafa5012bc48a3c3aad1a34bf2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/float_placement.rs:8887-8891 | src/renderer/layout.rs:1254-1258 | src/renderer/typeset.rs:756-760 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":8887}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeae9a89a5ba57fc109776cac0dab0fa9a09ea574cbd72e08aa95c7a40746708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/height_cursor.rs:154-161 | src/renderer/typeset.rs:955-962 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/height_cursor.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb63f927497c9fa77cbed1462d97b16468d2972a0d6c806d5009fb72ba83c2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/kerning.rs:1052-1058 | src/renderer/shaping.rs:151-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/kerning.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"7804751bbe60a04ae5d89378e23c2db3168b001f5a3ff4c94882c278d418f042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout.rs:1740-1746 | src/renderer/typeset.rs:785-791 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9f59671e9683beba463139f6d91a2fa559c96d7b5a8aa32ba242eae39cdfc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/layout.rs:1748-1759 | src/renderer/typeset.rs:793-804 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d4d5303fd18eaaac25d0df777072b538ac26b6f632bfe11a38864e9b7cc713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout.rs:1846-1852 | src/renderer/typeset.rs:822-828 \u2014 before extracting anything, compare \u0060src/renderer/layout.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c78c498966085671624a076c26f8808cba58d9319757a2d13549fbe0b6ec97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/page_layout.rs:49-57 | src/renderer/render_tree.rs:852-860 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/page_layout.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63ca7040455e7bb71d3abfa21fa10e8994432ca06176b296ca37e2d0760a3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/pagination/engine.rs:124-131 | src/renderer/typeset.rs:2206-2213 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 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":"src/renderer/pagination/engine.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0eacf42ea29728f5fd21f3334532c400f447684d639b6f4ee8d2fb728ea237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/render_normalization/math_table.rs:68-73 | src/renderer/render_normalization/math_textbox.rs:14-19 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization/math_table.rs\u0060 and \u0060src/renderer/render_normalization/math_textbox.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/math_table.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"88000fd8d7a4bf8e4a46fa111abdb1b8d0cc028cf46bbedbfb1bc5f0d20e6921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/render_normalization/math_table.rs:178-183 | src/renderer/render_normalization/math_textbox.rs:128-133 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization/math_table.rs\u0060 and \u0060src/renderer/render_normalization/math_textbox.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/render_normalization/math_table.rs:178\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":"src/renderer/render_normalization/math_table.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff123e1b10abdf0c7f31f3f5d20e775ceaeb07e6d322ba5b0f936625ac240022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/typeset/controls/paragraph_flow.rs:98-103 | src/renderer/typeset/paragraph/flow.rs:24-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset/controls/paragraph_flow.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060TableParagraphInput\u003C\u0027_\u003E\u0060 in one and \u0060ParagraphFlowInput\u003C\u0027_\u003E\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":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50996127523e20616802763abeaf3526eba1042f526d6d848a9e4d67cfe8d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/serializer/body_text.rs:50-55 | src/serializer/control.rs:368-373 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060payload\u0060 to \u0060ParaPayload\u003C\u0027_\u003E\u0060 in one and \u0060ControlPayload\u003C\u0027_\u003E\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":"src/serializer/body_text.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed16e99c730ec8d672668bb53e5e888b46e1287190106a578bfdb5972795d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/serializer/hml/body.rs:547-555 | src/serializer/hml/preflight.rs:473-481 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/serializer/hml/body.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feca441f2650af7f874a89f28811f9984d6831341a953a134b84f94201a97e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): src/serializer/hwpx/picture.rs:673-693 | src/serializer/hwpx/shape.rs:1560-1582 | src/serializer/hwpx/table.rs:177-196 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6062c1848e62cb63bf0be0a1efca77f58619dee7c598217aeab334127c695d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/serializer/hwpx/picture.rs:769-779 | src/serializer/hwpx/shape.rs:1730-1740 | src/serializer/hwpx/table.rs:722-732 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dbe3801ac6aa0cff89dc21a0aa61cf49947b5253fee3f62447c5e9df61d5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/serializer/hwpx/picture.rs:781-788 | src/serializer/hwpx/shape.rs:1742-1749 | src/serializer/hwpx/table.rs:734-741 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a143d20d533337d06623c7f07d36859861a1379d53ef5018ffc3a2d5d2a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/serializer/hwpx/picture.rs:809-818 | src/serializer/hwpx/shape.rs:1770-1779 | src/serializer/hwpx/table.rs:778-787 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fa9abf78ff0a3d8f92b33f02eaf792c4c7ea3d23aa20c6e429c57bf0f7c26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/serializer/hwpx/picture.rs:820-829 | src/serializer/hwpx/shape.rs:1781-1790 | src/serializer/hwpx/table.rs:789-798 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/picture.rs\u0060 and \u0060src/serializer/hwpx/shape.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/picture.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e599e208b9a3afdd453a80adaf4a890d2d187c09deaf7d60fddbc91fe3e0ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/serializer/hwpx/section.rs:4897-4905 | src/serializer/hwpx/shape.rs:1587-1595 | src/serializer/hwpx/table.rs:199-207 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/section.rs\u0060 and \u0060src/serializer/hwpx/shape.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"e313c835a8e8504226a4814d946748de6a0d6619143b75648d1521f4153c8d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/serializer/hwpx/section.rs:4912-4918 | src/serializer/hwpx/shape.rs:1602-1608 | src/serializer/hwpx/table.rs:214-220 \u2014 before extracting anything, compare \u0060src/serializer/hwpx/section.rs\u0060 and \u0060src/serializer/hwpx/shape.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"src/serializer/hwpx/section.rs"},"region":{"startLine":4912}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccbf32e8e218d0e8b1f0e4f24831a0c7e38c90230351db67bb050976b1cf8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14): src/document_core/commands/document.rs:2640-2647 | src/document_core/queries/rendering.rs:5462-5467 | src/model/paragraph.rs:2508-2513 | src/renderer/composer/frame_geometry.rs:82-87 | src/renderer/page_number.rs:59-64 | src/renderer/pagination.rs:735-740 | src/renderer/render_normalization.rs:389-394 | src/renderer/typeset/state.rs:483-488 | src/renderer/typeset/state.rs:769-774 | src/renderer/typeset/state.rs:787-794 | src/renderer/typeset/state.rs:815-822 | src/renderer/typeset/state.rs:868-873 | src/renderer/typeset/state.rs:964-971 | src/renderer/typeset/state.rs:1098-1105 \u2014 before extracting anything, compare \u0060src/renderer/render_normalization.rs\u0060 and \u0060src/renderer/typeset/state.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/frame_geometry.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn paginate_pass(\u0026mut\u0060 in one and \u0060\u0026mut\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":"src/document_core/commands/document.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e73540763f5faec3c95131f55db8a42038c503058621193571bf660cf512910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/commands/document.rs:2977-2982 | src/model/paragraph.rs:682-687 | src/model/paragraph.rs:3252-3257 \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":"src/document_core/commands/document.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f662ed6fbd9e0e2de25464c6d905a5633fb2164f2a5c5d8f2a490cf37d7ad7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/document_core/converters/common_obj_attr_writer.rs:31-36 | src/renderer/composer/inline_control_projection.inc.rs:70-75 | src/renderer/composer/stored_lines_runs.inc.rs:598-603 | src/serializer/body_text.rs:912-917 | src/serializer/record_writer.rs:70-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/common_obj_attr_writer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"912e0b2e5f8038d69d8cb25aaa9b41b6fe2378f9f0338f9b8df2431d61a8c7a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/loaded_frame_restore.rs:143-148 | src/document_core/loaded_frame_restore.rs:163-168 | src/renderer/height_measurer.rs:2775-2780 \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":"src/document_core/loaded_frame_restore.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b0276f1afc3ff979b7b8c04c838d46cdf2d0d40f33e619d26c8b1326c18f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/document_core/loaded_frame_restore.rs:228-233 | src/model/table.rs:1141-1146 | src/model/table.rs:1681-1686 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn capture_loaded_source_frames(\u0026mut\u0060 in one and \u0060\u0026mut\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":"src/document_core/loaded_frame_restore.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d87644cdd147dc825707a3ca6f3b114aa648a75e5ef0eb29d220a51b5692dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/emf/emfplus/stream.rs:63-67 | src/emf/emfplus/stream.rs:69-73 | src/emf/emfplus/stream.rs:75-79 | src/paint/text_shadow.rs:130-134 \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":"src/emf/emfplus/stream.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7292e77cd27396822a021c877b51459fe47848a3b8aabbbb8c70581f245225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/border_paint.rs:1187-1192 | src/model/text_clip.rs:267-272 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/border_paint.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce86c8649edc4029a81576dd3ead909c8b7a41f4c2faced1aceb250b1a23df08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/document.rs:468-473 | src/paint/metafile_surface.rs:49-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da887ebe5ce6551667d7f8d323a4c63a1d585787723a8fd29743360e82327db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/paint/text_v2_slots.rs:289-295 | src/paint/text_variants.rs:667-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":"src/paint/text_v2_slots.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d64d2f9c656c59ec5e11c249e1149c6ff9e3b376f9a9c91c78b5da8dfe90d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/body_text.rs:361-366 | src/parser/hwpx/section.rs:213-218 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sections\u0060 to \u0060\u0026mut [crate::model::document::Section]\u0060 in one and \u0060\u0026mut [Section]\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":"src/parser/body_text.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee52f7f0a782e449c4e8316a9ae3ca95b11f8f1bf3875e4241d68c0e2ebf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/arabic_context.rs:96-101 | src/renderer/composer/conjoining_jamo.rs:30-35 | src/renderer/composer/supplemental_clusters.rs:186-191 \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":"src/renderer/arabic_context.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b05e01be95a3b5cc84ad99f8d45e8c30962fd6069105e5bdec6ffc1b51b6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 14): src/renderer/composer/conjoining_jamo.rs:89-100 | src/renderer/composer/line_breaking.rs:4347-4358 | src/renderer/composer/line_breaking.rs:5427-5438 | src/renderer/composer/line_breaking.rs:5466-5477 | src/renderer/composer/reflow_helpers.inc.rs:703-714 | src/renderer/composer/reflow_helpers.inc.rs:904-915 | src/renderer/composer/stored_word_tail.rs:28-39 | src/renderer/composer/stored_word_tail.rs:119-130 | src/renderer/composer/stored_word_tail.rs:184-195 | src/renderer/height_measurer.rs:1727-1738 | src/renderer/inline_flow.rs:1009-1020 | src/renderer/render_normalization/stored_text_metrics.rs:203-214 | src/renderer/typeset.rs:1723-1734 | src/renderer/typeset/table.rs:50-61 \u2014 before extracting anything, compare \u0060src/renderer/composer/reflow_helpers.inc.rs\u0060 and \u0060src/renderer/composer/stored_word_tail.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/conjoining_jamo.rs:89\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":"src/renderer/composer/conjoining_jamo.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c04f311fc1de5e074da80650782743eb7f64b456326f7ac0ee9fa217b3044c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/composer/empty_line_metrics.rs:11-16 | src/serializer/control.rs:613-618 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/empty_line_metrics.rs:11\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":"src/renderer/composer/empty_line_metrics.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a11952916dfc327ab4213eef482a8d7f2665192742a3a8fb72d4e4b081253bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/renderer/composer/equation_line_metrics.rs:29-40 | src/serializer/body_text.rs:369-380 | src/serializer/control.rs:449-460 | src/serializer/control.rs:1487-1498 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/equation_line_metrics.rs:29\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":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a5264bb12da5f70e098a78095791d21c68b0db8db87d5ab391051f593613f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/composer/line_breaking.rs:5176-5192 | src/renderer/composer/reflow_helpers.inc.rs:1034-1050 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/composer/line_breaking.rs:5176\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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":5176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23c92a2041dc7214608e9be47ab3eb6505b15bb1947cc09eafe928aa7c2cebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 13): src/renderer/composer/reflow_helpers.inc.rs:201-214 | src/renderer/composer/stored_cell_reflow.inc.rs:703-716 | src/renderer/composer/stored_margin_context.rs:52-65 | src/renderer/composer/stored_margin_context.rs:108-121 | src/renderer/composer/stored_word_tail.rs:506-519 | src/renderer/equation_tac_flow.rs:42-55 | src/renderer/inline_flow.rs:263-276 | src/renderer/pagination.rs:563-576 | src/renderer/typeset.rs:1761-1774 | src/renderer/typeset/paragraph.rs:81-94 | src/renderer/typeset/paragraph.rs:1296-1309 | src/renderer/typeset/paragraph/columns.rs:15-28 | src/renderer/typeset/table.rs:239-252 \u2014 before extracting anything, compare \u0060src/renderer/composer/reflow_helpers.inc.rs\u0060 and \u0060src/renderer/composer/stored_word_tail.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/reflow_helpers.inc.rs: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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3496042e0c4117e29268ab45aec01ca2da255d386cc72f1e06305458a7608db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 12): src/renderer/composer/reflow_helpers.inc.rs:536-548 | src/renderer/composer/stored_margin_context.rs:200-212 | src/renderer/composer/stored_margin_context.rs:259-271 | src/renderer/composer/stored_word_tail.rs:404-416 | src/renderer/composer/stored_word_tail.rs:467-479 | src/renderer/layout/shape_layout.rs:376-388 | src/renderer/mod.rs:2705-2717 | src/renderer/pagination.rs:1395-1407 | src/renderer/render_normalization/cached_frame_owner.rs:82-94 | src/renderer/render_normalization/stored_nested_text_frames.rs:63-75 | src/renderer/render_normalization/stored_text_metrics.rs:139-151 | src/renderer/typeset/paragraph.rs:1472-1484 \u2014 before extracting anything, compare \u0060src/renderer/composer/reflow_helpers.inc.rs\u0060 and \u0060src/renderer/composer/stored_word_tail.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/reflow_helpers.inc.rs:536\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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa06653053770c970a5d75b3f2a744e2fe945095c3e7b7e2201d93a68707fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/renderer/composer/reflow_helpers.inc.rs:594-609 | src/renderer/composer/stored_cell_reflow.inc.rs:356-371 | src/renderer/typeset/controls.rs:494-509 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/reflow_helpers.inc.rs:594\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":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af6364cbde9c0b1f74131127d5b9dd20d4f03c063b5b2a707fb663f7f9578fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/renderer/composer/stored_cell_reflow.inc.rs:28-48 | src/renderer/typeset/paragraph.rs:810-830 \u2014 before extracting anything, compare \u0060src/renderer/composer/stored_cell_reflow.inc.rs\u0060 and \u0060src/renderer/typeset/paragraph.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_cell_reflow.inc.rs:28\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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9bfd308bc94929fbb0290f094f98652d12b6e01ea7c31faac976a5335b695c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/renderer/composer/stored_marker_frames.rs:12-17 | src/renderer/inline_flow/alignment.rs:35-40 | src/renderer/typeset/controls/order.rs:132-137 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/composer/stored_marker_frames.rs:12\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":"src/renderer/composer/stored_marker_frames.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"164ca4b7a49ecc3e1952e9e538331962aff4f3815dbfde28d4f09d2a3ca74f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/float_placement.rs:7434-7445 | src/renderer/float_placement/reflow_block_cell.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/float_placement.rs:7434\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":"src/renderer/float_placement.rs"},"region":{"startLine":7434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505fd5e683b03d2bb9299fe42b511f06d209d8cd4e456103c4115bcfce8ada0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/renderer/float_placement/reflow_block_cell.rs:148-160 | src/renderer/float_placement/reflow_block_lines.rs:94-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/float_placement/reflow_block_cell.rs:148\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":"src/renderer/float_placement/reflow_block_cell.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f62056dc50ab9a09862e5989e2de9965a92c78cc2215a2e2cec7b947ba0933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10): src/renderer/height_measurer.rs:2209-2220 | src/renderer/height_measurer.rs:2956-2967 | src/renderer/height_measurer.rs:2999-3010 | src/renderer/height_measurer.rs:3119-3130 | src/renderer/height_measurer.rs:3402-3413 | src/renderer/height_measurer.rs:3475-3486 | src/renderer/layout/table_layout.rs:18544-18555 | src/renderer/render_normalization.rs:244-255 | src/renderer/typeset/section/heading.rs:35-46 | src/renderer/typeset/state.rs:545-556 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2209\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":"src/renderer/height_measurer.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"715fd0af74c3c4afc9d2506b623ce0d85dd5339a6994ff6f5dfdd0439d4dcd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/renderer/height_measurer.rs:2279-2292 | src/renderer/height_measurer.rs:3750-3763 | src/renderer/height_measurer.rs:6296-6309 | src/renderer/pagination/engine.rs:235-248 | src/renderer/typeset.rs:3935-3948 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060src/renderer/height_measurer.rs:2279\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":"src/renderer/height_measurer.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e66aa8c88d8c4c2dffcc12c4897940a85e3fe190c77e4963fdad8f5e050cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/renderer/height_measurer.rs:2692-2701 | src/renderer/render_normalization.rs:562-571 | src/renderer/typeset/state.rs:387-396 | src/renderer/typeset/state.rs:1042-1051 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/render_normalization.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:2692\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 \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn emit_decoration_table(\u0026mut\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":"src/renderer/height_measurer.rs"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"322999e6d3a9a9246c3987b5568bb9e8225d8e2483f20b4f129c1c0789d160c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 10): src/renderer/height_measurer.rs:3077-3087 | src/renderer/height_measurer.rs:3249-3259 | src/renderer/height_measurer.rs:3348-3358 | src/renderer/layout/table_layout.rs:18620-18630 | src/renderer/layout/table_layout.rs:18663-18673 | src/renderer/layout/table_layout.rs:18711-18721 | src/renderer/render_normalization.rs:420-430 | src/renderer/typeset/state.rs:420-430 | src/renderer/typeset/state.rs:1008-1018 | src/renderer/typeset/state.rs:1275-1285 \u2014 before extracting anything, compare \u0060src/renderer/height_measurer.rs\u0060 and \u0060src/renderer/layout/table_layout.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 300 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/height_measurer.rs:3077\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":"src/renderer/height_measurer.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ad7de8b68ec69717c3474624c2c78041c77a7d446ce611306b3caea22ef4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/renderer/height_measurer.rs:6143-6153 | src/renderer/page_layout.rs:62-72 | src/renderer/pagination.rs:856-866 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/renderer/pagination.rs:856\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":"src/renderer/height_measurer.rs"},"region":{"startLine":6143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c05a04572f7584a19bf596904b2fc04bf5057bc5b1a0a0cddf12b728e6566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/renderer/inline_flow/floating_shapes.rs:70-84 | src/renderer/render_normalization/stored_word_tail.rs:141-155 | src/renderer/render_normalization/stored_word_tail.rs:192-206 | src/renderer/typeset/paragraph.rs:1147-1161 | src/renderer/typeset/paragraph.rs:1353-1367 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/inline_flow/floating_shapes.rs:70\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":"src/renderer/inline_flow/floating_shapes.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"487c29caac78996b41ab8176a0a126926bada2ff296f622b0b1b486186feb30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/table_layout.rs:18586-18591 | src/renderer/page_number.rs:146-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/page_number.rs:146\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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":18586}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1b89f00722c97f3d9323e9a2f0dd642aecca4c5cadb03f2b7bcad6a3fd7578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/renderer/pagination/engine.rs:281-295 | src/renderer/typeset.rs:3994-4008 \u2014 before extracting anything, compare \u0060src/renderer/pagination/engine.rs\u0060 and \u0060src/renderer/typeset.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/pagination/engine.rs:281\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":"src/renderer/pagination/engine.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"62103ff2292b6fb56de90f271971149a27412d7fb429a7df68cd0b71ec7f4711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/typeset.rs:4056-4072 | src/renderer/typeset/section/controls.rs:21-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/typeset.rs:4056\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":"src/renderer/typeset.rs"},"region":{"startLine":4056}}}],"partialFingerprints":{"codehealthFindingId/v1":"49691f778d8cc1f047291925df5ebf35d1e50df897c458fe2996b154a0d028db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/renderer/typeset/controls.rs:327-344 | src/renderer/typeset/paragraph.rs:576-593 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/renderer/typeset/controls.rs:327\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":"src/renderer/typeset/controls.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6500707f3892eba456c5ddb38fd6967c1fe7b1a459195fa7697756b74c98abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): src/serializer/char_shape.rs:9-13 | src/serializer/doc_info.rs:300-304 | src/serializer/doc_info.rs:324-328 | src/serializer/doc_info.rs:377-381 | src/serializer/doc_info.rs:596-600 | src/serializer/doc_info.rs:702-706 | src/serializer/doc_info.rs:817-821 | src/serializer/doc_info.rs:842-846 | src/serializer/doc_info.rs:906-910 | src/serializer/doc_info.rs:970-974 | src/serializer/doc_info.rs:1060-1064 \u2014 there are 11 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 11 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/char_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"067db3f2b7ce2074755bd7b1af676cdb62cbc7dc888a4b6034db4a081685803e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/wmf/parser/objects/structure/point_l.rs:20-27 | src/wmf/parser/objects/structure/point_s.rs:20-27 | src/wmf/parser/objects/structure/scan.rs:104-111 | src/wmf/parser/objects/structure/size_l.rs:20-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/point_l.rs:20\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":"src/wmf/parser/objects/structure/point_l.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ef4f09297ead047be098e35ea5669c75e423a66525026bce5b102b1b4ceed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/wmf/parser/records/state/realize_palette.rs:29-41 | src/wmf/parser/records/state/save_dc.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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/records/state/realize_palette.rs:29\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":"src/wmf/parser/records/state/realize_palette.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e869facf9e9ffbf87d471e8a2cf8cafc0727a056f6c2f0685999228879402ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rhwp-contracts/src/ir_schema.rs:847-855 | src/capabilities_schema.rs:528-548 | src/capabilities_schema.rs:564-583 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-contracts/src/ir_schema.rs:847\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-contracts/src/ir_schema.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa611229e7e47b89064b546786b49465252967dc911da613b10299a0295fedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/serializer/hwpx/mod.rs:345-365 | src/serializer/hwpx/mod.rs:425-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/mod.rs:345\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":"src/serializer/hwpx/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a380d4806ea52407d0f6dd50052cc1524e7bdc71bc2bd1f912b56fe0d8b6812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/wmf/parser/objects/structure/bitmap_info_header/info.rs:140-160 | src/wmf/parser/objects/structure/log_color_space.rs:105-125 | src/wmf/parser/objects/structure/log_color_space_w.rs:106-126 \u2014 before extracting anything, compare \u0060src/wmf/parser/objects/structure/log_color_space.rs\u0060 and \u0060src/wmf/parser/objects/structure/log_color_space_w.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/structure/bitmap_info_header/info.rs:140\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":"src/wmf/parser/objects/structure/bitmap_info_header/info.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9004997e9f143e5cf2956c1bece795ec887c4293abd1f00a8c9f1a8ffbd804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/renderer/layout/table_layout.rs:24058-24074 | src/renderer/layout/table_layout/row_block_cut.rs:362-378 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout/table_layout.rs:24058\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":24058}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7211153d64fcb79885638f227c72c2d6ffca94db93fecf9cafc30eb2497bca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/commands/edit/document_text.rs:747-762 | src/cli/commands/edit/note_content.rs:36-51 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/note_content.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 232 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:747\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ec7e21fd72f0a343ac67aab3c86718a74064a631945acee659b6135781d0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): src/bin/rhwp-q/more/inventory.rs:228-243 | src/bin/rhwp-q/more/inventory.rs:255-270 | src/bin/rhwp-q/more/inventory.rs:282-297 | src/bin/rhwp-q/more/inventory.rs:1219-1234 | src/bin/rhwp-q/more/inventory.rs:1246-1261 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0a450bb496a7f8ae51a5599b66af2ab56206faa333dfbdc724f3782e3337e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): src/bin/rhwp-q/pack/inventory.rs:500-518 | src/bin/rhwp-q/pack/inventory.rs:914-932 | src/bin/rhwp-q/pack/inventory.rs:941-959 | src/bin/rhwp-q/pack/inventory.rs:1302-1320 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/pack/inventory.rs:500\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/pack/inventory.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"552b03550a468d58f4b5f13c2b66efdf381496b3c42defaf7bea8c4263ca9e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/commands/edit/header_footer_content.rs:706-721 | src/cli/commands/edit/header_footer_content.rs:1136-1151 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/header_footer_content.rs:706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5707f6a8687221a7cd43ca2b0828aa497f4019fb38af1f833c1cae624c809cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): src/bin/rhwp-q/more/inventory.rs:147-162 | src/bin/rhwp-q/more/inventory.rs:174-189 | src/bin/rhwp-q/more/inventory.rs:201-216 | src/bin/rhwp-q/more/inventory.rs:914-929 | src/bin/rhwp-q/more/inventory.rs:941-956 | src/bin/rhwp-q/more/inventory.rs:1111-1126 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a26cf4e6ad2355ef7ba1a55820bc3659e7c1b52e1a4c1062223ce918e19ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): src/bin/rhwp-q/more/inventory.rs:390-405 | src/bin/rhwp-q/more/inventory.rs:417-432 | src/bin/rhwp-q/more/inventory.rs:444-459 | src/bin/rhwp-q/more/inventory.rs:995-1010 | src/bin/rhwp-q/more/inventory.rs:1138-1153 | src/bin/rhwp-q/more/inventory.rs:1273-1288 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/more/inventory.rs:390\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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc048e7754ac63a998d86c380839846bba94c4b614bc7a5978be232917159b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/diagnostics/hwp5_inventory_diff.rs:1876-1890 | src/diagnostics/hwp5_inventory_diff.rs:1923-1937 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/hwp5_inventory_diff.rs:1876\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_inventory_diff.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb71dd4ace2fc851f0452b5e6b975e64e6daf52133f0e72dccd0f99e99e6e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/cli/commands/edit/header_footer_content.rs:554-568 | src/cli/commands/edit/header_footer_content.rs:706-720 | src/cli/commands/edit/header_footer_content.rs:849-863 | src/cli/commands/edit/header_footer_content.rs:1136-1150 | src/cli/commands/edit/header_footer_properties.rs:520-534 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:554\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d69d0cf9d8626bccf3863388be6e1968f948ff30fce8e2b975b32ce8cf21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/section.rs:1544-1549 | src/parser/hwpx/section.rs:1579-1593 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:1544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8517a4eeb8e15cb3ebe2cdbd5a5c7d638f1eef858fd39ec83f849e9fb818ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/batch/mod.rs:331-345 | src/cli/commands/batch_fill.rs:180-194 \u2014 before extracting anything, compare \u0060src/cli/batch/mod.rs\u0060 and \u0060src/cli/commands/batch_fill.rs\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/batch/mod.rs:331\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":"src/cli/batch/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"de834689622e067742c5ad7b178030e2eabb77d38aaa3d9b844d628cbb810c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/bin/rhwp-agent/stats.rs:45-59 | src/bin/rhwp-agent/stats.rs:87-101 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/stats.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8df8eeb4b8a43574a2c1a5308ac79e504de1e6acd53bc56aa037269ac7574bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:141-155 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:140-154 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:144-158 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:141\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b05698a899c2c60466579173f49a0cd5326f8a441e5cda9ab5f9c1d0f2b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:108-122 | src/parser/pdf/structured_lowering/wrap_width.rs:32-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:108\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d07575264e0221a8504dadc5ae3627ec736a2197bc3b109dd819d68e8eafd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/serializer/hwpx/context.rs:583-596 | src/serializer/hwpx/context.rs:601-614 | src/serializer/hwpx/context.rs:619-632 | src/serializer/hwpx/context.rs:637-650 | src/serializer/hwpx/context.rs:655-668 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/context.rs:583\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":"src/serializer/hwpx/context.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d0b6555823e44dc3fe85dea0d542625f0a329b8c23b894e2b4d06dcd344d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:2845-2858 | src/parser/pdf/structured_lowering.rs:2860-2864 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/structured_lowering.rs:2845\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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe8e5f42099732b866d87e265b5938c0333e624b3ce72f365a009ac38684635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/paint/font_glyph.rs:975-988 | src/paint/shaping_glyph_vertical.rs:350-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/font_glyph.rs:975\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/font_glyph.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bafbba0513df1e0c1b1969801dce79a085b314bfc6a511289bd0964d83d9fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/native_host/gpu_gl.rs:597-610 | src/native_host/gpu_gl.rs:1011-1024 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/native_host/gpu_gl.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"9880a7829512f7152c5ef2f8f5aa19cd6214da097b0c5195a1d97a49f5e3cbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/commands/edit/document_text.rs:910-923 | src/cli/commands/edit/document_text.rs:1006-1019 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/commands/edit/document_text.rs:910\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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26b9afa0e8abbcd8eee990274a1e04732fc66959d4eb45320e4bd0e65764eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/hwpx/header.rs:963-976 | src/parser/hwpx/header.rs:1123-1136 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:963\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":"src/parser/hwpx/header.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"6223c20f4d4ea7216ecf02c312cef5f24416d3b54083b8d5c220135436e06439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser/hwpx/header.rs:1925-1938 | src/parser/hwpx/section.rs:3081-3094 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1925\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba1360135e6e81c5e7dd88ead3e56605292fe89fe1c2432a286cb1a2140ad76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:224-237 | src/bin/rhwp-q/commands/rhwp-q-font-trace.rs:226-239 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:171-184 | src/bin/rhwp-q/commands/rhwp-q-scan-items.rs:200-213 | src/bin/rhwp-q/commands/rhwp-q-section-starts.rs:147-160 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-font-trace.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:224\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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c8cdb78c3cca2cf511d4c690be37739ebe41f9d2bae5fc016ea7551895816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/commands/edit/cells.rs:367-379 | src/cli/commands/tabular_import.rs:341-354 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cells.rs\u0060 and \u0060src/cli/commands/tabular_import.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 177 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cells.rs:367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cells.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f46a6f2f0c785bf7fdb9f8b4cbaca3be73b61723b77ead588b35cdb9cfb7827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): src/serializer/hwpx/context.rs:582-594 | src/serializer/hwpx/context.rs:600-612 | src/serializer/hwpx/context.rs:618-630 | src/serializer/hwpx/context.rs:636-648 | src/serializer/hwpx/context.rs:654-666 | src/serializer/hwpx/context.rs:672-684 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/context.rs:582\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":"src/serializer/hwpx/context.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e641098681015f3767ba5f85a86fd256cf4a4a4a8d66866eb51353cea0cc1600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:140-152 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:139-151 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:143-155 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:124-136 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a48cbb9adf5ebb26e0d7b0a00d66fedafc9d8160b6b26002bf07aae266e9d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:256-268 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:237-249 | src/bin/rhwp-q/commands/rhwp-q-para-shape.rs:238-250 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-char-shape.rs:256\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-char-shape.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"054bda8e95d1559c7da498c5103247b22e9fee02834b9f0893b50c79373c64c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/renderer/layout/table_layout.rs:23648-23660 | src/renderer/layout/table_layout.rs:23953-23963 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/layout/table_layout.rs:23648\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60436de5e238c7f98899c8e5f5406a926891785ce7782fbbf71786c74261f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/parser/hwpx/section.rs:3081-3093 | src/parser/hwpx/section.rs:4682-4694 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:3081\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27cc2f17c419f2cefa280c199c1807105c9b600bb68e57cf8aa68cdb4e17bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:129-141 | src/diagnostics/hwp5_cell_header_probe.rs:199-211 | src/diagnostics/hwp5_char_shape_audit.rs:203-215 | src/diagnostics/hwp5_contract_probe.rs:151-163 | src/diagnostics/hwp5_ctrl_data_trace.rs:92-104 | src/diagnostics/hwp5_first_para_control_probe.rs:155-167 | src/diagnostics/hwp5_inventory_diff.rs:323-335 | src/diagnostics/hwp5_mel_personnel_probe.rs:145-157 | src/diagnostics/hwp5_table_probe.rs:151-163 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diagnostics/hwp5_contract_probe.rs:165\u0060 calls \u0060ok_or_else\u0060, \u0060to_string\u0060 and \u0060src/diagnostics/hwp5_inventory_diff.rs:337\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fc7ccbc81bc43e02f03904147dd9af78079621f07965e27902374aff5e7666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/parser/hwpx/section.rs:3248-3260 | src/parser/hwpx/section.rs:3871-3881 | src/parser/hwpx/section.rs:7853-7865 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:3248\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93841a83b5f8e604f8ab7f49d98410ff7042b9820556860027779c48f5ee96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/main.rs:1104-1116 | src/main.rs:1183-1195 | src/main.rs:1258-1269 | src/main.rs:1341-1353 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:1104\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68d6e6369cd72790d7f4746b9e3b832f82dbddaa533163cdca7a459a664c303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/document_core/commands/object_ops/equation.rs:481-491 | src/document_core/commands/object_ops/picture.rs:1434-1446 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:481\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12a76f3f56f79c8a9bb5559c3437bec7a218090320aae82209d162b3e487ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/parser/hwpx/header.rs:2207-2219 | src/parser/hwpx/header.rs:2317-2329 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/header.rs:2207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab96e36c7827cd560cb78c833489991b8a6b5d69142eaf8d50631f2be547a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): src/bin/rhwp-agent/envelope.rs:198-218 | src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs:44-64 | src/bin/rhwp-q/commands/rhwp-q-objects.rs:44-64 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-object-cycle.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-objects.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/envelope.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/envelope.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe9c981a7e96d2c06e5fbefa9e84487a181e86300f92bc7aab929dc24065bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/wmf/converter/svg/mod.rs:804-815 | src/wmf/converter/svg/mod.rs:1588-1599 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wmf/converter/svg/mod.rs:804\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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16cb381e3e031eabb4b4d50db45e9f2219ebd3ff6fb9f91b14a75ce736800f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1546-1557 | src/serializer/hwpx/roundtrip.rs:1649-1660 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/roundtrip.rs:1546\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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fed590410b3b56d80890f1678319ebfb4829266e8f7328b5a19bd76c6bb7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/cli/protocol/capsule/signing.rs:97-108 | src/cli/protocol/trust/anchor.rs:28-37 | src/cli/protocol/trust/anchor.rs:182-191 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/trust/anchor.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:97\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c8e865fee7115413d49d08ee91d8f5ea2db5737b216472dcb696daeb662da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1610-1621 | src/serializer/hwpx/roundtrip.rs:1640-1651 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/roundtrip.rs:1610\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d808642906cfdb62498aabec21d85e2aaa55c5d9a34b6ac046dfea907ee558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/renderer/svg.rs:4093-4104 | src/renderer/svg.rs:4111-4122 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/svg.rs:4093\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":4093}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3b002790494734ee4d2d3c2bdc71c723ecb02958dbe8ba2e8babca75ea67bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/rhwp-agent/grepcmd.rs:15-26 | src/bin/rhwp-q/kit/bin_data.rs:13-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/grepcmd.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac18b7de32a780a5bd6e138a993e325f365ca963ff42924fa8958f334319913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/bin/rhwp-q/kit/cell_shape.rs:58-69 | src/bin/rhwp-q/kit/flow_images.rs:61-72 | src/bin/rhwp-q/kit/overlay_images.rs:65-76 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cell_shape.rs\u0060 and \u0060src/bin/rhwp-q/kit/flow_images.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cell_shape.rs:58\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cell_shape.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"491666722d68df093ec1403abe16d3a3a31701e36a53e4f9ef073588737129cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/cli/commands/edit/media.rs:160-171 | src/cli/commands/edit/privacy.rs:120-131 | src/cli/queries/info.rs:66-77 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/media.rs\u0060 and \u0060src/cli/commands/edit/privacy.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/media.rs:160\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":"src/cli/commands/edit/media.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1628c9b49505c4376b1b9c581a701ba0eb2c2099ba55d7d94dea6725dbecb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/bin/rhwp-q/kit/form_at.rs:88-97 | src/bin/rhwp-q/kit/form_value.rs:89-100 | src/bin/rhwp-q/kit/hf_edit_target.rs:81-92 | src/bin/rhwp-q/kit/hit_fn_marker.rs:89-98 | src/bin/rhwp-q/kit/hit_in_footnote.rs:89-98 | src/bin/rhwp-q/kit/hit_in_hf.rs:107-118 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/form_at.rs\u0060 and \u0060src/bin/rhwp-q/kit/form_value.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/form_at.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/form_at.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e71d869784e00c528afe2c803efb4d42fc06182d5da638b0589c903c5dd4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cli/protocol/trust/governance.rs:305-316 | src/cli/protocol/trust/governance.rs:751-762 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/trust/governance.rs:305\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/trust/governance.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"428f75562b57b9c4b3b7a4ad1b0a30cb992438d442aa27318c92e0050c42067b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/parser/hwpx/section.rs:1019-1028 | src/parser/hwpx/section.rs:1349-1360 | src/parser/hwpx/section.rs:3484-3493 | src/parser/hwpx/section.rs:5393-5402 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/section.rs:1019\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"51869c0598dd8c4b6e96c2911351b87b48c1b2b67b488218f4919e3d0f913cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): bindings/Native/src/gpu_d3d.rs:188-199 | bindings/Native/src/gpu_gl.rs:274-285 | bindings/Native/src/gpu_metal.rs:198-209 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:188\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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3682e938a5b5d6818529056c03a2db0603bde57ebb297c6e1fd384a0aa369c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/document_core/commands/text_editing.rs:4001-4010 | src/document_core/commands/text_editing.rs:5283-5294 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:4001\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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":4001}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1a2f4bc10c24ff590a69a07a62f9c6c48d7670b7b59f8d79857fc024f0a1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/parser/hwpx/header.rs:962-973 | src/parser/hwpx/header.rs:1122-1133 | src/parser/hwpx/header.rs:1165-1176 | src/parser/hwpx/header.rs:1179-1190 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:962\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97df98cc02dd3154188a8ef6c2269e18576ec6ecc2d5316a8dcd67ae40b107f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): src/bin/rhwp-q/kit/cursor_in_cell.rs:31-41 | src/bin/rhwp-q/kit/cursor_in_footnote.rs:30-40 | src/bin/rhwp-q/kit/cursor_in_hf.rs:31-41 | src/bin/rhwp-q/kit/cursor_in_note.rs:30-40 | src/bin/rhwp-q/kit/flow_images.rs:24-32 | src/bin/rhwp-q/kit/footnote_hit.rs:24-34 | src/bin/rhwp-q/kit/footnote_info.rs:24-34 | src/bin/rhwp-q/kit/hit_header.rs:24-34 | src/bin/rhwp-q/kit/note_edit_info.rs:25-35 | src/bin/rhwp-q/kit/overlay_images.rs:24-32 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs\u0060 and \u0060src/bin/rhwp-q/kit/cursor_in_footnote.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/cursor_in_cell.rs:31\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/cursor_in_cell.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d61beb96700f4a0da0a2d3d6c3a5abc66feab48e3d7b62b20528e200ea8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/bin/rhwp-q/kit/canvaskit_preflight.rs:79-89 | src/bin/rhwp-q/kit/layer_tree.rs:60-70 | src/bin/rhwp-q/kit/page_border_fill.rs:60-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/canvaskit_preflight.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/canvaskit_preflight.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a13143fd942470c39f4e1b0b82dff9a95fcef73073f2d74cf093a76a3997a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-agent/contextcost.rs:119-129 | src/bin/rhwp-agent/inspect.rs:413-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":"src/bin/rhwp-agent/contextcost.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de103e6d1390708b76a4cef36cc04749043b8af3b5fdd45706015321dc3c01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/hwpx/section.rs:7566-7576 | src/parser/hwpx/section.rs:7705-7715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser/hwpx/section.rs:7579\u0060 calls \u0060Ok\u0060 and \u0060src/parser/hwpx/section.rs:7717\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":7566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5baba06ec560ce7ca1000f13ec08f14cdfdc9257fa08bd501c3b772e5cc9380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/protocol/capsule/audit.rs:14-24 | src/cli/protocol/harness.rs:17-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/audit.rs:14\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":"src/cli/protocol/capsule/audit.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e28becda33ce452d395b12510be7cc7ea9cd53204b983983e93446d77f25d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:230-240 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:233-243 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-form-info.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:230\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7e4aeff93605f97b5f9826636c7b075b014dc1217ab68a0a5c4e72496c299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/metadata/help/mod.rs:14-22 | src/cli/metadata/help/public.rs:5-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/cli/metadata/help/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27f2b70422b03913af490c1be2307b569f5e6667366c4c45664ff402350497e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cli/protocol/exchange/disclosure.rs:30-40 | src/cli/protocol/trust/anchor.rs:28-38 | src/cli/protocol/trust/anchor.rs:182-192 \u2014 before extracting anything, compare \u0060src/cli/protocol/exchange/disclosure.rs\u0060 and \u0060src/cli/protocol/trust/anchor.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/disclosure.rs:30\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/disclosure.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b234e314acb6aae8e8a403af733b8a59062e4e20ddcc21cb9dd066d58a14d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/hwpx/section.rs:4992-5002 | src/parser/hwpx/section.rs:5006-5016 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:4992\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4992}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc5ee8a9666adfb8822730f05d40500a4e9326d04080468595c25dcf9156ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/queries/security_inspection.rs:760-770 | src/cli/queries/security_inspection.rs:1032-1042 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/queries/security_inspection.rs:760\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":"src/cli/queries/security_inspection.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8ec125ffb57479391cc90dc7cde090d2b467a54f290ff95528b446901d0ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser/hwpx/section.rs:6169-6179 | src/parser/hwpx/section.rs:6834-6844 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:6169\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":"src/parser/hwpx/section.rs"},"region":{"startLine":6169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa98698f33d06ce3ce54f34506455b0223f6d30957dbced2fd4cea189509208a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): src/cli/protocol/capsule/signing.rs:17-27 | src/cli/protocol/exchange/settlement.rs:31-41 | src/cli/protocol/harness.rs:117-127 | src/cli/protocol/trust/anchor.rs:94-104 | src/cli/protocol/trust/governance.rs:458-468 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/harness.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:17\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":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a83065d49910a14103f0c946304b3fd920a93c34d9b97d1fdfb444a6cb81dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): src/document_core/queries/table_extract.rs:224-233 | src/document_core/queries/table_extract.rs:237-246 | src/document_core/queries/table_extract.rs:249-258 | src/document_core/queries/table_extract.rs:261-270 | src/document_core/queries/table_extract.rs:273-282 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/table_extract.rs:224\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":"src/document_core/queries/table_extract.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"846fc40500f4c0d7e8b683279e5cdc7a2ae0927cba1cec93ceece16633bb89e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-agent/lookups.rs:25-34 | src/cli/queries/document_inventory.rs:118-127 | src/cli/queries/document_inventory.rs:190-199 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/lookups.rs:25\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad854809ec45c94fbaf0fd343abef577f95f4e4a5063ecece1c42e20700e0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/protocol/capsule/lineage.rs:168-177 | src/cli/protocol/capsule/lineage.rs:181-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/lineage.rs:168\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":"src/cli/protocol/capsule/lineage.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"401bb4758d31357d081e2df3b7b751959a8681aa15c2e38c63bb2e186c309d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/parser/hwpx/header.rs:1929-1938 | src/parser/hwpx/section.rs:3085-3094 | src/parser/hwpx/section.rs:5180-5189 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:1929\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1eacf59f82a3ccee9ee1116c8f1504ca42adcaa4299b5f14e4f21b244e8fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:1480-1489 | src/diagnostics/render_geom_diff.rs:534-541 \u2014 before extracting anything, compare \u0060src/diagnostics/layout_anomaly.rs\u0060 and \u0060src/diagnostics/render_geom_diff.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/layout_anomaly.rs:1480\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d73a43b91986acfd41b44aba3f49e672535dcfff6e8d6e86117f9db5996dd91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/commands/caption_validation.rs:204-213 | src/main.rs:717-726 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/caption_validation.rs:204\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/caption_validation.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3e92ee6771968fc362a032b5fb5ec27917eabda8f62722dd4830cccd5304d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/metadata/capabilities/mod.rs:560-569 | src/cli/protocol/capsule/replay.rs:8-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/metadata/capabilities/mod.rs:560\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/metadata/capabilities/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18608842dfd3fe6848f072ce2ee50aadb2cbba8b605b73b98fc995e6f059ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/cli/commands/edit/document_text.rs:108-117 | src/cli/commands/edit/document_text.rs:413-422 | src/cli/commands/edit/document_text.rs:549-558 | src/cli/commands/edit/media.rs:718-727 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/media.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 261 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a512471a8e21194bb887820c4df3268b9f57ac38fbce6cce80cf6f206ab0dc26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): src/cli/commands/edit/document_objects.rs:590-599 | src/cli/commands/edit/formatting.rs:45-54 | src/cli/commands/edit/formatting.rs:183-192 | src/cli/commands/edit/header_footer_properties.rs:44-53 | src/cli/commands/edit/note_content.rs:604-613 | src/cli/commands/edit/page.rs:34-43 | src/cli/commands/edit/page.rs:137-146 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 217 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8ea59181ff0cb522cdf0b27802ecae5554d2fd02fe35dea613fca84bd31e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 25): src/bin/rhwp-agent/doctor.rs:20-28 | src/bin/rhwp-agent/harvest.rs:19-27 | src/bin/rhwp-agent/safety.rs:220-229 | src/bin/rhwp-agent/safety.rs:525-534 | src/bin/rhwp-agent/structurecmd.rs:14-22 | src/bin/rhwp-q/kit/caret_stops.rs:16-24 | src/bin/rhwp-q/kit/char_index.rs:18-26 | src/bin/rhwp-q/kit/chart_csv.rs:29-37 | src/bin/rhwp-q/kit/covering_pages.rs:13-21 | src/bin/rhwp-q/kit/cur_field_state.rs:18-26 | src/bin/rhwp-q/kit/field_by_id.rs:16-24 | src/bin/rhwp-q/kit/field_info_at.rs:18-26 | src/bin/rhwp-q/kit/fn_selection_rects.rs:21-29 | src/bin/rhwp-q/kit/form_at.rs:18-26 | src/bin/rhwp-q/kit/form_value.rs:19-27 | src/bin/rhwp-q/kit/hit_fn_marker.rs:19-27 | src/bin/rhwp-q/kit/hit_in_footnote.rs:19-27 | src/bin/rhwp-q/kit/line_starts.rs:17-25 | src/bin/rhwp-q/kit/page_border_fill.rs:15-23 | src/bin/rhwp-q/kit/page_text.rs:15-23 | src/bin/rhwp-q/kit/para_bounds.rs:17-25 | src/bin/rhwp-q/kit/word_end.rs:18-26 | src/bin/rhwp-q/kit/word_starts.rs:16-24 | src/bin/rhwp-q/more/envelope.rs:94-102 | src/bin/rhwp-q/pack/envelope.rs:94-102 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/harvest.rs\u0060 and \u0060src/bin/rhwp-agent/safety.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/doctor.rs:20\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/bin/rhwp-agent/harvest.rs:17\u0060 calls \u0060to_string\u0060 and \u0060src/bin/rhwp-agent/doctor.rs:18\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/doctor.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"890217cabe12ac67656962e7d472950950a71e1c15b4fc78ed2a5eda1f299253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): bindings/Native/src/gpu_d3d.rs:164-173 | bindings/Native/src/gpu_gl.rs:242-251 | bindings/Native/src/gpu_metal.rs:175-184 \u2014 before extracting anything, compare \u0060bindings/Native/src/gpu_d3d.rs\u0060 and \u0060bindings/Native/src/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 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 \u0060bindings/Native/src/gpu_d3d.rs:164\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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ab65259b1f696440586273f8baf30fd3f32e14271f06ea23d1dcc5fcce8821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/diagnostics/layout_anomaly.rs:1915-1922 | src/diagnostics/render_geom_diff.rs:893-902 \u2014 before extracting anything, compare \u0060src/diagnostics/layout_anomaly.rs\u0060 and \u0060src/diagnostics/render_geom_diff.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diagnostics/layout_anomaly.rs:1915\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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cb5ef74da2414fba6df01bceb4bc59470cc79ce6272067909e6726770a5b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/hwpx/section.rs:1453-1458 | src/parser/hwpx/section.rs:1491-1500 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:1453\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cedbe79bca071ef05cfa0e96650ec0222541d4dbc4075b5f3400a3cccf5f8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-agent/lookups.rs:345-354 | src/bin/rhwp-agent/lookups.rs:506-515 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/lookups.rs:345\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ab43ec7443637d4396ba07fb46ce5df5924ad26f4d8d9a9383f3b96923231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:182-191 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:199-208 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:183-192 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-images.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:182\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ae578931dd5361ff1628ceeb6a14ee0d2d7c0222e55e294ee8a213560353b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:203-212 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:222-231 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-images.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9775bb7e92084fbee601ff6c0dc379a8132e41d56e719f9d44e6798ce19d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/wmf/parser/objects/graphics/region.rs:96-103 | src/wmf/parser/records/drawing/poly_line.rs:51-60 | src/wmf/parser/records/drawing/polygon.rs:53-62 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/wmf/parser/objects/graphics/region.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/graphics/region.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5e0c543dd9371fd5e42ba543a3e6ec3cd04706e148bd24adb65a190e168aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/bin/rhwp-agent/inspect.rs:147-154 | src/bin/rhwp-agent/locate.rs:215-222 | src/bin/rhwp-agent/lookups.rs:79-88 | src/bin/rhwp-agent/safety.rs:374-383 | src/bin/rhwp-agent/tables.rs:73-80 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/inspect.rs\u0060 and \u0060src/bin/rhwp-agent/locate.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/inspect.rs:147\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":"src/bin/rhwp-agent/inspect.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b4a27e19e4db17a6eaf7561e653c9c93a1952ab32e58b426d8e4415265dbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/commands/edit/fields.rs:74-83 | src/cli/protocol/harness.rs:126-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/fields.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/cli/commands/edit/fields.rs:72\u0060 calls \u0060Some\u0060 and \u0060src/cli/protocol/harness.rs:124\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/fields.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd2071d582483646fe4973378d25042cc93e8799ee7d77de588115b16523f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/bin/rhwp-q/kit/canvaskit_preflight.rs:79-88 | src/bin/rhwp-q/kit/char_index.rs:87-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/bin/rhwp-q/kit/canvaskit_preflight.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/canvaskit_preflight.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"780b908dcc429f2001625d4f1edd86b5165fbba035bc1ddd8e04029ec3929b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/outputs/raster.rs:140-149 | src/cli/outputs/vector.rs:222-231 \u2014 before extracting anything, compare \u0060src/cli/outputs/raster.rs\u0060 and \u0060src/cli/outputs/vector.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/raster.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e782e2da4aba1344ccf974b5b85ac03ab28721ffcafa137da94102a50d3ef3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): src/parser/hwpx/header.rs:900-909 | src/parser/hwpx/header.rs:1929-1938 | src/parser/hwpx/section.rs:1019-1028 | src/parser/hwpx/section.rs:1351-1360 | src/parser/hwpx/section.rs:3085-3094 | src/parser/hwpx/section.rs:3484-3493 | src/parser/hwpx/section.rs:5180-5189 | src/parser/hwpx/section.rs:5393-5402 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:900\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c790e09dfcb832d5616ba85f23daeaf08a27a75334cc0d9a74c8c5f5649d6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): src/cli/commands/edit/header_footer_content.rs:296-305 | src/cli/commands/edit/header_footer_content.rs:453-462 | src/cli/commands/edit/header_footer_content.rs:615-624 | src/cli/commands/edit/header_footer_content.rs:769-778 | src/cli/commands/edit/header_footer_content.rs:908-917 | src/cli/commands/edit/header_footer_content.rs:1055-1064 | src/cli/commands/edit/header_footer_properties.rs:437-446 | src/cli/commands/edit/page.rs:248-256 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:296\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5cb86afa145379fbb5ccfbc493f0bdb7544bb63dbb2238c6d876651fba4980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/outputs/text.rs:40-48 | src/cli/queries/data_extraction.rs:33-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/text.rs:40\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6f449b293bb0ae4f042206c4ba2ce18bbd1e7b0e790577534ed951e976b231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-q/kit/hf_edit_target.rs:70-78 | src/bin/rhwp-q/kit/hit_in_hf.rs:96-104 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/hf_edit_target.rs\u0060 and \u0060src/bin/rhwp-q/kit/hit_in_hf.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/hf_edit_target.rs:70\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/hf_edit_target.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93a9d9d5344c2fc3be6cde7f8b3ee5c3c3d184757e5a7262e1159a8998a365f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-q/kit/layer_tree.rs:50-58 | src/bin/rhwp-q/kit/search_all.rs:52-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":"src/bin/rhwp-q/kit/layer_tree.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad63308107492749a2802acd7c742a9a422d42f21a9fcaea287332a9f06188d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/queries/ir_comparison.rs:887-895 | src/cli/queries/ir_comparison.rs:930-934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/ir_comparison.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"04055589e49992458de23b2fa7988c04acd5fc66699f37097bdd2f19081f1683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:179-187 | src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs:227-235 | src/bin/rhwp-q/commands/rhwp-q-form-info.rs:230-238 | src/bin/rhwp-q/commands/rhwp-q-page-def.rs:198-206 | src/bin/rhwp-q/commands/rhwp-q-page-images.rs:196-204 | src/bin/rhwp-q/commands/rhwp-q-text-layout.rs:180-188 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-rect.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-control-layout.rs:179\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/commands/rhwp-q-control-layout.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2405f970d5405cc99183fe55127b207dbdd10f37084095046d6ff85eba56116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/document_io.rs:158-166 | src/cli/document_io.rs:178-186 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/document_io.rs:158\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/document_io.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9354be3030ff618dda695f0fb4923deab2da76b9c9a9f191c0269acb5ed27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cli/commands/edit/header_footer_content.rs:525-533 | src/cli/queries/structured_objects.rs:75-83 | src/cli/queries/structured_objects.rs:203-211 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/queries/structured_objects.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/header_footer_content.rs:525\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":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea36cd69213aab42448ea6ebb66c116f8d89a463e77ccb76fbf802fc2b4fb60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bin/rhwp-agent/lookups.rs:496-504 | src/cli/queries/structured_objects.rs:293-301 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/lookups.rs:496\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e9b6a1ad856dd6b2b83965fb4d0d0506e8c6cd5dcbb6f66cd87e5a44772116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/bin/rhwp-agent/lookups.rs:22-30 | src/bin/rhwp-agent/lookups.rs:335-343 | src/cli/queries/document_inventory.rs:115-123 | src/cli/queries/document_inventory.rs:187-195 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/lookups.rs:22\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/lookups.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77355c79c1f918fa02469fcbc979c32fdb5817c9841c289f190871fb97edc87c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cli/protocol/exchange/bundle.rs:87-95 | src/cli/protocol/exchange/settlement.rs:190-198 | src/cli/protocol/exchange/settlement.rs:338-346 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/exchange/bundle.rs:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b248125f1af00523d52893bed40e1ddf1dec178a68c595cab5f0fe536e2664ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/document_core/queries/rendering.rs:7666-7674 | src/document_core/queries/rendering.rs:7743-7751 | src/document_core/queries/rendering.rs:7825-7833 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/rendering.rs:7666\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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd1031c7131c6cb257f30c614404b0e483534d617ff5bfe2063598f8b9256d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/text_editing.rs:5879-5887 | src/document_core/commands/text_editing.rs:5998-6006 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:5879\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":5879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c624d1d760f1e89fa280c67a4ef7d3a9e700766885edbda1e3eb6ab065e8f7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parser/hwpx/section.rs:4207-4215 | src/parser/hwpx/section.rs:4532-4540 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/hwpx/section.rs:4207\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":4207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbdc54bd17b15efa0fbeafe2ccb33489e3deda997a0ce5b06374415a3415eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/paint/json.rs:709-717 | src/paint/json.rs:897-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/paint/json.rs:709\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9581a93cc21a6fe2fc34ada12c8bbc3c0b665ca0e0e07146f32bbbb6ffadf282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/diagnostics/hwp5_cell_header_probe.rs:285-293 | src/diagnostics/hwp5_contract_probe.rs:237-245 | src/diagnostics/hwp5_mel_personnel_probe.rs:229-237 | src/diagnostics/hwp5_table_probe.rs:232-240 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"507eb3ab038e5b58a67974c4a1e523b7a184913b51e29a9b9220eaeac9c66450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 13): src/cli/commands/edit/document_objects.rs:570-577 | src/cli/commands/edit/note_content.rs:132-139 | src/cli/commands/edit/page.rs:14-21 | src/cli/commands/edit/page.rs:117-124 | src/cli/commands/edit/privacy.rs:57-65 | src/cli/commands/edit/shapes.rs:283-290 | src/cli/commands/edit/tables/layout.rs:13-20 | src/cli/commands/edit/tables/layout.rs:233-240 | src/cli/commands/edit/tables/layout.rs:481-488 | src/cli/commands/edit/tables/layout.rs:595-602 | src/cli/commands/edit/tables/structure.rs:126-133 | src/cli/commands/edit/tables/structure.rs:221-228 | src/cli/commands/edit/tables/structure.rs:316-323 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_objects.rs\u0060 and \u0060src/cli/commands/edit/note_content.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_objects.rs:570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_objects.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac22b0bfe00bb2a268ce4b4deb0de9881cc947827f2e1d20c35361f01ca2e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/queries/injection_scan.rs:826-834 | src/document_core/queries/injection_scan.rs:840-848 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/injection_scan.rs:826\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":"src/document_core/queries/injection_scan.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdfd9501a90aa973fcf4b331eb4b0cf3fa4c14232ad1ae484d153885c385a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/document_core/commands/text_editing.rs:2938-2946 | src/document_core/commands/text_editing.rs:2985-2993 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/text_editing.rs:2938\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc117a22318400c3ed731e42c1686f0ce5215003d73beefbc9211a1bf53d584f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/renderer/layout/table_layout.rs:23675-23683 | src/renderer/layout/table_layout.rs:23977-23985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23675}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb1ca03060ed57f92a5a86bb76f9c08f9578cdc984f39a0b8d29fb61a3e3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/object_ops/chart.rs:374-382 | src/document_core/commands/object_ops/chart.rs:432-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/chart.rs:374\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":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e226f5c70ee79f40179ff4817f1129abdda51f8feab34ba704290f057e6379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/outputs/raster.rs:146-159 | src/cli/outputs/raster.rs:178-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/raster.rs:146\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"85656a991e212d5ff1dda518362d582ae8a8dd9a343b9bf782957a659a666a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): src/cli/commands/edit/cell_paragraphs.rs:46-53 | src/cli/commands/edit/cell_paragraphs.rs:202-209 | src/cli/commands/edit/cells.rs:523-530 | src/cli/commands/edit/cells.rs:702-709 | src/cli/commands/edit/cells.rs:862-869 | src/cli/commands/edit/formatting.rs:742-749 | src/cli/commands/edit/formatting.rs:893-900 | src/cli/commands/edit/tables/grid.rs:31-38 | src/cli/commands/edit/tables/grid.rs:139-146 | src/cli/commands/edit/tables/grid.rs:246-253 | src/cli/commands/edit/tables/grid.rs:376-383 | src/cli/commands/edit/tables/grid.rs:495-502 | src/cli/commands/edit/tables/grid.rs:609-616 | src/cli/commands/edit/tables/layout.rs:139-146 | src/cli/commands/edit/tables/layout.rs:383-390 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/cells.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 262 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/cell_paragraphs.rs:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db78f69a284d43cf0fc80df6e0bf031ec3c110732e9006e37e9a71c8f811d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/cli/outputs/text.rs:46-53 | src/cli/queries/data_extraction.rs:39-46 | src/cli/queries/search.rs:40-47 | src/cli/queries/search.rs:53-60 \u2014 before extracting anything, compare \u0060src/cli/outputs/text.rs\u0060 and \u0060src/cli/queries/search.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/outputs/text.rs:46\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/text.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11666d4bea5d8addf8a5d9b3f393b2549d04529438be97c2484323d539ea7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-agent/chunkplan.rs:22-29 | src/bin/rhwp-agent/difftext.rs:228-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/chunkplan.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/chunkplan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5eb1b322855082b203edd49caf587065930728e9bacead06f861a4c4674ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/cli/queries/document_inventory.rs:128-135 | src/cli/queries/document_inventory.rs:200-207 | src/cli/queries/structured_objects.rs:310-317 \u2014 before extracting anything, compare \u0060src/cli/queries/document_inventory.rs\u0060 and \u0060src/cli/queries/structured_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/queries/document_inventory.rs:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/document_inventory.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab7cd5ee14f3862b086c148d536878c4bba7fbd2512475903b1bc91d52450bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): src/cli/protocol/capsule/signing.rs:7-14 | src/cli/protocol/capsule/signing.rs:74-81 | src/cli/protocol/exchange/bundle.rs:9-16 | src/cli/protocol/exchange/bundle.rs:218-225 | src/cli/protocol/exchange/disclosure.rs:7-14 | src/cli/protocol/exchange/disclosure.rs:210-217 | src/cli/protocol/harness.rs:6-13 | src/cli/protocol/trust/anchor.rs:9-16 | src/cli/protocol/trust/anchor.rs:84-91 | src/cli/protocol/trust/anchor.rs:159-166 | src/cli/protocol/trust/governance.rs:444-451 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/exchange/bundle.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac7d21fb8e798a3c1672c4035a014b517793c0896dc95d78287cc5016a0c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/bin/rhwp-q/kit/caret_stops.rs:64-71 | src/bin/rhwp-q/kit/line_starts.rs:65-72 | src/bin/rhwp-q/kit/para_bounds.rs:65-72 | src/bin/rhwp-q/kit/word_starts.rs:64-71 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/caret_stops.rs\u0060 and \u0060src/bin/rhwp-q/kit/line_starts.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/caret_stops.rs:64\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/caret_stops.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9e6b3c36ff1ac845829d921032b12fbec9e43c2cafe50b582ad3cc821576c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cli/protocol/plan/mod.rs:12-19 | src/main.rs:1064-1070 | src/main.rs:1144-1150 | src/main.rs:1218-1224 | src/main.rs:1300-1306 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/plan/mod.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f81580323b1790c99c503ef2ee7a95ae9e72757c19f4932bf297c859a016a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/table_detection/cell_regions.rs:287-294 | src/parser/pdf/table_detection/cell_regions/empty_faces.rs:72-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/table_detection/cell_regions.rs:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection/cell_regions.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1753a3678763fc4cb7a0567b3a331d7379a3f1c9cad58987fe2c613fd8c479d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/kit/bin_data.rs:79-86 | src/bin/rhwp-q/kit/source_image_bytes.rs:74-81 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/bin_data.rs\u0060 and \u0060src/bin/rhwp-q/kit/source_image_bytes.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/bin_data.rs:79\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":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2d5c41fcce11f99f172a10add3e28492373a6b237899395499537fd28c1c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:95-102 | mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:30-37 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs\u0060 and \u0060mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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":"mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f26450333ff89e441a63dbb73163a5374ce803d1c3485f2e3ee6e6d2e15bd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/protocol/plan/execution.rs:181-188 | src/cli/protocol/plan/execution.rs:189-196 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/plan/execution.rs: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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b64e55ee3e60ad20c10d204d08d4010161d08e51e6043d62e9068f471fdeced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:532-536 | src/diagnostics/hwp5_cell_header_probe.rs:879-886 | src/diagnostics/hwp5_contract_probe.rs:797-801 | src/diagnostics/hwp5_mel_personnel_probe.rs:793-800 | src/diagnostics/hwp5_table_probe.rs:648-652 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8ca7aa6a50890a8b1fdf537cb08893f4334de3907744b5f99c2d00243a385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-q/kit/bin_data.rs:54-61 | src/bin/rhwp-q/kit/source_image_bytes.rs:52-59 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/kit/bin_data.rs\u0060 and \u0060src/bin/rhwp-q/kit/source_image_bytes.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/kit/bin_data.rs:54\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/bin_data.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821686c3c05fa4a66327b81dd74aaa12ef1fc6d29be95ac7a75cf1ae0956d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/commands/clipboard.rs:1115-1119 | src/document_core/commands/object_ops/picture.rs:713-720 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/clipboard.rs:1115\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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c345e57aa64214b6760e558a8698fddaabeb3f39d88fd0b32185df3c4d57e464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): src/cli/protocol/capsule/signing.rs:8-15 | src/cli/protocol/exchange/bundle.rs:10-17 | src/cli/protocol/exchange/bundle.rs:219-226 | src/cli/protocol/exchange/disclosure.rs:8-15 | src/cli/protocol/exchange/disclosure.rs:112-119 | src/cli/protocol/exchange/disclosure.rs:211-218 | src/cli/protocol/exchange/settlement.rs:10-17 | src/cli/protocol/exchange/settlement.rs:146-153 | src/cli/protocol/exchange/settlement.rs:306-313 | src/cli/protocol/harness.rs:7-14 | src/cli/protocol/harness.rs:104-111 | src/cli/protocol/trust/anchor.rs:10-17 | src/cli/protocol/trust/anchor.rs:85-92 | src/cli/protocol/trust/anchor.rs:160-167 | src/cli/protocol/trust/governance.rs:445-452 \u2014 before extracting anything, compare \u0060src/cli/protocol/capsule/signing.rs\u0060 and \u0060src/cli/protocol/exchange/bundle.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/protocol/capsule/signing.rs:8\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0aa852cdd3d80ec95055d9d9ced0e418e6c82eb70260c481e70d2563de8ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/diagnostics/hwp5_cell_header_probe.rs:939-946 | src/diagnostics/hwp5_contract_probe.rs:858-865 | src/diagnostics/hwp5_table_probe.rs:696-703 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 and \u0060src/diagnostics/hwp5_contract_probe.rs\u0060 as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 370 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d07ba7d7c9aba69cbcea79bafcbe70efea4bdb433241572e73e020879d176c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rhwp-ooxml-chart/src/renderer.rs:1449-1456 | crates/rhwp-ooxml-chart/src/renderer.rs:1718-1725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rhwp-ooxml-chart/src/renderer.rs:1449\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5ad22dc8055704a177cd2c927047460a47d76a64ebbc4928b4a75e348e2958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/diagnostics/hwp5_borderfill_diagonal_probe.rs:533-537 | src/diagnostics/hwp5_cell_header_probe.rs:880-887 | src/diagnostics/hwp5_contract_probe.rs:798-802 | src/diagnostics/hwp5_first_para_control_probe.rs:827-831 | src/diagnostics/hwp5_mel_personnel_probe.rs:794-801 | src/diagnostics/hwp5_table_probe.rs:649-653 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_borderfill_diagonal_probe.rs\u0060 and \u0060src/diagnostics/hwp5_cell_header_probe.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 254 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_borderfill_diagonal_probe.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148e974516c43e3fa8ce54b2dd65085a6c978433eac52e5875fe247dc838e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bin/rhwp-agent/difftext.rs:247-254 | src/bin/rhwp-agent/piiscan.rs:41-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/difftext.rs:247\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/difftext.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6913cacc42f72e4a4f7381912ba5f1f075f564a3e1eb827d7767da05e80f6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cli/commands/edit/bookmarks.rs:101-107 | src/cli/commands/edit/bookmarks.rs:215-221 | src/cli/commands/edit/bookmarks.rs:338-344 | src/cli/commands/edit/document_objects.rs:372-378 | src/cli/commands/edit/document_objects.rs:525-531 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/bookmarks.rs\u0060 and \u0060src/cli/commands/edit/document_objects.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/bookmarks.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/bookmarks.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77d275b4c0f1dc860298f86fee31db488f93a8e68e5b8a724f2a5ae67ed9108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:138-144 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:167-173 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:177-183 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:187-193 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:143-149 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:220-226 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:138\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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8beabce6b1aa2402715a2acde9a5c010a1fc06ca6e4b707ec9f1fe385eb8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/agent/dsel/parse.rs:275-281 | src/agent/dsel/parse.rs:416-422 \u2014 both copies are in the same file, so extract the block 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 \u0060src/agent/dsel/parse.rs:275\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/parse.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad7deb0d7fcc55cc4544af309ac8ab40a90e86e3ca1b002fe61a37057679458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/bin/rhwp-agent/locate.rs:87-93 | src/bin/rhwp-agent/locate.rs:178-184 | src/bin/rhwp-agent/locate.rs:294-300 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/locate.rs:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/locate.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed4fea7f504ad253b4a93f7f31eb25cc7e1ffe8d839c2ecb74c463206dda3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bin/rhwp-agent/harvest.rs:35-41 | src/bin/rhwp-agent/harvest.rs:160-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/harvest.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734d60fb0e7eadcabbff386090c092c353d993e7aa6d11de679067a19c7f2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/queries/diagnostics.rs:112-118 | src/cli/queries/diagnostics.rs:119-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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c57d1552ec81876d97b4bd1b1006a8186008d34bcd99323b27b47fd99bb457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:2020-2026 | src/parser/hwpx/section.rs:5221-5227 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:2020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb497ee85eb4975043bcc75b62f9392fb63e76a8ce229e3eeddf729225f19507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/parser/hwpx/section.rs:2109-2115 | src/parser/hwpx/section.rs:6174-6180 | src/parser/hwpx/section.rs:6839-6845 \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":"src/parser/hwpx/section.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da278054ce93cec2c908235cf7bd95aa5186c764efc276364339f1342970152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:1305-1311 | src/parser/hwpx/section.rs:6767-6773 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"518c91d0db7d39b5bdc5b5564888fd99f936cdfe40e199d6ee4a4fdb50f8804c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/pdf/recognition.rs:921-927 | src/parser/pdf/recognition.rs:929-935 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/recognition.rs:921\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":"src/parser/pdf/recognition.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"69df3a085f0d7bb678d29f62fb5c3ca9fb32565afd058cca9fefb32826fb206a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): src/serializer/hwpx/roundtrip.rs:1391-1393 | src/serializer/hwpx/roundtrip.rs:1401-1403 | src/serializer/hwpx/roundtrip.rs:1573-1579 | src/serializer/hwpx/roundtrip.rs:1620-1626 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/serializer/hwpx/roundtrip.rs:1391\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/serializer/hwpx/roundtrip.rs:1400\u0060 calls \u0060Picture\u0060 and \u0060src/serializer/hwpx/roundtrip.rs:1388\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5a45888e5bfd500703d63ba4a90172363e3ebde0b6374dbea27a71e926f3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/commands/edit/note_content.rs:9-15 | src/cli/commands/edit/note_content.rs:347-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/note_content.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc33641a3cddd6edbda8dee887e986cf4de7ac826793820a7ced5c5b9200862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 11): src/parser/hwpx/header.rs:903-909 | src/parser/hwpx/header.rs:1002-1008 | src/parser/hwpx/header.rs:1932-1938 | src/parser/hwpx/section.rs:1022-1028 | src/parser/hwpx/section.rs:1354-1360 | src/parser/hwpx/section.rs:3088-3094 | src/parser/hwpx/section.rs:3487-3493 | src/parser/hwpx/section.rs:5183-5189 | src/parser/hwpx/section.rs:5396-5402 | src/parser/hwpx/section.rs:6122-6128 | src/parser/hwpx/section.rs:6735-6741 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d856bd2fe786636374dbf2a8152e9d5bfda037a58ee89fd3d280bc4082783a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/bin/rhwp-agent/grepcmd.rs:48-54 | src/bin/rhwp-agent/inspect.rs:163-169 | src/bin/rhwp-agent/locate.rs:231-237 \u2014 before extracting anything, compare \u0060src/bin/rhwp-agent/grepcmd.rs\u0060 and \u0060src/bin/rhwp-agent/inspect.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/grepcmd.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8bda5d708744b7d496326ee2cc87d85b0f8ae972a86837212f1af27716810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/renderer/html.rs:73-79 | src/renderer/html.rs:84-90 | src/renderer/html.rs:95-101 | src/renderer/html.rs:183-189 \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":"src/renderer/html.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"107fca05832949d880735e9aba6fe6a459f81de06be8b7f8d773e938ab696510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): mydocs/tech/investigations/issue-1058/probes/dump_footnote_inner.rs:76-82 | mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:171-177 | mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:87-93 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mydocs/tech/investigations/issue-1058/probes/dump_footnote_inner.rs:76\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":"mydocs/tech/investigations/issue-1058/probes/dump_footnote_inner.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14ffc3e31412f6f2041be7cf8c8a316ac890f479fc41b3ab12ae2498117daea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:153-159 | src/parser/hwpx/section.rs:2914-2920 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57c3bb8387001bd371848f599128a68436bc749dbe823a77f1f768a2a5513e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parser/hwpx/header.rs:2020-2026 | src/parser/hwpx/section.rs:7203-7209 \u2014 before extracting anything, compare \u0060src/parser/hwpx/header.rs\u0060 and \u0060src/parser/hwpx/section.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/hwpx/header.rs:2020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d750e205ddab54906c7cbcfdc4438d2c440e634b47dc0025756352386eac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/eps.rs:122-128 | src/eps.rs:136-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/eps.rs:122\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":"src/eps.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7eefeb6f89bf67f3daf3e755710508026e84c3011f9184fd5cbe91323d30ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/bin/rhwp-agent/stats.rs:206-212 | src/bin/rhwp-agent/stats.rs:232-238 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/stats.rs:206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/stats.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8f48f0f3e5cb79e3ac91ac3b3a346114fb7b564e9eb82d2604699c3d027135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mydocs/tech/investigations/issue-671/probes/inspect_task671.rs:22-28 | mydocs/tech/investigations/issue-671/probes/inspect_task671_v2.rs:23-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060mydocs/tech/investigations/issue-671/probes/inspect_task671.rs:22\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":"mydocs/tech/investigations/issue-671/probes/inspect_task671.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb922043d9b86d457fd1e607e3b34d74a0c4b7e68294f09bddc8e4b7c81676b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:136-142 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:146-152 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:170-176 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:180-186 | src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:190-196 | src/bin/rhwp-q/commands/rhwp-q-page-caret.rs:141-147 | src/bin/rhwp-q/commands/rhwp-q-page-items.rs:218-224 \u2014 before extracting anything, compare \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs\u0060 and \u0060src/bin/rhwp-q/commands/rhwp-q-page-caret.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs:136\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":"src/bin/rhwp-q/commands/rhwp-q-cursor-model.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1cf972d5035c1cc4b09c2b517ad2ee3b1bf49f241bfa2d6211d535777a5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/batch/mod.rs:168-174 | src/cli/batch/mod.rs:201-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/batch/mod.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/batch/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"491b124b557a289f5a209e89c81e38b18c820c29bd8b761cda428518292312cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/paragraph_block/import.rs:230-235 | src/document_core/commands/paragraph_block/repeat.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/paragraph_block/import.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/import.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8f9b9f5dd78d4172a2b58ebedaaf3e353abea30327f003e453305bda48e115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/document_core/commands/html_import.rs:821-826 | src/document_core/commands/html_import.rs:857-862 | src/document_core/commands/html_import.rs:906-910 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/html_import.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104f9335707e52b2f7e12e094ccf714ec5044f405b48a7a0c4ab3005ee695fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 92): src/bin/rhwp-q/more/inventory.rs:138-143 | src/bin/rhwp-q/more/inventory.rs:165-170 | src/bin/rhwp-q/more/inventory.rs:192-197 | src/bin/rhwp-q/more/inventory.rs:219-224 | src/bin/rhwp-q/more/inventory.rs:246-251 | src/bin/rhwp-q/more/inventory.rs:273-278 | src/bin/rhwp-q/more/inventory.rs:300-305 | src/bin/rhwp-q/more/inventory.rs:327-332 | src/bin/rhwp-q/more/inventory.rs:354-359 | src/bin/rhwp-q/more/inventory.rs:381-386 | src/bin/rhwp-q/more/inventory.rs:408-413 | src/bin/rhwp-q/more/inventory.rs:435-440 | src/bin/rhwp-q/more/inventory.rs:462-467 | src/bin/rhwp-q/more/inventory.rs:489-494 | src/bin/rhwp-q/more/inventory.rs:516-521 | src/bin/rhwp-q/more/inventory.rs:543-548 | src/bin/rhwp-q/more/inventory.rs:570-575 | src/bin/rhwp-q/more/inventory.rs:597-602 | src/bin/rhwp-q/more/inventory.rs:624-629 | src/bin/rhwp-q/more/inventory.rs:651-656 | src/bin/rhwp-q/more/inventory.rs:678-683 | src/bin/rhwp-q/more/inventory.rs:703-708 | src/bin/rhwp-q/more/inventory.rs:730-735 | src/bin/rhwp-q/more/inventory.rs:755-760 | src/bin/rhwp-q/more/inventory.rs:780-785 | src/bin/rhwp-q/more/inventory.rs:805-810 | src/bin/rhwp-q/more/inventory.rs:830-835 | src/bin/rhwp-q/more/inventory.rs:855-860 | src/bin/rhwp-q/more/inventory.rs:880-885 | src/bin/rhwp-q/more/inventory.rs:905-910 | src/bin/rhwp-q/more/inventory.rs:932-937 | src/bin/rhwp-q/more/inventory.rs:959-964 | src/bin/rhwp-q/more/inventory.rs:986-991 | src/bin/rhwp-q/more/inventory.rs:1013-1018 | src/bin/rhwp-q/more/inventory.rs:1040-1045 | src/bin/rhwp-q/more/inventory.rs:1102-1107 | src/bin/rhwp-q/more/inventory.rs:1129-1134 | src/bin/rhwp-q/more/inventory.rs:1156-1161 | src/bin/rhwp-q/more/inventory.rs:1183-1188 | src/bin/rhwp-q/more/inventory.rs:1210-1215 | src/bin/rhwp-q/more/inventory.rs:1237-1242 | src/bin/rhwp-q/more/inventory.rs:1264-1269 | src/bin/rhwp-q/more/inventory.rs:1291-1296 | src/bin/rhwp-q/pack/inventory.rs:83-88 | src/bin/rhwp-q/pack/inventory.rs:110-115 | src/bin/rhwp-q/pack/inventory.rs:135-140 | src/bin/rhwp-q/pack/inventory.rs:160-165 | src/bin/rhwp-q/pack/inventory.rs:185-190 | src/bin/rhwp-q/pack/inventory.rs:210-215 | src/bin/rhwp-q/pack/inventory.rs:235-240 | src/bin/rhwp-q/pack/inventory.rs:260-265 | src/bin/rhwp-q/pack/inventory.rs:285-290 | src/bin/rhwp-q/pack/inventory.rs:310-315 | src/bin/rhwp-q/pack/inventory.rs:335-340 | src/bin/rhwp-q/pack/inventory.rs:360-365 | src/bin/rhwp-q/pack/inventory.rs:385-390 | src/bin/rhwp-q/pack/inventory.rs:416-421 | src/bin/rhwp-q/pack/inventory.rs:441-446 | src/bin/rhwp-q/pack/inventory.rs:466-471 | src/bin/rhwp-q/pack/inventory.rs:480-485 | src/bin/rhwp-q/pack/inventory.rs:494-499 | src/bin/rhwp-q/pack/inventory.rs:521-526 | src/bin/rhwp-q/pack/inventory.rs:548-553 | src/bin/rhwp-q/pack/inventory.rs:575-580 | src/bin/rhwp-q/pack/inventory.rs:600-605 | src/bin/rhwp-q/pack/inventory.rs:627-632 | src/bin/rhwp-q/pack/inventory.rs:654-659 | src/bin/rhwp-q/pack/inventory.rs:679-684 | src/bin/rhwp-q/pack/inventory.rs:704-709 | src/bin/rhwp-q/pack/inventory.rs:729-734 | src/bin/rhwp-q/pack/inventory.rs:756-761 | src/bin/rhwp-q/pack/inventory.rs:783-788 | src/bin/rhwp-q/pack/inventory.rs:808-813 | src/bin/rhwp-q/pack/inventory.rs:833-838 | src/bin/rhwp-q/pack/inventory.rs:858-863 | src/bin/rhwp-q/pack/inventory.rs:883-888 | src/bin/rhwp-q/pack/inventory.rs:908-913 | src/bin/rhwp-q/pack/inventory.rs:935-940 | src/bin/rhwp-q/pack/inventory.rs:962-967 | src/bin/rhwp-q/pack/inventory.rs:989-994 | src/bin/rhwp-q/pack/inventory.rs:1016-1021 | src/bin/rhwp-q/pack/inventory.rs:1041-1046 | src/bin/rhwp-q/pack/inventory.rs:1066-1071 | src/bin/rhwp-q/pack/inventory.rs:1093-1098 | src/bin/rhwp-q/pack/inventory.rs:1118-1123 | src/bin/rhwp-q/pack/inventory.rs:1167-1172 | src/bin/rhwp-q/pack/inventory.rs:1192-1197 | src/bin/rhwp-q/pack/inventory.rs:1217-1222 | src/bin/rhwp-q/pack/inventory.rs:1244-1249 | src/bin/rhwp-q/pack/inventory.rs:1269-1274 | src/bin/rhwp-q/pack/inventory.rs:1296-1301 | src/bin/rhwp-q/pack/inventory.rs:1323-1328 \u2014 \u0060src/bin/rhwp-q/more/inventory.rs\u0060 and \u0060src/bin/rhwp-q/pack/inventory.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 22 separate duplicated blocks between them, totalling at least 173 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":"src/bin/rhwp-q/more/inventory.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e571b2303cf84b26b9a434d87717629673372f775b48bcffef2fc58c1b72c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/font_decision.rs:451-456 | src/document_core/queries/font_decision.rs:471-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/queries/font_decision.rs:451\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_decision.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"634955e71f13f4e6aa132c517de686e9c7df12b6008c59d7ce60190833121ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:168-173 | mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:84-89 | tools/diagnostics/audit_studio_image_parity.rs:132-137 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/diagnostics/audit_studio_image_parity.rs:128\u0060 calls \u0060Ok\u0060 and \u0060mydocs/tech/investigations/issue-1067/probes/dump_polygon_transform.rs:80\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":"mydocs/tech/investigations/issue-1061/probes/dump_equation_records.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e27df03e56e582661bce3241cf54dd8c24e6ec9c2670432e5749814a1ce97b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/document_text.rs:724-729 | src/cli/commands/edit/formatting.rs:11-16 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 218 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ee3abe10164072f10b6133fdcb20f635cbf324820103a4373896a1f2d787e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/layout/paragraph_layout.rs:2919-2924 | src/renderer/layout/paragraph_layout.rs:2927-2932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07a10afae94cf04dc2e8a7eef22d92d97ecb4520f4e6c0968a844b6ef881bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/privacy.rs:750-755 | src/cli/commands/edit/text.rs:159-164 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/privacy.rs\u0060 and \u0060src/cli/commands/edit/text.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/privacy.rs:750\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/privacy.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5106d6e6519ef579f07eb4482f3ccaafadb91fc631228751a35b3c43fc6d60b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/diagnostics/hwp5_contract_analyze.rs:246-253 | src/diagnostics/hwp5_contract_analyze.rs:467-474 \u2014 both copies are in the same file, so extract the block 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 \u0060src/diagnostics/hwp5_contract_analyze.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/diagnostics/hwp5_contract_analyze.rs:243\u0060 calls \u0060display\u0060 and \u0060src/diagnostics/hwp5_contract_analyze.rs:464\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cea2f7b13741bc8d03005fae36879bffa52df87eece395ef34dfd9b65cd7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/header_footer_content.rs:1005-1010 | src/cli/commands/edit/header_footer_properties.rs:140-145 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/header_footer_content.rs\u0060 and \u0060src/cli/commands/edit/header_footer_properties.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44c5c9abeb8ab61f329f6238fb2cc37bdda1dd66a751b5fe1d812913cf07ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/native_host/gpu_d3d.rs:545-550 | src/native_host/gpu_metal.rs:357-362 \u2014 before extracting anything, compare \u0060src/native_host/gpu_d3d.rs\u0060 and \u0060src/native_host/gpu_metal.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/native_host/gpu_d3d.rs:545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/native_host/gpu_d3d.rs:543\u0060 calls \u0060validate_resource\u0060 and \u0060src/native_host/gpu_metal.rs:355\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/gpu_d3d.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7c4afbf9943cc8cc8e01e1750f6ddd3d18a8092e453d7eced470c934a5e1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/bin/rhwp-agent/scan.rs:199-204 | src/bin/rhwp-agent/scan.rs:209-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/scan.rs:199\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":"src/bin/rhwp-agent/scan.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23d979e0832925312f4b631c3a4065bbbc0202a39922dc562ffe8a5a145c897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/protocol/plan/execution.rs:331-336 | src/cli/protocol/plan/execution.rs:348-353 \u2014 both copies are in the same file, so extract the block 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 \u0060src/cli/protocol/plan/execution.rs:331\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":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3b974e8e8725f8c88a30d6bb8fd970d3c4308fab4efd986b5e35cc87110a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/html.rs:510-515 | src/renderer/svg.rs:4246-4251 \u2014 before extracting anything, compare \u0060src/renderer/html.rs\u0060 and \u0060src/renderer/svg.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/html.rs:510\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":"src/renderer/html.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb634ed04be26ac22b36ae91d95140c5c646e4c99bde9cb544e8c9d4aa69fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/wasm_api.rs:2028-2033 | src/wasm_api.rs:9895-9900 \u2014 both copies are in the same file, so extract the block 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 \u0060src/wasm_api.rs:2028\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e683b93ac53cac489cb79616f35b3e4ed8a99cea027dcedaf012da9a93e404f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/commands/edit/header_footer_content.rs:734-739 | src/cli/commands/edit/header_footer_content.rs:874-879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/header_footer_content.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b569f0a02380e38d6cff468646e36636a85936e81d1c75655645f9fef1498923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1564-1569 | src/serializer/hwpx/roundtrip.rs:1750-1755 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/roundtrip.rs:1564\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":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"207bb593763c67fb2862f94fe9afb5ba37d276e52e6170b2d73f4a49dca09bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/diagnostics/hwp5_contract_analyze.rs:237-242 | src/diagnostics/hwp5_contract_analyze.rs:459-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diagnostics/hwp5_contract_analyze.rs:245\u0060 calls \u0060display\u0060 and \u0060src/diagnostics/hwp5_contract_analyze.rs:467\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6950aaad0a3adef62ce09efe3afa85fd432d13f1b89c9c31ffbf66c4dc5fbaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/commands/object_ops/equation.rs:54-58 | src/document_core/commands/object_ops/picture.rs:341-345 \u2014 before extracting anything, compare \u0060src/document_core/commands/object_ops/equation.rs\u0060 and \u0060src/document_core/commands/object_ops/picture.rs\u0060 as WHOLE FILES: this scan already matched 5 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/commands/object_ops/equation.rs:54\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/equation.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f5357f0b845c63ffc329c740b2c65cd652ca5bf3bc7eabc94e7f2a30c9894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1582-1586 | src/serializer/hwpx/roundtrip.rs:1629-1633 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/roundtrip.rs:1582\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"773a9dab4d0437343cec291b913958f1794951e6fa7a6b9339723c40ec60961d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/diagnostics/hwp5_roundtrip_batch.rs:572-576 | src/diagnostics/hwpx_roundtrip_batch.rs:409-413 \u2014 before extracting anything, compare \u0060src/diagnostics/hwp5_roundtrip_batch.rs\u0060 and \u0060src/diagnostics/hwpx_roundtrip_batch.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9b943ce1b3eada2c45c32f7f0b61d0f8b5e5b7bfaf9d46535e437652363be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/serializer/hwpx/roundtrip.rs:1394-1398 | src/serializer/hwpx/roundtrip.rs:1404-1408 \u2014 both copies are in the same file, so extract the block 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 \u0060src/serializer/hwpx/roundtrip.rs:1394\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15a27b4dd4e5e6e59d8a2931bb89de3b4b583063aa0d907a977c7aa5f50277d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/cli/commands/edit/cell_paragraphs.rs:12-16 | src/cli/commands/edit/cell_paragraphs.rs:170-174 | src/cli/commands/edit/formatting.rs:708-712 | src/cli/commands/edit/formatting.rs:860-864 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/cell_paragraphs.rs\u0060 and \u0060src/cli/commands/edit/formatting.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 240 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/edit/cell_paragraphs.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57534a5934ef8eab06776e9c0b551df3568f9d83d4b797ddd8f6bcef5b6d91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/recognition.rs:765-769 | src/parser/pdf/recognition.rs:773-777 \u2014 both copies are in the same file, so extract the block 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 \u0060src/parser/pdf/recognition.rs:765\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65a6318bab7c9d9e0716d817730072e8467e924c75e43a5716a407b3dc0e9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/diagnostics/text_width_probe.rs:43-47 | src/diagnostics/text_width_probe.rs:59-63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"src/diagnostics/text_width_probe.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d11d255a63b30b23b990b182229acb9cba1c6b33eac109b5e57b4b4046b71c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs:16-20 | mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs:38-42 \u2014 both copies are in the same file, so extract the block 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 \u0060mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs:16\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":"mydocs/tech/investigations/issue-2264/probes/task2264_profile.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a7c8885b035c6021745b39d6f9ded8c22200197a321e5fbc8bf067e020b16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/hwpjson/body.rs:844-848 | src/document_core/hwpjson/body.rs:925-929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/hwpjson/body.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec871ead151e0e97611342d8baaa7f341557e067e8e449b548372b714e4d859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:1502-1506 | src/document_core/queries/hwpctrl_sets.rs:1508-1512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fc4ec5f3cc9765e16b3f784f4de680578d22b13bcfa26066b1da6b75959fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/cli/commands/edit/document_text.rs:195-199 | src/cli/commands/edit/fields.rs:351-355 | src/cli/commands/tabular_import.rs:427-431 \u2014 before extracting anything, compare \u0060src/cli/commands/edit/document_text.rs\u0060 and \u0060src/cli/commands/edit/fields.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/cli/commands/edit/document_text.rs:195\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":"src/cli/commands/edit/document_text.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f0373bdd3783cc0a4f6f8566e9f108ea9d5eb3f48cf2925e21b33bb18be66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/bin/rhwp-agent/locate.rs:120-124 | src/bin/rhwp-agent/searchcmd.rs:18-22 | src/bin/rhwp-agent/searchcmd.rs:63-67 | src/bin/rhwp-agent/searchcmd.rs:98-102 | src/bin/rhwp-agent/searchcmd.rs:126-130 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/rhwp-agent/locate.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/locate.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2425beb9d51f5e1c09911466cb793663ad005a4eee50ab4d86c58243c30d3940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs:18-24 | mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs:21-27 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs\u0060 and \u0060mydocs/tech/investigations/issue-1064/probes/repro_1064_save.rs\u0060 as WHOLE FILES: this scan already matched 3 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. 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":"mydocs/tech/investigations/issue-1064/probes/dump_table_ctrl_data.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2661c7265597a765e038c4ecc10def64b215740d92c7905225391a1da850ca31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mydocs/tech/investigations/issue-705/probes/inspect_705.rs:27-31 | mydocs/tech/investigations/issue-705/probes/scan_cell_pagehide.rs:20-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060mydocs/tech/investigations/issue-705/probes/inspect_705.rs:27\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":"mydocs/tech/investigations/issue-705/probes/inspect_705.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"408e5289a71b9eb4051bfe7081d376de45acab6fe51019426b1bc48c91d23b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/agent/dsel/suggest.rs:40-44 | src/bin/rhwp-agent/envelope.rs:300-304 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agent/dsel/suggest.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agent/dsel/suggest.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a7a729103c49058078cc4aa9e5025b41d9fed8107a9265846166190c2500b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bin/rhwp-agent/safety.rs:282-286 | src/bin/rhwp-agent/safety.rs:586-590 \u2014 both copies are in the same file, so extract the block 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 \u0060src/bin/rhwp-agent/safety.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-agent/safety.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b908649e206c5555bd072d234bd6a3bcaaa30eabef368d451e1b2a427a4c83a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/bin/rhwp-q/kit/chart_csv.rs:121-125 | src/cli/outputs/tabular.rs:312-316 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/rhwp-q/kit/chart_csv.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29298b5849306b9aae1626dc544669d8f9e4e67ad47c3435c04a7b8af895945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/capsule_sign.rs:268-273 | src/cli/commands/edit/privacy.rs:419-424 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/capsule_sign.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1628bede1ee5f6a63c3e02de7ae9707bb7b9e83c32bd5cc6844f3b3604527844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/queries/diagnostics.rs:621-626 | src/renderer/render_tree.rs:339-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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07e3fc3e4e6ecbd1e85869f8b30944ecc1b9525360a628d4430f309c953ba05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/commands/border_paint_structure.rs:219-224 | src/document_core/commands/border_paint_structure.rs:585-590 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/commands/border_paint_structure.rs:219\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":"src/document_core/commands/border_paint_structure.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de34fa28ff595d663af093c7f65064cbfbaec3e10fff0c4451687a67315c94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/document_core/converters/hwpx_to_hwp.rs:2191-2197 | src/document_core/converters/hwpx_to_hwp.rs:2584-2590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7052e7b1b3a05c61e2df4932eaa9d9a81c905c3087edce3a5b466b688502c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/hwpjson/fonts_charpr.rs:175-180 | src/document_core/hwpjson/fonts_charpr.rs:190-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/document_core/hwpjson/fonts_charpr.rs:175\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":"src/document_core/hwpjson/fonts_charpr.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"135624e2a89916bb8d4043bae81e752e3e76d93fe93215cc9ae62adae3996970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/document_core/queries/cursor_rect.rs:6199-6203 | src/document_core/queries/cursor_rect.rs:6502-6506 \u2014 both copies are in the same file, so extract the block 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 \u0060src/document_core/queries/cursor_rect.rs:6199\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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":6199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa2b28d487207f9f9b014711ec8e06e14b873d7267680f90231e4cc97430016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/document_core/queries/hwpctrl_sets.rs:1779-1784 | src/serializer/hwpx/roundtrip/export_cache.rs:94-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":"src/document_core/queries/hwpctrl_sets.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b375a5d373c47a23793a286275d304b9e12418b5b2d14b671f8922fe540c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/control/shape.rs:1078-1083 | src/parser/control/shape.rs:1098-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca77bb918176245625b0171b78194022f2ad93ecb4036f65669cc83f9e833a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/hwp3/ole.rs:81-85 | src/parser/hwp3/ole.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":"src/parser/hwp3/ole.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c32bce3b9e84f4763be61b1e06883444e741b9bee6f60dbacdafadf3e090e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/parser/pdf/recognition.rs:431-438 | tools/pdf-ir-poc/src/recognition.rs:248-255 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb0cb070f7a6dea41507b257dcf6c0fd59f0482d3f8731f8a56ad75640154b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/recognition.rs:442-446 | tools/pdf-ir-poc/src/recognition.rs:258-262 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 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":"src/parser/pdf/recognition.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6516f70598cad9c46b82066b14acfec6d0f2620b0ceb5cd4c4e847cbd415eb87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/recognition.rs:851-855 | tools/pdf-ir-poc/src/recognition.rs:573-577 \u2014 before extracting anything, compare \u0060src/parser/pdf/recognition.rs\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 233 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/parser/pdf/recognition.rs:850\u0060 calls \u0060allocation\u0060 and \u0060tools/pdf-ir-poc/src/recognition.rs:572\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9fb83269118bbe56c1a53b44b68efbb382ccb3db65e9e3e49d700d4eff426e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parser/pdf/structured_lowering.rs:1623-1628 | tools/pdf-ir-poc/src/structured_lowering.rs:502-507 \u2014 before extracting anything, compare \u0060src/parser/pdf/structured_lowering.rs\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 309 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser/pdf/structured_lowering.rs:1623\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, \u0060src/parser/pdf/structured_lowering.rs:1629\u0060 calls \u0060map_or_else\u0060, \u0060hu\u0060, \u0060number\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:508\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c87e3d59a977b03cd53376826b1c5fa5710f0e05d0a66291553c015f1e02d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/parser/pdf/table_detection.rs:876-880 | tools/pdf-ir-poc/src/table_detection.rs:474-478 \u2014 before extracting anything, compare \u0060src/parser/pdf/table_detection.rs\u0060 and \u0060tools/pdf-ir-poc/src/table_detection.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 144 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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c742cb35ebb16d21791e44318687661fdca71c3a9d91a3a3526a56006b41b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/anisotropic_sampling.rs:80-85 | src/renderer/cubic_sampling.rs:94-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/anisotropic_sampling.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/renderer/cubic_sampling.rs:93\u0060 calls \u0060min\u0060, \u0060max\u0060 and \u0060src/renderer/anisotropic_sampling.rs:79\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/anisotropic_sampling.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d305dcad7eaf05f9e9863160b29fa5f0bf8dea947c86a692e653d8d85250bee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/equation/brace_stretch.rs:24-29 | src/renderer/equation/round_stretch.rs:63-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/equation/brace_stretch.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d094c5e7e3bd384c1996544b3c59f5fe699858b07588925e7c8392383fef16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/equation/canvas_render.rs:367-371 | src/renderer/equation/canvas_render.rs:389-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/equation/canvas_render.rs:367\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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab103b293c83e0b275f3a341d6e811f976cfc4560925f386b10d6486eff63625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/float_placement.rs:9320-9324 | src/renderer/float_placement.rs:9417-9421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":9320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e02aac10ac36291a8a371413e39d0354504e5b5480bac1f1e5556bcc6b3c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/height_measurer.rs:5779-5785 | src/renderer/height_measurer.rs:6005-6011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":5779}}}],"partialFingerprints":{"codehealthFindingId/v1":"34443f63e1fb4a8b0f298e948b3af38f037d0ec46c851d23d9b003e6328d9f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/inline_flow/alignment.rs:60-64 | src/renderer/inline_flow/separator_spaces.rs:9-13 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/renderer/inline_flow/alignment.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c2b2934d262947b3fc645ad71a450f9b40f43d7a1b9b7ca22ad92a945a457e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/renderer/layout.rs:15382-15386 | src/renderer/layout.rs:16437-16441 | src/renderer/layout.rs:16645-16649 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/renderer/layout.rs:15382\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":"src/renderer/layout.rs"},"region":{"startLine":15382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc1fda8888cd09b4f0919b1534dae81328c1c62232cac38c6082fb173489e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/renderer/layout/table_layout.rs:4719-4725 | src/renderer/layout/table_partial.rs:7246-7252 \u2014 before extracting anything, compare \u0060src/renderer/layout/table_layout.rs\u0060 and \u0060src/renderer/layout/table_partial.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 327 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":4719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034ac0411af222f4a899c86a265c9611d5313bd19234a8da553e4892c3725d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/layout/table_layout.rs:23262-23266 | src/renderer/layout/table_layout.rs:23883-23887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be0327aa503bf73eaabc43a8551ccf30eb477a5729a94b8e2afad5e2efd169a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/renderer/png_sampling.rs:92-99 | src/renderer/png_sampling.rs:102-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/png_sampling.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e703c8f9c6129445abe0ae09441049a378d8c678deb26a4474991f1f6ef7bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/renderer/skia/equation_conv.rs:790-795 | src/renderer/skia/renderer.rs:2624-2629 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad0027fc3912c09678fb98a933febc91c05ef83de6953ceded637b3407704dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/renderer/typeset/section/controls.rs:345-349 | src/renderer/typeset/section/controls.rs:368-372 \u2014 both copies are in the same file, so extract the block 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 \u0060src/renderer/typeset/section/controls.rs:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec490b86d8c5f0fef1b578c70579f12c8f2c677888838ae80b18674fda954f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/serializer/control.rs:2218-2223 | src/serializer/control.rs:2249-2254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8de144c52cf061f6796b08620743f44769c7f87b5028e38be6974c74acc296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tools/font_metric_gen.rs:530-534 | src/tools/font_metric_gen.rs:556-560 \u2014 both copies are in the same file, so extract the block 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 \u0060src/tools/font_metric_gen.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/font_metric_gen.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"17102e1da46658e79f90240c6c0376ae6b24692a47d585d364d9528f76adf8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (128\u2013129 lines \u00D7 2): gym/tools/fuzz_corpus.py:967-1094 | gym/tools/robustness.py:785-913 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 \u0060gym/tools/fuzz_corpus.py:967\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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d315244f77bd1217503e26cb34b09d5e795dc31fab904aaac9ffe0f1144f17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (118\u2013119 lines \u00D7 2): gym/tools/fuzz_corpus.py:1092-1209 | gym/tools/robustness.py:935-1053 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0b9b24949068b627717c3693649d9236177d1911f3b49ec8a8bef25435a24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): .claude/skills/rhwp-explore/references/_gen_pack.py:322-351 | .claude/skills/rhwp-explore/references/_gen_pack.py:372-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/rhwp-explore/references/_gen_pack.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"be16b61bd891c22854c045945fa603bbf7a89fbbbb2b5bc4e81bf30b19f3e791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): gym/tools/fuzz_corpus.py:824-851 | gym/tools/robustness.py:657-684 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 \u0060gym/tools/fuzz_corpus.py:824\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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c411a1bcf7326481fb71a3271956b360e5d12d1cd8d3dd472b9b7d88bc51f782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): gym/tools/build_baseline.py:346-371 | gym/tools/discriminate.py:271-296 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/tools/build_baseline.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655406f08061096f963a0e5a32e799f5f4d7ef65a3701670c93578a8f4fbe98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201322 lines \u00D7 5): gym/tools/audit.py:781-790 | gym/tools/differential.py:868-886 | gym/tools/discriminate.py:473-482 | gym/tools/release_diff.py:794-815 | gym/tools/trajectory.py:572-581 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 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 after the matched lines, \u0060gym/tools/audit.py:792\u0060 calls \u0060isinstance\u0060, \u0060get\u0060 and \u0060gym/tools/discriminate.py:483\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f76ea9dd026af217d43c49e54ee934eb406ed74d4faf93149eb8153ab9cb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): gym/tools/differential.py:416-440 | gym/tools/release_diff.py:467-491 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gym/tools/release_diff.py:494\u0060 calls \u0060observations_equal\u0060, \u0060_values_equal\u0060 and \u0060gym/tools/differential.py:443\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa4540dff5a4160846c1a388c76be1032972156b1c85277bb6e943da5dd8e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): gym/tools/build_baseline.py:377-396 | gym/tools/discriminate.py:302-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 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":"gym/tools/build_baseline.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bcd1d15739f5086a51ef0df475f4b44b7d67c3b9f93526a354ede602d98905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): gym/tools/fuzz_corpus.py:949-965 | gym/tools/robustness.py:919-935 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 \u0060gym/tools/fuzz_corpus.py:949\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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eaa1ba612af8688088280baf0c79315ceb406e9bab9d5b8d07a726e64b60de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): gym/tools/differential.py:211-224 | gym/tools/trajectory.py:352-367 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gym/tools/differential.py:210\u0060 calls \u0060isinstance\u0060 and \u0060gym/tools/trajectory.py:351\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a8ddc450ff2cd5a608433b7cf080061cc15a47f137a84663dbed317637b7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gym/tools/fuzz_corpus.py:914-929 | gym/tools/robustness.py:756-771 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680104b2f453df6af2a77ba5940665560bb1692bc87cc41dbde050161e58c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gym/tools/fuzz_corpus.py:1650-1665 | gym/tools/robustness.py:1311-1326 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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 after the matched lines, \u0060gym/tools/fuzz_corpus.py:1666\u0060 calls \u0060is_fatal_exception\u0060 and \u0060gym/tools/robustness.py:1327\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7907f2de417201bc6cdcb006256c76d5bb0696cd76e860cc1fcb0f6bbc0b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): gym/core/runner.py:229-243 | gym/tools/differential.py:251-265 | gym/tools/release_diff.py:246-260 | gym/tools/trajectory.py:376-390 \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. 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, \u0060gym/tools/differential.py:246\u0060 calls \u0060update\u0060 and \u0060gym/tools/release_diff.py:242\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":"gym/core/runner.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce2dd782b0bedd5b7ed3d8e00a09679fce287bf26f2c67ff3a874759ada8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gym/tools/audit.py:218-232 | gym/tools/release_gate.py:212-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 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":"gym/tools/audit.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"03707878f301aa340c6006334235b1a2620f1c03b6f434afd42d572d0a9b2d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gym/core/checks.py:306-319 | tools/schema-validator/schema_validator.py:70-83 \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. 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":"gym/core/checks.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bf92d5c2a90bed09ed087c85c6687e6ffae710e11a3080a57f471df896fe26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): gym/tools/fuzz_corpus.py:1433-1446 | gym/tools/robustness.py:1226-1239 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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 after the matched lines, \u0060gym/tools/robustness.py:1240\u0060 calls \u0060isinstance\u0060, \u0060get\u0060 and \u0060gym/tools/fuzz_corpus.py:1447\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ade4ac48097b3f501e456cdf924dee24c78cd53b2a3ee2b2bf88f04d16e46f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gym/tools/build_baseline.py:723-735 | gym/tools/discriminate.py:220-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/tools/build_baseline.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9299511934792e7d42a5751df61f39ccf62f7ced7e0e959400f71a6183e6e33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/audit.py:945-954 | gym/tools/audit.py:967-976 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68f5f01c60ff9131f57fe5c3485e2687a7df532992e288e8ad106b0e3ba1937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/differential.py:933-942 | gym/tools/release_diff.py:863-872 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/tools/differential.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4ed7932b2af45013c2de3ae4b8afe50124ebfad931c71cd6d56e1b3984e145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/fuzz_corpus.py:1286-1295 | gym/tools/robustness.py:1121-1130 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"160e45278b782e1b15c5097169972f4040828293bf239b02e8d848d70956363b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/fuzz_corpus.py:1458-1467 | gym/tools/robustness.py:1252-1261 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gym/tools/robustness.py:1251\u0060 calls \u0060any\u0060, \u0060isinstance\u0060 and \u0060gym/tools/fuzz_corpus.py:1457\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"37250ec37a58b96552655d0c4e0a35481316efeb0e66a6ec29a53f4af9a11128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/release_diff.py:202-212 | gym/tools/release_gate.py:246-255 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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. 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":"gym/tools/release_diff.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"19594c28b3d000eadf28ae7e3f4769b780a02c837ce610eaa2bb171dbe631717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): gym/tools/audit.py:1132-1139 | gym/tools/audit.py:1144-1151 | gym/tools/audit.py:1160-1168 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gym/tools/audit.py:1160\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":"gym/tools/audit.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"365668f6acc9b95875b79798add4a7245b2252cff5a212e90816dd6af96c142d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gym/tools/evidence_report.py:514-522 | gym/tools/evidence_report.py:618-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/evidence_report.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a7b1246613ea9413d4ee7bf9c3d5e8a8de0169aa61662dc5bbc4feb9900769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gym/tools/fuzz_corpus.py:1450-1458 | gym/tools/robustness.py:1242-1250 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060gym/tools/robustness.py:1251\u0060 calls \u0060any\u0060, \u0060isinstance\u0060 and \u0060gym/tools/fuzz_corpus.py:1459\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a07d88437eb5490d01a2ddcf277ccab40d253edaca7f8f5f2c26dacc8af5073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gym/tools/release_gate.py:754-762 | gym/tools/release_gate.py:778-786 \u2014 both copies are in the same file, so extract the block 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 \u0060gym/tools/release_gate.py:754\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gym/tools/release_gate.py:776\u0060 calls \u0060get\u0060 and \u0060gym/tools/release_gate.py:753\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_gate.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"256663107ed455e9f63a1adb05e04e281c16834f900d8b99fcb77d5819174a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/audit.py:992-999 | gym/tools/audit.py:1045-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/audit.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b048745695999cee11178a876cad4a72646218dbe6d7934ec737d462396e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/build_baseline.py:830-837 | gym/tools/discriminate.py:350-357 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060gym/tools/discriminate.py:344\u0060 calls \u0060score_discriminates\u0060, \u0060score_is_pass\u0060 and \u0060gym/tools/build_baseline.py:826\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/build_baseline.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9420db5f470a783b17a180f05bf451ed465bb3e9ec57de0e31d2b40047517bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/release_diff.py:332-339 | gym/tools/release_diff.py:355-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_diff.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29f010aec46e724830443c32b73c6b4dd874e8b1364aadf77e7f679677b7990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gym/tools/audit.py:506-512 | gym/tools/release_gate.py:576-582 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/tools/audit.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e7efbe61a202cc210689863b06ed39f14201730e99eb5d2fb6ffbeb7391bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gym/tools/fuzz_corpus.py:1800-1806 | gym/tools/robustness.py:1387-1393 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccbdbf3d57785600b50ce6566338465ce913ba25147c99de3746daaea19bae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): gym/tools/audit.py:786-791 | gym/tools/differential.py:882-887 | gym/tools/release_diff.py:811-816 | gym/tools/release_gate.py:796-801 | gym/tools/trajectory.py:577-582 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"gym/tools/audit.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bee35fe4eadf959e7f4deef1f06c0d7f612d03f8838697b5e8ef63249c53f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gym/certify.py:705-710 | gym/report.py:789-794 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/certify.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ffb247833df0ed7f5551bcd505d832664db68a3149aa7780e8dca8471494cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gym/tools/agent_session.py:659-663 | tools/hwp5_inventory/model.py:436-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":"gym/tools/agent_session.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bcc5f89f8f43893b84101903c0754f0aa5cac80010f3cdbe01ef78e4bdb2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gym/tools/fuzz_corpus.py:943-947 | gym/tools/robustness.py:913-917 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 \u0060gym/tools/fuzz_corpus.py:943\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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6782ee61554e234edcc18acbba96dcbfe0774ad50d5f1a190c28ffa327251c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): gym/tools/fuzz_corpus.py:1216-1220 | gym/tools/fuzz_corpus.py:1316-1320 | gym/tools/fuzz_corpus.py:1347-1350 \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. 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf34251f1b3ae1104001ddcd440c94e64105ce16c4f3d497547a0843416e43b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): pdf/issue7966/generate.py:13-18 | pdf/issue7966/generate_close_stroke.py:9-14 | pdf/issue7966/generate_text_paint_order.py:9-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"pdf/issue7966/generate.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9764f20b5009569cffd3ef39fddb1d33153d5bdff151bbbb9c2f1d8d707dd550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .claude/skills/rhwp-recipes/references/_gen_pack.py:377-382 | .claude/skills/rhwp-strategist/references/_gen_pack.py:53-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":".claude/skills/rhwp-recipes/references/_gen_pack.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843faad02413126ec49325e49777ad26744a28a6efee064d05b3e0086dc284d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gym/certify.py:216-221 | gym/report.py:209-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":"gym/certify.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"383ccd78e97632577998c3b400f0401680967e9801e4d83e48fd07db0366dae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gym/certify.py:664-670 | gym/report.py:700-706 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"gym/certify.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ea4e222a7192279ed8466b65941f9a7de5b3c2155f5dc356ab8bc540ab92cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): gym/core/checks.py:28-32 | tools/provenance_chain.py:35-39 | tools/scale_ladder_real.py:151-155 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060Path\u0060 in one and \u0060str\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":"gym/core/checks.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5beaaf47041247e447cbeb1c52176705d16f5b094abca70f12e228a440608253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gym/tools/differential.py:287-292 | gym/tools/release_diff.py:303-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. 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":"gym/tools/differential.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd80c330ded9ce46db3cc88f75c64ef44a708b91bf044dc15905b3b3ae1936d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/differential.py:308-315 | gym/tools/release_diff.py:284-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"gym/tools/differential.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b352fb95687bc9b99897ab2a4f652a4478ea16d2faf78c7829faad273772280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gym/tools/fuzz_corpus.py:691-705 | gym/tools/robustness.py:563-577 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd11ae93d955b3c5d495950f847a3397bf1addbc313e660758c467f14c133e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gym/tools/fuzz_corpus.py:709-718 | gym/tools/robustness.py:581-590 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"946876771110debcf13e1e92b352aa65d0a3a1acf2b3969ee97df9d2aa8892dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/fuzz_corpus.py:865-872 | gym/tools/robustness.py:698-705 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f976f386011fe4b47ee0ffac69e49dc3d9a84d558e506b5200c0009f5b0a6fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gym/tools/fuzz_corpus.py:876-883 | gym/tools/robustness.py:709-716 \u2014 before extracting anything, compare \u0060gym/tools/fuzz_corpus.py\u0060 and \u0060gym/tools/robustness.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 421 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 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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a7641d59e211a5991c11c2cff7457f45b81ffffdd9738d5ca99361387bd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): gym/certify.py:305-310 | gym/report.py:352-357 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060role\u0060 to \u0060str = \u0022cert\u0022\u0060 in one and \u0060str = \u0022scorecard\u0022\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":"gym/certify.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e148d5747b04c8609c9458aebdd75cea0cdb0ec59ec68ddbf96ae0c8e83ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): gym/tools/competitive_bench.py:957-961 | gym/tools/competitive_bench.py:965-969 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"gym/tools/competitive_bench.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a8138ffe8d4eb1f06e26c3fca87ff292be089cdcb6e120d9481368e4941eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): bindings/Flutter/lib/src/native_ffi.dart:273-287 | bindings/Flutter/lib/src/native_presentation.dart:159-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/Flutter/lib/src/native_ffi.dart:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note 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":"bindings/Flutter/lib/src/native_ffi.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2d7c488323d049c04988381cdbc252b720550619b6c14f0960f65a929f1117"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 12 shared lines): scripts/font_rank1_metric_hypothesis.py:513-526 | scripts/font_rank7_metric_hypothesis.py:169-186 | scripts/font_rank8_metric_hypothesis.py:669-683 \u2014 These 3 members are variants of one another: a block of 12 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5824cced6ecd4d97d5240382fb4a54f8404ae5bdac1f8b7f9422a388eaad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): tools/llm_verifier/repeat_eval/src/loader.rs:91-119 | tools/llm_verifier/tool_version_gate/src/loader.rs:150-177 \u2014 These two members are variants of one another: 25 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":"tools/llm_verifier/repeat_eval/src/loader.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbce53952e58896dba0912ba72d24186297664c69e5196c29cf76e07590f953"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (21 shared lines): tools/task2279/footer_flip_run.py:119-169 | tools/task2279/footer_flip_worker.py:31-119 \u2014 These two members are variants of one another: 21 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":"tools/task2279/footer_flip_run.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd64fc933d137df85333f8298712e95979ad7e4c90b5399630b38b14724e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): tools/oracle_public/coverage_report.py:570-612 | tools/oracle_public/oracle_resolver.py:386-423 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ad05f68fe019fd842b555f6b97565f477e572cf227570917fc605fe40fa1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): scripts/font_kerning_cohort.py:112-119 | scripts/font_rank1_metric_hypothesis.py:54-64 | scripts/font_rank8_metric_hypothesis.py:68-78 | scripts/font_rank8_qualification.py:102-109 | scripts/oracle_stage3_profile.py:51-58 | scripts/oracle_stage4_profile.py:166-173 \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":"scripts/font_kerning_cohort.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3919f343b24d436c89190226b124f08d79545dab76ace16ae9c3b312dc5097"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): tools/llm_verifier/abstain/generate_corpus.py:506-523 | tools/llm_verifier/lineage_chain/generate_corpus.py:601-618 | tools/llm_verifier/oracle_vs_self/generate_corpus.py:334-342 | tools/llm_verifier/shadow_agree/generate_corpus.py:306-314 | tools/llm_verifier/third_party_replay/generate_corpus.py:480-497 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:453-472 \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":"tools/llm_verifier/abstain/generate_corpus.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5f2c2652833a19d349020895cad156dfc79e75835e105b506ecfb4e5f2a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/layout_anomaly_batch_report.py:254-278 | tools/oracle_public/page_smoke.py:144-165 | tools/oracle_public/sweep_runner.py:557-581 | tools/page_roundtrip/harness.py:200-221 \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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6c4b05bacf7691cbc073d74792fa14227d0b61517295c026ce94b62f47c6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/layout_anomaly_batch_report.py:733-739 | tools/oracle_public/coverage_report.py:555-561 | tools/oracle_public/oracle_resolver.py:373-382 | tools/oracle_public/sweep_runner.py:1220-1227 \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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9377462b3791f5ed49f782a7c0ed7323aa2e2519a8465aba595e553abb6d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/llm_verifier/abstain/corpus_io.py:21-36 | tools/llm_verifier/oracle_vs_self/corpus_io.py:21-36 | tools/llm_verifier/shadow_agree/corpus_io.py:24-39 | tools/llm_verifier/untrusted_sandbox/corpus_io.py:21-38 \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":"tools/llm_verifier/abstain/corpus_io.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f2c78b7cdf8d9837b36f2f7b7f0c61f9cd3140723721fc628ae1f4b300d6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/llm_verifier/abstain/corpus_io.py:52-57 | tools/llm_verifier/oracle_vs_self/corpus_io.py:47-52 | tools/llm_verifier/shadow_agree/corpus_io.py:52-57 | tools/llm_verifier/untrusted_sandbox/corpus_io.py:53-58 \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":"tools/llm_verifier/abstain/corpus_io.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e86af2939547c26ddd3c51856112c9b78eb49374cc2aca3cea5a9660f2cef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/llm_verifier/abstain/generate_corpus.py:440-502 | tools/llm_verifier/oracle_vs_self/generate_corpus.py:260-330 | tools/llm_verifier/shadow_agree/generate_corpus.py:230-302 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:370-449 \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":"tools/llm_verifier/abstain/generate_corpus.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af0e4f9d000bcb95cc21ab172aef8f7b076decbc57039cdcf2e1557076641a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/oracle_public/sweep_runner.py:643-652 | tools/oracle_public/sweep_runner.py:776-788 | tools/oracle_public/sweep_runner.py:799-809 | tools/oracle_public/sweep_runner.py:875-901 \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":"tools/oracle_public/sweep_runner.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc54437147a2e42e268a26f6fdba3fbf8fb15ad0b75bde375c3858484a8b74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/task2279/pi78_split_ladder.py:72-100 | tools/task2279/spacing_ladder.py:39-108 | tools/task2279/subpixel_align_harness.py:32-100 | tools/task2430/hy_ascii_ladder.py:176-207 \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":"tools/task2279/pi78_split_ladder.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd7741151e8b97b33008baeafe34d3f3036f36504bedf7225a000a818a4efb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): samples/issue8474/gen_section_top_spacing.py:65-114 | samples/issue8474/gen_top_tac_cases.py:65-113 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8474/gen_section_top_spacing.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"22317e0abec4b907d16fea2bccc36e3e2d82176202a897979c02dd77d4018479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): scripts/font_kerning_cohort.py:228-304 | scripts/font_rank8_qualification.py:316-379 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcd8dfa8c163790823352bc6717b4da6a9d30a242b0297860f406a20b5f1640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): tools/fidelity_compare/fidelity_compare.py:3026-3072 | tools/fidelity_compare/fidelity_compare.py:3081-3130 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"0498be4b30289ca4175e96873266acd71b0e1d876f6cd94f9e0d8fb1ebbae5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): tools/oracle_public/coverage_report.py:101-136 | tools/oracle_public/oracle_resolver.py:95-128 | tools/oracle_public/sweep_runner.py:283-314 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/coverage_report.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"34866ed2eb7c46555451b7a4ce77f0da8f8a1a477f438aafb23791a1bc51e29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): tools/llm_verifier/lineage_chain/verify_corpus.py:21-51 | tools/llm_verifier/third_party_replay/verify_corpus.py:21-51 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"tools/llm_verifier/lineage_chain/verify_corpus.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad338a8e16bb6872ac9ce2f89b340b5318b4f31d2fd1afea503859cbe6973e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): tools/gate_3798_page_end_spill.py:42-77 | tools/verify_pi_page_vs_hangul.py:69-112 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/gate_3798_page_end_spill.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c065ab03900f8987b7f6d04918d5c2c691eceeb419a667f3029ded8ae503a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): tools/fidelity_compare/fidelity_compare.py:2525-2579 | tools/fidelity_compare/fidelity_compare.py:2585-2638 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c08c14b914430385397473035f8b597005c5acfabeed7ccf32e1768299f7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): tools/llm_verifier/lineage_chain/generate_corpus.py:537-597 | tools/llm_verifier/third_party_replay/generate_corpus.py:417-476 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/lineage_chain/generate_corpus.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50939bc45f4c36743f8b284bc0a445763eaea37bd58580024f46dfc25e56864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): tools/llm_verifier/claim_bind/src/loader.rs:83-117 | tools/llm_verifier/criteria_decomp/src/loader.rs:84-130 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b75558a31af2906fc076c2a0b5262155d17ebb62f19a62f96a3524b0401e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): tools/skill_router/audit_skill_commands.py:201-236 | tools/skill_router/gate_new_skill.py:409-444 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4ea8872dae0d5151ee95a1abc4d73c1e885ec4863a96ef6935fe6839631e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): samples/issue1937/gen_cell_notes_multipage.py:68-91 | samples/issue8081/gen_fn_table.py:64-87 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue1937/gen_cell_notes_multipage.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9a17494f6f13a1732aceb06067beb3be86e6e2621b7287129b0e3cd42a386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): tools/llm_verifier/lineage_chain/cli.py:22-55 | tools/llm_verifier/third_party_replay/cli.py:22-51 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/lineage_chain/cli.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb9787096210532cab29f2b2cee44738c65e3ef85e634c5e4104c2cb098d27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): samples/issue7687/gen_empty_host.py:80-97 | samples/issue7687/gen_titled_host_after_band.py:42-59 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue7687/gen_empty_host.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6739a79d2b381abecbca58d2a163bf4358bcf3a895108d698592cd3b11f9d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): scripts/font_kerning_cohort.py:135-164 | scripts/font_rank8_qualification.py:211-240 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b545cd74f6e1efe0b93f786a4b1db6b0f729baded6eb232c514c39f96c28ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): scripts/font_rank1_qualification.py:65-110 | scripts/font_rank7_qualification.py:78-128 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_qualification.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5893962dbd05a7af2eccad80c0b64bed9c90cbbfb5219933b81af6c4debd6974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): bindings/Native/examples/native_worker_file_store.py:259-282 | bindings/Native/examples/native_worker_file_store.py:343-373 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/examples/native_worker_file_store.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ad3e2cead1749f06c46f1df4912f53cbe8a51619ff9a3cc56230c4f34b1aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (118 corresponding lines): scripts/font_rank1_qualification.py:250-367 | scripts/font_rank7_qualification.py:354-484 \u2014 These two members are one piece of code written twice and then edited apart: 118 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"664156c621653ceaa220b20c19cda78842878e2dedebf7b43697ce39b522c194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): samples/issue8149/gen_captioned_host.py:113-133 | samples/issue8149/gen_headerrow.py:89-103 | samples/issue8149/gen_rowfit.py:84-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8149/gen_captioned_host.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"845b1531ed3ae0840787c94f65af8a7bf72468d0af09d480ec42d725976ef15c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): tools/oracle_public/fatten_catalog.py:303-339 | tools/oracle_public/fatten_catalog.py:349-379 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"tools/oracle_public/fatten_catalog.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2be8587f30a4cc774c4497ab54fca4a4fb0b678be68bd8d73a121d33ef47cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): scripts/visual_sweep_handbook.py:57-88 | scripts/visual_sweep_native_webfonts.py:94-118 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep_handbook.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"005a538a9d8a4e4e9d029f18b69dc96eb7988a5ef2256a625830783d7b15bc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): scripts/font_rank8_metric_hypothesis.py:246-280 | scripts/font_rank8_private_qualification.py:196-227 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_metric_hypothesis.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c762e9d79544b70482a02864a874a4ced8abf1de3867d5db8a0cd0012668c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:2244-2363 | tools/inspect_msec/gen_msec_fixtures.py:2415-2522 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45569f94b678dd24a4bea197e5003f17ecc52f387f869f9af6c30a8ed49a635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): tools/oracle_public/page_smoke.py:169-199 | tools/oracle_public/sweep_runner.py:585-609 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/page_smoke.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6528ffe3a2013d3e121286d410114d76fc5c5b5ffa1af6fa8b8430969fef61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): samples/issue1937/gen_row_trim.py:70-83 | samples/issue8464/gen_row_content_fit.py:80-93 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue1937/gen_row_trim.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1371fdab9d572ef4fb6239751628a2716cc4fcb10940fb5cf1763614f240c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): scripts/font_rank1_qualification.py:371-406 | scripts/font_rank7_qualification.py:488-523 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_qualification.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b303ce6500697207fadda041a5ac256308f6f9284303d34f37e49d1fc042dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): tools/oracle_public/page_smoke.py:309-347 | tools/oracle_public/sweep_runner.py:730-758 \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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a04a30693c9207572152a0cf13618d92731ac381634682a24a051cfbcbe39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): samples/continuation_reset/gen_continuation_reset.py:57-72 | samples/issue8468/gen_line_reserve.py:57-69 \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":"samples/continuation_reset/gen_continuation_reset.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e434f1c574fd8b451d254b4663ab97743c5fbab1b2e7f061308388de89039da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/oracle_public/coverage_report.py:616-642 | tools/oracle_public/oracle_resolver.py:427-447 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/coverage_report.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac7727426672b838ee96d2c62f6c7d48eca430a9c755320e298a5e1af4d9bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): tools/oracle_public/page_smoke.py:439-462 | tools/page_roundtrip/harness.py:370-392 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/page_smoke.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"90630961a28cd14f67601cfb4259ea4f910adbcbf653ec625ea776738f62a405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tools/skill_router/install_git_hook.py:52-71 | tools/skill_router/precommit_skill_gate.py:76-100 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/install_git_hook.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"459bc4110cb36b2b48d694fa904b3a652733f2ae7e6aa9719527bfb452a2bea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): tools/adoption_spine.py:141-166 | tools/frame_guard.py:82-105 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/adoption_spine.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"23be16b4999bb356efbdf8dd9138ae9ce4778a09e57cbe104d15cc5e296726c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): samples/issue8149/gen_captioned_host.py:44-62 | samples/issue8149/gen_headerrow.py:38-61 | samples/issue8149/gen_rowfit.py:33-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8149/gen_captioned_host.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edb110a4702f0bcfd58d1cc17442457118dde5072d6a6e6ac900ea614730e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tools/skill_router/audit_skill_commands.py:175-193 | tools/skill_router/gate_new_skill.py:383-401 \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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3ba02bf75d7f6a92ab9d4d0afdc568ffb687d701ffc86994e4a7c42f5af5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/task2279/hancom_metric_visual_check.py:35-43 | tools/task2279/visual_evidence.py:44-53 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2279/hancom_metric_visual_check.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ee90773d83cc77dafd57c0e98a0bac7fa95acb8345b867650a8904a62e6ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tools/render_backend/gen_m06f.py:102-123 | tools/render_backend/harness.py:52-70 \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":"tools/render_backend/gen_m06f.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6933bdcb48d8cbc5d3933b03f40f8cd7d9f08b6927c3e707f6e852a5b996873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): samples/issue8470/gen_vertical_cell_table.py:92-101 | samples/issue8471/gen_pushed_none_table.py:87-98 \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":"samples/issue8470/gen_vertical_cell_table.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b082489f1b3c5092285a0c85ba7a04d71e164d54717d5182537b1da9fb3985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:1377-1421 | tools/inspect_msec/gen_msec_fixtures.py:1492-1536 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3990af47332b975bb6b444f045060345dbc848acd210538fae161fdee490725a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): tools/llm_verifier/claim_bind/src/loader.rs:67-81 | tools/llm_verifier/criteria_decomp/src/loader.rs:68-82 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee83162ed8ccf4c1ffb171451131ab7d6e96de20d3ffeb94831e84a6071b4263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/llm_verifier/process_steps/generate_corpus.py:844-865 | tools/llm_verifier/verdict_protocol/generate_corpus.py:858-878 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e5b8361ff6554fadf08ecc0da90a618105b2992533bd7767e962d5fcbe397f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): tools/llm_verifier/process_steps/generate_corpus.py:779-804 | tools/llm_verifier/verdict_protocol/generate_corpus.py:807-831 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca094d32000a00f7df5dd615f491fedf6784ef7355ea523a9052b9a88331df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): scripts/font_rank1_qualification.py:42-61 | scripts/font_rank7_qualification.py:55-74 | scripts/font_rank8_qualification.py:130-148 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_qualification.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"24423736deaaed1f0be5b4709b0364b9426ab37d9591814725e5aec77a13ac8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 44\u002B corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:1256-1299 | tools/inspect_msec/gen_msec_fixtures.py:1317-1374 | tools/inspect_msec/gen_msec_fixtures.py:1539-1592 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 44 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"096755f59018ab9e9c366a7ea1f4ad586051be08ffd25a280fb62faac3cc9f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): tools/llm_verifier/process_steps/src/score.rs:9-34 | tools/llm_verifier/verdict_protocol/src/classify.rs:60-88 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/src/score.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad96138deb4547af11c3b42b56e04ff274a36e9e3c5dc2465d50b371726acf92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): scripts/font_kerning_cohort.py:558-569 | scripts/font_rank1_qualification.py:410-422 | scripts/font_rank7_qualification.py:527-539 | scripts/font_rank8_qualification.py:607-616 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2e99144a2056b6613400a3d0e83eb84fd73b9e9be683ee370684a71ed69298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): tools/skill_router/audit_skill_commands.py:466-492 | tools/skill_router/check_catalog_sync.py:314-345 | tools/skill_router/gate_new_skill.py:844-870 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b7bef89ed8e634a02bde6ca9affb7629245f56167677216b5062dbbc88a109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): tools/llm_verifier/criteria_decomp/src/decomp.rs:202-220 | tools/llm_verifier/criteria_decomp/src/envelope.rs:45-62 | tools/llm_verifier/repeat_eval/src/envelope.rs:61-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/criteria_decomp/src/decomp.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77b21e6ac98e4b253d2c918f1168194a9bb0ad7f69e620dc7827fbea383003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): samples/issue8149/gen_headerrow.py:78-85 | samples/issue8149/gen_reservefit.py:24-31 | samples/issue8149/gen_rowfit.py:73-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8149/gen_headerrow.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8e0822e0060799f2493c952f4c9601868a177f03dda132d642e61523424f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): scripts/font_kerning_cohort.py:521-554 | scripts/font_rank8_qualification.py:579-603 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddef8efc52cfddd93890f6620b7550ada83693b6c69a8d0609956036f66fe5d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): scripts/font_rank1_qualification.py:186-216 | scripts/font_rank7_qualification.py:255-286 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139aacdb0cf7901b3e1f736a306a798acfe4b9a17e158042510ebce691f43dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): samples/issue1937/gen_cell_notes_multipage.py:95-103 | samples/issue8081/gen_fn_table.py:91-97 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue1937/gen_cell_notes_multipage.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a1af8ab2135668a8e16aa75c1c990683b096169d14eeee091058bc3e10c147"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/dar/transaction.py:310-317 | tools/dar/transaction.py:455-463 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/dar/transaction.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a6eb140a17dcbcbab7135df1f6e1a6faf047af2f5a56fae1c070ce66802d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tools/oracle_public/oracle_resolver.py:259-285 | tools/oracle_public/sweep_runner.py:434-447 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/oracle_resolver.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac7daf80b3b7295ee94c7af5e56b23866ca9e19ce6add86caacdfcc0a254e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/font_kerning_cohort.py:81-93 | scripts/font_rank8_qualification.py:67-79 \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":"scripts/font_kerning_cohort.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37314f1215eedd2d10c0152b5d63b480a5f226183a9b5f9d833ba7ea6409f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tools/llm_verifier/process_steps/src/loader.rs:100-118 | tools/llm_verifier/verdict_protocol/src/loader.rs:106-124 \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":"tools/llm_verifier/process_steps/src/loader.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fb3bd30d07618ab884dbba094763cbf4d2a9ab1bb1ba4fa3e5a13da0be3c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/hangul_row_heights2.py:130-140 | tools/probe_width_ladder.py:78-85 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hangul_row_heights2.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"384c06724491309974e0ef7f60263d9747ebe0b5b4c618e1d402be01dbd8fa20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/layout_anomaly/gen_m02f_fixtures.py:106-110 | tools/layout_anomaly/gen_m02f_fixtures.py:114-118 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"tools/layout_anomaly/gen_m02f_fixtures.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d66e0eec5c44183ec27b90cc454cbc993e51848736a0990829f02361089441"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): tools/fidelity_compare/fidelity_compare.py:928-957 | tools/fidelity_compare/fidelity_compare.py:961-989 | tools/fidelity_compare/fidelity_compare.py:993-1010 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3d6bec35b801be4378518f649a3a6e0b3d8c99668da44e44d7a18bd636388f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tools/llm_verifier/oracle_vs_self/generate_corpus.py:236-256 | tools/llm_verifier/shadow_agree/generate_corpus.py:210-226 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/oracle_vs_self/generate_corpus.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbce373e9a20e1bdcb6866cce271e6be081f777394dec3315d480cee9764cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/oracle_stage4_contract.py:46-53 | scripts/oracle_stage4_reproduction_compare.py:45-52 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_contract.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5fc75b6fb1e549b16e0219b91d5e04d14bbc695b9f2f0a9206462ce8577ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): tools/scale_ladder.py:214-244 | tools/scale_ladder_real.py:210-241 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"tools/scale_ladder.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9c17888a01c3e7a86b687e42307f8eb267d56be683542a5247c05b58067a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/task2279/hancom_metric_visual_check.py:19-26 | tools/task2279/visual_evidence.py:28-35 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2279/hancom_metric_visual_check.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f91b48d79b46a69be35c647793799b67d9babec47c6a2cda449955923bc9fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tools/llm_verifier/process_steps/generate_corpus.py:808-832 | tools/llm_verifier/verdict_protocol/generate_corpus.py:835-854 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2148cae82c83b261bdad936f124c80dea12b91daeb2b96f233962dce748bd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/oracle_public/page_smoke.py:297-305 | tools/oracle_public/sweep_runner.py:719-726 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/page_smoke.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"10501dddad3d4db95a6fccc35d67c7511880964e7bcb6b8418e4eaa6b19cb5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:853-898 | tools/inspect_msec/gen_msec_fixtures.py:1103-1149 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9955a205b666e49fd4ab1bfab9950998c14f62f11da22396bf8322de6e59aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/font_kerning_cohort.py:123-129 | scripts/font_rank8_qualification.py:120-126 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5fcff83bab4cca01e2a157e903515d613933e71dfbcd5a471506d2be45daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:1071-1100 | tools/inspect_msec/gen_msec_fixtures.py:1752-1783 | tools/inspect_msec/gen_msec_fixtures.py:1825-1860 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"020b40a62590d6a8dbe389d18401f0de64124dbb852d5c58d39c61f3b614e003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tools/llm_verifier/lineage_chain/corpus_io.py:58-67 | tools/llm_verifier/third_party_replay/corpus_io.py:58-67 \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":"tools/llm_verifier/lineage_chain/corpus_io.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d495ed3d4417e28e32d25c04e0772b43b844e0cb9feb1f27e84ca3b936efb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): samples/anchor_char_line_height/make_anchor_char_height.py:31-37 | samples/float_push_spacing_before/make_float_push_spacing_before.py:47-58 | samples/float_push_spacing_before/make_float_push_spacing_before_boundaries.py:67-79 | samples/float_push_spacing_before/make_float_push_spacing_before_column_top.py:53-64 | samples/issue7679/gen_tac_after_text.py:54-65 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/anchor_char_line_height/make_anchor_char_height.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55596974b062af9820b98fd496f0dbf27859d8b6e8499626f1594b7c2995c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/font_oracle_inventory.py:41-49 | scripts/font_rank8_metric_hypothesis.py:82-90 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_oracle_inventory.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4498c4ee4230f5164f8b0925cc04f837bfcc07dc5f2a73a1a1e6b8d207aa4f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/table_exchange/cases.py:300-306 | tools/table_exchange/cases.py:310-316 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/table_exchange/cases.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1a6a4e58a05183dea3d65bb2c870a91e3aef51d28ab3613d8268f65b2b179e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/verify_hangul_pages.py:54-62 | tools/verify_pi_page_roundtrip.py:160-168 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_hangul_pages.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f612a7de2728dc1f1b6676b432f6eae59fd5be0c4a425887dba0d0e9baccf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): bindings/Native/examples/qt_native_host.py:1408-1415 | bindings/Native/examples/qt_native_host.py:1430-1435 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/examples/qt_native_host.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f468a1a34b15950bae79ac29f136496f069ca77ab2d0b420761bf52ed3c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/oracle_page_count/regenerate.py:253-263 | tools/oracle_page_count/sweep.py:107-115 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_page_count/regenerate.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca602d2d6c8fb2f756f56fd480f540bbc4a25513c878ad51ada5a7438844a05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/secd_tail_survey.py:151-165 | tools/issue5162_field_wraps_table.py:82-92 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/secd_tail_survey.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e604300723773a59703c1599c082826236a105b3c54c6088456434f5fbb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/task2070/make_hy_ladder4.py:136-148 | tools/task2097/make_cellcompress_ladder.py:48-60 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2070/make_hy_ladder4.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81d3adcfe471221045452f4622c6b504f61eeb7ad30b4f0685122d6ae58ac62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/extract_char_shape_ir.py:107-117 | scripts/extract_char_shape_ir.py:120-130 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/extract_char_shape_ir.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e951f83e8467577af9ff7e497e8488a77e64e73a97dc1e26df58562d7c4620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tools/scale_ladder.py:198-210 | tools/scale_ladder_real.py:545-555 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/scale_ladder.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e22ea9552527557c4989833dc8dcf5066a0e1d8fe413ba80b938416748b4f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/skill_router/audit_skill_commands.py:149-157 | tools/skill_router/gate_new_skill.py:321-329 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48f3eaf1bf1a1d49f09c8d401d178db92e73f492c4be63a5028dad9627f7576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/llm_verifier/repeat_eval/src/exit_class.rs:74-86 | tools/llm_verifier/verdict_protocol/src/exit_class.rs:91-103 \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":"tools/llm_verifier/repeat_eval/src/exit_class.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd93c997452e32c9bfb6af1dd4e61d694dd5e9c830de69f48f54ec4b97b453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/fidelity_compare/oracle_pair_index.py:51-55 | tools/oracle_page_count/regenerate.py:178-181 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/oracle_pair_index.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca89006fbf80f679812ed52fae8583e7cadcc3074409e8c53c89441283131a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): bindings/Native/examples/native_host.py:66-72 | bindings/Native/examples/native_host.py:75-85 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/examples/native_host.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c66bc9b3140db608c72bb38a5197d993d5e68e14afc0ded4818bb338530ebf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/task2373/ladder_diff.py:19-25 | tools/task2373/ladder_diff.py:29-35 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2373/ladder_diff.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"18651ac8a8660a5152741af14c02723abb249de0d67c93857342906501012df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): tools/llm_verifier/process_steps/generate_corpus.py:296-343 | tools/llm_verifier/verdict_protocol/generate_corpus.py:219-265 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"905c67e8c9e88660203ab31e99060c36d1e0562d0604f7878dd8f59d79542784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tools/task2287/delta_staircase.py:65-79 | tools/verify_pi_page_vs_hangul.py:116-127 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2287/delta_staircase.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ac0b85a529f9dde26ad32cc4733879ee6f99f9708a4298cd7934f26725cb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/llm_verifier/criteria_decomp/src/envelope.rs:31-43 | tools/llm_verifier/repeat_eval/src/envelope.rs:93-108 \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":"tools/llm_verifier/criteria_decomp/src/envelope.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e25904efc1bc88424869775220fc52cf48c3ef82e762d63a5be4e870aa64ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/render_backend/gen_m06f.py:92-98 | tools/render_backend/harness.py:42-48 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_backend/gen_m06f.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"026beb2073128204dc40ea7df5548b7762a185ed1dcd4505832d18980413ed1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/llm_verifier/claim_bind/src/coords.rs:170-178 | tools/llm_verifier/verdict_protocol/src/extract.rs:15-23 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/claim_bind/src/coords.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b624ce4867b9992146a3f1b1ad3cfec4875e7170d9eafe791e765aac29b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/hwpctrl_compat/detect_nondeterminism.py:49-57 | tools/hwpctrl_compat/pagecount_sweep.py:40-48 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwpctrl_compat/detect_nondeterminism.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ce01548217610114dc265005558712137d4469defecf81c998fa2ec4e23dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): scripts/font_kerning_boundary.py:319-326 | scripts/generate_kerning_pair_fixture.py:275-286 | scripts/generate_kerning_runtime_fixture.py:121-134 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_boundary.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"27da406c63e0310f28623e70b650834d28f686deaae666607d47a0f087f9beca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): scripts/font_rank1_metric_hypothesis.py:286-297 | scripts/font_rank8_metric_hypothesis.py:308-319 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a39882c07298cc911c0036195ec09001750cfb55255c275eb41c4027c564c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tools/scale_ladder.py:172-179 | tools/scale_ladder.py:183-189 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/scale_ladder.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"87da99c366fb06fa1a613a204f9913f81f1ada23aaee692c9db5ecd67e6fa8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/skill_router/audit_skill_commands.py:138-145 | tools/skill_router/gate_new_skill.py:310-317 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aec9fc2b1e440f45b2a6025bb8495ffd98dbe46d1fe737734b8b1840e3f47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/llm_verifier/process_steps/src/score.rs:41-49 | tools/llm_verifier/verdict_protocol/src/classify.rs:95-103 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/src/score.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56a2b6df08466cf922f8ec08de212a6cb975bfd092031e8382239d1fcfa3739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:595-606 | tools/render_backend/gen_m06f.py:659-668 \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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a9b569d34e77b0df2dfffefe6e0d5b18a14ae48722fc2d2a48723ba76435fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): tools/llm_verifier/claim_bind/src/loader.rs:61-65 | tools/llm_verifier/criteria_decomp/src/loader.rs:62-66 | tools/llm_verifier/process_steps/src/loader.rs:87-90 | tools/llm_verifier/repeat_eval/src/loader.rs:71-75 | tools/llm_verifier/tool_version_gate/src/loader.rs:77-81 | tools/llm_verifier/verdict_protocol/src/loader.rs:88-91 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb685f2c24e4c3dd86b02181fdc6b05fa124fc3af11e82933fafcd82454588ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tools/fork_harvest/harvest.py:225-246 | tools/fork_harvest/harvest.py:250-260 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fork_harvest/harvest.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f463d4b604434642ffb38f33e090ef1ef6fbba4031c669620356ee48467cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/hwp5_inventory/catalog.py:87-90 | tools/hwp5_inventory/model.py:74-77 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwp5_inventory/catalog.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2874e463baa9bad6ae250cfbe459d1a80e0bc0f2d4889515c7f736e229ff9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): tools/layout_anomaly/gen_m02f_fixtures.py:432-436 | tools/llm_verifier/abstain/generate_corpus.py:419-422 | tools/llm_verifier/oracle_vs_self/generate_corpus.py:229-232 | tools/llm_verifier/shadow_agree/generate_corpus.py:203-206 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:315-318 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/layout_anomaly/gen_m02f_fixtures.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dbd8ee976d15c32a3777c77886b0708854a87d867732c3449923cc59e59f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/llm_verifier/untrusted_sandbox/corpus_io.py:42-49 | tools/llm_verifier/abstain/corpus_io.py:40-48 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/untrusted_sandbox/corpus_io.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"da553d669b579eadaeb8280734fbb70b5816a4025fdf2d0389d2b05a2ff1315a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tools/loadsave_sweep/classify_mismatch.py:23-25 | tools/loadsave_sweep/judge.py:44-47 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"tools/loadsave_sweep/classify_mismatch.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a162d3888f3a5994f9e418f8d2b8f1b4d69789c4bfe4fd435fb85b5a90c25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): samples/issue1937/gen_cell_notes_multipage.py:59-64 | samples/issue8081/gen_fn_table.py:55-60 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue1937/gen_cell_notes_multipage.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f856478c8b6aa5d32683913df2e2f65f2454888722f0342c9033b644ca54cd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/forms/build_\uAC04\uC774\uAE30\uC548\uBB38_\uC11C\uC2DD.py:25-28 | tools/forms/build_\uC77C\uBC18\uAE30\uC548\uBB38_\uC11C\uC2DD.py:27-31 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/forms/build_\uAC04\uC774\uAE30\uC548\uBB38_\uC11C\uC2DD.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c2b3365f0ecfb6c7ec4cb0fbef7e7484ec7e6b1bff35ea63c3470b65feca23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/inspect_msec/gen_msec_fixtures.py:584-587 | tools/proptest_roundtrip/gen_m04f_catalogs.py:319-322 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ee4ee25f4118dab95c8cb90088427a6ef03dc30c635db3635492711480cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tools/llm_verifier/process_steps/generate_corpus.py:765-775 | tools/llm_verifier/verdict_protocol/generate_corpus.py:794-803 \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":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e458e474a938d4048ff604107f502cc659d27d3e38059a6c9651cc0038337"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): samples/issue1937/gen_row_trim.py:61-66 | samples/issue8464/gen_row_content_fit.py:71-76 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue1937/gen_row_trim.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"851fd0a6f2293d922697e0f7e0ae8a0ddefe0f8761883996cd5f362bcb00a59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/oracle_stage4_profile.py:649-655 | scripts/oracle_stage5_rank8_profile.py:485-490 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_profile.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5b7ff0c2acda7496234ea02b8f245c2ed6fd5dc0fd5a1d9c8741ff645284e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/font_oracle_inventory.py:238-248 | scripts/pdf_oracle_observe.py:313-319 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_oracle_inventory.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b22564ec3c4ba80670a62b5f5b5ba1389606841e18d89f418bce63de0eba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): tools/hwp5_inventory/fatten_catalog.py:81-82 | tools/oracle_public/fatten_catalog.py:126-128 | tools/table_exchange/fatten_catalog.py:81-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwp5_inventory/fatten_catalog.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06955788bbb75213e3dfe94895eb599a6246d837454c4d39ea16e081bf02ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): tools/task2279/hancom_metric_visual_check.py:30-31 | tools/task2279/visual_evidence.py:39-40 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"tools/task2279/hancom_metric_visual_check.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"484b922993dc557a9afc8e14dd8c89e993c137fafa99c74e0366026d1d3bccab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tools/oracle_public/sweep_runner.py:524-529 | tools/skill_router/route.py:115-120 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/sweep_runner.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4948aaefa493841e8b32141c7f9ed8180e334802e296fe1e314d9ae56402ffb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): scripts/oracle_stage4_profile.py:659-662 | scripts/oracle_stage5_queue_projection.py:574-578 | scripts/oracle_stage5_rank16_disposition.py:287-290 | scripts/oracle_stage5_rank8_profile.py:494-497 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_profile.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be8829b2c4540272b1d8f024ff8b285b5fbd1a5e740b533c314ba0708ab9640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/oracle_stage4_profile.py:666-669 | scripts/oracle_stage5_rank8_profile.py:501-507 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_profile.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c448223a40c3af9ac4aa2ff982ab6ca790650776857679b46ebc2f319f00324b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/workflow_promotion_evidence.py:445-448 | scripts/workflow_promotion_preflight.py:981-984 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/workflow_promotion_evidence.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f08b1eb31850b5ff00e51ab2b9d4a602cef1328608973786fe0f80ee888296"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/llm_verifier/process_steps/src/loader.rs:82-85 | tools/llm_verifier/verdict_protocol/src/loader.rs:83-86 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/src/loader.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8032eecd7174f89c70e6fe889bc91e8f7d1538b59611c2a4629c1787405cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/oracle_stage5_rank16_disposition.py:57-64 | scripts/oracle_stage5_rank8_profile.py:113-116 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage5_rank16_disposition.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f9140b09c520765a4506a53548386186a2dc2305858ac2d189651547d996b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): tools/task2668/discriminator.py:37-39 | tools/task2668/fn_geom_drive.py:32-34 | tools/task2668/margins.py:40-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2668/discriminator.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"336876f3ca24ea6ee752948ffbbeba3b50e25a551a1316234d3fec52c88000b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tools/verify_hangul_pages.py:44-50 | tools/verify_pi_page_roundtrip.py:111-116 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_hangul_pages.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3ece2177a03d231ea30a3a6c4286a7200aca7036ad7435e3d95cc5c0c3b9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tools/llm_verifier/process_steps/src/loader.rs:66-71 | tools/llm_verifier/verdict_protocol/src/loader.rs:62-67 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/src/loader.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f320c161313b8f711dae20c9757bed4847cf469e04c4da71879972e9b24c5da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/llm_verifier/repeat_eval/src/loader.rs:19-23 | tools/llm_verifier/tool_version_gate/src/loader.rs:32-38 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"tools/llm_verifier/repeat_eval/src/loader.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a685c1e8f62868cf4fd98318f2604bb23054d9a9319068926248b47fbafa9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): samples/issue8493/gen_table_tail.py:22-25 | samples/issue8518/gen_table_host_top.py:28-31 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8493/gen_table_tail.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"badba720cc8647f9a899eb93ef59f8f6556999e304607460c69da01d1ca80164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tools/llm_verifier/best_of_n/generate_corpus.py:586-588 | tools/llm_verifier/repeat_eval/generate_corpus.py:899-901 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"tools/llm_verifier/best_of_n/generate_corpus.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99e484482410db6b27896914a8d5ac49035e402595335356bd9e6c39f4bdfe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): samples/float_push_spacing_before/make_float_push_spacing_before_boundaries.py:58-63 | samples/issue7679/gen_tac_after_text.py:45-50 | samples/issue8507/gen_tac_adjacent.py:16-20 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/float_push_spacing_before/make_float_push_spacing_before_boundaries.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcf18b33f5787e40affc0434d74d1020e0c23661720d6364a4987a907a79f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): tools/oracle_public/page_smoke.py:137-140 | tools/oracle_public/sweep_runner.py:266-269 | tools/page_roundtrip/harness.py:193-196 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/page_smoke.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a2160a6a96f6a1a440cef9fe5e2ec2ad5d4129ce4767d7443e5fd3c8ea0bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): tools/task2070/make_hy_ladder3.py:77-80 | tools/task2070/make_hy_ladder4.py:103-106 | tools/task2169/make_linebreak_ladder.py:100-103 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2070/make_hy_ladder3.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd26a945ace21a51a968b2dc7a856ddd39b81350a6a9b3f4575e5de6d02b4416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/font_kerning_cohort.py:105-108 | scripts/font_rank8_qualification.py:113-116 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb6050c656e8f1082b7910897b096860e408ec182a7c218a002c1ab1286dcff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/font_rank1_metric_hypothesis.py:68-71 | scripts/font_rank8_metric_hypothesis.py:323-326 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3db7cd3b601328379524cafd2c0ac15c52c99a4a1cbfce94770443bb4165df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): tools/provenance_map/fatten_provenance_map.py:638-638 | tools/work_receipt/fatten_work_receipt.py:817-817 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"tools/provenance_map/fatten_provenance_map.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aae55d406f4286be33616c0c1276b42d9a2bece2ac2d0acbc1a13221eb651b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tools/forms/build_\uAC04\uC774\uAE30\uC548\uBB38_\uC11C\uC2DD.py:58-60 | tools/forms/build_\uC77C\uBC18\uAE30\uC548\uBB38_\uC11C\uC2DD.py:71-73 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"tools/forms/build_\uAC04\uC774\uAE30\uC548\uBB38_\uC11C\uC2DD.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39c2e51c3cd0bfe544b079a719fbd665855b374a20f66f5e6d4991e7c1cb802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/oracle_stage4_reproduction_compare.py:56-59 | scripts/oracle_stage5_rank8_profile.py:120-123 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_reproduction_compare.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"245f686090794c2ba6ab25762c506a7a5636b65d8779b076001076fcc3d6b740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): scripts/font_kerning_cohort.py:45-48 | scripts/font_rank8_qualification.py:42-45 | scripts/oracle_stage2_common.py:38-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_kerning_cohort.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e140fa340f261364cd9584b066fe67490ce4ab2918ad0e98f49e37e540b6fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tools/fidelity_compare/fatten_text_layer.py:144-146 | tools/form_fill/fatten_form_fill.py:150-152 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"tools/fidelity_compare/fatten_text_layer.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5903e74b02c29790f3cfec0e0a6f0771c1b0666aa740d2f2bceaffe29a844867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 2\u002B corresponding lines): samples/issue7679/gen_tac_after_text.py:36-37 | samples/issue7687/gen_empty_host.py:49-50 | samples/issue7695/gen_footnote_page_tail.py:40-41 | samples/issue8474/gen_section_top_spacing.py:29-30 | samples/issue8474/gen_top_tac_cases.py:29-30 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue7679/gen_tac_after_text.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a1c52b951b0b8110af9e4e176d47ea03b2c319e756a3e9745ad98b13897d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): scripts/font_kerning_cohort.py:70-72 | scripts/font_rank8_qualification.py:91-93 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e15e26f7aa50f9fa31d1ac0ac6acf2ff5c8f23fa672539f660c786a19a3e49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): tools/llm_verifier/best_of_n/generate_corpus.py:290-291 | tools/llm_verifier/repeat_eval/generate_corpus.py:232-233 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"tools/llm_verifier/best_of_n/generate_corpus.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e16affb67abcd2db621264b8586cbb9a0f9d6000e2e058950016eadb767494"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): scripts/generate_font_native_hwpx_fixture.py:19-21 | scripts/generate_outline_navigation_fixture.py:132-134 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"scripts/generate_font_native_hwpx_fixture.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34519918ad77701a9e7adb8fd81f04e58540d197bd68ffffce94638eec6dda8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 2\u002B corresponding lines): samples/issue7092/gen_subst_font.py:58-59 | samples/issue8149/gen_headerrow.py:65-66 | samples/issue8149/gen_rowfit.py:60-61 | samples/issue8470/gen_vertical_cell_table.py:69-70 | samples/issue8471/gen_pushed_none_table.py:67-68 | samples/issue8478/gen_span_page_bottom.py:37-38 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue7092/gen_subst_font.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93b45ead13e81770de9dcac802353cf012769b8f893f05a19e913452b3337b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/row.rs:93-121 | tools/llm_verifier/tool_version_gate/src/row.rs:109-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/src/row.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9330ddd980aa1079daf30dd51677f3921a574a5af44fee27414236d9449f4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/llm_verifier/claim_bind/src/loader.rs:86-101 | tools/llm_verifier/criteria_decomp/src/loader.rs:89-104 \u2014 before extracting anything, compare \u0060tools/llm_verifier/claim_bind/src/loader.rs\u0060 and \u0060tools/llm_verifier/criteria_decomp/src/loader.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/claim_bind/src/loader.rs:86\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":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe53eb62c31cf4624432e15822177c7b8920df8adcf0b2a67e0ca36f09e89bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/llm_verifier/process_steps/src/envelope.rs:47-59 | tools/llm_verifier/verdict_protocol/src/judgment.rs:151-163 \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":"tools/llm_verifier/process_steps/src/envelope.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d9abe6bca8a2aa731ab5750cecc74c66e65afac45732603b7b7c078604286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/llm_verifier/claim_bind/src/loader.rs:106-117 | tools/llm_verifier/criteria_decomp/src/loader.rs:119-130 \u2014 before extracting anything, compare \u0060tools/llm_verifier/claim_bind/src/loader.rs\u0060 and \u0060tools/llm_verifier/criteria_decomp/src/loader.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/claim_bind/src/loader.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdd23d4c28d86823af96dd9fdce601ffe70971aa8f4fcbc10946c5dbda67754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/exit_class.rs:76-86 | tools/llm_verifier/verdict_protocol/src/exit_class.rs:93-103 \u2014 before extracting anything, compare \u0060tools/llm_verifier/repeat_eval/src/exit_class.rs\u0060 and \u0060tools/llm_verifier/verdict_protocol/src/exit_class.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/repeat_eval/src/exit_class.rs:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/src/exit_class.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"469580719e2d604ac9c7cb007cc6ef81753b467df7d4c46ee07aefb522baeb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/llm_verifier/criteria_decomp/src/envelope.rs:32-41 | tools/llm_verifier/repeat_eval/src/envelope.rs:97-106 \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":"tools/llm_verifier/criteria_decomp/src/envelope.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f594cb8c50a1f9a7657ff91a6f7acd9ca519957e839a1aeacc2d1cfe2003764f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/pdf-ir-poc/src/structured_lowering.rs:593-602 | tools/pdf-ir-poc/src/structured_lowering.rs:648-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/pdf-ir-poc/src/structured_lowering.rs:591\u0060 calls \u0060try_from\u0060, \u0060map_err\u0060 and \u0060tools/pdf-ir-poc/src/structured_lowering.rs:647\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":"tools/pdf-ir-poc/src/structured_lowering.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e006a62bfdee37c4de3bdfe6fc9d1d9be6202c5e7bfa12c58a097af71cf214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/loader.rs:106-119 | tools/llm_verifier/tool_version_gate/src/loader.rs:164-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/repeat_eval/src/loader.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/src/loader.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"595866d1b4f4ebb7239eefc960a2359137f8103952739c885731e20ad5a859c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/row.rs:57-65 | tools/llm_verifier/tool_version_gate/src/row.rs:62-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"tools/llm_verifier/repeat_eval/src/row.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"89690fd9159970ff4fdc3ce794a2cb75d4959e85e4d8f37495b2a2ad780ca5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): tools/llm_verifier/process_steps/src/exit_class.rs:66-73 | tools/llm_verifier/repeat_eval/src/exit_class.rs:75-82 | tools/llm_verifier/verdict_protocol/src/exit_class.rs:92-99 \u2014 before extracting anything, compare \u0060tools/llm_verifier/process_steps/src/exit_class.rs\u0060 and \u0060tools/llm_verifier/repeat_eval/src/exit_class.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/process_steps/src/exit_class.rs:66\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":"tools/llm_verifier/process_steps/src/exit_class.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4246499bbc36ab69ff4116c41402e419331aa20844797a466fbb6b85257a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/llm_verifier/process_steps/src/loader.rs:121-134 | tools/llm_verifier/verdict_protocol/src/loader.rs:127-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/process_steps/src/loader.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2e2d8811feaafee7f1b4ad50cb8b39d849e0f6b41b8480fc070e2789100f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/command.rs:68-75 | tools/llm_verifier/verdict_protocol/src/command.rs:47-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/repeat_eval/src/command.rs: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":"tools/llm_verifier/repeat_eval/src/command.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07ff2e4373b5ec0ce7baaafb923b85eacf110facbcaf333b5e7a22ffd4e7b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/command.rs:88-95 | tools/llm_verifier/verdict_protocol/src/command.rs:61-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/repeat_eval/src/command.rs:88\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":"tools/llm_verifier/repeat_eval/src/command.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165dedc2758e271cdbd34df92201c1e68a3cbd080f9a6934eb734d014880ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/llm_verifier/claim_bind/src/loader.rs:68-75 | tools/llm_verifier/criteria_decomp/src/loader.rs:69-76 \u2014 before extracting anything, compare \u0060tools/llm_verifier/claim_bind/src/loader.rs\u0060 and \u0060tools/llm_verifier/criteria_decomp/src/loader.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/claim_bind/src/loader.rs: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. 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":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8f24817f65d54299b39e5d728d59ccb25f5f8bee8573374369acdc4822dba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): tools/llm_verifier/claim_bind/src/loader.rs:17-21 | tools/llm_verifier/criteria_decomp/src/loader.rs:17-21 | tools/llm_verifier/process_steps/src/loader.rs:17-21 | tools/llm_verifier/verdict_protocol/src/loader.rs:17-21 \u2014 before extracting anything, compare \u0060tools/llm_verifier/claim_bind/src/loader.rs\u0060 and \u0060tools/llm_verifier/criteria_decomp/src/loader.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"tools/llm_verifier/claim_bind/src/loader.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eba81bbe5e5196fe95ded9d78d789f6b666da66a2cdc520768b5d2ee3f2d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/process_steps/src/check.rs:75-81 | tools/llm_verifier/verdict_protocol/src/observation.rs:48-54 \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":"tools/llm_verifier/process_steps/src/check.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f00ec4646dc84c2693c8ce325bf56909f84eda32996a175df663a1c216312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/llm_verifier/process_steps/src/exit_class.rs:26-35 | tools/llm_verifier/repeat_eval/src/exit_class.rs:26-35 | tools/llm_verifier/verdict_protocol/src/exit_class.rs:31-40 \u2014 before extracting anything, compare \u0060tools/llm_verifier/process_steps/src/exit_class.rs\u0060 and \u0060tools/llm_verifier/repeat_eval/src/exit_class.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"tools/llm_verifier/process_steps/src/exit_class.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feb905ea41575d5cd45749c91fe35601ce0fd463b3765d02864b2ce44885eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tools/llm_verifier/process_steps/src/exit_class.rs:41-49 | tools/llm_verifier/repeat_eval/src/exit_class.rs:41-49 | tools/llm_verifier/verdict_protocol/src/exit_class.rs:46-54 \u2014 before extracting anything, compare \u0060tools/llm_verifier/process_steps/src/exit_class.rs\u0060 and \u0060tools/llm_verifier/repeat_eval/src/exit_class.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"tools/llm_verifier/process_steps/src/exit_class.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2027b3437c25a44c595d45146317a05e54969e324fa4feef83b5d3e31c0954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/llm_verifier/process_steps/src/loader.rs:73-80 | tools/llm_verifier/verdict_protocol/src/loader.rs:74-81 \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":"tools/llm_verifier/process_steps/src/loader.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0728fc33e1947cb130e9dfaf5f53d582784a2cac11bba678f7f487506115f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/diagnostics/hwpx_hwp_ir_diff.rs:29-39 | tools/diagnostics/hwpx_hwp_ir_diff.rs:46-55 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/diagnostics/hwpx_hwp_ir_diff.rs:29\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":"tools/diagnostics/hwpx_hwp_ir_diff.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"768c6bc96aaeeaf7ab2b1f974021ea3362e1ca05ee466d87d4dab08b90a865d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/render_backend/fixture.rs:452-458 | src/render_backend/fixture.rs:473-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/render_backend/fixture.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render_backend/fixture.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4574af18b55ddab398bfd83ecd7bd4bfe3201f826299a4e031ee1ba12066bf21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/loader.rs:98-103 | tools/llm_verifier/tool_version_gate/src/loader.rs:157-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/repeat_eval/src/loader.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/src/loader.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecb217e3e2e3525cd5e3572b0dbafe0a97a990d655d8f367c67ca22b09af9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/llm_verifier/repeat_eval/src/loader.rs:92-96 | tools/llm_verifier/tool_version_gate/src/loader.rs:151-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/src/loader.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a4edab858accfe1d663f8cc1dc06c3db546c3323f7913c016c1f39b8088121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58\u201374 lines \u00D7 2): scripts/renderer_baseline.py:1326-1399 | scripts/renderer_baseline.py:1670-1727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note 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":"scripts/renderer_baseline.py"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c1763c2767dc66e05994757eb29601decda9546e6de85fa20a3a350d91867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201362 lines \u00D7 3): scripts/renderer_baseline.py:1348-1380 | scripts/renderer_baseline.py:1447-1508 | scripts/renderer_baseline.py:1669-1727 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/renderer_baseline.py:1510\u0060 calls \u0060get\u0060 and \u0060scripts/renderer_baseline.py:1729\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/renderer_baseline.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"66535381bdd35e984f9c50e9676c277d6215ff01c6cd479c926111bb7c8943bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201353 lines \u00D7 2): tools/llm_verifier/lineage_chain/generate_corpus.py:545-597 | tools/llm_verifier/third_party_replay/generate_corpus.py:425-476 \u2014 \u0060tools/llm_verifier/lineage_chain/generate_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 81 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. 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":"tools/llm_verifier/lineage_chain/generate_corpus.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c3d222acb6e8db95b76c251b90b94a5b8f932fda577b1c1d98d5a460e12735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201346 lines \u00D7 2): scripts/oracle_stage4_profile.py:341-385 | scripts/oracle_stage5_rank8_profile.py:245-290 \u2014 before extracting anything, compare \u0060scripts/oracle_stage4_profile.py\u0060 and \u0060scripts/oracle_stage5_rank8_profile.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_profile.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b17be51508cb76e7240677d453298df926e59661ce6d31923df54412af43cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): scripts/renderer_baseline.py:493-538 | scripts/renderer_baseline.py:551-598 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/renderer_baseline.py:493\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":"scripts/renderer_baseline.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c1058b687edbca37c39f30b76fb2416906fcd04fdb0974a9de976471c4d757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:2534-2579 | tools/fidelity_compare/fidelity_compare.py:2593-2638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8b18fcddf9a6c99078b19788bb3a91b8c626ae7a32bbcc6089f1b318d81e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201343 lines \u00D7 2): scripts/font_rank1_qualification.py:261-303 | scripts/font_rank8_qualification.py:464-503 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 108 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 \u0060scripts/font_rank1_qualification.py:261\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":"scripts/font_rank1_qualification.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c42e72d01e836c70a7231c7f5e43a95b1aca3a6e4acd37053f1abbba2afe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 3): tools/oracle_public/coverage_report.py:198-237 | tools/oracle_public/oracle_resolver.py:190-229 | tools/oracle_public/sweep_runner.py:374-413 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c24ffa8e8ecf4a28657d160186f453d298146c51fb7ae5907d591f73253445a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): scripts/generate_kerning_pair_fixture.py:165-202 | scripts/generate_oracle_typesetting_fixture.py:299-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":"scripts/generate_kerning_pair_fixture.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9651ec60ba3095fa4497c371d872dbfe00a46807d52c70a090a4eb777a62e6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:86-119 | tools/skill_router/gate_new_skill.py:237-270 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b8543f5ebff8bae51395a722587f6fd15edc88d2d1d8f0bb8e5d78f1b6cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 3): tools/inspect_msec/gen_msec_fixtures.py:1383-1414 | tools/inspect_msec/gen_msec_fixtures.py:1451-1482 | tools/inspect_msec/gen_msec_fixtures.py:1498-1529 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/inspect_msec/gen_msec_fixtures.py:1383\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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6229bf19cc258e1a02bc43a23c99b60193c964473faeffe96836be92b6c9cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): tools/oracle_public/coverage_report.py:385-414 | tools/oracle_public/oracle_resolver.py:324-352 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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 \u0060tools/oracle_public/coverage_report.py:385\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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"584d03d315ec6ff1155b6cedb1ecd51dbb48bccbe8dcbb0857e0feaa7474151a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): tools/oracle_public/page_smoke.py:233-262 | tools/oracle_public/sweep_runner.py:656-685 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7f92af2f1ad8bf3f042a441e75fa0caad17bd35a210247d7b2ee11ea4d19d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): tools/table_exchange/cases.py:999-1026 | tools/table_exchange/cases.py:1053-1081 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/table_exchange/cases.py:999\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":"tools/table_exchange/cases.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe7274c7bc56e92707fcce460e81b0d9ba40378e0c85c3ea104ff7c8e5ab784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): scripts/oracle_stage4_contract.py:75-100 | scripts/oracle_stage4_contract.py:261-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/oracle_stage4_contract.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1415b476b23a3eb8e019995af4f78bfb37fcd783eb48b0737442373cd2e23139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:1272-1297 | tools/fidelity_compare/fidelity_compare.py:1387-1412 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/fidelity_compare/fidelity_compare.py:1272\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32496bef9863281110579a4599b1acd85d6f657abcabcc64caca3ada7ce01c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): tools/form_fill/fatten_form_fill.py:853-878 | tools/form_fill/fatten_form_fill.py:883-908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/form_fill/fatten_form_fill.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aec70899a046ad3365ae9940bc35fecfb0dd66930abca82f5e69e7fb483005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): tools/inspect_msec/gen_msec_fixtures.py:1037-1061 | tools/inspect_msec/gen_msec_fixtures.py:1342-1367 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/inspect_msec/gen_msec_fixtures.py:1037\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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0923d9f9218dab7b4f1fa810909cfcd8098e1410c4525e5a35c5413e2d4eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:267-292 | tools/skill_router/gate_new_skill.py:475-498 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9424b7cb02631a2653b79509af9b7dab58ba88264522b0decd96c35fc6e93901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): tools/layout_anomaly_batch_report.py:254-278 | tools/oracle_public/sweep_runner.py:557-581 \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. 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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae00ee1916f819b219ae9c73c0296d6dcc7d95ac9bf65fe8d271c5da78e10d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): scripts/font_rank7_qualification.py:169-192 | scripts/font_rank8_qualification.py:181-204 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/font_rank7_qualification.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ece35cfe36dcab3126639e6b923e100507b6e3bdb2e1e5a11828659cd5d1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:3026-3045 | tools/fidelity_compare/fidelity_compare.py:3081-3104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"999bc24a22bab177d149d0a12330cf31520e15e04444a873ebff7520267521fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201347 lines \u00D7 2): tools/llm_verifier/oracle_vs_self/generate_corpus.py:260-306 | tools/llm_verifier/shadow_agree/generate_corpus.py:230-275 \u2014 \u0060tools/llm_verifier/oracle_vs_self/generate_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 70 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. 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":"tools/llm_verifier/oracle_vs_self/generate_corpus.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c731b1909fd9b254207a8aba5debd2cea30454ce675124f087d2b01f48d8b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): scripts/generate_exact_face_collection_fixture.py:35-55 | scripts/generate_font_glyph_payload_fixture.py:96-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/generate_font_glyph_payload_fixture.py:96\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":"scripts/generate_exact_face_collection_fixture.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6e797f5ce5aad83493539c7992c078f8a0d565b7bfdebe8a9f4ff288822b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:930-952 | tools/fidelity_compare/fidelity_compare.py:962-983 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/fidelity_compare/fidelity_compare.py:930\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a1b62521f446cd9db66ebdfb03e8a7c23730818e437af483c5e5842b7b16df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): tools/oracle_public/coverage_report.py:570-591 | tools/oracle_public/oracle_resolver.py:386-407 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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 \u0060tools/oracle_public/coverage_report.py:570\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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"485535701bae100a3d47ceb1d2748990a70921a409b36a24e2ac362e901b6b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): tools/oracle_public/page_smoke.py:144-165 | tools/page_roundtrip/harness.py:200-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. 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2e7334199cefe48c88ac6b5081fb364b735f7174de95f7a459b55b1a3bedd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:211-232 | tools/skill_router/gate_new_skill.py:419-440 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6922c0ffb3ec7b99a165f2ee40d9427558bfb25c82ac48c6d224e76d97c8f490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): tools/oracle_public/coverage_report.py:164-184 | tools/oracle_public/oracle_resolver.py:156-176 | tools/oracle_public/sweep_runner.py:340-360 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"62329273d49fe0c3508dbecf687a2d6eec710319e91e604035f65a3e8243ccbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): scripts/visual_sweep.py:3430-3450 | scripts/visual_sweep.py:3628-3642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep.py"},"region":{"startLine":3430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97ad1ab11452f27cf1b3fd6293e20df82a304f009782fbd2617fc73cc7d1f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): tools/inspect_msec/gen_msec_fixtures.py:1402-1421 | tools/inspect_msec/gen_msec_fixtures.py:1517-1536 | tools/inspect_msec/gen_msec_fixtures.py:2222-2241 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/inspect_msec/gen_msec_fixtures.py:1402\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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b4272a3b4cbf73180122448be6bda7004e9fc8aac297d531e68938312062e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): samples/issue8474/gen_section_top_spacing.py:87-114 | samples/issue8474/gen_top_tac_cases.py:86-113 \u2014 before extracting anything, compare \u0060samples/issue8474/gen_section_top_spacing.py\u0060 and \u0060samples/issue8474/gen_top_tac_cases.py\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":"samples/issue8474/gen_section_top_spacing.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c30b8b0f57b14c066a41ea9110259a16fe4233161f31fa6ebe017ebb10eda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): scripts/font_kerning_cohort.py:145-164 | scripts/font_rank8_qualification.py:221-240 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18612b1c1d1c477d83cd2a60fc278e0cec17de0cc68b9b29c3578b9e95f42f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): scripts/visual_sweep.py:3503-3522 | scripts/visual_sweep.py:3528-3547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/visual_sweep.py"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ac8d3134323b368b44257e89ec5c99e9335f597d7bf54e7860eb91691bba80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): tools/oracle_public/page_smoke.py:323-342 | tools/oracle_public/sweep_runner.py:736-754 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"882fab17312e44c89ab77d92786955237f5c18b5a7ff0b9623ab557cf06b60cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:240-259 | tools/skill_router/gate_new_skill.py:448-467 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a145deda29a07dc3ac7e3dfdb89c561010262607c5b8772f3a0c87ede100b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): tools/oracle_public/coverage_report.py:118-136 | tools/oracle_public/oracle_resolver.py:110-128 | tools/oracle_public/sweep_runner.py:296-314 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0257798b4f297c659b7650a3c2de26169bc542e1a289003d61d990cdd007a90f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): tools/llm_verifier/repeat_eval/generate_corpus.py:1035-1053 | tools/llm_verifier/repeat_eval/generate_corpus.py:1063-1081 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/generate_corpus.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76197fd485a4fe73c8a84975aef437e75530c6a8ab21a8f67a37548752fe233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): scripts/font_rank1_qualification.py:389-406 | scripts/font_rank7_qualification.py:506-523 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5523eae944e9e8f17c0e9cfbdadd149acc5b1e2b2a15c16b6560176f746ac8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:2234-2251 | tools/fidelity_compare/fidelity_compare.py:2272-2289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f5b10355ecd5b2a48c6ba9c276ce0f5eada37d606a014cdd4e8a15c7d5439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): tools/skill_router/install_git_hook.py:52-70 | tools/skill_router/precommit_skill_gate.py:76-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":"tools/skill_router/install_git_hook.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d1ef5a8bd555af65e33cdc18b9d8951b5190480cad4b50ad14627b7833eeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tools/render_backend/gen_m06f.py:105-121 | tools/render_backend/harness.py:53-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":"tools/render_backend/gen_m06f.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9102b97b75b5bd74a315aca2d27e8a52e23ac44433305ec7fbe3a1e46dbf928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): tools/inspect_msec/gen_msec_fixtures.py:1401-1416 | tools/inspect_msec/gen_msec_fixtures.py:1469-1484 | tools/inspect_msec/gen_msec_fixtures.py:1516-1531 | tools/inspect_msec/gen_msec_fixtures.py:2221-2236 | tools/inspect_msec/gen_msec_fixtures.py:2295-2310 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/inspect_msec/gen_msec_fixtures.py:1401\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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fc78fea9f79078f51b5488fbe29911eefd3d7c5836781373ab1930bd510129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): scripts/font_rank1_qualification.py:220-233 | scripts/font_rank7_qualification.py:290-303 | scripts/font_rank8_qualification.py:430-445 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5883adb64142587bc0b7a82910f3eeb8c7985023789017baf201141539568a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): tools/fidelity_compare/fidelity_compare.py:2381-2396 | tools/fidelity_compare/fidelity_compare.py:2525-2540 | tools/fidelity_compare/fidelity_compare.py:2585-2599 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/fidelity_compare/fidelity_compare.py:2381\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f26613abe9a0dcea3e2689f269907c5dab4fd5864a92324a505579aa1361363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tools/llm_verifier/abstain/generate_corpus.py:508-523 | tools/llm_verifier/lineage_chain/generate_corpus.py:603-618 | tools/llm_verifier/third_party_replay/generate_corpus.py:482-497 \u2014 \u0060tools/llm_verifier/lineage_chain/generate_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 81 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. 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":"tools/llm_verifier/abstain/generate_corpus.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fc6b3cf4ef3483a0ce02d4aa13a590ba3a6c6e593ca0adaaf82ad420f85b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/hwp5_inventory/cases.py:96-111 | tools/hwp5_inventory/cases.py:113-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":"tools/hwp5_inventory/cases.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"26396bc024025ed452ccf021b79517a7aa15cdcd23a00053dc8aaa1ffb2a6036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/inspect_msec/gen_msec_fixtures.py:1912-1928 | tools/inspect_msec/gen_msec_fixtures.py:2011-2026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d777a06ace4a75554be69891896da8ed2c8fa412f99924465df9c42fe26db13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): tools/llm_verifier/lineage_chain/cli.py:22-37 | tools/llm_verifier/third_party_replay/cli.py:22-35 \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":"tools/llm_verifier/lineage_chain/cli.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb7de69cdcdde428b48f93793d7682f5d1adc76087a91e078e5d5a7a3dd9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/llm_verifier/lineage_chain/generate_corpus.py:386-401 | tools/llm_verifier/lineage_chain/generate_corpus.py:422-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/lineage_chain/generate_corpus.py:386\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":"tools/llm_verifier/lineage_chain/generate_corpus.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d850485364df01cf24ec73eb6084b63af8b22b17511e2755348acfbd0759a4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tools/llm_verifier/lineage_chain/hexutil.py:29-44 | tools/llm_verifier/third_party_replay/hexutil.py:28-43 \u2014 \u0060tools/llm_verifier/lineage_chain/hexutil.py\u0060 and \u0060tools/llm_verifier/third_party_replay/hexutil.py\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 1 separate duplicated blocks between them, totalling at least 16 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. 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":"tools/llm_verifier/lineage_chain/hexutil.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"415812fd1f70591136db78756d34cc765153fde573f11806bb0c5dd061cab48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): tools/table_exchange/cases.py:1136-1151 | tools/table_exchange/cases.py:1216-1228 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/table_exchange/cases.py:1136\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":"tools/table_exchange/cases.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb87106fc139161d8a9b19072935ad87c8cd83627fc90d151caa16f4875c335d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 9): tools/inspect_msec/gen_msec_fixtures.py:1071-1093 | tools/inspect_msec/gen_msec_fixtures.py:1390-1414 | tools/inspect_msec/gen_msec_fixtures.py:1458-1482 | tools/inspect_msec/gen_msec_fixtures.py:1505-1529 | tools/inspect_msec/gen_msec_fixtures.py:1752-1776 | tools/inspect_msec/gen_msec_fixtures.py:1829-1853 | tools/inspect_msec/gen_msec_fixtures.py:2069-2083 | tools/inspect_msec/gen_msec_fixtures.py:2205-2234 | tools/inspect_msec/gen_msec_fixtures.py:2294-2308 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/inspect_msec/gen_msec_fixtures.py:1071\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/inspect_msec/gen_msec_fixtures.py:1070\u0060 calls \u0060_ht_graphic_suppress\u0060 and \u0060tools/inspect_msec/gen_msec_fixtures.py:2204\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b9de81b709b9ca5aadff82e94769a0d2b22888224f7b5790891833039d57b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): tools/llm_verifier/abstain/corpus_io.py:21-34 | tools/llm_verifier/oracle_vs_self/corpus_io.py:21-34 | tools/llm_verifier/shadow_agree/corpus_io.py:24-37 | tools/llm_verifier/untrusted_sandbox/corpus_io.py:21-35 \u2014 \u0060tools/llm_verifier/abstain/corpus_io.py\u0060 and \u0060tools/llm_verifier/oracle_vs_self/corpus_io.py\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 2 separate duplicated blocks between them, totalling at least 21 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/untrusted_sandbox/corpus_io.py:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note 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":"tools/llm_verifier/abstain/corpus_io.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b891f3964c7474894dc20ee4fa9aa232df20d8ab4dd04a9e4b932d61fd8214c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): scripts/font_rank1_qualification.py:42-56 | scripts/font_rank7_qualification.py:55-69 | scripts/font_rank8_qualification.py:130-144 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/font_rank1_qualification.py:57\u0060 calls \u0060require_equal\u0060, \u0060get\u0060 and \u0060scripts/font_rank8_qualification.py:145\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_qualification.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eb23d6c4aec82891a338954b8ed79b87188791e8e270100492e05dc91d210a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): tools/hwp5_inventory/cases.py:96-110 | tools/hwp5_inventory/cases.py:113-127 | tools/hwp5_inventory/cases.py:130-144 \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":"tools/hwp5_inventory/cases.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef65fd2675ecf55c9326b8b820bb83070b5715f4b96020bb2330a594a777ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): tools/oracle_public/coverage_report.py:143-159 | tools/oracle_public/oracle_resolver.py:135-151 | tools/oracle_public/sweep_runner.py:320-336 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f3276934f7181e6ea18829dd53269feeb52a47ef7919c3fb4cd3bc3e05e025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/visual_sweep.py:2557-2571 | scripts/visual_sweep.py:4354-4368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep.py"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f194c023b47220c9cca9c84296feca83db82c8b8e836bbd59b2731da52d7b591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:973-987 | tools/fidelity_compare/fidelity_compare.py:994-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7aca4d7a3ab09bae9c37b05cbbc3ea1497a875c9930b063a2388095ec0403"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tools/hangul_row_heights2.py:42-56 | tools/probe_width_ladder.py:32-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. 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":"tools/hangul_row_heights2.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a508adadd2acb148d6141f7cc6c9306ba4263cdf68d73d1071592af882aaea75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): tools/schema-validator/schema_validator.py:470-484 | tools/test-data-gen/hwp_test_data_generator.py:414-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/schema-validator/schema_validator.py:470\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":"tools/schema-validator/schema_validator.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc042e853ff887b89d25a75091183c01cc19d675df942affd269e62de8ae742f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): tools/gate_3798_page_end_spill.py:59-69 | tools/verify_pi_page_vs_hangul.py:89-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. 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":"tools/gate_3798_page_end_spill.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4e90d0837fad919b8ce11e44ca2993e01ec441643ce2aee3f84a5fab4fcef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/inspect_msec/gen_msec_fixtures.py:1051-1064 | tools/inspect_msec/gen_msec_fixtures.py:1843-1856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"126db86bd557004ab78860f7e0f5d0c384e85ade899346dffc98feaa9acdf0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/llm_verifier/lineage_chain/verify_corpus.py:21-34 | tools/llm_verifier/third_party_replay/verify_corpus.py:21-34 \u2014 \u0060tools/llm_verifier/lineage_chain/verify_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/verify_corpus.py\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 33 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":"tools/llm_verifier/lineage_chain/verify_corpus.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f68a8e7e1185709194104f7f3bb90777b06bc9f96199ef408b7ecd3e25c6b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/llm_verifier/process_steps/generate_corpus.py:779-792 | tools/llm_verifier/verdict_protocol/generate_corpus.py:807-820 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060per_shard\u0060 to \u0060int = 24\u0060 in one and \u0060int = 40\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":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3940119a2b15fd9992a8773bb9a88ef99a320869be8ef389a2d797217dee35be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/oracle_public/page_smoke.py:175-188 | tools/oracle_public/sweep_runner.py:588-601 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8487a5ca1f37ebe137f07f86f93fc18434d2f1a896d750f4de50c9d3f24a249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/oracle_public/page_smoke.py:280-293 | tools/oracle_public/sweep_runner.py:702-715 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee3a1f52f894fe6c154a817188a06e549c491f5f3a7cd082c11e253a100d83a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:175-188 | tools/skill_router/gate_new_skill.py:383-396 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d4136a7a4feb5229a42e523db95aa50207eb89b09159f015f4d0fa6c061c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/skill_router/check_catalog_sync.py:329-345 | tools/skill_router/gate_new_skill.py:857-870 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/skill_router/check_catalog_sync.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9831b4abd6a31d1dc997a1410c8888493849d1555a9749a96b30d4711275b9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): tools/layout_anomaly_batch_report.py:259-271 | tools/oracle_public/page_smoke.py:148-160 | tools/oracle_public/sweep_runner.py:562-574 | tools/page_roundtrip/harness.py:204-216 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/layout_anomaly_batch_report.py:259\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/layout_anomaly_batch_report.py:272\u0060 calls \u0060Path\u0060 and \u0060tools/oracle_public/page_smoke.py:161\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"df622b34089838e48e5dfe971b3d13a60ffc15493c1b2f5ebbbee95ea0193f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): scripts/font_rank1_qualification.py:371-386 | scripts/font_rank7_qualification.py:488-503 | scripts/font_rank8_qualification.py:579-591 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4e092cdbe76ebd80af13f3150f39847679a7ad65293313c4eddeed332faf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): tools/hwp5_inventory/cases.py:95-107 | tools/hwp5_inventory/cases.py:112-124 | tools/hwp5_inventory/cases.py:373-385 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/hwp5_inventory/cases.py:95\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":"tools/hwp5_inventory/cases.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7242d1d1ccbe2516808f8bb9385bdbcc5e24fe48d3505c1ac6afba25f83328ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): tools/inspect_msec/gen_msec_fixtures.py:1051-1063 | tools/inspect_msec/gen_msec_fixtures.py:1083-1095 | tools/inspect_msec/gen_msec_fixtures.py:1843-1855 \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":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e5d69816ff3c6e3af041263cace1c55d4be5cb71879dc4929ac5214ce7fa44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): tools/task2070/make_hy_ladder3.py:84-96 | tools/task2070/make_hy_ladder4.py:110-122 | tools/task2169/make_linebreak_ladder.py:107-119 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ptag\u0060 to \u0060str = \u0022A\u0022\u0060 in one and \u0060str\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":"tools/task2070/make_hy_ladder3.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"009588a0558d46b43ada118922ee75a1b4653a47aee201178de26b38dfe95838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): samples/issue8149/gen_headerrow.py:42-54 | samples/issue8149/gen_rowfit.py:37-49 \u2014 before extracting anything, compare \u0060samples/issue8149/gen_headerrow.py\u0060 and \u0060samples/issue8149/gen_rowfit.py\u0060 as WHOLE FILES: this scan already matched 4 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. 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 \u0060samples/issue8149/gen_headerrow.py:42\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":"samples/issue8149/gen_headerrow.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"785bceac22fe1dae263ca48a8a4c39f82966233de45dce532555dcb0b5aa26ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/font_rank1_qualification.py:257-269 | scripts/font_rank7_qualification.py:360-372 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/font_rank7_qualification.py:373\u0060 calls \u0060summarize_style_domain\u0060 and \u0060scripts/font_rank1_qualification.py:270\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_qualification.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcefdaa32e10b41aa3201cbe97621fa6101bb4f8f2835e920ae594bbba8155fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): scripts/visual_sweep_handbook.py:63-75 | scripts/visual_sweep_native_webfonts.py:98-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"scripts/visual_sweep_handbook.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7132d8f89d0786d14dacfa71f19b37ac78341c2d3244b225dd627dbd4d893e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:1144-1156 | tools/fidelity_compare/fidelity_compare.py:1337-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4501b6c7eedee6dd8fc01f7e89b25a524b452f3c3de33180c6f2bbfd8acf32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/inspect_msec/gen_msec_fixtures.py:2073-2085 | tools/inspect_msec/gen_msec_fixtures.py:2187-2199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inspect_msec/gen_msec_fixtures.py"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a66b2dd669bca9b9ff555e7a91a94f12bd386a06263f9d6166cc0882792169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/llm_verifier/lineage_chain/schema.py:73-85 | tools/llm_verifier/third_party_replay/schema.py:60-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. 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":"tools/llm_verifier/lineage_chain/schema.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ec0f70f9b834380d9fc3d7a4d194ad22ebdc3ae429cc7bc6c9afc9f358785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 3): tools/llm_verifier/oracle_vs_self/verify_corpus.py:73-85 | tools/llm_verifier/shadow_agree/verify_corpus.py:76-79 | tools/llm_verifier/untrusted_sandbox/verify_corpus.py:98-111 \u2014 \u0060tools/llm_verifier/oracle_vs_self/verify_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/verify_corpus.py\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 32 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. 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 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":"tools/llm_verifier/oracle_vs_self/verify_corpus.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c7723bb52467bb1a051966a64f44b85a0118b22b2877d94721be1b7ba99e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/table_exchange/cases.py:910-922 | tools/table_exchange/cases.py:1151-1163 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/table_exchange/cases.py:910\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":"tools/table_exchange/cases.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e224b50a079d0339eaa51667064d28e2a85a5754ca2c296d7f11725dc7e2151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): samples/issue7092/gen_subst_font.py:114-125 | samples/issue8149/gen_captioned_host.py:122-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. 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":"samples/issue7092/gen_subst_font.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449b5ded6c0812df78120d4d678cc7e1ca9b5924dc868d05717f179c79ac074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/oracle_stage4_profile.py:464-475 | scripts/oracle_stage5_rank8_profile.py:399-410 \u2014 before extracting anything, compare \u0060scripts/oracle_stage4_profile.py\u0060 and \u0060scripts/oracle_stage5_rank8_profile.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_stage4_profile.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cc3dc5a70a83695fa9f0ac3042e7766eead02a1872e5bd46b9c0a61558fd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): scripts/workflow_promotion_preflight.py:754-763 | scripts/workflow_promotion_preflight.py:764-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 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":"scripts/workflow_promotion_preflight.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656c56222635ce525ad2c4265535a9c04e1161217981409629d2fe2ef77dfc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/llm_verifier/abstain/verify_corpus.py:26-37 | tools/llm_verifier/oracle_vs_self/verify_corpus.py:26-37 \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":"tools/llm_verifier/abstain/verify_corpus.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aa66e75ddaa5e3957ccada9b86c37ba396a5795434cef1d438fa6099f5b3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tools/llm_verifier/best_of_n/generate_corpus.py:272-286 | tools/llm_verifier/repeat_eval/generate_corpus.py:214-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/best_of_n/generate_corpus.py:272\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":"tools/llm_verifier/best_of_n/generate_corpus.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf4f9999f61ae23fc79d2ff560007764c0580966b2cebfabbed43b7719d29d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/llm_verifier/lineage_chain/verify_corpus.py:40-51 | tools/llm_verifier/third_party_replay/verify_corpus.py:40-51 \u2014 \u0060tools/llm_verifier/lineage_chain/verify_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/verify_corpus.py\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 33 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. 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":"tools/llm_verifier/lineage_chain/verify_corpus.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a9879c90cef17900ba8d8155b27210d696408e558b0b0a770164899c980614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/llm_verifier/process_steps/generate_corpus.py:433-444 | tools/llm_verifier/verdict_protocol/generate_corpus.py:380-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":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5775ed6e3390a3f5e020735d78bc1178b3b832bc295de07746d0274b36142594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/llm_verifier/process_steps/generate_corpus.py:844-855 | tools/llm_verifier/verdict_protocol/generate_corpus.py:858-869 \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. 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":"tools/llm_verifier/process_steps/generate_corpus.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"c629349148083a0dc2623dddff1cabee709a8b9bd3d9bf3f3c5d806e96901531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/regression_loop/gate.py:53-64 | tools/regression_loop/promote.py:84-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/regression_loop/gate.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"68de464b185ff03e8c703814f019ea74b500ec99bd90fed9acbca5319cb35d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): tools/table_exchange/cases.py:910-920 | tools/table_exchange/cases.py:946-956 | tools/table_exchange/cases.py:1151-1161 | tools/table_exchange/cases.py:1191-1201 \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":"tools/table_exchange/cases.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d557866ce74e3ac5a5692fde64223ffe29f1046649dee26d350fc580606a512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): tools/llm_verifier/abstain/verify_corpus.py:30-39 | tools/llm_verifier/oracle_vs_self/verify_corpus.py:30-40 | tools/llm_verifier/shadow_agree/verify_corpus.py:31-40 \u2014 \u0060tools/llm_verifier/oracle_vs_self/verify_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/verify_corpus.py\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 32 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/llm_verifier/oracle_vs_self/verify_corpus.py:30\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":"tools/llm_verifier/abstain/verify_corpus.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"021ae9285fe251887a8783516ed7a2471e7c2891477769f6840d6f658bacc24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): scripts/font_rank1_qualification.py:65-75 | scripts/font_rank7_qualification.py:78-87 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 \u0060scripts/font_rank1_qualification.py:65\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":"scripts/font_rank1_qualification.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fba8b6aef89341d301c9cdc43bbc24f1dfaff10673b3fcdb00b066ae4b17ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/visual_sweep.py:2491-2501 | scripts/visual_sweep.py:2874-2887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 after the matched lines, \u0060scripts/visual_sweep.py:2502\u0060 calls \u0060sorted\u0060, \u0060min\u0060, \u0060max\u0060 and \u0060scripts/visual_sweep.py:2888\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep.py"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bffebfe7ab04a6556ebe7f71f10ac0b886a59c23b44036893c1239cab292bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/hwpctrl_compat/classify_remaining.py:255-265 | tools/hwpctrl_compat/sweep_actions.py:55-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/hwpctrl_compat/classify_remaining.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8b5fdc87b5ead72c1cd4185988013b989deaa1d54e6a0485c490e7e21e18f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/hwpctrl_compat/sweep_actions.py:222-232 | tools/hwpctrl_compat/sweep_hang_windows.py:99-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwpctrl_compat/sweep_actions.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8acc2ba92613780205e66afb14aabaabfeee4321acd248666f3dafe1e2094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/page_roundtrip/spec_probe.py:239-249 | tools/page_roundtrip/spec_probe.py:263-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":"tools/page_roundtrip/spec_probe.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1e3ff33e0534c45b93cfb785bd5386b250fcb8a61638f37a74eebf9ffa1d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/skill_router/audit_skill_commands.py:452-462 | tools/skill_router/check_catalog_sync.py:300-310 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a969ce5046c720856c7e7e6034980a08bc2aea8cef0be302031101f58fa2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/strategist/engagement.py:206-216 | tools/strategist/engagement.py:242-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/strategist/engagement.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448d5225201d83b5c1216989aa123df5d6f6a2719134ca1ca58d28b5100f4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/llm_verifier/lineage_chain/corpus_io.py:19-28 | tools/llm_verifier/oracle_vs_self/envelopes.py:25-34 | tools/llm_verifier/third_party_replay/corpus_io.py:19-28 \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. 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":"tools/llm_verifier/lineage_chain/corpus_io.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c22860f5d9e58e13fd54820648a31d5174eb95676f4e07e3609be861f13fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/llm_verifier/oracle_vs_self/generate_corpus.py:265-274 | tools/llm_verifier/shadow_agree/generate_corpus.py:235-244 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:375-384 \u2014 \u0060tools/llm_verifier/oracle_vs_self/generate_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 70 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. 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":"tools/llm_verifier/oracle_vs_self/generate_corpus.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c114b2dff996e9f706595148a5ae2e6e8be7be838abfe92965ac518f9d23d97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/llm_verifier/oracle_vs_self/schema.py:35-44 | tools/llm_verifier/shadow_agree/schema.py:40-49 | tools/llm_verifier/untrusted_sandbox/schema.py:40-49 \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. 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":"tools/llm_verifier/oracle_vs_self/schema.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1d67f89030c58ce06338849eea49d8e52bec8c64d2435c2bef08d14ecdb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): tools/llm_verifier/repeat_eval/generate_corpus.py:981-993 | tools/llm_verifier/repeat_eval/generate_corpus.py:1044-1056 | tools/llm_verifier/repeat_eval/generate_corpus.py:1072-1084 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/llm_verifier/repeat_eval/generate_corpus.py:979\u0060 calls \u0060sorted\u0060 and \u0060tools/llm_verifier/repeat_eval/generate_corpus.py:1043\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/llm_verifier/repeat_eval/generate_corpus.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5525f88a5ac7218189473b2a221a5912049c2295c3f0cad0e3e69c5cde8fad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201310 lines \u00D7 6): samples/anchor_char_line_height/make_anchor_char_height.py:31-32 | samples/anchor_char_line_height/make_anchor_char_height.py:33-33 | samples/float_push_spacing_before/make_float_push_spacing_before.py:49-58 | samples/float_push_spacing_before/make_float_push_spacing_before_boundaries.py:70-73 | samples/float_push_spacing_before/make_float_push_spacing_before_column_top.py:55-64 | samples/page_anchored_square/make_page_anchored_square.py:60-61 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060samples/anchor_char_line_height/make_anchor_char_height.py:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060samples/float_push_spacing_before/make_float_push_spacing_before.py:48\u0060 calls \u0060join\u0060, \u0060cell\u0060 and \u0060samples/anchor_char_line_height/make_anchor_char_height.py:31\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/anchor_char_line_height/make_anchor_char_height.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6abd346ce9cdaba8073389e6d3a76602ff3c3659e8628fae74a0cdaeb2b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): samples/issue8149/gen_captioned_host.py:44-53 | samples/issue8149/gen_rowfit.py: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":"samples/issue8149/gen_captioned_host.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0977e4530e11279f10b969416046eab49f9d1db34d86b8e2fa383db0d7c13946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/font_rank1_qualification.py:186-195 | scripts/font_rank7_qualification.py:255-264 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fecd9e44f9de69cee786d3efc38463099775e9b70bad6d9dbee8bbe1f07e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/fidelity_compare/fatten_text_layer.py:1941-1950 | tools/oracle_public/fatten_catalog.py:1185-1194 \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. 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":"tools/fidelity_compare/fatten_text_layer.py"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbe7f24bc9014d3e60103669c3ace10daaf210dd09a5ff4d4ed20f8be297dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): tools/layout_anomaly_batch_report.py:794-799 | tools/oracle_public/sweep_runner.py:1241-1250 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/oracle_public/sweep_runner.py:1241\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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f8700b75eb6fae3681be531b271fac5852d72d466d2fac9ea6546b048e707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/oracle_public/page_smoke.py:266-275 | tools/oracle_public/sweep_runner.py:689-698 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eab309972a1610326888d94c1b5cc3f397033ca43147f30b7936907a129de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/oracle_public/page_smoke.py:443-452 | tools/page_roundtrip/harness.py:374-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. 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe89684246383ebce1b1dd456d71d4b27baa48f2618945f6c007aa5e0e3f3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): tools/test-data-gen/hwp_test_data_generator.py:341-350 | tools/test-data-gen/hwp_test_data_generator.py:356-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/test-data-gen/hwp_test_data_generator.py:341\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/test-data-gen/hwp_test_data_generator.py:364\u0060 calls \u0060GenerationError\u0060, \u0060get\u0060 and \u0060tools/test-data-gen/hwp_test_data_generator.py:350\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":"tools/test-data-gen/hwp_test_data_generator.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5f0e8515c531044f894669ff9957a3dc560695c062ca8d3134898c7d73adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): tools/gate_3798_page_end_spill.py:60-68 | tools/task2287/delta_staircase.py:39-47 | tools/verify_pi_page_vs_hangul.py:90-101 \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. 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":"tools/gate_3798_page_end_spill.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f08b3e949f6fd17a90268468383dc99edd24b405de5d7a7177aa18b8dae898a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): samples/issue1937/gen_row_trim.py:74-83 | samples/issue8464/gen_row_content_fit.py:84-93 \u2014 before extracting anything, compare \u0060samples/issue1937/gen_row_trim.py\u0060 and \u0060samples/issue8464/gen_row_content_fit.py\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"samples/issue1937/gen_row_trim.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c212a24b425c8be132dc99f136022f8bf3b9d4b3fe39e05de1d48a2fb12c12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): samples/issue8470/gen_vertical_cell_table.py:48-65 | samples/issue8471/gen_pushed_none_table.py:46-63 \u2014 before extracting anything, compare \u0060samples/issue8470/gen_vertical_cell_table.py\u0060 and \u0060samples/issue8471/gen_pushed_none_table.py\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":"samples/issue8470/gen_vertical_cell_table.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f5cf1a49d10591b0fa14d4df8a5dce056e4f9751bd4323658551b7eab7d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): samples/issue8470/gen_vertical_cell_table.py:105-121 | samples/issue8471/gen_pushed_none_table.py:102-118 \u2014 before extracting anything, compare \u0060samples/issue8470/gen_vertical_cell_table.py\u0060 and \u0060samples/issue8471/gen_pushed_none_table.py\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":"samples/issue8470/gen_vertical_cell_table.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b8abea98ca5e106b18e778f2cac3904f3ad18de13b6a406c00b68e9037b836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/font_kerning_cohort.py:135-143 | scripts/font_rank8_qualification.py:211-219 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d6a1c43d19e15cd57a4f478e782638dc781e57b6097b4f0b578c5235687aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/font_kerning_cohort.py:256-264 | scripts/font_rank8_qualification.py:334-342 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f261495d4b15a63189a6f459031593e3c8c24428b4ca8f29e5c87742ac1eb88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/font_rank8_metric_hypothesis.py:257-265 | scripts/font_rank8_private_qualification.py:205-213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/font_rank8_metric_hypothesis.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ccbeb0fd6411896fa5cb439348ccff90179da02253e13d66cf84de41b41f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): scripts/oracle_stage5_queue_projection.py:73-81 | scripts/oracle_stage5_rank16_disposition.py: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/oracle_stage5_queue_projection.py:73\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":"scripts/oracle_stage5_queue_projection.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"730fa576c39af9dd5da87135878ad2984295c783e96201240c52d0133a75726c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/visual_sweep_native_webfonts.py:197-205 | scripts/visual_sweep_native_webfonts.py:209-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":"scripts/visual_sweep_native_webfonts.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95457eb977ca19dc91830e63f7b8b500882f4dcef2ad96a601e5462dbb32b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/workflow_promotion_preflight.py:611-619 | scripts/workflow_promotion_preflight.py:621-629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/workflow_promotion_preflight.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56d77028387ef68e053dacfae7d7e905b1ecded63fe86bcce9cac5c6bd48323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:3047-3055 | tools/fidelity_compare/fidelity_compare.py:3106-3114 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/fidelity_compare/fidelity_compare.py:3047\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca36d15cc09978f348acd17666a7aa533eeaf3c3837326c10a8be7dbf3d1cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20139 lines \u00D7 3): tools/fidelity_compare/fidelity_compare.py:2297-2298 | tools/fidelity_compare/fidelity_compare.py:3056-3064 | tools/fidelity_compare/fidelity_compare.py:3115-3122 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/fidelity_compare/fidelity_compare.py:3056\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d15a18dab3226093ab7fb323fc04fbeb53f3ed51f9273863572738f131ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): tools/issue5162_field_wraps_table.py:82-90 | tools/issue5169_bodytext_vs_viewtext.py:26-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/issue5162_field_wraps_table.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff2195770ee257779ba067d59af144b236a4afd87a5f58f3e120faccb87c5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/oracle_public/page_smoke.py:367-375 | tools/oracle_public/sweep_runner.py:465-473 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/oracle_public/page_smoke.py:377\u0060 calls \u0060PageSmokeError\u0060 and \u0060tools/oracle_public/sweep_runner.py:474\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/page_smoke.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d25758a9ee7ede30a9742740b9edf5300009f5510d82a20d6e6cb1dd7a5025d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): tools/task2279/footer_flip_run.py:121-128 | tools/task2279/footer_flip_worker.py:32-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/task2279/footer_flip_run.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca227971e8abd8fcb906a08ca483877a188f8bd98b9226422d3bc1fdc9e9267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): tools/llm_verifier/abstain/generate_corpus.py:451-458 | tools/llm_verifier/oracle_vs_self/generate_corpus.py:281-288 | tools/llm_verifier/shadow_agree/generate_corpus.py:250-257 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:393-400 \u2014 \u0060tools/llm_verifier/oracle_vs_self/generate_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 70 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/llm_verifier/abstain/generate_corpus.py:448\u0060 calls \u0060any\u0060, \u0060RuntimeError\u0060 and \u0060tools/llm_verifier/oracle_vs_self/generate_corpus.py:279\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":"tools/llm_verifier/abstain/generate_corpus.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc58b7252932fe940f370cab4671dd027ce704c699c00f26c6ddfa6097f879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): tools/oracle_public/page_smoke.py:177-184 | tools/oracle_public/sweep_runner.py:590-597 | tools/page_roundtrip/harness.py:262-269 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eaa58f5139e57885e11581ef93bebeba776e684ea042b37afbc875fa767eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): samples/continuation_reset/gen_continuation_reset.py:46-53 | samples/issue8468/gen_line_reserve.py:46-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/continuation_reset/gen_continuation_reset.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9872c4b67705799dae37b67f664b3f3c724f1a9a94a8db227e73c2ec85dfcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/font_rank1_metric_hypothesis.py:331-338 | scripts/font_rank8_metric_hypothesis.py:365-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ce7647be9d2d4947ca751b744fdbe3958a67bd5e53103ef5c7d5de196fcde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/visual_sweep.py:2095-2102 | scripts/visual_sweep.py:2105-2112 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/visual_sweep.py:2095\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":"scripts/visual_sweep.py"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca88f6c68b35259adb27e4d9b96f11bbc0afe00358930d99d8a61f5863ba382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/visual_sweep.py:3606-3613 | scripts/visual_sweep.py:3866-3873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep.py"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8be62267a8c381b2299f3cc9c3f71ee2e8e0c8c6932fc65e78d628d0a1575e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/visual_sweep_handbook.py:165-172 | scripts/visual_sweep_native_webfonts.py:220-227 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/visual_sweep_handbook.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"68363248b0f12cfdd126d00a7a9829182983930f55e55da8c6e53749854c76c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/layout_anomaly/gen_m02f_fixtures.py:497-504 | tools/layout_anomaly/gen_m02f_fixtures.py:517-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":"tools/layout_anomaly/gen_m02f_fixtures.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d22c67773aefae1e198f9eda3d2b82dcb51c28ea4dc856583f199647b1977d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/llm_verifier/lineage_chain/corpus_io.py:37-44 | tools/llm_verifier/third_party_replay/corpus_io.py:37-44 \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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cases\u0060 to \u0060Iterable[LineageCase]\u0060 in one and \u0060Iterable[ReplayCase]\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":"tools/llm_verifier/lineage_chain/corpus_io.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1498189ed64c898bb39c6e8cf4b04b98ec0cba1a35f421efcba4d774433b47a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/oracle_public/page_smoke.py:298-305 | tools/oracle_public/sweep_runner.py:719-726 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d0fd6aa96a3ba0fc18c65e4344692410d517e9e2ba91f79062c0d1f585215a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/proptest_roundtrip/gen_m04f_catalogs.py:1375-1382 | tools/proptest_roundtrip/gen_m04f_catalogs.py:1383-1390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/proptest_roundtrip/gen_m04f_catalogs.py"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fefcc137504442891a05bbc10e69230408fbd68848eaffc2f68c508ae989607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): tools/task2279/pi78_split_ladder.py:75-81 | tools/task2279/subpixel_align_harness.py:39-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. 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":"tools/task2279/pi78_split_ladder.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6704ef7738949d403b5f647031e655d43f60bc706ea21dbee35ad4721525edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/verify_hangul_pages.py:55-62 | tools/verify_pi_page_roundtrip.py:161-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/verify_hangul_pages.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"828bcf063c2f67f96d2020ca82af267112dd9c0a074e64b5faa49e4999730d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): tools/llm_verifier/abstain/schema.py:77-83 | tools/llm_verifier/lineage_chain/schema.py:72-78 | tools/llm_verifier/third_party_replay/schema.py:59-65 \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. 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":"tools/llm_verifier/abstain/schema.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7e7d07e5a4076816225e4b6ffc44da53a01400edb350df9429f2f9ddc2510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): tools/oracle_public/coverage_report.py:91-97 | tools/oracle_public/oracle_resolver.py:85-91 | tools/oracle_public/sweep_runner.py:273-279 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb103cf87ddb93edae2cbf3d7b351ec43bd6c9e330b79470d1b7b9bd4fe5e1e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): samples/issue1937/gen_cell_notes_multipage.py:68-81 | samples/issue8081/gen_fn_table.py:64-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060samples/issue1937/gen_cell_notes_multipage.py: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":"samples/issue1937/gen_cell_notes_multipage.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca954bfbe3961a5259e4454b7f9ee20f915b850b87156cd0deb80587f981f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): samples/issue7687/gen_empty_host.py:81-95 | samples/issue7687/gen_titled_host_after_band.py:43-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060samples/issue7687/gen_empty_host.py:81\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":"samples/issue7687/gen_empty_host.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad884bdf866f9a5a39f1285cb66fb5932266cd6ac8af33efee6672b6bda922a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/generate_kerning_pair_fixture.py:94-100 | scripts/generate_oracle_typesetting_fixture.py:236-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_kerning_pair_fixture.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"577d58611e11d3961020def89a5bba7409b8bf2c9b12c839b93a3dde2b2e1743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/workflow_promotion_preflight.py:747-753 | scripts/workflow_promotion_preflight.py:775-783 \u2014 both copies are in the same file, so extract the block 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 \u0060scripts/workflow_promotion_preflight.py:775\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":"scripts/workflow_promotion_preflight.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3609145adf1d887cd57ff7389d8da2858a9d73d6ebd7f73b56a22e155a681f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:2712-2718 | tools/fidelity_compare/fidelity_compare.py:2867-2873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"add5a5669506d8151f1afff4152a6e7eb333ec2254f052bf39b30f4f2bcb172a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/hwpctrl_compat/run_gate.py:108-114 | tools/hwpctrl_compat/run_gate.py:142-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. 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":"tools/hwpctrl_compat/run_gate.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a6bb85614c5ca6df19cd70fa30ab9e386e8c7cb62c4d4179cd1b00bcad350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/lineage_chain/corpus_io.py:61-67 | tools/llm_verifier/third_party_replay/corpus_io.py:61-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"tools/llm_verifier/lineage_chain/corpus_io.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"de83b208f498d70710acca2d7f913fdea92f9d3935624c63052ac416e8760d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/lineage_chain/generate_corpus.py:537-543 | tools/llm_verifier/third_party_replay/generate_corpus.py:417-423 \u2014 \u0060tools/llm_verifier/lineage_chain/generate_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 81 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":"tools/llm_verifier/lineage_chain/generate_corpus.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb9f4aea5e350e72ff7e1c2d34b787cae85d0bd8e7537c8ce1714462260ce88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/lineage_chain/verify_corpus.py:55-61 | tools/llm_verifier/third_party_replay/verify_corpus.py:55-61 \u2014 \u0060tools/llm_verifier/lineage_chain/verify_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/verify_corpus.py\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 33 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. 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":"tools/llm_verifier/lineage_chain/verify_corpus.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf272de884d5ebe6e4dfc130591f2c10d9f9f2e292a8e6fd3bafcb7d7930234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/oracle_vs_self/verify_corpus.py:89-95 | tools/llm_verifier/shadow_agree/verify_corpus.py:102-108 \u2014 \u0060tools/llm_verifier/oracle_vs_self/verify_corpus.py\u0060 and \u0060tools/llm_verifier/shadow_agree/verify_corpus.py\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 32 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. 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 before the matched lines, \u0060tools/llm_verifier/shadow_agree/verify_corpus.py:97\u0060 calls \u0060bool_cell_mismatch\u0060, \u0060parse_bool\u0060 and \u0060tools/llm_verifier/oracle_vs_self/verify_corpus.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":"tools/llm_verifier/oracle_vs_self/verify_corpus.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c2fe0c7ec2f83912980c77de38849862cecf92ac073b1da5e544d935e9b28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/llm_verifier/verdict_protocol/generate_corpus.py:661-667 | tools/llm_verifier/verdict_protocol/generate_corpus.py:762-768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/llm_verifier/verdict_protocol/generate_corpus.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeae5cc6fc2387dc7ff06eb49d37521ea995da08c3e40835a03ea5ed0e062a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle_public/coverage_report.py:416-422 | tools/oracle_public/oracle_resolver.py:359-365 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f554848a50a14a26bb9e86a05bc02c9e6faf50e926461d5f9a9eefdd49263aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle_public/sweep_runner.py:777-783 | tools/oracle_public/sweep_runner.py:800-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/sweep_runner.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aaa93b98e30ffd4a22d9288469aa636c45d84c39ec4a70ac330e69537c58ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/roundtrip_fidelity_harness.py:97-103 | tools/verify_pi_page_vs_hangul.py:185-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 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":"tools/roundtrip_fidelity_harness.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a59813c3071f6fbf4e3448638b969f1f9eb3902d2905d3cb3e8d1719de0b88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/strategist/engagement.py:622-629 | tools/strategist/sws_audit.py:267-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/strategist/engagement.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a36da7afaf6dd9b6dc9bf3dbac77336f3dba92f8bde4cffdc3e75d340c9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/task2279/spacing_ladder.py:71-77 | tools/task2430/hy_ascii_ladder.py: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. 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":"tools/task2279/spacing_ladder.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb719197b4d66577f198a06b2daabac721191470fc276054acefe83bd726d1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): scripts/font_kerning_cohort.py:112-117 | scripts/font_rank1_metric_hypothesis.py:54-59 | scripts/font_rank8_metric_hypothesis.py:68-73 | scripts/font_rank8_qualification.py:102-107 | scripts/oracle_stage3_profile.py:51-56 | scripts/oracle_stage4_profile.py:166-171 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060label\u0060 to \u0060str = \u0022public\u0022\u0060 in one and \u0060str = \u0022evidence\u0022\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":"scripts/font_kerning_cohort.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70f3d30eb2fb7aa83f8514f4a6568058aa21ab65d98ff3e0c2340694d2ef3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): tools/dar/conformance.py:222-227 | tools/fde/triage.py:166-171 | tools/handoff/orchestrator.py:701-706 | tools/regression_loop/gate.py:68-73 | tools/regression_loop/promote.py:217-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/regression_loop/promote.py:224\u0060 calls \u0060add_argument\u0060 and \u0060tools/handoff/orchestrator.py:708\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":"tools/dar/conformance.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc84e3955b60bc45817fd9466c1ff9253411a2bad9f654668eb38d88469a5320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): samples/issue7687/gen_empty_host.py:91-97 | samples/issue7687/gen_titled_host_after_band.py:53-59 | samples/issue8149/gen_headerrow.py:97-103 | samples/issue8149/gen_rowfit.py:92-98 \u2014 before extracting anything, compare \u0060samples/issue8149/gen_headerrow.py\u0060 and \u0060samples/issue8149/gen_rowfit.py\u0060 as WHOLE FILES: this scan already matched 4 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. 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 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":"samples/issue7687/gen_empty_host.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0e43ca49a6d324b90ebcd17faa928dc3aadefe3936a0b77cf0e697a3f673c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): tools/layout_anomaly_batch_report.py:734-739 | tools/oracle_public/coverage_report.py:556-561 | tools/oracle_public/oracle_resolver.py:377-382 | tools/oracle_public/sweep_runner.py:1222-1227 \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. 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 after the matched lines, \u0060tools/oracle_public/coverage_report.py:564\u0060 calls \u0060emit_json\u0060, \u0060dumps\u0060, \u0060emit_text\u0060 and \u0060tools/oracle_public/oracle_resolver.py:385\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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8208342bb46d3b7d7c95eecbf5e8a775860e12be395239fd45d1ab6ab9b1289d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): samples/issue8149/gen_captioned_host.py:48-53 | samples/issue8149/gen_headerrow.py:42-47 | samples/issue8149/gen_rowfit.py:37-42 \u2014 before extracting anything, compare \u0060samples/issue8149/gen_headerrow.py\u0060 and \u0060samples/issue8149/gen_rowfit.py\u0060 as WHOLE FILES: this scan already matched 4 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. 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 \u0060samples/issue8149/gen_captioned_host.py:48\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":"samples/issue8149/gen_captioned_host.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d0c70aed41493b47d15af970a2cf657032723817f4fcf81bb5c8072de756b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): samples/issue8149/gen_captioned_host.py:116-125 | samples/issue8149/gen_headerrow.py:91-100 | samples/issue8149/gen_rowfit.py:86-95 \u2014 before extracting anything, compare \u0060samples/issue8149/gen_headerrow.py\u0060 and \u0060samples/issue8149/gen_rowfit.py\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060samples/issue8149/gen_captioned_host.py:115\u0060 calls \u0060add_spaced_para_pr\u0060, \u0060read\u0060, \u0060decode\u0060 and \u0060samples/issue8149/gen_headerrow.py:90\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8149/gen_captioned_host.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"331403b6eee30a6f228ebd5309b3bb734b092ac840ea9ea0ee8fc8c2b1bb5dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): samples/issue8474/gen_section_top_spacing.py:65-73 | samples/issue8474/gen_top_tac_cases.py:65-73 | samples/issue8478/gen_span_page_bottom.py:94-102 \u2014 before extracting anything, compare \u0060samples/issue8474/gen_section_top_spacing.py\u0060 and \u0060samples/issue8474/gen_top_tac_cases.py\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":"samples/issue8474/gen_section_top_spacing.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cd061447b1b76ed1869463968b9a1241bb2fcf00d3da096b5b575aafb9595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/font_rank1_metric_hypothesis.py:513-518 | scripts/font_rank7_metric_hypothesis.py:169-174 | scripts/font_rank8_metric_hypothesis.py:669-674 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd67168f7b941aa81ebe051274d2a5c827051c5ead2b3a8e77c53e46aa53ec72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/font_rank1_metric_hypothesis.py:521-526 | scripts/font_rank7_metric_hypothesis.py:181-186 | scripts/font_rank8_metric_hypothesis.py:678-683 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0111a4e689a31e018b4df1ce2f25c36573b631d2eac12d57e700b4503868f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): tools/oracle_public/coverage_report.py:101-112 | tools/oracle_public/oracle_resolver.py:95-106 | tools/oracle_public/sweep_runner.py:283-294 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/oracle_public/coverage_report.py:113\u0060 calls \u0060is_deferred_regression_input\u0060 and \u0060tools/oracle_public/oracle_resolver.py:107\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_public/coverage_report.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c5fe631d043033ed135781ef12217ad022bf75b6a1e573bc490b1571356795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): tools/oracle_public/sweep_runner.py:645-650 | tools/oracle_public/sweep_runner.py:779-784 | tools/oracle_public/sweep_runner.py:802-807 | tools/oracle_public/sweep_runner.py:898-900 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/oracle_public/sweep_runner.py:645\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":"tools/oracle_public/sweep_runner.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"872ddbac82aa584fbc90487f982009b98264f4f9cd5372d2bb9c5d859a1848bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/agent_bench/run_bench.py:241-246 | tools/agent_bench/run_bench.py:260-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/agent_bench/run_bench.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac594917930348a6eeb77e8e5df6d410a340d3a01a20df4cce6c4d3070af3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/llm_verifier/abstain/verify_corpus.py:84-89 | tools/llm_verifier/untrusted_sandbox/verify_corpus.py:139-144 \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. 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":"tools/llm_verifier/abstain/verify_corpus.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3107dfaac7012e2f361a14235d4ca6abd69f0c48cd61beabcd23ed6327a663b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/oracle_public/page_smoke.py:653-658 | tools/page_roundtrip/harness.py:684-689 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/oracle_public/page_smoke.py:653\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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02bdf13c5680be9e8cdf2ee44ea376f31feeb442a6d1ab9d3651661af062aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/repair_loop/loop.py:156-162 | tools/repair_loop/loop.py: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. 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":"tools/repair_loop/loop.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4ce4198bfd1d95d08012ad6e3dca514e5490b0be973b74587db5493160018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/scale_ladder_real.py:674-679 | tools/scale_ladder_real.py:718-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/scale_ladder_real.py:674\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":"tools/scale_ladder_real.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1794c8aa6db67d2a007d60ba29743dbcb3f135696d506b24630fdd5bd7028d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/task2279/footer_flip_run.py:152-157 | tools/task2279/footer_flip_worker.py:94-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/task2279/footer_flip_run.py:152\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":"tools/task2279/footer_flip_run.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"15013ddc1159a4453cc2cb98dbf17d11e744de9dccd4b45e35ea239fa0450143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): tools/llm_verifier/abstain/generate_corpus.py:506-510 | tools/llm_verifier/lineage_chain/generate_corpus.py:601-605 | tools/llm_verifier/oracle_vs_self/generate_corpus.py:334-338 | tools/llm_verifier/shadow_agree/generate_corpus.py:306-310 | tools/llm_verifier/third_party_replay/generate_corpus.py:480-484 | tools/llm_verifier/untrusted_sandbox/generate_corpus.py:453-457 \u2014 \u0060tools/llm_verifier/lineage_chain/generate_corpus.py\u0060 and \u0060tools/llm_verifier/third_party_replay/generate_corpus.py\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 4 separate duplicated blocks between them, totalling at least 81 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":"tools/llm_verifier/abstain/generate_corpus.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8df8a8db24e8c3dc6ae566317c688ab24459a640994dd30edf63f11af566ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): tools/llm_verifier/abstain/corpus_io.py:52-57 | tools/llm_verifier/oracle_vs_self/corpus_io.py:47-52 | tools/llm_verifier/shadow_agree/corpus_io.py:52-57 | tools/llm_verifier/untrusted_sandbox/corpus_io.py:53-58 \u2014 \u0060tools/llm_verifier/abstain/corpus_io.py\u0060 and \u0060tools/llm_verifier/oracle_vs_self/corpus_io.py\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 2 separate duplicated blocks between them, totalling at least 21 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":"tools/llm_verifier/abstain/corpus_io.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57b3be83f2def0c0abee49befe3e2373369984df79af65e4aa850e8f47869f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): tools/task2279/pi78_split_ladder.py:77-81 | tools/task2279/spacing_ladder.py:73-77 | tools/task2279/subpixel_align_harness.py:42-46 | tools/task2430/hy_ascii_ladder.py:183-187 \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. 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":"tools/task2279/pi78_split_ladder.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c158e807dbd74e402f989e6c1d9ab9510415454035429d4e8e2881f0dff7160b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 8): scripts/visual_sweep.py:4841-4845 | scripts/visual_sweep.py:4851-4852 | scripts/visual_sweep.py:4860-4862 | scripts/visual_sweep.py:4867-4869 | scripts/visual_sweep.py:4879-4883 | scripts/visual_sweep.py:4889-4893 | scripts/visual_sweep.py:4898-4900 | scripts/visual_sweep.py:4905-4906 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/visual_sweep.py:4841\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/visual_sweep.py:4841\u0060 calls \u0060draw_bbox\u0060, \u0060get\u0060 and \u0060scripts/visual_sweep.py:4860\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":"scripts/visual_sweep.py"},"region":{"startLine":4841}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da3d4b7cb53962f0659a9062fabd44ef81e48578a986fae360b0a176b56789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): tools/fidelity_compare/fidelity_compare.py:1438-1442 | tools/fidelity_compare/fidelity_compare.py:1629-1633 | tools/fidelity_compare/fidelity_compare.py:2097-2101 \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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7cbcded979ed0fe33d35787020be6f36e914bf0f6e7d26ec5705cd825beb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): samples/issue8474/gen_section_top_spacing.py:51-61 | samples/issue8474/gen_top_tac_cases.py:51-61 \u2014 before extracting anything, compare \u0060samples/issue8474/gen_section_top_spacing.py\u0060 and \u0060samples/issue8474/gen_top_tac_cases.py\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":"samples/issue8474/gen_section_top_spacing.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0efd1fcb47a0f8ea3198443c83d4c03063e18d7c15a3e00ca6a825cb1f2084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:3060-3072 | tools/fidelity_compare/fidelity_compare.py:3118-3130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"71770f3ca925932ada08d89d7f3ea413769e0a1236cd3d28f2de763a82bfee78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/form_fill/fatten_form_fill.py:765-769 | tools/form_fill/fatten_form_fill.py:797-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"tools/form_fill/fatten_form_fill.py"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"7345c14663c3bada47708e175ff432d4f432bcab40e99f0578b44927a020fbaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/oracle_public/coverage_report.py:271-276 | tools/oracle_public/oracle_resolver.py:259-264 \u2014 before extracting anything, compare \u0060tools/oracle_public/coverage_report.py\u0060 and \u0060tools/oracle_public/oracle_resolver.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 187 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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3ae513ae30873cdf3410b930157900f572843e39a6e82f35f87d2fc59b2056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/task2279/footer_flip_run.py:134-140 | tools/task2279/footer_flip_worker.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 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":"tools/task2279/footer_flip_run.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af38230a9baa489f4d97e27d440eff9ed7090ec762fd1643b80f6d0bcb445cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/task2668/discriminator.py:46-51 | tools/task2668/margins.py:47-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. 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":"tools/task2668/discriminator.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff839194cf2efffd84064083a373702e1fb718c11adfee0353e9d679cd0d0d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py:33-101 | mydocs/tech/investigations/issue-7418/probes/make_condense_numbered_fixture.py:29-97 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py\u0060 and \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_numbered_fixture.py\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bf855b515169777c64b10236cb3e5f29cdcd2decf6842f9f5b8c9b83185151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 3): mydocs/tech/investigations/issue-7418/probes/make_condense_cell_fixture.py:24-73 | mydocs/tech/investigations/issue-7418/probes/make_condense_fixture.py:29-78 | mydocs/tech/investigations/issue-7418/probes/make_condense_letter_spacing_fixture.py:27-76 \u2014 before extracting anything, compare \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_cell_fixture.py\u0060 and \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_fixture.py\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060mydocs/tech/investigations/issue-7418/probes/make_condense_cell_fixture.py:24\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":"mydocs/tech/investigations/issue-7418/probes/make_condense_cell_fixture.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d3041933fb226ff7506b35dfc210959245150b596e77ebe3982495f47f2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): samples/float_push_spacing_before/make_float_push_spacing_before.py:38-43 | samples/float_push_spacing_before/make_float_push_spacing_before_column_top.py:44-49 | samples/page_anchored_square/make_page_anchored_square.py:45-50 \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":"samples/float_push_spacing_before/make_float_push_spacing_before.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5d8b0552baea2535dc1d2a84d557e9b22a7bf60c77243c39cc87af514ac435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): samples/issue1937/gen_cell_notes_multipage.py:49-55 | samples/issue1937/gen_row_trim.py:51-57 | samples/issue8081/gen_fn_table.py:45-51 | samples/issue8464/gen_row_content_fit.py:61-67 \u2014 before extracting anything, compare \u0060samples/issue1937/gen_row_trim.py\u0060 and \u0060samples/issue8464/gen_row_content_fit.py\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"samples/issue1937/gen_cell_notes_multipage.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e119f7252715eb64eeafeb4868db570d099a1b2a39b515310ae258f3c84095b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/issue8470/gen_vertical_cell_table.py:39-44 | samples/issue8471/gen_pushed_none_table.py:37-42 \u2014 before extracting anything, compare \u0060samples/issue8470/gen_vertical_cell_table.py\u0060 and \u0060samples/issue8471/gen_pushed_none_table.py\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":"samples/issue8470/gen_vertical_cell_table.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1be0a5ab2ceb6aa6df8e2ca1782acaf08b1ee41de86aa5db23f704e24beb4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): scripts/font_kerning_cohort.py:62-66 | scripts/font_rank8_qualification.py:59-63 | scripts/oracle_stage2_common.py:54-58 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e501d17628cdbeea21a7bb2d1baad6507222b8818bfcc31ca6c799985317cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): scripts/font_kerning_cohort.py:573-590 | scripts/font_rank1_qualification.py:426-443 | scripts/font_rank7_qualification.py:543-560 | scripts/font_rank8_qualification.py:620-636 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12f628373caf46cbff2d4285be4ccf5914d45b6438fb5295325e3be9fbf4e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/font_rank1_qualification.py:172-182 | scripts/font_rank7_qualification.py:241-251 \u2014 before extracting anything, compare \u0060scripts/font_rank1_qualification.py\u0060 and \u0060scripts/font_rank7_qualification.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 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":"scripts/font_rank1_qualification.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de7ccc378568964aec222557333168eeda67902e1870e471a43a07818a1765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/generate_exact_face_collection_fixture.py:20-26 | scripts/generate_font_glyph_payload_fixture.py:51-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/generate_exact_face_collection_fixture.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c64a36102c2336f878933dfb790f3bac4a15752a6062688520984ed17d344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/oracle_stage3_historical_import.py:30-35 | scripts/oracle_stage3_profile.py:33-38 | scripts/oracle_stage4_profile.py:157-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/oracle_stage3_profile.py:29\u0060 calls \u0060compile\u0060 and \u0060scripts/oracle_stage3_historical_import.py:26\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":"scripts/oracle_stage3_historical_import.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8ac5e30b2361ca382af0deeede7a08d85b6a000bdd70a628d6cc6b5fefabdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/oracle_stage3_profile.py:67-74 | scripts/oracle_stage4_profile.py:196-203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/oracle_stage3_profile.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dae158cbc6e22924ebf487c361951b545249c27e98f839dad375b551945055b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/oracle_stage3_profile.py:78-85 | scripts/oracle_stage4_profile.py:207-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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060codepoint\u0060 to \u0060int\u0060 in one and \u0060int = 0xAC00\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":"scripts/oracle_stage3_profile.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"687efb0b5a9399680125d0f100e8b599eb48090b6c806e27dfc4cf9f30ae1873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): scripts/oracle_stage4_profile.py:182-188 | scripts/oracle_stage5_queue_projection.py:62-68 | scripts/oracle_stage5_rank16_disposition.py:47-53 | scripts/oracle_stage5_rank8_profile.py:96-102 \u2014 before extracting anything, compare \u0060scripts/oracle_stage4_profile.py\u0060 and \u0060scripts/oracle_stage5_rank8_profile.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"scripts/oracle_stage4_profile.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb71c00445490ffb4f4aae8a4e73bfb2cd9e0c27833d963a01c3d8cf4bfa65eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/agent-toolkit/lib/toolkit.py:49-54 | tools/font-analyzer/font_analyzer.py:50-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/agent-toolkit/lib/toolkit.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f248157cac2353a13e63670f46b9b4c9e151720c7812efca81d12a17f105d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/dar/conformance.py:48-52 | tools/dar/transaction.py:201-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. 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 \u0060timeout\u0060 to \u0060float = 30.0\u0060 in one and \u0060float = 60.0\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":"tools/dar/conformance.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b67e959a40f53687e2ee6cf3acd9a80cd6707ed165ae32bbf59ab4aef36e10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): tools/dar/transaction.py:86-90 | tools/hancom_chart_judgment_verify.py:84-88 | tools/handoff/orchestrator.py:127-131 | tools/page_roundtrip/spec_probe.py:383-387 \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":"tools/dar/transaction.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92011cb412ff9609eff956ddcc422fb79a424fb92c5d9ffb4e74f2b9cd7f19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): tools/layout_anomaly_batch_report.py:784-790 | tools/oracle_public/page_smoke.py:680-686 | tools/oracle_public/sweep_runner.py:1231-1237 | tools/page_roundtrip/harness.py:717-723 \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":"tools/layout_anomaly_batch_report.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344d97e5abf6e33aa7c12f85b5c6b439b65713ad4053b8e9b4c0e1e16b626cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/llm_verifier/oracle_vs_self/cli.py:18-23 | tools/llm_verifier/shadow_agree/cli.py:21-26 \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. 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":"tools/llm_verifier/oracle_vs_self/cli.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a390aea69654ed3d9cc3370493cd668abfbccdcbca4642b1177b7e7648dabbad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/object_visual_regression.py:66-70 | tools/verify_pi_page_vs_hangul.py:61-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/object_visual_regression.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f88fb3884402c659b93521714b13d387d29a117703b0e3508e128fc34ae7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle_public/page_smoke.py:400-410 | tools/page_roundtrip/harness.py:360-366 \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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8bf188b776c016920195f06fee24ed5091e2f1fb46ba9ce50b79f499e1fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): tools/skill_router/audit_skill_commands.py:51-58 | tools/skill_router/check_catalog_sync.py:45-52 | tools/skill_router/gate_new_skill.py:210-217 | tools/skill_router/install_git_hook.py:30-37 | tools/skill_router/precommit_skill_gate.py:37-44 | tools/skill_router/route.py:64-71 | tools/skill_router/run_ci_skill_gate.py:34-41 \u2014 before extracting anything, compare \u0060tools/skill_router/audit_skill_commands.py\u0060 and \u0060tools/skill_router/gate_new_skill.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 124 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 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, \u0060tools/skill_router/precommit_skill_gate.py:33\u0060 calls \u0060tuple\u0060, \u0060rstrip\u0060 and \u0060tools/skill_router/route.py:60\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b8661c56d88c7727dce9f96cee8b868f688d88172ac46faf0cebf891c0f1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/verify_hangul_pages.py:33-40 | tools/verify_pi_page_roundtrip.py:48-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"tools/verify_hangul_pages.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cd8b8e70620855f8fb0889ed3dabd82e5ccc4cc13860833136b355c3854cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/font_kerning_cohort.py:97-101 | scripts/font_rank8_qualification.py:83-87 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a757c9d0e12ce8d798f7afc91391d4c340c0145e0032f5af75926d6c6b2edf99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/llm_verifier/lineage_chain/decide.py:184-194 | tools/llm_verifier/third_party_replay/decide.py:145-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"tools/llm_verifier/lineage_chain/decide.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2708a7b2e4fa369e1a01a24ffdba2e6103c6348f8929b903d456d760570bc094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): samples/issue1937/gen_row_trim.py:87-96 | samples/issue8464/gen_row_content_fit.py:97-106 \u2014 before extracting anything, compare \u0060samples/issue1937/gen_row_trim.py\u0060 and \u0060samples/issue8464/gen_row_content_fit.py\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"samples/issue1937/gen_row_trim.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db10023d40d4c106707b3350702908288b3946d55fe688edae83abad4e833ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): samples/issue7092/gen_subst_font.py:104-108 | samples/issue7687/gen_empty_host.py:82-86 | samples/issue7687/gen_titled_host_after_band.py:44-48 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060samples/issue7092/gen_subst_font.py:104\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":"samples/issue7092/gen_subst_font.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855c319bc2c10f590c38b91edb8a4d30ab474a71e311738650fad6e2efa40ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): samples/issue8470/gen_vertical_cell_table.py:92-100 | samples/issue8471/gen_pushed_none_table.py:87-95 \u2014 before extracting anything, compare \u0060samples/issue8470/gen_vertical_cell_table.py\u0060 and \u0060samples/issue8471/gen_pushed_none_table.py\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060samples/issue8471/gen_pushed_none_table.py:96\u0060 calls \u0060para\u0060, \u0060extend\u0060 and \u0060samples/issue8470/gen_vertical_cell_table.py:101\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/issue8470/gen_vertical_cell_table.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f457067c7eefd95d99faaad48683fd8168d88c7c6243d1c012db005f553cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/extract_verified_math_alphabet_metrics.py:45-49 | scripts/extract_verified_math_symbol_metrics.py:63-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/extract_verified_math_alphabet_metrics.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"823289c510794be47d9fdd83a3d2a9dd59bb7eed1468bb564f00d7fd6ff4b357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/font_kerning_cohort.py:281-285 | scripts/font_rank8_qualification.py:357-361 \u2014 before extracting anything, compare \u0060scripts/font_kerning_cohort.py\u0060 and \u0060scripts/font_rank8_qualification.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 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":"scripts/font_kerning_cohort.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabb77e542986c4883eb3be97acbf7c540b21844b4dfc004d6bce6472f3e13ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/font_rank7_metric_hypothesis.py:220-225 | scripts/font_rank8_metric_hypothesis.py:710-715 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"scripts/font_rank7_metric_hypothesis.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c493f83ab67c476b8ffe3518f5ac358badef3c59bd6534d9b36d197b0b868fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/visual_sweep_native_webfonts.py:318-322 | scripts/visual_sweep_native_webfonts.py:406-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual_sweep_native_webfonts.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb35a06806a6d9501acf3467d43bc3414a1f659a21250309408865820054956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/agent-toolkit/workflows/archive_search.py:127-131 | tools/agent-toolkit/workflows/distribution_verify.py:136-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/agent-toolkit/workflows/archive_search.py:132\u0060 calls \u0060is_file\u0060, \u0060ToolkitError\u0060 and \u0060tools/agent-toolkit/workflows/distribution_verify.py:142\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":"tools/agent-toolkit/workflows/archive_search.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a4d968d3dfb96877c08357d848ce1b4432e8ba8cc8a9304ce8c7c179edd8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/chief/service_loop.py:245-250 | tools/chief/service_loop.py:253-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. 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":"tools/chief/service_loop.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb300fc2f6c0ec460ddf93bf4e9791224f1518d761c47905fd055489f2d5489a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/fidelity_compare/fidelity_compare.py:3147-3151 | tools/fidelity_compare/fidelity_compare.py:3257-3261 \u2014 both copies are in the same file, so extract the block 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 \u0060tools/fidelity_compare/fidelity_compare.py:3147\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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86766a7e804eafdac0f0a3029252035dbf8eb4aaeb85d7f455c0e948b2fef83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/oracle_public/page_smoke.py:351-355 | tools/oracle_public/sweep_runner.py:451-455 \u2014 before extracting anything, compare \u0060tools/oracle_public/page_smoke.py\u0060 and \u0060tools/oracle_public/sweep_runner.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 138 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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b039c820336d604c95c2af275e98dd10a813bdda7f270d3c0fb33ec9f500c1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rhwp-ooxml-chart: rhwp-ooxml-chart: 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":"c6fee1d7419ce04acd9215c8cf7a56aca9a3453a587659b715a0f96b4cf1cdbe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rhwp-password-crypto: rhwp-password-crypto: 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":"1ab50d54742c1fa2bee8ef1f665fd00e328bc66f76fbe67582c4966e72265625"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SVGPlayer (LCOM4 26): SVGPlayer\u0027s methods fall into 26 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 26 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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58f8390e0320dcc8d4eb4e74b782848b050f82ce0f52b2253c770fbee9a0cf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: f32x8 (LCOM4 13): f32x8\u0027s methods fall into 13 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 13 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":"vendor/rhwp-hayro-jpeg2000/src/math.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c505c547a4f3fe1078d1fb4e43f95504aa670af33879118c67f6e0bc05f4a7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DeviceContext (LCOM4 12): DeviceContext\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/device_context.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5090602ca94edc82769f50d8f06c30fcc874bbb1b0c66ce74ad518fa3c07e1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NameAllocator (LCOM4 6): NameAllocator\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":"vendor/svg2pdf/src/util/allocate.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1397deb597d9c6428917b380ba0f20e18938b7cfa60c30f629df5e770d2b3246"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: u32x8 (LCOM4 5): u32x8\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":"vendor/rhwp-hayro-jbig2/src/simd.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cacbcfcbb85b73ec5c80452ca210de5185d2a4355c34c5be186bfa9fc877bef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ParentFieldConfig (LCOM4 5): ParentFieldConfig\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":"vendor/rhwp-pdf-import-backend/src/editor/form_fields.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbc74b265ab39ddf7a7a43371e15d58f38b5bb4179521b75996cbe4acf68436"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TextRasterizer (LCOM4 5): TextRasterizer\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":"vendor/rhwp-pdf-import-backend/src/rendering/text_rasterizer.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d50f8f778a694eb6cd415191cd08113316d8d2dbaf740efd0579d2b47fca39"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DocumentCore (LCOM4 4): DocumentCore\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":"src/document_core/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef876b645fbbe5d55e2209d501ea09ced76621b19c0d124d40209d8afe3715"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PdfDocument (LCOM4 4): PdfDocument\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":"vendor/rhwp-pdf-import-backend/src/document.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f1418009fe2f15936b169040db469d20e72e74afda887f6ee5f234fb5a03d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageContent (LCOM4 4): ImageContent\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":"vendor/rhwp-pdf-import-backend/src/elements/image.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6184eee6a8ac1f2114ab10d0cae104bb844750e3ecc9e7cc1cd5f8cc503d9603"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PathContent (LCOM4 4): PathContent\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":"vendor/rhwp-pdf-import-backend/src/elements/path.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2311e904e9f62cf8befb3b92c223fa28d483a6c0d1525ba840c31202a6e2e312"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Layer (LCOM4 4): Layer\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":"vendor/rhwp-pdf-import-backend/src/writer/layers.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf46b00b898112dc42007ff708b2ef2581bb53517d43c9ef80b0f4d5cebe335"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: YmmRegister (LCOM4 4): YmmRegister\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":"vendor/rhwp-zune-jpeg/src/unsafe_utils_neon.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"590694121ae5a7cbc6d9321f4f24b2d7ba3bbc38038a8dc0a00b291fcde20d1e"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): F5 \uB2E8\uC77C \uC140 \uC120\uD0DD \uC774\uB3D9\uC740 \uD3C9\uBA74\u00B7\uC911\uCCA9 \uD45C\uC758 \uBB38\uC11C \uC704\uCE58\uB97C \uB3D9\uAE30\uD654\uD55C\uB2E4: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/tests/cell-selection-caret-sync.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d0cd7eb5be6c2f8642a12d23078ea5a43e127a3f82b3a9e0cff199fd98261c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout.rs: src/renderer/layout/table_layout.rs changed 515 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 542 in LayoutEngine::cell_units_uncached at line 14973. 176 of those changes were fix/bug commits, and the other 339 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":14973}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dad4433acae61acf641cbef46f201e1218e8260f0cc13dfcb8b29df521eab8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout.rs: src/renderer/layout.rs changed 478 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 468 in LayoutEngine::build_single_column at line 7866. 147 of those changes were fix/bug commits, and the other 331 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/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":"src/renderer/layout.rs"},"region":{"startLine":7866}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc3e6e5e694f7802148f2bbeff4ac0f96590b04bf33e45ac6eda0fce567add6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_partial.rs: src/renderer/layout/table_partial.rs changed 274 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 555 in LayoutEngine::layout_partial_table_cells at line 1077. 96 of those changes were fix/bug commits, and the other 178 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_partial.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_partial.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed714fff8f852774da8e9a50b37ee6eaabb7719df009cbe4dfd1b421c580ad06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/paragraph_layout.rs: src/renderer/layout/paragraph_layout.rs changed 309 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 335 in LayoutEngine::layout_composed_paragraph_in_frame at line 5656. 103 of those changes were fix/bug commits, and the other 206 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/paragraph_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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93edbabdbc37213db8d4c13be2fc6e03b3e9d4b0cdf0f8b911358c7e01af13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset.rs: src/renderer/typeset.rs changed 364 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 169 in TypesetEngine::place_table_with_text at line 5062. 56 of those changes were fix/bug commits, and the other 308 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset.rs"},"region":{"startLine":5062}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfffa63bc3078086fb97e52503aa17f623f4506426e9d366218d0f0b1127109"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/height_measurer.rs: src/renderer/height_measurer.rs changed 166 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 310 in HeightMeasurer::measure_table_impl_with_storage at line 3765. 57 of those changes were fix/bug commits, and the other 109 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/height_measurer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cc9d2f47f43b8aa80504ca3fd1894a0183d82cc6ab0530a8ae3a5b7aa61cc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/emit.rs: src/renderer/typeset/table/continuation/fragment/emit.rs changed 148 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 288 in TypesetEngine::emit_table_fragment at line 13. 73 of those changes were fix/bug commits, and the other 75 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/emit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/emit.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04184faa656e9bb445dc7134644cec50aa3440fe29b7f9756c9b2975d6ce5e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/scan/runner/row_step.rs: src/renderer/typeset/table/scan/runner/row_step.rs changed 114 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 258 in TypesetEngine::scan_ordinary_row_step at line 15. 57 of those changes were fix/bug commits, and the other 57 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/runner/row_step.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/row_step.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"db676be581e8b879bbc370f17e8e23a7d6e70becf017911924281370ef3e742c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/height_cursor.rs: src/renderer/height_cursor.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 335 in HeightCursor::vpos_adjust at line 497. 18 of those changes were fix/bug commits, and the other 47 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/height_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":"src/renderer/height_cursor.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"92935f9b5426128f385454682a6057c3fbdfb48befec642814a59fad8e09422f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/block/entry.rs: src/renderer/typeset/table/block/entry.rs changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 284 in TypesetEngine::prepare_block_table_entry at line 15. 31 of those changes were fix/bug commits, and the other 43 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/block/entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ad0f57db51a720abc399c332c71fbf00287d6c2063fb28d62f769f2cbbddcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/budget.rs: src/renderer/typeset/table/continuation/fragment/budget.rs changed 99 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 203 in TypesetEngine::prepare_table_fragment_budget 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c4d6c6f1bf6b033d1b7a2d464538894804aa4c02cd26d900aa3b160dda2fa4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvaskit-renderer.ts: rhwp-studio/src/view/canvaskit-renderer.ts changed 96 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 163 in CanvasKitLayerRenderer.renderTextRun at line 3142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvaskit-renderer.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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9f12064eba0693363fa15f7306c067cad996f2e61bdce79c8202368641c9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/rendering.rs: src/document_core/queries/rendering.rs changed 145 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in DocumentCore::paginate_pass_with_storage at line 5469. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/rendering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aff649306af5b051212269d62331dc60b0eda9d046e3d1531f74d5f479556b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main.rs: src/main.rs changed 124 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in rhwp::main 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- 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":"src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4bd697ce412d5d6af59543f06e4a0481b7a56e4bd52631de4c8462fa4ed51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/text_measurement.rs: src/renderer/layout/text_measurement.rs changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in rhwp::renderer::layout::text_measurement::char_width_decision_with_hft_tracking at line 1949. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/text_measurement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/text_measurement.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"291bf1f30c32bf66a83f0be719db48ea01234b000ed74aa51bd32e311e7c6228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/document.rs: src/document_core/commands/document.rs changed 107 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in DocumentCore::reflow_zero_height_paragraphs at line 741. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/document.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/document.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d910c2aca89d29ba0b92319e3692d42cca065b2066e8cf1f9a55f7c2f50afb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/block/prepare.rs: src/renderer/typeset/table/block/prepare.rs changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 186 in TypesetEngine::prepare_block_table_continuation 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/block/prepare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aa9442968a8a498e7c740cce2593978a92ee7a5fee7f14846fb6cc1c8167f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/renderer.rs: src/renderer/skia/renderer.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 157 in SkiaLayerRenderer::render_node at line 1171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/renderer.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a031e92e73873fde136442adb24f8eb2d4e77c0773c9c9b504619f08f61e165a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/svg.rs: src/renderer/svg.rs changed 105 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in SvgRenderer::render_node at line 764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/svg.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2465faf58a4f2d100d2fcd095a636cb0ba8e5ce513c0e852cbe97ba49c1ed7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/shape_layout.rs: src/renderer/layout/shape_layout.rs changed 95 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in LayoutEngine::layout_shape_object_with_group_origin at line 1715. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/shape_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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"300bd95f5ee27a9a309c9d4ff9f0768df24a5504a2d85a1b2d17dc9850dd1f44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/paragraph.rs: src/renderer/typeset/notes/endnotes/paragraph.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 199 in TypesetEngine::typeset_endnote_paragraphs at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/paragraph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14d7542124c7e63ed93436f7e68594ae1266aee1f7bd3237acbcf6df2acdbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwpx/section.rs: src/parser/hwpx/section.rs changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in rhwp::parser::hwpx::section::parse_picture at line 3111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwpx/section.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb9e683ae35a114e389d7408ed3fe828b350e7fa146884dcbf9ff95d44bc558"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwp3/mod.rs: src/parser/hwp3/mod.rs changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 155 in rhwp::parser::hwp3::parse_paragraph_list_inner at line 3137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwp3/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":"src/parser/hwp3/mod.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"432f7a5d308f5b31517ac0f894da8477bd9011f1a5da96b05d7d03d8a6c0a29e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler-keyboard.ts: rhwp-studio/src/engine/input-handler-keyboard.ts changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 289 in input-handler-keyboard.onKeyDown at line 709. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler-keyboard.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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7412f18c6440f00fb6a5a5d79fa458e81d0045a2ebd5a66c4f48ac62708d7e13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/float_placement.rs: src/renderer/float_placement.rs changed 235 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::renderer::float_placement::stored_nested_row_frames_with_storage at line 3205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/float_placement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement.rs"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"512ed87dc7802af9c31745a81fcdaa74677f5d18cdbb55b807de16c4ab520470"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/text_replay.rs: src/renderer/skia/text_replay.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in SkiaTextReplay::draw_text 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/text_replay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"02852d5383fcc3fe6fbb088593fb647809851609a13b473196fc54cf11041840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/cursor_rect.rs: src/document_core/queries/cursor_rect.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 177 in DocumentCore::get_cursor_rect_native at line 436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/cursor_rect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee852534b2d1607c5eb0ba8ee607abf05a547269a6c70842aaf1b44517832aa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/json.rs: src/paint/json.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in PaintOp::write_json at line 645. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/json.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef195acd3c64f45b75c5acde12230c94d1b5941afd616e9d0373380266460ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/web_canvas.rs: src/renderer/web_canvas.rs changed 95 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in WebCanvasRenderer::draw_text_positioned at line 2679. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/web_canvas.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/web_canvas.rs"},"region":{"startLine":2679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc4401085b5825dff349f85a41152bc919da6fe16f345ea21fa32ef36070b39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/scan.rs: src/renderer/typeset/table/continuation/fragment/scan.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in TypesetEngine::scan_table_fragment 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/scan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6b2ec1f0b083a9964cb43d08cfaee0201a3de8a127e402765cc5c57460567d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/section.rs: src/serializer/hwpx/section.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in rhwp::serializer::hwpx::section::render_runs_in_paragraph_scope_with_storage at line 2244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/section.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/section.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a5f22dcb1c1bb34f8aeaae97c0c8b6c425c607e0709d2c2eeb7e73aa28dc14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/paragraph.rs: src/model/paragraph.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Paragraph::insert_text_at_caret at line 1600. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/paragraph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/paragraph.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9180548e6296436d0f1d4c59502bac995ad00f42591bc08617310ed0eb43b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/pagination/engine.rs: src/renderer/pagination/engine.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in Paginator::paginate_with_measured_context_with_storage at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/pagination/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/engine.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9532a2c77d108e77131a570b741855ea080057e12274bd7a29a11b653726c050"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/visual_sweep.py: scripts/visual_sweep.py changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in visual_sweep.render_target at line 1537. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/visual_sweep.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":"scripts/visual_sweep.py"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3002ed2f6691e460b1acbad2d7dc476532a970a887d66101419c856d3a3d5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler-mouse.ts: rhwp-studio/src/engine/input-handler-mouse.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 240 in input-handler-mouse.onClick at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler-mouse.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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be6319dd1f44f94356b77c9b383942a45fbee2471fad1d482014555d11bcd04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/mod.rs: src/renderer/mod.rs changed 192 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::renderer::canvas_cluster_fit at line 793. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a7191071d2b624dd042d7f2f8c79ce45fb9ef56f6bf3c3539f218419ed8baa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/image_conv.rs: src/renderer/skia/image_conv.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in rhwp::renderer::skia::image_conv::draw_image_bytes at line 217. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/image_conv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/image_conv.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e445ae724568dc2093e66ab714176e2fb84e7607fe11c9f431f8fcb110d80ba1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/body_text.rs: src/serializer/body_text.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in rhwp::serializer::body_text::try_serialize_para_text_with_slots at line 934. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/body_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":"src/serializer/body_text.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca4877cd5602a6066ff73ddcf0546d3de28028ce1bdd794fc61b1d5caf5fdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/main.ts: rhwp-studio/src/main.ts changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in main.initialize at line 570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/main.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":"rhwp-studio/src/main.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"052351ea90e8ba0b31f820bb466c50678eab1e80829280efa5c411b4cc593dd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/stored_tac.rs: src/renderer/typeset/controls/stored_tac.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in rhwp::renderer::typeset::controls::stored_tac::prepare at line 581. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/stored_tac.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3773d9ce164cfb326191fc7576943559c04347686b003f46bc783f0956336a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/style_resolver.rs: src/renderer/style_resolver.rs changed 81 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::renderer::style_resolver::resolve_styles_with_environment 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/style_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":"src/renderer/style_resolver.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d76db125f9125f39b2026972cf4eafc633283176b2f0956b49648c212deda2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/inline_flow.rs: src/renderer/inline_flow.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in rhwp::renderer::inline_flow::plan_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/inline_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":"src/renderer/inline_flow.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3afc05d28f4bc6bb5df3c3f80b827623fdb94ad8da9c8d06dcf31f38dad092"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/equation_conv.rs: src/renderer/skia/equation_conv.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in rhwp::renderer::skia::equation_conv::render_box at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/equation_conv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e62e60b9d66217d9d188a18e7f225243c81f93d242309c8b70950f6e13f5b19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wasm_api.rs: src/wasm_api.rs changed 93 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in HwpDocument::update_style_shapes at line 8113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/wasm_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":8113}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dacf43cdac4cc11d593d1d1821570f6597a8ebca0dc00ad8b1f2b5f139c597"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/table_ops.rs: src/document_core/commands/table_ops.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in DocumentCore::set_table_properties_native at line 3067. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/table_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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8008b21601ad35a05e1d5638cf00d4bc0d55f9d5dca8f32f6e7872846410b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_cell_content.rs: src/renderer/layout/table_cell_content.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in LayoutEngine::layout_vertical_cell_text 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_cell_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_cell_content.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d94e3efea39a9fccc4c1d1a894f5551e2059776c5bf943d603db163f858178"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/picture.rs: src/document_core/commands/object_ops/picture.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in DocumentCore::apply_picture_props_inner at line 950. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/picture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc43ae4128b962c7de5caf3dd3718155b3c29780170e2fd39f13db9d1f9a5589"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/canvas_render.rs: src/renderer/equation/canvas_render.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in rhwp::renderer::equation::canvas_render::render_box at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/canvas_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e426fb96a68015fb10a133558118ad40c3e88f6ab53a2c02ea405a6c993b373"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph.rs: src/renderer/typeset/paragraph.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rhwp::renderer::typeset::paragraph::place_split_paragraph_with_storage at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e40317d22658dfdb01df7d1fee289ce84f31f267423b9467d567493b35be0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler.ts: rhwp-studio/src/engine/input-handler.ts changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in InputHandler.cutSelectedObject at line 5764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler.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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5764}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dbbd4aa3ae04435af3bef620d80dfd3df683151b75f3325b5564bf866f4f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/text_editing.rs: src/document_core/commands/text_editing.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in DocumentCore::delete_range_internal at line 3861. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/text_editing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/text_editing.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"365e10eedbb3d8a728f208108e33e8f238e22607a400876444dc1b40c6251a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/svg_render.rs: src/renderer/equation/svg_render.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in rhwp::renderer::equation::svg_render::render_box 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/svg_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d1a8fbd826842a53956650fdd2efb00aa5b1e8224429a761e95bd4e0b5d9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/export-wasm-png-for-sweep.mjs: scripts/export-wasm-png-for-sweep.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in export-wasm-png-for-sweep.main 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/export-wasm-png-for-sweep.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6f8d37a51a60a69eda5b498a9e7c0db974c53e613d427fb88de669bde3f160"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/picture_footnote.rs: src/renderer/layout/picture_footnote.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in LayoutEngine::layout_picture_full at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/picture_footnote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/picture_footnote.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9620a19ac3b6793352d60659bf0c6f0f43714f7158f2c2ecce63bfe3d24c91b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwpx/mod.rs: src/parser/hwpx/mod.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in rhwp::parser::hwpx::parse_hwpx_with_reservation at line 457. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwpx/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":"src/parser/hwpx/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ced01b4ddb52a04c61d26963e1790c87f7011f11b311a25ba1e19bf9533dd44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/builder.rs: src/paint/builder.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in LayerBuilder::build_node at line 310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/builder.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dfbb1f316d0283bb9388faf6c6d9d8c26ec62eb421a58156a5e34c64d1c385"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/wasm-bridge.ts: rhwp-studio/src/core/wasm-bridge.ts changed 69 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in WasmBridge.prepareDeclaredFontEnvironment at line 1051. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/wasm-bridge.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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f6661af93bc8ad71d81f5af20fac988807332db0d069521748bea751ae229b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/controls.rs: src/renderer/typeset/section/controls.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in TypesetEngine::place_paragraph_controls_with_storage at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/controls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/controls.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbfe527f2f71faf65b2dcdd819783bd9cfeaac300bc53e228b7571164c13391"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvas-view.ts: rhwp-studio/src/view/canvas-view.ts changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in CanvasView.updateVisiblePages at line 631. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvas-view.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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771efee1cf5a74f3a03bc263dd6d2264cad21c5b47e093b06d507a45e751480"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/stored_cell_reflow.inc.rs: src/renderer/composer/stored_cell_reflow.inc.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in rhwp::renderer::composer::stored_cell_reflow::inc::recompose_stored_lines_in_frame_with_known_square_band_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/stored_cell_reflow.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8082dae80591ab735a6a13deb09eaeb298ea80056b0b225e64ab5cac0a9e26b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/canvaskit_policy.rs: src/renderer/canvaskit_policy.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in CanvasKitReplayPlanBuilder::item_for_op at line 1516. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/canvaskit_policy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvaskit_policy.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"989cec35bd8010c6d61b2ba2367eb34322e39aef964cd43310886f22c1952db7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/measure.rs: src/renderer/typeset/notes/endnotes/measure.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in TypesetEngine::replay_endnote_column 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/measure.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/measure.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1194dc46bef8875b8b262a7500b93ed807aa195fc0fd1b687abf4df25d7b2ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/shape.rs: src/document_core/commands/object_ops/shape.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in DocumentCore::create_shape_control_native at line 1039. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/shape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/shape.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e7bbd5d994fe3da1d30eb5874e2a5b320947adc575a95b39a113eb718d362f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwpx/header.rs: src/parser/hwpx/header.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in rhwp::parser::hwpx::header::parse_border_fill at line 1657. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwpx/header.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/header.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02b3e0357211a7adef301fa6b3f7e71a8fa02290b17349da858edcad66358c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/cursor_nav.rs: src/document_core/queries/cursor_nav.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in DocumentCore::get_selection_rects_for_target_native at line 1830. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/cursor_nav.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"990842f3b67ef3547d6d538c847190ab4f716931167b54a312b800fa81d24a17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/verify-trusted-postmerge-ci-reuse.mjs: scripts/verify-trusted-postmerge-ci-reuse.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in verify-trusted-postmerge-ci-reuse.evaluateTrustedPostMergeReuse at line 515. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/verify-trusted-postmerge-ci-reuse.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d566a4c47ebfc01000d22625adfde21a534138d7c93e17361c423f411f462a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/logical_font_frame.rs: src/renderer/equation/logical_font_frame.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in rhwp::renderer::equation::logical_font_frame::frame_with_style 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/logical_font_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/logical_font_frame.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5301c0fb6a2eef45735d1df1340d7e3133016947ab7990102665f77fe47c870"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/parser.rs: crates/rhwp-ooxml-chart/src/parser.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 182 in rhwp_ooxml_chart::parser::handle_start 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/parser.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edac483eabca4c88d981deccb2e0609bf6f46a1cac8f81e0b2b148447743ee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/control.rs: src/serializer/control.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::serializer::control::serialize_control 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/control.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec985a92b4be0a4d8d61767af63ff7ae15d86ae1a595094ddad4aafe3d12ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout.rs: src/renderer/equation/layout.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EqLayout::layout_symbol at line 595. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/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":"src/renderer/equation/layout.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc1c5ddb156462065db61561fac033f460068ed0facf4a25d1a27f2d183f574"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/converters/hwpx_to_hwp.rs: src/document_core/converters/hwpx_to_hwp.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in rhwp::document_core::converters::hwpx_to_hwp::normalize_picture_geometry_for_hwp at line 996. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/converters/hwpx_to_hwp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/converters/hwpx_to_hwp.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ad1d91f9f8460106c418ba106898a97f3bd28ce451c8c37538f8206627aa0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/dev/page-scroll-probe.ts: rhwp-studio/src/dev/page-scroll-probe.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 167 in page-scroll-probe.installPageScrollProbe at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/dev/page-scroll-probe.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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5166a252e8288ba7f91a25712f5b2a0c1d711b9cb94933966729f8cdd88257d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/block/whole_fit.rs: src/renderer/typeset/table/block/whole_fit.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in TypesetEngine::query_whole_table_fit at line 472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/block/whole_fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/whole_fit.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a39a7f0b6ec6731a6700f50a2b440d369f2713714f818563126b0ca2f06b989"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/format.rs: src/renderer/typeset/paragraph/format.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in rhwp::renderer::typeset::paragraph::format::resolve_line_metrics_with_storage at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/format.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/format.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d996fac747627118f50f06540ae2ca039ee0e6346de2c2956ab6ce1d3096354"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/html_table_import.rs: src/document_core/html_table_import.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in DocumentCore::parse_table_html 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/html_table_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/html_table_import.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5bcf98369f5692c5411038055245f2c151fde2cb2039c73ad8326d43ec9864"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci-impact-classifier.cjs: scripts/ci-impact-classifier.cjs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ci-impact-classifier.classifyChanges at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/ci-impact-classifier.cjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30f9dad047967e41b90d8bc8f438c4c7d37cdf99cb4647ed2d2449934c31f47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/stored_reset.rs: src/renderer/typeset/section/stored_reset.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in TypesetEngine::apply_stored_paragraph_boundary_with_storage at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/stored_reset.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b4a5eb8b6a7d1857a062fe692a727e6fdb956139c2368a3bf08c2a3064eda4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls.rs: src/renderer/typeset/controls.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::renderer::typeset::controls::place_table_host_shape_with_storage at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"74edd46019bccbf80d1496e17f2a8f97be9373cc5bec98272875b159d0d75475"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/vpos.rs: src/renderer/typeset/section/vpos.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in TypesetEngine::vpos_snap_current_height_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/vpos.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/vpos.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"25df818522416a234079703445d195b3872b2c8bcfa36337522efeb7c9f8e171"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/tac_reconcile.rs: src/renderer/typeset/controls/tac_reconcile.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in rhwp::renderer::typeset::controls::tac_reconcile::measure 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/tac_reconcile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/tac_reconcile.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"01864a283d1c56df90b9fb4269922fde794ea62a4e19f762939b4535ad702d5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/physical_rows.rs: src/renderer/typeset/table/continuation/fragment/physical_rows.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TypesetEngine::record_stored_fragment_rows at line 602. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/physical_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/physical_rows.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93240308f3b044e4a3ddcac9c580c9011f876274c78b6d3cfe8d1e148fa02e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/pdf.rs: src/renderer/pdf.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in rhwp::renderer::pdf::direct_pdf_validation::validate_op at line 882. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/pdf.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"5756d9572cabe2364210bbd28874cd9f6d19e6d71c16543d3839c9de32eec83b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/glyph_replay.rs: src/renderer/skia/glyph_replay.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in rhwp::renderer::skia::glyph_replay::prepare_glyph_outline at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/glyph_replay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/glyph_replay.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f6db982ed017aca1108ab14076bb7f9f02f8cbe72c908a52953c8a5681dfc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layer_renderer.rs: src/renderer/layer_renderer.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rhwp::renderer::layer_renderer::collect_glyph_run_reject_reasons at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layer_renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layer_renderer.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1167abe8bc7f8e51c482ce3f4b58403776cd853bd7d0529eb48c2a10f6534517"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/mod.rs: src/parser/mod.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::parser::load_bin_data_content at line 2065. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/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":"src/parser/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"095e61937c6141741eaed7b55b7722118050ee738a77804cad2a7e7bacb353d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/public/rhwp.js: rhwp-studio/public/rhwp.js changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp.__wbg_get_imports at line 14105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/public/rhwp.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":"rhwp-studio/public/rhwp.js"},"region":{"startLine":14105}}}],"partialFingerprints":{"codehealthFindingId/v1":"02220b32f57305668d9482c1de4a91cd4c70d45830e8e9af39df448d3f4037b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/renderer.rs: crates/rhwp-ooxml-chart/src/renderer.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in rhwp_ooxml_chart::renderer::render_bars 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f78eeca9ba914d194aaa612b80ca8eac1bddd55a2b33612fbaa3b6b844fcdc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/equation_line_metrics.rs: src/renderer/composer/equation_line_metrics.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in rhwp::renderer::composer::equation_line_metrics::try_refresh_rows 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/equation_line_metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/equation_line_metrics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12831e2c891f72e6b844f0f58c96770ad3ddd07bae2075492843860dd6a2d3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/body_text.rs: src/parser/body_text.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in rhwp::parser::body_text::parse_para_text at line 605. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/body_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":"src/parser/body_text.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5b0631045ac8cac93c1939d4a5e40b9a17c754d269ea4acccb337600fba5e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/mod.rs: src/document_core/mod.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DocumentCore::get_document_info at line 418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/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":"src/document_core/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf494aaaac16fe64ce03ac6ae454e2d9701369e929c412c08a557cdf0ced421"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/flow.rs: src/renderer/typeset/paragraph/flow.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in rhwp::renderer::typeset::paragraph::flow::place_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/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":"src/renderer/typeset/paragraph/flow.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1b65c1cf44c970bac43c9a761a4e0993aa9e44063dc80f0fb02460f79653fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/border_rendering.rs: src/renderer/layout/border_rendering.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rhwp::renderer::layout::border_rendering::build_fallback_row_col_x at line 243. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/border_rendering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"718aeb27e7847ea099562af2f82c5034966b5da361d72d7431eb6a8d81b2811d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/command.ts: rhwp-studio/src/engine/command.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in DeleteSelectionCommand.constructor at line 1167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/command.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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd3094d513030ca709a6c699ad6afc31a95feaa0d3aab7730e274c67f785361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/html_import.rs: src/document_core/commands/html_import.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in DocumentCore::parse_html_to_paragraphs_at_depth at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/html_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/html_import.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d472639eca39ccd1b536e2e7dcee5917554fa8365d999f411e709aa6d3eb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/entry.rs: src/renderer/typeset/section/entry.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in TypesetEngine::prepare_paragraph_boundary_with_storage at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/entry.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac2fa6920da445ea276f6099dadde64a51a26a316689126ef42725cd0a5c87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler-text.ts: rhwp-studio/src/engine/input-handler-text.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in input-handler-text.onInput at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler-text.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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb608e17abf1d7459ae2579b97b79800f6cf944f343c9dc765cd0a2cb13e0bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/tokenizer.rs: src/renderer/equation/tokenizer.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Tokenizer::next_token at line 436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/tokenizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/tokenizer.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b176cee8edd5cfb31df42db05d6e9349cd3d82c700cb263795db7d48af6fbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_span_content.rs: src/renderer/layout/table_layout/stored_span_content.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in LayoutEngine::rowbreak_straddle_cut_units at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_span_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_span_content.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08856b2c68c1a15ae0422a6548f166e17791be429baf303d7f3d99a539d0730"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/table.rs: src/model/table.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Table::fallback_paragraph_frame_owner_widths_with_storage at line 797. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb04842eafd720df2678f67980f8dea2930a7331202205782b34e954710c074"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/footnotes/body.rs: src/renderer/typeset/notes/footnotes/body.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in TypesetEngine::register_body_footnote at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/footnotes/body.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/footnotes/body.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba883b1eb89338efa83d63701fdcb12c061cfb138fe4a974da6641474bed270"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment.rs: src/renderer/typeset/table/continuation/fragment.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TypesetEngine::step_block_table_fragment at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a59be31b8c6d36f7e455fc863eb1a82423ce41a2e8c8215ceca6d15fc0339"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/flow.rs: src/renderer/typeset/section/flow.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in TypesetEngine::place_paragraph_flow_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/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":"src/renderer/typeset/section/flow.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"675877f2d6d846820f75d396aa391da4261588c2545e9d7207b0c7c6202ab72e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/mod.rs: src/serializer/hwpx/mod.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in rhwp::serializer::hwpx::serialize_hwpx_into 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/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":"src/serializer/hwpx/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e06f5fc3674d8d8b8eb3b018ec711b296a82ef6cd28cbbfdd4f2f112d88f9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/state/transition.rs: src/renderer/typeset/state/transition.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TypesetState::spill_page_tail_floats at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/state/transition.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/state/transition.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7c408360afb5ffc174079f357f62f6183cef1c01bdbb0d8a02f076e30f297"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/stored_lines.rs: src/renderer/typeset/paragraph/stored_lines.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::renderer::typeset::paragraph::stored_lines::stored_frame_prefix 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/stored_lines.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/stored_lines.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f5400c16aa4df60d9546e79de69fb191928c96837c081efa7d778260ff81a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci-impact-policy.cjs: scripts/ci-impact-policy.cjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ci-impact-policy.auditCodeql at line 819. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/ci-impact-policy.cjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-impact-policy.cjs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"77addf02cb50a8a01c16a06a9d6f94555b29cb231839fcd67ab91cbf98452614"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/plain_cell_flow.rs: src/renderer/layout/table_layout/plain_cell_flow.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in LayoutEngine::resolve_span_content_requirements 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/plain_cell_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":"src/renderer/layout/table_layout/plain_cell_flow.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bc09d63e7b49ba6d837934913cec1d5c2a724cd78c1c4e7bfdb5922b56363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/shape_item.inc.rs: src/renderer/layout/shape_item.inc.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in LayoutEngine::layout_shape_item 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/shape_item.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_item.inc.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6058b2b09e35db818079c9bfa8c751f55507f6b665b8781d89bc4f7eee3aae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table.rs: src/renderer/typeset/table.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rhwp::renderer::typeset::table::fit_measured_for_host_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3010752dd4e495654a5aff3aea47910bfdbe4a4b7087c45d8d2fb50f20488a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/renderer_baseline.py: scripts/renderer_baseline.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 181 in renderer_baseline.write_reports at line 793. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/renderer_baseline.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":"scripts/renderer_baseline.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ce159d4b4bcc67cbd315680f64067c55ee4616bcd6b21dffda7bece7f93658"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/editable.rs: src/parser/pdf/editable.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in rhwp::parser::pdf::editable::reflow at line 696. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/editable.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/editable.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ce0d91ca4327cae5d59cd38c6bfbc2b787ec16fc0d7b691591f888b1f5a8af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout/symbol_spacing.rs: src/renderer/equation/layout/symbol_spacing.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in EqLayout::row_children 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/symbol_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":"src/renderer/equation/layout/symbol_spacing.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf599b040782b1c2ccf6bee196a1ae39542e37122ae1ca0e90eed224ef03bd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/table.rs: src/document_core/commands/object_ops/table.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DocumentCore::create_table_with_options_native at line 459. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"63781c2cabcbc91892d3f8bfa42bcd949588660d8215dcac1c8ee3d058639cbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/prepare.rs: src/renderer/typeset/notes/endnotes/prepare.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in TypesetEngine::prepare_endnote_emit 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/prepare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/prepare.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"720abf856a5ea357b642ed4342421a2822728df900d69c9278540f274296d25a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bindings/Native/src/session.rs: bindings/Native/src/session.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rhwp_native_ffi::session::rhwp_native_host_request 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- bindings/Native/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":"bindings/Native/src/session.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ba7e1444dac9b92ac85e7abb3ca7ec6b762d8345b3e570b4a7107a42898cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/empty_float.rs: src/renderer/typeset/controls/empty_float.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in rhwp::renderer::typeset::controls::empty_float::prepare at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/empty_float.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/empty_float.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c3eda2287bfd352a9a4118d55d9ee589be1dc528168cc30e788fc14a365bd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/paragraph_flow.rs: src/renderer/typeset/controls/paragraph_flow.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rhwp::renderer::typeset::controls::paragraph_flow::place_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/paragraph_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":"src/renderer/typeset/controls/paragraph_flow.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b2b2e370941eadc9e4270dddc9a5ad457be5cb3f409c09a548c0aa73c329a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts: rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in CanvasKitGlyphRunFontCache.replayStatus at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvaskit/glyph-run-fonts.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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"624fc04e1c239ab3f372fd2ce844b57aacc75aab011e8f4e790f8cc65d67668d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler-picture.ts: rhwp-studio/src/engine/input-handler-picture.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in input-handler-picture.findPictureAtClick at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler-picture.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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b4ced6372bf772ffea788b1107076cb08a6ad9d8420f762d584f3fb0b2c52c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/ui/picture-props-dialog.ts: rhwp-studio/src/ui/picture-props-dialog.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in PicturePropsDialog.populateFromProps at line 2151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/ui/picture-props-dialog.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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ca894512e0e75198e560062da6c927bb9544dab6dc71e4cad5286db626049"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/common.rs: src/document_core/commands/object_ops/common.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in DocumentCore::apply_common_obj_attr_from_json at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/common.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ea5a94c19255fb8a0f62305ec60705418ce57dc3d81b040c8c2f3cbedbccaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/render_normalization/stored_word_tail.rs: src/renderer/render_normalization/stored_word_tail.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in rhwp::renderer::render_normalization::stored_word_tail::normalize_flow_with_storage at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/render_normalization/stored_word_tail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_word_tail.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0818c1692b966c84f3a89556df681e85b996bbe33d7ac0c5ae6cc6d5321b9b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/chart.rs: src/document_core/commands/object_ops/chart.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in rhwp::document_core::commands::object_ops::chart::validate_structure at line 501. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/chart.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/chart.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"842f05575fe96a60055fcf426a88ef37ae31a776df375f381654906e160bd4fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/cfb_writer.rs: src/serializer/cfb_writer.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in rhwp::serializer::cfb_writer::serialize_hwp_inner_with_storage at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/cfb_writer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/cfb_writer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9defafd00a7d2f6dab74b00f53adba46454e3818031f1a9b7a74a58ae4bf146b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/scan.rs: src/renderer/typeset/paragraph/scan.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in rhwp::renderer::typeset::paragraph::scan::stored_body_reset_fragment_matches_current_flow at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/scan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/scan.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa775ac1e36a136db65b9d19c6e8680563d25c57d7fbd77ca5ed1a55c708867"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/page-renderer.ts: rhwp-studio/src/view/page-renderer.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in page-renderer.collectLayerPlaneSummary at line 1542. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/page-renderer.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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f1a847da4cb765960037ce98fb1c4b572d58e10d15c6424296672d390f504"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/columns.rs: src/renderer/typeset/section/columns.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in TypesetEngine::process_multicolumn_break at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/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":"src/renderer/typeset/section/columns.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f489ef614a8d33e93dcd55752d207143dd0a93b3b400a42b936740f6c436d0d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/row_block_cut.rs: src/renderer/layout/table_layout/row_block_cut.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in LayoutEngine::advance_row_block_cut_with_row_offsets at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/row_block_cut.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/row_block_cut.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7596899e112350679bf199463dd531085db1dfda3ed63c6705f706d4fd67233f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/post_flow.rs: src/renderer/typeset/section/post_flow.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in TypesetEngine::finish_paragraph_anchor_state at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/post_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":"src/renderer/typeset/section/post_flow.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45f95a4df37566ed22674c16c948e031e7dc76d2ba0e781ac60d00069d7a51d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/footnotes.rs: src/renderer/typeset/table/footnotes.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in TypesetEngine::register_queued_table_footnotes 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/footnotes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/footnotes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b13e7e81036c6de8d9327e78a1567f3c81a75f795485162cfeab2b485b7f3d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/scan/runner/block_step.rs: src/renderer/typeset/table/scan/runner/block_step.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TypesetEngine::scan_rowspan_block_step 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/runner/block_step.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner/block_step.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"45240edc9bf50d09397970cf15a322d9181c7e14e18aa78db16bd24d30e8888f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section/tail.rs: src/renderer/typeset/section/tail.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in TypesetEngine::absorb_section_tail_with_storage at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/tail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/tail.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aef177c9ea64b91802bbe542e3f9751c4743738ccdc9cc5d82e0c023695e6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mcp_serve.rs: src/mcp_serve.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rhwp::mcp_serve::run at line 473. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- 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":"src/mcp_serve.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"219700da2c433f10c9622c3e5b09e66eed2349c4d16642da21438da7cf61e5cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/composition.inc.rs: src/renderer/composer/composition.inc.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::renderer::composer::composition::inc::try_compose_paragraph_scoped_with_frame_tables at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/composition.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"979a4fa6be8e71d6c060ad48abce50de290dceec277e2befdfcff60987bd278a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/clipboard.rs: src/document_core/commands/clipboard.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DocumentCore::paste_control_native at line 1309. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/clipboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1cb88f2219154462b0a7d59cd02d6352e7c0efbe42b8f3dfd07ee1042f7ffc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/data.rs: crates/rhwp-ooxml-chart/src/data.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in rhwp_ooxml_chart::data::scan_chart_values at line 575. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/data.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/data.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b521a2270934ef4200d88d4b52bad70b93a60ff9483f642404d97a11eaaeab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/emf/converter/player.rs: src/emf/converter/player.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Player::exec 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/emf/converter/player.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/emf/converter/player.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"643796c9b18cd1a96a58f52d4248738efa9cfb4aa29bf41417f75d5c47325c0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/visual_sweep_png.py: scripts/visual_sweep_png.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in visual_sweep_png.font_catalog at line 243. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/visual_sweep_png.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":"scripts/visual_sweep_png.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cd09ba36ca899c86c2fd3ba752bbbe50c2395d250578618f286c22f92abc66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/stored_lines_runs.inc.rs: src/renderer/composer/stored_lines_runs.inc.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rhwp::renderer::composer::stored_lines_runs::inc::try_compose_lines at line 2. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/stored_lines_runs.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7387469d011f019f0c7bbeb10397e63c1bdd7e09b372c1937b49844dd9817"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/section.rs: src/renderer/typeset/section.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TypesetEngine::run_section_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"446a51f004d173333e03416ce3f14a96b3612c7b3ec2e17e1d75da13d0f6eb43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/kerning.rs: src/renderer/kerning.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::renderer::kerning::compose_kerning_paragraph_measurement_accounted at line 762. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/kerning.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/kerning.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"1500bc4f5f01df1cae82c4f9420640366170ec5fc1f7c20bac881e4d7edbd058"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/header_footer_ops.rs: src/document_core/commands/header_footer_ops.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DocumentCore::apply_hf_template_native at line 1307. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/header_footer_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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5deee3b60674ac5f0ecd7fad42d496ae5b7275013e0f15ff6dc25a239fd127"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/structured_lowering.rs: src/parser/pdf/structured_lowering.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in TableBuilder::build_inner at line 1506. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/structured_lowering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1e6cb1aea35d5261870e22d0d8f929a752281f42dd73d6f13aa5a7af35e71e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/header_footer_layout.rs: src/renderer/layout/header_footer_layout.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in LayoutEngine::layout_header_footer_paragraphs at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/header_footer_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":"src/renderer/layout/header_footer_layout.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23cb57f23947a4c5cb01fcd0d1b83b711d678b92608ac9029dc3f46a33f1e4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/hancom_glyphs.rs: src/renderer/equation/hancom_glyphs.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rhwp::renderer::equation::hancom_glyphs::glyph 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/hancom_glyphs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/hancom_glyphs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fb031fac5628d6f1b4261e4d1ddd28304b82ae5ee46a7352210be287a0138c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wmf/converter/svg/mod.rs: src/wmf/converter/svg/mod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SVGPlayer::ext_text_out at line 868. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/wmf/converter/svg/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":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f71993f7e0d539dd54a197710f3f206ff2d0c79cd47846afba62971d0eab00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/diagnostics/layout_anomaly.rs: src/diagnostics/layout_anomaly.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::diagnostics::layout_anomaly::run_single at line 1700. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/diagnostics/layout_anomaly.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c265aebb6ed373754f3692653438849745b32f186049c120408eae720eff70bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/outputs/vector.rs: src/cli/outputs/vector.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in rhwp::cli::outputs::vector::parse_export_svg_args at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/outputs/vector.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/vector.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ecc61f0b91f1e59bbe27c15faaef36c8edb580188661a917bd4b22fabae6de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_paragraph_cut.rs: src/renderer/layout/table_paragraph_cut.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LayoutEngine::row_cut_plain_paragraph_contract 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_paragraph_cut.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_paragraph_cut.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10f84d5d727a4b1e240c80f43dd722e5dda0fd592a8273104552c0108c0e860"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/host-canvas-fonts.ts: rhwp-studio/src/core/host-canvas-fonts.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in HostCanvasFontSession.prepare at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/host-canvas-fonts.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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4d66cc27b6e7443d7581dbbdc6801c3d04de2de5e9bec2ccce36102bb8b1e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/control/shape.rs: src/parser/control/shape.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::parser::control::shape::parse_container_children at line 662. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/control/shape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/control/shape.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfca8d3e272bdafa0962039b459c5d1a02a74df3ed6d2e6b48db03fcfe3a4351"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/doc_info.rs: src/serializer/doc_info.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rhwp::serializer::doc_info::try_serialize_doc_info at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/doc_info.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/doc_info.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca10a078c83ea7de1254f210f9c847fbd868d1d37befb915b2c4149bed8d119"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/render_normalization.rs: src/renderer/render_normalization.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RenderNormalizationOverlay::register_rendered_text_partitions_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/render_normalization.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a3088606313423faa1ef9643016d2a5ee17e1c08c4022550e13d80b8af4ddf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/lowering.rs: src/parser/pdf/lowering.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in rhwp::parser::pdf::lowering::lower at line 198. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/lowering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/lowering.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f07a93e6b0895366af17790024b414dd1847869939234b609149433550748e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/visual-sweep-font-registration.mjs: scripts/visual-sweep-font-registration.mjs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in visual-sweep-font-registration.selectTextEffectFontFaces at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/visual-sweep-font-registration.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e654fb8b522eaea29b0034f341bb55d5bc78f94ba601236c6e83ffb824c93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs: src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TypesetEngine::stored_body_closing_fragment_extent 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/stored_frame_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":"src/renderer/typeset/table/continuation/fragment/stored_frame_budget.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2d85f348632807037d3176083fb47b55b6f6553facc62a167213bf8cd84f46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/paint_bounds.rs: src/paint/paint_bounds.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PaintOp::paint_bounds 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/paint_bounds.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/paint_bounds.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8214c59c2208eb40dd96075e7206db5e11f40275c3375aae91b8efd49c419d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout_frame.rs: src/renderer/layout_frame.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in LayoutFrame::try_carve at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout_frame.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abadce77436a77b4bd26efdf3134b82e6b2283a0da0c0bb725917cac74a72d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/stored_word_tail.rs: src/renderer/composer/stored_word_tail.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::renderer::composer::stored_word_tail::project_stored_rows_with_storage at line 520. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/stored_word_tail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_word_tail.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffa84612f716daf88433f1382c5687ef07ecb6f054315c38f0dfd461ac7b016"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/tac_picture_item.inc.rs: src/renderer/layout/tac_picture_item.inc.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in LayoutEngine::layout_tac_picture_item at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/tac_picture_item.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/tac_picture_item.inc.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a27b9c0f215b45920c01b210a4805c41b26e9d3aa0783ddf58da66498c9b18c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/object_ops/note.rs: src/document_core/commands/object_ops/note.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in DocumentCore::insert_footnote_native at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/note.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/object_ops/note.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ff4b8e3d0b09c2e037b8079ac4f1e0e2e869bb80af42a921a062c329c8465"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/html.rs: src/renderer/html.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in HtmlRenderer::render_node at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/html.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/html.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bed27f618e67477b98cbb437504203fbe636e21b7a756a86e39378af4ba13c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bindings/Native/examples/qt_native_host.py: bindings/Native/examples/qt_native_host.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NativeWindow.update_document_ui at line 413. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- bindings/Native/examples/qt_native_host.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":"bindings/Native/examples/qt_native_host.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f73938b198686eba88035ced5e82e4cc78b8df7f57e7b665e5c715f5257aca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/font_decision.rs: src/document_core/queries/font_decision.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DocumentCore::get_font_decision_trace_from_tree at line 913. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/font_decision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_decision.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"191ed1864082987c9e03bdd521d1691840fc11265bad9f8436ba4c73a1e0e55d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/ruler.ts: rhwp-studio/src/view/ruler.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Ruler.drawHorizontal at line 558. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/ruler.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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"495457eb24d6e226da7f5992be59b4764864ed779fc79758d2e6c9625977d9e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/host_spacing.rs: src/renderer/typeset/table/host_spacing.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rhwp::renderer::typeset::table::host_spacing::resolve 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/host_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":"src/renderer/typeset/table/host_spacing.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ea4faa6f8f4deacc780fbec812f0a39a6ec60b5fc61ac2ce7bc0738c621b47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/grep.rs: src/document_core/queries/grep.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in DocumentCore::grep_with_context 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/grep.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/grep.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc50dcbb97af994d76a886f702ecf7158f0e32664e52f57905b3be99e13f305"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/oracle_page_count/regenerate.py: tools/oracle_page_count/regenerate.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in regenerate.main at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/oracle_page_count/regenerate.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":"tools/oracle_page_count/regenerate.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffa11ec4ca0a777a38aaee60cd32ff7b58b4217fbefafaa424bbdc468491a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/native-pua-font-session.ts: rhwp-studio/src/core/native-pua-font-session.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in NativePuaFontSession.prepare 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/native-pua-font-session.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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6a2ca2c4039a57a0ad8c45d649f0a2d3d4199d899e6dbfc3211c7bc1293079"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/shape.rs: src/serializer/hwpx/shape.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::serializer::hwpx::shape::write_fill_brush_with_storage at line 1285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/shape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/shape.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2004197ada7af53c98c796c69f24f6c6912be129ec2a87f039e486aae1e9419a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/font-substitution.ts: rhwp-studio/src/core/font-substitution.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in font-substitution.fontFamilyCandidatesForDisplayWithRules at line 474. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/font-substitution.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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f108a223860da7857c566645457035693863d506205c12fe33e7b1844321fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/footnotes/boundary.rs: src/renderer/typeset/notes/footnotes/boundary.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::renderer::typeset::notes::footnotes::boundary::native_hwp5_footnote_reset_fragments at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/footnotes/boundary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/footnotes/boundary.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b15358eddac785a1d5b4ed797fb96e53c4fd091fea78e25fdb224a349e89c79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/font_metric_coverage.rs: src/document_core/queries/font_metric_coverage.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::document_core::queries::font_metric_coverage::analyze_paragraph at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/font_metric_coverage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/font_metric_coverage.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54d7a4bb65ef88718228b752a3f08e0e482bbeb7d890ecab5a396d8f0717655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/host-font-requests.ts: rhwp-studio/src/core/host-font-requests.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in host-font-requests.hancomEquationFamilies 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/host-font-requests.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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f1553e78bf5fd665ec76037d1169d6d1d05589d2b2b96fd7e2bed2d41c2414"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/inline_flow.rs: src/renderer/typeset/inline_flow.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TypesetEngine::typeset_inline_flow_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/inline_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":"src/renderer/typeset/inline_flow.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d46d9afac901e94950cbd990f9e48273a198680a37a775bab4f59d5d88249c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/doc_info.rs: src/parser/doc_info.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhwp::parser::doc_info::parse_para_shape at line 747. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/doc_info.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/doc_info.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f395e2561ea2e9faf5b58e8327cfbfdc2accc078c778effe73ce0b07d5c625"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/scan/source_frame.rs: src/renderer/typeset/table/scan/source_frame.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SourceFrameQuery::resolve 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/source_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/source_frame.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa48eafc50bfb33f547db3a3ca4a78b5bd44f17f8798f879e514540bbeb537d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs: src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in TypesetEngine::query_initial_fit at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/initial_fit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded46274215fda49e7283639c89a2def9701b9bfb53820d0b4f6389100bb0a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/extract.rs: src/parser/pdf/extract.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rhwp::parser::pdf::extract::extract 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/extract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/extract.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b97b49107859edaeb66b7c71a4c03201d87041a62652974e6ead946cfb2d8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/refresh-nextest-target-duration-policy.mjs: scripts/refresh-nextest-target-duration-policy.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in refresh-nextest-target-duration-policy.refreshDurationPolicy at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/refresh-nextest-target-duration-policy.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/refresh-nextest-target-duration-policy.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dc62535392531dbf3dcf2be6573464e0a4044024b5c40b98e1757120d290b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/recognition.rs: src/parser/pdf/recognition.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in rhwp::parser::pdf::recognition::recognize_page at line 841. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/recognition.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/recognition.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d764f71d91d42feea4064b059310abc379627e71369d73614ff672a5fd90cd4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout/matrix_geometry.rs: src/renderer/equation/layout/matrix_geometry.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EqLayout::layout_matrix 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/matrix_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":"src/renderer/equation/layout/matrix_geometry.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd485f1b5f8bad85a673a7a692bd8b9329035c57d1be0aaf8df39942ed41fcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/context.rs: src/serializer/hwpx/context.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SerializeContext::try_collect_from_document at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/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":"src/serializer/hwpx/context.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb78759cceea7c438551fcb558db22bc305847bfc80f3388ea9f96e495152dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/outputs/raster.rs: src/cli/outputs/raster.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in rhwp::cli::outputs::raster::parse_export_png_args at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/outputs/raster.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/raster.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e245b0a4ce065db470deb06d60cb37156ff425f4a9a186d0710fda6f523ab50d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_atoms.rs: src/renderer/equation/parser_atoms.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in EqParser::parse_element_atom at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_atoms.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_atoms.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cae309ab8e2a855b833d1a99898963535c266de673b6b2df1137a38d160270"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/native_host/runtime/worker.rs: src/native_host/runtime/worker.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in rhwp::native_host::runtime::worker::execute 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/native_host/runtime/worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/runtime/worker.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"54892152516a2472eb32ab5bcd24319be4fad08215649caefd127537713ec260"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/cursor.ts: rhwp-studio/src/engine/cursor.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CursorState.updateRect at line 1447. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/cursor.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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"89013ec191802b81cda310c5f1a9ee36ac2e2e021eb6c0eaea9f417b5ae0d24e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/whole_fit.rs: src/renderer/typeset/paragraph/whole_fit.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::renderer::typeset::paragraph::whole_fit::inspect 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/whole_fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/whole_fit.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"050f6096fb3142e7487f745193e8ad52e2befd2212896a25e5fe5d27e346ed4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/state/stored_tac.rs: src/renderer/typeset/state/stored_tac.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TypesetState::stored_tac_page at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/state/stored_tac.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/state/stored_tac.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89feec697bf525caff4e293a98d56f4d2448d9a6867db07323facad233e86e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_commands.rs: src/renderer/equation/parser_commands.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in EqParser::parse_command_inner 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_commands.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e518cfd6dfcbb5c10314776c2829b8a0a9531a36750385e5dc3aa610f2e0ea2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs: src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LayoutEngine::first_source_frame_owner at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_intra_paragraph_frame.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eade27ec6da912cec455bb3033cdd29e0248ac3fb1c338a1be12b09a9f008a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/stored_tac_display.inc.rs: src/renderer/composer/stored_tac_display.inc.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::renderer::composer::stored_tac_display::inc::try_convert_pua_display_text at line 351. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/stored_tac_display.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/stored_tac_display.inc.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2839a8b9f38e10b229c595e791dbdc84d4bbb63cbfc7f22bda81afab2bed17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/font_glyph.rs: src/paint/font_glyph.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FontGlyphLowerer::lower_portable_glyph_run at line 569. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/font_glyph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/font_glyph.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5315643b032bc57ab539616022c69137b1b2f9b98c2752cc133a4963643f03a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwp3/drawing.rs: src/parser/hwp3/drawing.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Hwp3DrawingObject::read at line 487. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwp3/drawing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9be4ab8a050d11ce88512c752b19954f4369a8a18d3d767958e1b27e75dd18d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/scan/runner.rs: src/renderer/typeset/table/scan/runner.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TypesetEngine::scan_block_table_split_rows at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/runner.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf7949966e048bbef568cca621d9b054d43ed720d0362b3efb76406119b7770"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/reflow_fragment_content.rs: src/renderer/layout/table_layout/reflow_fragment_content.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LayoutEngine::reflow_cut_content_height at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/reflow_fragment_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/reflow_fragment_content.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b263eb1e85d6bbaaf7dbf6181e5596390810765210ac7fd1885277ddbdbef628"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/roundtrip.rs: src/serializer/hwpx/roundtrip.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::serializer::hwpx::roundtrip::diff_paragraph_linesegs_with_axis at line 1283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/roundtrip.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"02be39a4a031bd309d25c0ad59180ca9e79f32b7d08c6553db671ac2d3df12f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/content.rs: src/renderer/typeset/paragraph/content.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::renderer::typeset::paragraph::content::stored_content_bottom 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d5e306142bcb6c1e035605e76f63a9c55a479463d607bd167b445f13edd246"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/rust-test-suite-manifest.mjs: scripts/rust-test-suite-manifest.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in rust-test-suite-manifest.inspectRepository at line 784. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/rust-test-suite-manifest.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c060f90e8d50799873dda857d9e9c9be8515251e688e2e9662fd87ea7e4e2184"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/font_environment.rs: src/renderer/font_environment.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in FontEnvironment::from_document_lookup at line 309. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/font_environment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_environment.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78e1c3572203d6bddcd52f0e49e407af25c9b23658587c99f77ffc869138cc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/shaping_glyph.rs: src/paint/shaping_glyph.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::paint::shaping_glyph::lower_horizontal_shaping_source_shadow at line 1001. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/shaping_glyph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1cdb633ec92cdd2da6e7eb4f32cf492b8cfe83ce458149b68381a702fd9a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/workflow_promotion_preflight.py: scripts/workflow_promotion_preflight.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in workflow_promotion_preflight.verify_evidence at line 595. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/workflow_promotion_preflight.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":"scripts/workflow_promotion_preflight.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a38dedb9d1173b1d83000165776ad17001e1b5509b5b51f33407dbd4b237db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/table_detection.rs: src/parser/pdf/table_detection.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in rhwp::parser::pdf::table_detection::detect_ruled_tables at line 866. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/table_detection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/table_detection.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52a21f029708ac96f13214f29c7fee660323577931b29f156a24539241d5d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/embed/rpc-router.ts: rhwp-studio/src/embed/rpc-router.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in rpc-router.routeEmbedRequest 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/embed/rpc-router.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":"rhwp-studio/src/embed/rpc-router.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1386104a3fe803c69644ef874bec851fb6cc959800519605da9f2054939ebefa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/field_query.rs: src/document_core/queries/field_query.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rhwp::document_core::queries::field_query::collect_fields_from_paragraph at line 1578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/field_query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ae1f1ce729007b93e11a5607e8c1e1d61168e4a8988555d0a6af1f58b2cacf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/glyph-outline-payload-status.ts: rhwp-studio/src/view/glyph-outline-payload-status.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in glyph-outline-payload-status.glyphOutlinePayloadStatus 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/glyph-outline-payload-status.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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ada2d52b077aa2a47f0e4e85eb6ba6c5531ca52f9acebcf01f4a38a6bfab5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/ole_container.rs: src/parser/ole_container.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rhwp::parser::ole_container::parse_ole_container at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/ole_container.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/ole_container.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2f55a687c9a5bd7c29fae1fcd505416d487979ae5380fa91d0dc4d6ec50935"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/search_query.rs: src/document_core/queries/search_query.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DocumentCore::replace_matches_native at line 563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/search_query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/search_query.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedb16e52e38f9400ecf5b6d23be313658b93a814081fa56cd664df563264af2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/canvas.rs: src/renderer/canvas.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CanvasRenderer::render_node at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/canvas.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b3d62be4f6a1e3657a2e64a1851323dc5787bd4de517b0c5b7a51ab3a80cad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs: crates/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CartesianLayout::new at line 437. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/renderer/cartesian_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/rhwp-ooxml-chart/src/renderer/cartesian_layout.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ba7053bb598ed296899c524c04a04b1ad020d10b7872120cce6bdf3652a142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wmf/converter/svg/ternary_raster_operator.rs: src/wmf/converter/svg/ternary_raster_operator.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TernaryRasterOperator::run at line 543. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/wmf/converter/svg/ternary_raster_operator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/ternary_raster_operator.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9f5fce021f8e653de3b954463a1cd386ada721d5dd8fd0aa44438bee307e4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/cell_line_breaking.inc.rs: src/renderer/composer/cell_line_breaking.inc.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in rhwp::renderer::composer::cell_line_breaking::inc::split_composed_line_by_width 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/cell_line_breaking.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/cell_line_breaking.inc.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85350a0659ec54f173d564bcdaf2f7e3fd37f5236dd0d7dc1ddb39243222f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/table_calc/evaluator.rs: src/document_core/table_calc/evaluator.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp::document_core::table_calc::evaluator::eval_function 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/table_calc/evaluator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/table_calc/evaluator.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9460573d7006707bfd0a9190a9a9a372b790fbb59fa1055e3c46859ff8df9cf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/float_placement/stored_header_frame.rs: src/renderer/float_placement/stored_header_frame.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::renderer::float_placement::stored_header_frame::stored_whole_header_next_page_placement at line 217. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/float_placement/stored_header_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_header_frame.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c052b7a7fe86673804cdfbbfddd875602142ed689c633d3064898363c9bbab8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/hwp3/drawing/shape_mapping.rs: src/parser/hwp3/drawing/shape_mapping.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in rhwp::parser::hwp3::drawing::shape_mapping::map_to_shape_object 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwp3/drawing/shape_mapping.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/drawing/shape_mapping.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"451e924b526cf7e3cad051de68af17c758c1b4d1dc54208491dcc0e60332550f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/font_rule_registry_v2.mjs: scripts/font_rule_registry_v2.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in font_rule_registry_v2.validateMigrationV1ToV2 at line 1528. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/font_rule_registry_v2.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d392e64d049e054e2dceff9951c066fcdf96587923235c5b3d23857eac144534"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/input-handler-table.ts: rhwp-studio/src/engine/input-handler-table.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in input-handler-table.finishResizeDrag at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/input-handler-table.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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a11c69075208f6e64bf695f2f89d759a5f274be6ea91af7a726ab07f34169dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/font_metric_lineage.mjs: scripts/font_metric_lineage.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in font_metric_lineage.validateLineageManifest at line 1071. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/font_metric_lineage.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_lineage.mjs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f468ee98f9083ba2190130fe4a2e498bc72e60b0ad579548a046900adf2fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_text_frame_owner.rs: src/renderer/layout/table_layout/stored_text_frame_owner.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LayoutEngine::table_uses_stored_fragment_coordinates 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_text_frame_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":"src/renderer/layout/table_layout/stored_text_frame_owner.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dd83491698c608b23fe8f1e80b63ef3b5cc21b0cd3a73944798731da06e533"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/font_metric_coverage_contract.mjs: scripts/font_metric_coverage_contract.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in font_metric_coverage_contract.validateCoverageContract at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/font_metric_coverage_contract.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b70c05722136c47c72370999d30225acad95ec254e459229c76923491894d5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/stored_page_origin.rs: src/renderer/stored_page_origin.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::renderer::stored_page_origin::stored_inline_frame_restarts_page at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/stored_page_origin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/stored_page_origin.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f67b5a09c0d4482d3a2a044e275c7690a1adeda796ce54400001dae1827f6a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/trusted-postmerge-duration-evidence.mjs: scripts/trusted-postmerge-duration-evidence.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in trusted-postmerge-duration-evidence.validateDurationReports at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/trusted-postmerge-duration-evidence.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/trusted-postmerge-duration-evidence.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96fbffd3156c5ba833af76340bbed51fa3d4c0e80596222bbe49e9c8e4d1bcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/inline_control.rs: src/document_core/inline_control.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::document_core::inline_control::remove_slot at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/inline_control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/inline_control.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b06f7eb6a72336ef12ea2e25585374eab1a725747dbfa22abec66bd6b227d7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/declared-font-environment.ts: rhwp-studio/src/core/declared-font-environment.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in declared-font-environment.prepareDeclaredFontPrograms at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/declared-font-environment.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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6570dd3c94317b369daa0b98d784995980457729c1ca261891864fed63b0edcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_body_closed_frame.rs: src/renderer/layout/table_layout/stored_body_closed_frame.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LayoutEngine::row_cut_closes_original_restart_frame at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_body_closed_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f518a1eee6e7555d39f6a2a14320f450b14b51e05e634464da1c7dd5fab3689"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/reflow_helpers.inc.rs: src/renderer/composer/reflow_helpers.inc.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhwp::renderer::composer::reflow_helpers::inc::recompose_stored_single_line_if_overflowing_cached_with_storage at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/reflow_helpers.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/reflow_helpers.inc.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c7b5ea5943e8a0b5f1e95abae85cb6dd71981fa6f67e3abe40ec5db31643e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/svg_layer.rs: src/renderer/svg_layer.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::renderer::svg_layer::project_debug_overlay at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/svg_layer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg_layer.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"99acb01d6c0e275673ba163a383a2e9760f12c819260e63dbcd24d21a84c316a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/local-fonts.ts: rhwp-studio/src/core/local-fonts.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in local-fonts.normalizeLocalFontRecords at line 491. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/local-fonts.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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6f50423808dc4b23e2465e93195b5641cd7414cb30aaf18f645f63671ba75f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_block_frames.rs: src/renderer/layout/table_layout/stored_block_frames.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LayoutEngine::row_block_cut_is_original_source_page 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_block_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_block_frames.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4e248fa6383116093ca88cee59af65ef3a20b755f37276c5f832b641fa8c37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/float_placement/reflow_block_cell.rs: src/renderer/float_placement/reflow_block_cell.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::renderer::float_placement::reflow_block_cell::reflow_block_cell_flow_with_heights_with_storage at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/float_placement/reflow_block_cell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/reflow_block_cell.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a388529dd2e78dbb06e25148eacd358b45c10a7a0799413da8957c10d8c077"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/mod.rs: src/parser/pdf/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::parser::pdf::parse_pdf_with_request_and_progress at line 390. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/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":"src/parser/pdf/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203b18b4c9357c2f32afa4e2b3381131e12a50c5a2a650d39ab20e29bb13c40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/empty_line_flow.rs: src/renderer/layout/table_layout/empty_line_flow.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LayoutEngine::empty_unit_owns_flow_line_box at line 198. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/empty_line_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":"src/renderer/layout/table_layout/empty_line_flow.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b319ef1d81d79bced5340363e857aabebe3a8d503f1ddae231dd1386dd9b6854"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/font_typesetting_risk_rank.mjs: scripts/font_typesetting_risk_rank.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in font_typesetting_risk_rank.validateTypesettingRiskContract at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/font_typesetting_risk_rank.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a72024e288a41d63b422c90412ba02b2c90690fb23c8b47dc64cc1ec9d4d9d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/nested_table_frames.rs: src/renderer/composer/nested_table_frames.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::renderer::composer::nested_table_frames::recompose_cell_lines_with_nested_tables_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/nested_table_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/nested_table_frames.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"72faed131dd89714ca2f115d5c45a189654224e493486babe4ee0725f6d1635b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/table_calc/tokenizer.rs: src/document_core/table_calc/tokenizer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in rhwp::document_core::table_calc::tokenizer::tokenize at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/table_calc/tokenizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/table_calc/tokenizer.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ee1989bc28896b72ab962e990627cb0eab4a589ab5de561e615a7d5ef0d75e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/verify_ladder_drift.py: tools/verify_ladder_drift.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in verify_ladder_drift.analyze at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/verify_ladder_drift.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":"tools/verify_ladder_drift.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f295096f584ede8a4c7891cc7e35361640045a4d300fccc5b103e7ff2f159ce2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/commands/conversion.rs: src/cli/commands/conversion.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rhwp::cli::commands::conversion::convert_hwp at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/commands/conversion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/conversion.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d823bec0a50cef687a20b6211bd463817862c88f46c124ce72219c8a197d4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/refresh_oracle_pdfs.py: tools/refresh_oracle_pdfs.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in refresh_oracle_pdfs.main at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/refresh_oracle_pdfs.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":"tools/refresh_oracle_pdfs.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2087d0f6fd122a79d6caec7fcebdc8b8abf827817dc25ae955f3d3bc6aac22cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/ui/dialog.ts: rhwp-studio/src/ui/dialog.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ModalDialog.show at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/ui/dialog.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":"rhwp-studio/src/ui/dialog.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baea0af70ecbd626409ae04049b4968f6dbc0e3c0e4c4f267dafba6eaf3c316"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvaskit/nominal-text-replay.ts: rhwp-studio/src/view/canvaskit/nominal-text-replay.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in nominal-text-replay.textRequiresComplexShaping at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvaskit/nominal-text-replay.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":"rhwp-studio/src/view/canvaskit/nominal-text-replay.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4280487c75d04481b1c11ad64eb69a9d1151fa2d3314c691a23b3ed424ff502b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs: src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TypesetEngine::replay_endnote_column_extent at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/stored_ink_fit.inc.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ccd87d5835e6710ba97af110e86342875cfad93c808080d58b57f2cd33af05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/virtual-scroll.ts: rhwp-studio/src/view/virtual-scroll.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VirtualScroll.getVisibilitySnapshot at line 470. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/virtual-scroll.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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d899f736ddc8810a00ab37b44a871ccda9ac773eec1b3c18120e23f39e5356"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/leaderboard.py: gym/tools/leaderboard.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in leaderboard.verify_entry at line 495. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/leaderboard.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":"gym/tools/leaderboard.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0e7e38d02c9a15e41e9dd163b59b020688fedd5a7e10fdfd74f849a26cdb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs: src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TypesetEngine::coanchored_closed_first_fragment_row_end 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/fragment/coanchored_origin.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff30327f465a02ec0b105e58e95a6ab0da1273c9f53c3ea00022bfa0f32b5a9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ole_chart/legacy_presentation.rs: src/ole_chart/legacy_presentation.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Reader::body at line 293. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/ole_chart/legacy_presentation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ole_chart/legacy_presentation.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d0fad0a8ae69c145fb2590bf430b297ad12aa7d34d273d5f02a89ac05b9e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/drawing_style.rs: crates/rhwp-ooxml-chart/src/drawing_style.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rhwp_ooxml_chart::drawing_style::resolve at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/drawing_style.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/drawing_style.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd0d418f7e7994430c4d22d302b3fcf4f1ed3b2c6f45e4cc30c7109f22922ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/outputs/pdf.rs: src/cli/outputs/pdf.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::cli::outputs::pdf::export_pdf at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/outputs/pdf.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outputs/pdf.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e0b992ad61561832756bd711a7a06ab3bfc4b9b2238f7dc5904b4f59a9ca4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/font_catalog.rs: src/renderer/skia/font_catalog.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TypefaceCatalog::load at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/font_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":"src/renderer/skia/font_catalog.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff44707ad3a5c3340f0fc08b2f043ba151529c23e9455b8714396a3540fb1df6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/paragraph_block/validation/support.rs: src/document_core/commands/paragraph_block/validation/support.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Scan::control at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/paragraph_block/validation/support.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/validation/support.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"28427be7b37305f3ebe5b46bc0628c197a3dcd978acc1386f059aa1b8f63604d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/order.rs: src/renderer/typeset/controls/order.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rhwp::renderer::typeset::controls::order::for_paragraph_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/order.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/order.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"68722869cd7092c7ca95024746b30389e2bfc800d8d5028a324ef6810cad6f9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/robustness.py: gym/tools/robustness.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in robustness.deterministic_mutants at line 755. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/robustness.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":"gym/tools/robustness.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"623f3646a157a79fd98cc56e274c616eef6c71d9e4b051c28ffa3ab5c370b213"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/foreign_paste.rs: src/document_core/commands/foreign_paste.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DocumentCore::paste_foreign_document_native 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/foreign_paste.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/foreign_paste.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a50edd8d0d2772800ed1a9981cfa9ba3fff11637a3d937cb777b6d6c657f42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/composer/inline_box_rows.rs: src/renderer/composer/inline_box_rows.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::renderer::composer::inline_box_rows::normalized_host_with_table_height_with_storage at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/inline_box_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/inline_box_rows.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"022c45252ab9f663cf3654d0fa3ed00697f01a65727a460cc51cc49ad7731e0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/inline_flow/plan.rs: src/renderer/typeset/inline_flow/plan.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::renderer::typeset::inline_flow::plan::build_plan_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/inline_flow/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":"src/renderer/typeset/inline_flow/plan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9911b253741524e875cf1c75d48cbe41873b3891eace12936e2062d8870c5c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/text_shaping.rs: src/renderer/skia/text_shaping.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rhwp::renderer::skia::text_shaping::prepare_shaped_spans at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/text_shaping.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_shaping.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4519bcd868f50deed8bcb86edb1f5624f2bb1f60ddf896be27bbedf8df7b052"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/canvaskit_m07_pack_contract.rs: src/renderer/canvaskit_m07_pack_contract.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhwp::renderer::canvaskit_m07_pack_contract::op_from_matrix_row at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/canvaskit_m07_pack_contract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvaskit_m07_pack_contract.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d859d133ff697a195a2f1afada1e5f409a671263c847a1f50f4f686701732e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/fidelity_compare/fidelity_compare.py: tools/fidelity_compare/fidelity_compare.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in fidelity_compare.main at line 3327. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/fidelity_compare/fidelity_compare.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":"tools/fidelity_compare/fidelity_compare.py"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f41b94451169466f25e1ab1bb8e88ef62ef20019f6f9d5ccb699d129e0526d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/shaping_context.rs: src/renderer/shaping_context.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in HorizontalShapingTransaction::shadow_measure_with_instance_request at line 755. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/shaping_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":"src/renderer/shaping_context.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fdd93028a380e221d40e5ea371f0ff652ecf158c7684f6a47a3c3b06bde228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/sfnt-face.ts: rhwp-studio/src/core/sfnt-face.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in sfnt-face.normalizeFontFaceData at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/sfnt-face.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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef352e9a1784c4054a215578276debd06d72ba2401b29a1f91c2845bebb35d7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_script_operand.rs: src/renderer/equation/parser_script_operand.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EqParser::parse_script_span at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_script_operand.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_script_operand.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e39a79900bdf93d853e1f95fc77467d28c742c78c27db5307bcb50c3475766"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/ui/style-edit-dialog.ts: rhwp-studio/src/ui/style-edit-dialog.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in StyleEditDialog.onConfirm at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/ui/style-edit-dialog.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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9b6e0eaf713c15beea0f0b1ec80c061f1fb69de1d1fb386cfdd6bb03f55317"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-shared/pdf/import-session.js: rhwp-shared/pdf/import-session.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in import-session.snapshotOptions at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-shared/pdf/import-session.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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e86d3c9a7632d22ae932a9f417b2de721412a4b711fd9be0fde48242565fe0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/paragraph_block/template.rs: src/document_core/commands/paragraph_block/template.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::document_core::commands::paragraph_block::template::validate_source_fill at line 241. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/paragraph_block/template.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/paragraph_block/template.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbc122573dc2b5178e1ae99739773f51e29c7366fa293c3067ab66af9d19ae9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/patch.rs: crates/rhwp-ooxml-chart/src/patch.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Planner::clone_series at line 702. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/patch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/patch.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ac19b17d3515542bdd01d228499b3340c00250cb303ddbe54ca03b0a435af0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout/paren_geometry.rs: src/renderer/equation/layout/paren_geometry.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in EqLayout::layout_paren at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/paren_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":"src/renderer/equation/layout/paren_geometry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"838cdea8bdb552a9d532dcf502c49593b8924f686957eca53b2f09308d4aa4b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/tac_flow.rs: src/renderer/typeset/controls/tac_flow.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TacFlowQuery::tac_table_line_index at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/tac_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":"src/renderer/typeset/controls/tac_flow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a2875f3bb2256f74cc5e37425230f7e75d9ce6d41d5befa5969b83054239e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_inline_row_frame.rs: src/renderer/layout/table_layout/stored_inline_row_frame.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LayoutEngine::stored_inline_restart_row_end_frame 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_inline_row_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_inline_row_frame.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17d50ee950882ec85cc739b0fef46551218048708626e16a4369b6c3202274f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-shared/pdf/import-worker.js: rhwp-shared/pdf/import-worker.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in import-worker.onmessage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-shared/pdf/import-worker.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":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a2b90daea0e394c935e435c2d1265222ac14de041e29cc81890d024f09fc27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/clone_identity/remap.rs: src/document_core/commands/clone_identity/remap.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rhwp::document_core::commands::clone_identity::remap::reidentify_with_allocator at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/clone_identity/remap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/clone_identity/remap.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01a648ad28080310f03ae91453a9a83d9eeb9e685e04fa790da187765e5a3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_zero_origin.rs: src/renderer/layout/table_layout/stored_zero_origin.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LayoutEngine::stored_zero_origin_text_frame_break_witness at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_zero_origin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_zero_origin.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"20faeb0c7ecfdd26594348dcd32f2b85478caf4ff3f06ecda27899ed311cabdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/wrap_flow.rs: src/renderer/typeset/controls/wrap_flow.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::renderer::typeset::controls::wrap_flow::place 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/wrap_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":"src/renderer/typeset/controls/wrap_flow.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0fd6f7f4cec215c0b36984ad4520752881b4b30e8855b6ee38f8c83132c50b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/from_e2e.mjs: gym/tools/from_e2e.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in from_e2e.consumeContractLiteral at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/from_e2e.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/from_e2e.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb9d1d430abc0df99160424b6ee0b4546acf195319547d2989bccdcd4b968f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/extract_char_shape_ir.py: scripts/extract_char_shape_ir.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in extract_char_shape_ir.main at line 405. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/extract_char_shape_ir.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":"scripts/extract_char_shape_ir.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"036d75e4cf6dd94ff86f3cad21e4b8dfff838675536c26757095e3d0b9dd370d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/extract_verified_symbol_metrics.py: scripts/extract_verified_symbol_metrics.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in extract_verified_symbol_metrics.main at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/extract_verified_symbol_metrics.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":"scripts/extract_verified_symbol_metrics.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a90a71a73d1378d0d0355bce77afb14c3cbbf2d288704fddebac8594dce66ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/loadsave_sweep/judge.py: tools/loadsave_sweep/judge.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in judge.main 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/loadsave_sweep/judge.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":"tools/loadsave_sweep/judge.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e572b690f021600478a280d2420c0f2fa21bcc49db8a35d007dfd65e2b3261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/text_decoration.rs: src/renderer/text_decoration.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rhwp::renderer::text_decoration::resolve_page_phases at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/text_decoration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/text_decoration.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"af09629dbe3228c226b7f496e5a47639c33db69123d8f764130f113b0def371d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-chrome/sw/thumbnail-extractor.js: rhwp-chrome/sw/thumbnail-extractor.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in thumbnail-extractor.extractPrvImageFromZipAsync at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-chrome/sw/thumbnail-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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb29dff66ccb30b0f88e92034a4fc75b53aeeb01b48e94757e98f8753cbf3374"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-firefox/sw/thumbnail-extractor.js: rhwp-firefox/sw/thumbnail-extractor.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in thumbnail-extractor.extractPrvImageFromZipAsync at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-firefox/sw/thumbnail-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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aae4130446472ffe4e9897f364adf72ea0ab5eb84cfacfcfbab7ab7cd3e0de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-safari/src/background.js: rhwp-safari/src/background.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in background.extractPrvImageFromZip at line 460. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-safari/src/background.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":"rhwp-safari/src/background.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38377c0e48d45f9f68f7c562b5f6d805515ef10c393b81811a7577d5eee64ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/oracle_profile_contract.mjs: scripts/oracle_profile_contract.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in oracle_profile_contract.validateOracleProfileContract at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/oracle_profile_contract.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1f118003ec9fb66ddd20618f9b5ab5de3ada58dac70afcaa9ecdb3c54ff3de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/viewport-manager.ts: rhwp-studio/src/view/viewport-manager.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ViewportManager.onWheel 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/viewport-manager.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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"89794ce5afb1c3869b0ffbd3fd36c0601fa92dec685097876f2a945d6f83c9e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_mixed_opening_frame.rs: src/renderer/layout/table_layout/stored_mixed_opening_frame.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in LayoutEngine::stored_mixed_opening_cell_frame at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_mixed_opening_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_mixed_opening_frame.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"479b0b8b7fab5f0e01cde6ee898e945d1557427c0d089db70d90e54ba64478fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/mini_cfb.rs: src/serializer/mini_cfb.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in rhwp::serializer::mini_cfb::build_cfb_with_storage at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/mini_cfb.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/mini_cfb.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1de53b9e62258254112833c4b0cb638ec877984550dc58d72bcdf0d7881c76c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/float_placement/stored_editor_tail_frame.rs: src/renderer/float_placement/stored_editor_tail_frame.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::renderer::float_placement::stored_editor_tail_frame::stored_editor_tail_frame 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/float_placement/stored_editor_tail_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/stored_editor_tail_frame.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da41fd1ef2cb11e78d7cc43048b4ce8b7ed547bd32804c70488e85342584d5fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/collect-postmerge-duration-data.mjs: scripts/collect-postmerge-duration-data.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in collect-postmerge-duration-data.collectPostmergeDurations 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/collect-postmerge-duration-data.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aee09ff81297cb1c89c8540b669888b6f2fd9face6234eb45ed2b25162623a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/controls/tac_fit.rs: src/renderer/typeset/controls/tac_fit.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::renderer::typeset::controls::tac_fit::prepare at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/tac_fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/tac_fit.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6206a8c12f6e1b2c63e7cab935f6ac4f03f387bf7fd2cd6e61e29f0c6ea8e21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wasm_api/pdf_import.rs: src/wasm_api/pdf_import.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::wasm_api::pdf_import::options 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/wasm_api/pdf_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api/pdf_import.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d7d2a2b8f607f371b15aeebafe34b1b2765853ad4b2f0d7250a4f6492618bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/flow-image-clip.ts: rhwp-studio/src/view/flow-image-clip.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in flow-image-clip.collectFlowImagePaintOps at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/flow-image-clip.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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eff1ec2275e979bcccb6ebe4a414297be4dde85f4af6d8d332a5a33b8612fec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/legacy_font_advances.rs: src/renderer/legacy_font_advances.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::renderer::legacy_font_advances::select_native_programs 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/legacy_font_advances.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/legacy_font_advances.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e29ad9aae7770daf08d858d360776e40f3c7a576c29b6f5bf68aa404b4ad7ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/flow_table.rs: src/renderer/typeset/notes/endnotes/flow_table.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TypesetEngine::typeset_endnote_flow_tables 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/flow_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/flow_table.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ccc1ce3f2a3ab49efb6b250b2c6a6159ceb49eeae21821dc3cc9d58f1dd12b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/shaping_glyph_vertical.rs: src/paint/shaping_glyph_vertical.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::paint::shaping_glyph_vertical::prepare_vertical_font_delta 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/shaping_glyph_vertical.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/shaping_glyph_vertical.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c201caa22a68b5512be5ec982263151e01b1ff8e88649258291bca4faaa82615"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/security_trailer.rs: src/security_trailer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::security_trailer::open_with_privkey at line 460. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/security_trailer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/security_trailer.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d52e76a3a9a262b6f3827dddd45ac57d696525cc949482663d2691d4034a19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/queries/verification.rs: src/cli/queries/verification.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rhwp::cli::queries::verification::run at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/queries/verification.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/queries/verification.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d389595e5f8205ee6a53e8db8044e25df497e223d8c0fd1bcf87ee225135b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/bookmark_query.rs: src/document_core/queries/bookmark_query.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DocumentCore::delete_bookmark_native at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/bookmark_query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/bookmark_query.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d19f3b8190f8049f55a12eb482ad6fd974dd2575d4cb2cf25c34703c8572ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/commands/pdf_import.rs: src/cli/commands/pdf_import.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rhwp::cli::commands::pdf_import::parse_args at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/commands/pdf_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/commands/pdf_import.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0df6239f6d384c54bbd08585df15793e073e146ffc652606db0267da5290394"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/image-crop-scale.ts: rhwp-studio/src/view/image-crop-scale.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in image-crop-scale.imageCropSourceRect 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/image-crop-scale.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":"rhwp-studio/src/view/image-crop-scale.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c7f16d52ca8c729e1a089aeff1fb3c7e390dc28cb130dff49bbbc2305ece37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/visual-sweep-font-environment.mjs: scripts/visual-sweep-font-environment.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in visual-sweep-font-environment.applySweepFontEnvironment at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/visual-sweep-font-environment.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual-sweep-font-environment.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4739c15fbb6bfcbe6df2514eaf80696fa9270479901db111bcc9e6efb4b7e977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/paper_viewport.rs: src/paint/paper_viewport.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PagePaintContext::publish_glyph_geometry at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/paper_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":"src/paint/paper_viewport.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544973e26ad742975ed5f2e18d8d4a7822cd7924ce23f95eb08aad6ff135d5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/hangul_row_heights.py: tools/hangul_row_heights.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in hangul_row_heights.main 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/hangul_row_heights.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":"tools/hangul_row_heights.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4601e7b614e9bf7bb765ddecab4c3e8fe4e1fa0954a9edb424f3c12ed2da7b8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/image_header/svg.rs: src/renderer/image_header/svg.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in rhwp::renderer::image_header::svg::parse_header at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/image_header/svg.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_header/svg.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8b767233143a9b9073e2d636ba16588b0174f3d01d212bacc5458f66a3512a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/ui/chart-data-dialog.ts: rhwp-studio/src/ui/chart-data-dialog.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ChartDataDialog.menuItems at line 270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/ui/chart-data-dialog.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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dcae52341469f33f3768dd005f322ba4c84e1fe29af4b7461f6c3c7334dddf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvaskit/svg-image-header.ts: rhwp-studio/src/view/canvaskit/svg-image-header.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in svg-image-header.parseSvgImageHeader at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvaskit/svg-image-header.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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0746981375af11654909d0ac771b7bc21c1d2def4d5eb2f4d061d0e774ea2114"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/view/canvaskit/raster-stroke.ts: rhwp-studio/src/view/canvaskit/raster-stroke.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in raster-stroke.rasterLineGeometry at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/view/canvaskit/raster-stroke.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":"rhwp-studio/src/view/canvaskit/raster-stroke.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b944942da5abdf730343ad1f01ff25bfa6a4886b54e7363e743e6c688eaf6d34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_empty_frame_restart.rs: src/renderer/layout/table_layout/stored_empty_frame_restart.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LayoutEngine::stored_heading_before_inline_frame_cut at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_empty_frame_restart.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_empty_frame_restart.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35cf1b2454545866eef3ce668995a562a3748b1386ee2a8c315ba0369758986"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/oracle_public/page_smoke.py: tools/oracle_public/page_smoke.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in page_smoke.load_manifest 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/oracle_public/page_smoke.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b86da73bae43a682ef1d09bdea4ed0226b24cab9d6c07dde5356a8016f5257"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/protocol/plan/execution.rs: src/cli/protocol/plan/execution.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in rhwp::cli::protocol::plan::execution::run_plan_engine at line 426. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/protocol/plan/execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/protocol/plan/execution.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54e74b596bbd63efa4c829a8aeb039ae43b65a128297bc109ad1adca027e9cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/table_equal_size.rs: src/model/table_equal_size.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Table::equalize_cell_block 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/table_equal_size.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table_equal_size.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa5571939484f3f79d76b3e41a71d8f6052ec652ba6a5109863d7ff2b40758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/text_direction.rs: src/renderer/text_direction.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::renderer::text_direction::resolve_page at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/text_direction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/text_direction.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f70df79b3e0e7a35e4a127a8a64e507669389f30b17bac78dce144e14c8fe6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/paragraph/overflow.rs: src/renderer/typeset/paragraph/overflow.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rhwp::renderer::typeset::paragraph::overflow::tail_overflow_candidate at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/overflow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/overflow.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd8c4dd838e4e35e9f9c34c67820e15d88e09c52123106e19454d87442a21ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_alignment.rs: src/renderer/equation/parser_alignment.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EqParser::parse_eqalign at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_alignment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c872470c60a8e7aeab50f46cff9c8f83d9518ed9ffa8aaf9ca898c4a3c6eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/render_normalization/stored_nested_text_frames.rs: src/renderer/render_normalization/stored_nested_text_frames.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::renderer::render_normalization::stored_nested_text_frames::prove_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/render_normalization/stored_nested_text_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/render_normalization/stored_nested_text_frames.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da904db639fc210107000e3f8934c7d8b3b18144cce52ffbaf47bcc98663c2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/canvas_metric_requests.rs: src/document_core/canvas_metric_requests.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Collector::paragraphs at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/canvas_metric_requests.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/canvas_metric_requests.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"872643aceb00b66362df6ea06d59581ac33ab7b46007ab2f3f5cfb41235c5ac9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/pack_health.py: gym/tools/pack_health.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in pack_health.scan_check_contract at line 1173. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/pack_health.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":"gym/tools/pack_health.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"733c5ab421f2ff4d33698bc0df6aeca01b150a1aaafa1092901d6e7335bfcb19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/raster_stroke.rs: src/renderer/raster_stroke.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::renderer::raster_stroke::raster_line_geometry 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/raster_stroke.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/raster_stroke.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32dd9cec7198202dab162d43d4c281853e6f96482d383d8c20a3e603cfa5388"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/rowspan_fragment_height.rs: src/renderer/layout/table_layout/rowspan_fragment_height.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LayoutEngine::straddle_page_band_relief 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/rowspan_fragment_height.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/rowspan_fragment_height.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cbf2c4d848d3fbe935f497b3f328d5f2dfabff6f4c279572c70d50979a2e05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_inline_closing_frame.rs: src/renderer/layout/table_layout/stored_inline_closing_frame.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LayoutEngine::stored_inline_picture_closing_row_height 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_inline_closing_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_inline_closing_frame.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3797d1425060601de7727dd8734e0e186c1f8e86c4096e1cb28b9bdfde1e0323"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/paragraph_block/rows_geometry.rs: src/document_core/commands/paragraph_block/rows_geometry.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rhwp::document_core::commands::paragraph_block::rows_geometry::inspect at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/paragraph_block/rows_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":"src/document_core/commands/paragraph_block/rows_geometry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6b3a4e4bd6405f6452de71b5ed427e5dcd4d037140abb81a2984c25ae76e87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser/pdf/policy.rs: src/parser/pdf/policy.rs changed 3 times in last 90 days, max cyclomatic complexity 23 in BackendOverrides::apply at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/policy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/policy.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2acf772db3b621d5cc45a869ddab11518ced6cc3119ae74d2413ce8aafaf7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/font_rank8_private_qualification.py: scripts/font_rank8_private_qualification.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in font_rank8_private_qualification.build_public at line 799. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/font_rank8_private_qualification.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":"scripts/font_rank8_private_qualification.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4008a35d1ed9624f4dfec6e36f87ee0dfd136ce4167174171dc1dd8ff73c05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/stroke_pattern.rs: src/renderer/stroke_pattern.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in StrokeDash::intervals at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/stroke_pattern.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/stroke_pattern.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22397d32386fc1a9c8597d322b65005a3ad8c6c974eea49dd8b930b33da62b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/cell-lineseg-agreement.mjs: scripts/cell-lineseg-agreement.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cell-lineseg-agreement.storedCells 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/cell-lineseg-agreement.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/cell-lineseg-agreement.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2050819ae9d38822ebe6040d4d577a6c329b8a63eb2f24dcde1766799699395b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/identity/walk.rs: src/model/identity/walk.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rhwp::model::identity::walk::walk 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/identity/walk.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/identity/walk.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6296983013d862c7e06e52e76e2bc685668faefb9cea853402e51e1b82e5756d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/release_diff.py: gym/tools/release_diff.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in release_diff._values_equal at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/release_diff.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":"gym/tools/release_diff.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"634267c8c346f477ceae1adb7c7049e9c214649c83e49a0ef5c7863cad539f31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/skia/text_replay/marks.rs: src/renderer/skia/text_replay/marks.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::renderer::skia::text_replay::marks::draw 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/text_replay/marks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay/marks.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a360bdef6e9b5f2cd472688446ef57dd595f25411633078ef8def0b3638efcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/font_fallback.rs: src/renderer/font_fallback.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rhwp::renderer::font_fallback::generic_fallback 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/font_fallback.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_fallback.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"439bfdbf819bae884a4502146d40cb31325a9600f04efbff180b8eaaa6d69971"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/bitmap_raster.rs: src/renderer/bitmap_raster.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhwp::renderer::bitmap_raster::prepare_bitmap 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/bitmap_raster.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9094ec8965fda43927428aef809e8d5035e1406e1fc6f561c3e49ba15723a31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/table/row_frames.rs: src/model/table/row_frames.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Table::closing_row_frames_with_storage 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/table/row_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table/row_frames.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"197cb5e34a55848708837332dcf8435e141ebc92619ca07da4f16330a1b96e79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/inline_flow/stored_host.rs: src/renderer/inline_flow/stored_host.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::renderer::inline_flow::stored_host::plan_stored_body_wide_host 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/inline_flow/stored_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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e11b84d15bf66ad6ed1b6ba3347215553e9103464208d214a365e99993aae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/prepare_hft_hangul_font.py: scripts/prepare_hft_hangul_font.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in prepare_hft_hangul_font.restore at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/prepare_hft_hangul_font.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":"scripts/prepare_hft_hangul_font.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f04bba89df7410467d48d89bfc157886504e1b56c298a45e633254dee8ea9ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/editor/transport.js: npm/editor/transport.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EditorTransport._handlePortMessage at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- npm/editor/transport.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":"npm/editor/transport.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff9c001f69395fbf94076bf4771668d18a3304fa6450247db5b063d87991dc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_structures.rs: src/renderer/equation/parser_structures.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EqParser::parse_matrix 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_structures.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_structures.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad591cf7e4e22492d689b639ced1b7de6b49a214a0c44c65b9f344c8cfec7330"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/embed/runtime.ts: rhwp-studio/src/embed/runtime.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in runtime.installEmbedRuntime 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/embed/runtime.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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f85304cfd5c8380f9eee9d7fe742084aeeebc573a5b6daf40ecfac88d0e01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-desk/ui/js/batch.js: rhwp-desk/ui/js/batch.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in BatchRunner.run 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-desk/ui/js/batch.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":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3901cd7132b7654543489101678ffe0bf52bcb66c4a6c63f60f950643eee5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout/ladder_geometry.rs: src/renderer/equation/layout/ladder_geometry.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EqLayout::layout_ladder 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/ladder_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":"src/renderer/equation/layout/ladder_geometry.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9575d89f59850f5d6c76126dab3dab56030ae838a7b3f3989e7b791419658a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-shared/sw/download-interceptor-common.js: rhwp-shared/sw/download-interceptor-common.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in download-interceptor-common.classifyDownload 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-shared/sw/download-interceptor-common.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":"rhwp-shared/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc985bba3e02c59a2615e6a302c38cab10ef367de688ff1fb446e34fe9dbf84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/dar/conformance.py: tools/dar/conformance.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in conformance.check_datp at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/dar/conformance.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":"tools/dar/conformance.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a681b6a0bae57f9890182eb443a7b60db39586e3c6d349dc7793bef876e3b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/table_layout/stored_nested_outer_frame.rs: src/renderer/layout/table_layout/stored_nested_outer_frame.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LayoutEngine::stored_nested_cut_outer_margin_extra 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_nested_outer_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_nested_outer_frame.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9db5dfa2fd2b8663487fb6f8c05f7d551f31ad0082181947b432af722cc73b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/wmf/converter/svg/util.rs: src/wmf/converter/svg/util.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Font::set_props at line 376. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/wmf/converter/svg/util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/util.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"800feca634e5dc537ecf5b556555c8e3c175998d335d7b6ac0efd28ab14686b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/package_check.rs: src/serializer/hwpx/package_check.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rhwp::serializer::hwpx::package_check::check_package 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/package_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":"src/serializer/hwpx/package_check.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efef90a78d3665ac5aa22d1dc2d7fce7168f3cdd5190196a112b1f132423293"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/competitive_bench.py: gym/tools/competitive_bench.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in competitive_bench.render_report at line 687. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/competitive_bench.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":"gym/tools/competitive_bench.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278a38f29a1be5fcb1a9187a05bcbd16bbd37e33280d2f9af761e4f88915d49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/image_resolver/print_alpha.rs: src/renderer/image_resolver/print_alpha.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rhwp::renderer::image_resolver::print_alpha::print_alpha_payload 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/image_resolver/print_alpha.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_alpha.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a16fddcb48cf1a62d8c09923912e907745c5a56689d4e0c5f6d278fb7dea0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/queries/hyperlink_geometry.rs: src/document_core/queries/hyperlink_geometry.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in DocumentCore::collect_layer_hyperlinks at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/queries/hyperlink_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":"src/document_core/queries/hyperlink_geometry.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395c095caa88443867df447bb877e1ea24fe22936a289f0fb69bac534c3a311"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/layout/plain_matrix_geometry.rs: src/renderer/equation/layout/plain_matrix_geometry.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EqLayout::layout_plain_matrix 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/plain_matrix_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":"src/renderer/equation/layout/plain_matrix_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaf6f98b5c10ae5a7b418d422ea15270630c8b243caa497e3a3ccda5a50e77d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/export-wasm-for-sweep.mjs: scripts/export-wasm-for-sweep.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in export-wasm-for-sweep.main 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/export-wasm-for-sweep.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a08f84cc9f05a9fdba52a14be2a2dacc8f8379b9e9ef7ebc30a10184293e96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/dar/transaction.py: tools/dar/transaction.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in transaction.parse_policy at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/dar/transaction.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":"tools/dar/transaction.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ce937b174951b3782bd5077652dca72c5e7201027cfb7fc784036d2a633ebc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/layout/square_host_flow.rs: src/renderer/layout/square_host_flow.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LayoutEngine::layout_wrap_around_paras at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/square_host_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":"src/renderer/layout/square_host_flow.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"42293e9b544f6ac5796193520965b143bd2dee4d1fc282c42f00299710106c2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/html_import/inline_content.rs: src/document_core/commands/html_import/inline_content.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in DocumentCore::parse_inline_content at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/html_import/inline_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ce61c7a4f4b724e50869f9333d7d2b0239e1e39aa376d657cffcd8891f10b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/ui/pdf-import-dialog.ts: rhwp-studio/src/ui/pdf-import-dialog.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PdfImportDialog.onConfirm at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/ui/pdf-import-dialog.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":"rhwp-studio/src/ui/pdf-import-dialog.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d81e23f1610afc2e2d218889eb305cc4b2e3bf36645b8e42f6ef7a5cfc726c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/svg/pua_glyph.rs: src/renderer/svg/pua_glyph.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SvgRenderer::prepare_pua_glyphs at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/svg/pua_glyph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg/pua_glyph.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd86b1c1104df1911625f1430dfd4a22d50a1c772708dabceb368aeecf8f155"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gym/tools/differential.py: gym/tools/differential.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in differential._values_equal at line 415. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- gym/tools/differential.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":"gym/tools/differential.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5570168d2d1cdc96d36b9516e7fd298a67769cc622706464dbcb756a86bc6ddf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/strategist/engagement.py: tools/strategist/engagement.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in engagement.run_engagement at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- tools/strategist/engagement.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":"tools/strategist/engagement.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a44085a67052ad6de40b8d4e74dca9941d904dd86a86604452ad75968615b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/commands/caption_validation.rs: src/cli/commands/caption_validation.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rhwp::cli::commands::caption_validation::run 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/cli/commands/caption_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":"src/cli/commands/caption_validation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25dc8e21887b30e11dac7c58496c6676383798f0c4affc5f0ee9c779b835ab2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/document_core/commands/document/tac_cache_repair.rs: src/document_core/commands/document/tac_cache_repair.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rhwp::document_core::commands::document::tac_cache_repair::repair_cell_width_caches 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/document/tac_cache_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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa570d977ca01b2bfa212743600e21bd20ffc459553d6e1bead0ee8fd8aecba6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rhwp-ooxml-chart/src/renderer/chart_3d.rs: crates/rhwp-ooxml-chart/src/renderer/chart_3d.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rhwp_ooxml_chart::renderer::chart_3d::render_bars_3d 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/renderer/chart_3d.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-ooxml-chart/src/renderer/chart_3d.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"059884c68eac6934bb469406dfa8b6f0c5c8f2460cdce0d77e57a2c5ce62a122"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/form_appearance.rs: src/renderer/form_appearance.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rhwp::renderer::form_appearance::form_drawing at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/form_appearance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/form_appearance.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc279bef153706638e2315a1e04e5b73b9116236cde2cbef60c0edef9fb0fbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/paint/text_v2_export.rs: src/paint/text_v2_export.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PageLayerTree::write_text_v2_export 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/text_v2_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":"src/paint/text_v2_export.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b2548293726ee5aec82bf92cf1722547a7689e255d0bbbe1aeabf5a5e5ca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/oracle_stage5_queue_projection.py: scripts/oracle_stage5_queue_projection.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in oracle_stage5_queue_projection.validate_queue_projection at line 509. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- scripts/oracle_stage5_queue_projection.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":"scripts/oracle_stage5_queue_projection.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76dfb93a886c87ee71ac7f3eeba714550b33517a3e4e445199264ee786c21ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/legacy_coordinate_plan.rs: src/renderer/equation/legacy_coordinate_plan.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Plan::source 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/legacy_coordinate_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":"src/renderer/equation/legacy_coordinate_plan.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd7c59ca3664a02421736156c843c7444dfddd9a7102aedbeda94789b1c70d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/serializer/hwpx/roundtrip/export_cache.rs: src/serializer/hwpx/roundtrip/export_cache.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rhwp::serializer::hwpx::roundtrip::export_cache::project_paragraphs 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/hwpx/roundtrip/export_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/roundtrip/export_cache.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4963ca0cdb4761a1c9e7e59709c349a1e59617d2d56e8ebd3b9bcdccf43a9ec5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/font-decision-trace.ts: rhwp-studio/src/core/font-decision-trace.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in font-decision-trace.canvas2dDecision at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/font-decision-trace.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":"rhwp-studio/src/core/font-decision-trace.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213bf7ba21fa8ff5ebd5bab95e2cff44f9a29b3798b00d2088d9befbbcce5d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/core/document-font-status.ts: rhwp-studio/src/core/document-font-status.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in document-font-status.analyzeDocumentFonts.fonts 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/core/document-font-status.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":"rhwp-studio/src/core/document-font-status.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb97a72239b23efc4c4cafcfa425d70bed649f5b8a48ca0a284204be3ee8389"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/equation/parser_root.rs: src/renderer/equation/parser_root.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EqParser::parse_sqrt at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_root.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_root.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe3412fb4c6f3931f8aa5f6f14641296e2346518101f0b0ae0c55d11cf10cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/renderer/typeset/notes/endnotes/emit.rs: src/renderer/typeset/notes/endnotes/emit.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TypesetEngine::emit_endnote_split 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/emit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/emit.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"083944bab469e109cdc5e261dce976136c84123c611dd4b497b94d11c50db80e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rhwp-studio/src/engine/cell-selection-renderer.ts: rhwp-studio/src/engine/cell-selection-renderer.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CellSelectionRenderer.render 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-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/src/engine/cell-selection-renderer.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":"rhwp-studio/src/engine/cell-selection-renderer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8de42792c2b164e89263a62b8085de9512936007ae3b6d94cb0dbee5a7108c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/mod.rs: src/renderer/equation/mod.rs changed 73 times in last 90 days and 39 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 rhwp::renderer::equation::simple_math_frame_metrics at line 261), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(equation): #8332\uB97C \uAE30\uC874 flow\u00B7paint \uCE90\uC2DC\uC640 \uC911\uBCF5 \uC5C6\uC774 \uD1B5\uD569\u201D; \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix(equation): COL \uC778\uC790\uC640 \uD45C\uC2DC \uC138\uB300\uBCC4 \uC624\uB958\uB97C \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uCC98\uB9AC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/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":"src/renderer/equation/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb22f54291c478f44444606258ce764e37db886945979abf7d51d6767db3941"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/parser.rs: src/renderer/equation/parser.rs changed 39 times in last 90 days and 29 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 EqParser::parse_fraction_in_range at line 477), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uACF5\uD1B5 \uC88C\uD45C\uC640 \uCCA8\uC790 \uC18C\uC720 \uBCF4\uC874\u201D; \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uAE00\uAF34 \uC804\uD658 \uBC94\uC704\uB97C \uBCF5\uC6D0\u201D; \u201Cfix(equation): COL \uC778\uC790\uC640 \uD45C\uC2DC \uC138\uB300\uBCC4 \uC624\uB958\uB97C \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uCC98\uB9AC\u201D; \u201CMerge upstream/devel into fix/7873-equation-rm-space\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"121a6abc7f2ded5750683dc524e83ccc77a6a652d45f54f6fc00187ea7df718d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/state/commands.rs: src/renderer/typeset/state/commands.rs changed 37 times in last 90 days and 22 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 TypesetState::consume_pending_table_terminal_gap at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uB2E4\uB2E8 \uAC01\uC8FC\uC758 \uC18C\uC720\u00B7\uC608\uC57D\u00B7\uBC30\uCE58 \uD504\uB808\uC784 \uACF5\uD1B5\uD654\u201D; \u201Cfix(typeset): \uBCF8\uBB38 \uAC01\uC8FC\uB97C \uCC38\uC870 \uC904 \uB2E8\uC704\uB85C \uC608\uC57D\uD558\uACE0 \uAC01\uC8FC \uC5EC\uC720\u00B7\uAF2C\uB9AC\uB9D0 \uBC34\uB4DC \uD68C\uC218\uB97C \uC5C6\uC564\uB2E4 (#8468)\u201D; \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix(typeset): \uC774\uC5B4\uC9C0\uB294 \uCABD\uC5D0\uC11C\uB3C4 \uAC19\uC740 \uBB38\uB2E8\uC758 \uB2E4\uC74C \uC800\uC7A5 \uCABD reset \uC744 \uACBD\uACC4\uB85C \uC4F0\uACE0 \uADF8 \uC870\uAC01\uC758 \uC790\uAE30 \uAC01\uC8FC\uB97C \uD45C\uC2DC \uCABD\uC5D0 \uB454\uB2E4\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/state/commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/state/commands.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14e69c26bdd4c645b778f4d60d867d79952cabe3d5f4f2725298ef2ef2ffb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/source_font_symbol.rs: src/renderer/equation/layout/source_font_symbol.rs changed 19 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is rhwp::renderer::equation::layout::source_font_symbol::operator_metrics at line 33), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uAD6C\uD615 \uBB38\uC790 \uD3C9\uBA74\uACFC \uD604\uB300 \uC218\uC2DD \uC0C9\uC0C1 \uACBD\uACC4\uB97C \uACF5\uD1B5 \uACB0\uACFC\uC5D0 \uBC18\uC601\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uCF5C\uB860\u00B7\uC27C\uD45C\uC758 \uC2E4\uC81C \uAE00\uB9AC\uD504\uC640 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: \uC810 \uC5F0\uC0B0\uC790\uC758 em \uD45C\uC2DC \uAE30\uD558 \uACF5\uD1B5\uD654\uC640 \uB3C5\uB9BD Print \uB300\uC870 \uAE30\uB85D\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/source_font_symbol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/source_font_symbol.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7d63db8587b0a76acea5683c53cd4e22883fdaceb283717909980d52cb8165"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs: src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs changed 30 times in last 90 days and 16 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 TypesetEngine::query_reflowed_endnote_fit at line 50), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC800\uC7A5 \uCEF7 \uC804\uC9C4\uB7C9\uC5D0\uC11C \uBCC4\uB3C4 \uAC1C\uCCB4 \uBC29\uCD9C\uC758 \uAE00\uC904 \uC911\uBCF5 \uC81C\uC678\u201D; \u201Cfix: \uC800\uC7A5 \uCEF7 \uB4A4 \uC904\uC758 \uC18C\uC720\uB97C \uC2E4\uC9C8 \uC804\uC9C4 \uD68C\uC218\uC640 \uD568\uAED8 \uAC80\uC99D\u201D; \u201Cfix: \uC800\uC7A5 \uCEF7 \uD310\uC815\uC774 \uACF5\uD1B5 \uBBF8\uC8FC \uC904 \uC7AC\uBC1C\uD589 \uC870\uD68C\uB97C \uC18C\uBE44\uD558\uB3C4\uB85D \uACF5\uAC1C \uBC94\uC704 \uC870\uC815\u201D; \u201Cfix: \uC720\uC9C0\uB41C \uC800\uC7A5 \uB2E8 \uCEF7\uACFC \uC815\uC0C1 \uAE00\uAF34\uC758 \uAD04\uD638 \uC804\uC9C4\uD3ED\uC744 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/paragraph/reflow_fit.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"478f03e09fa8ecb1eacfb7ccd2058273ea73f2aefbd356abdd651796450b4740"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/script_geometry.rs: src/renderer/equation/layout/script_geometry.rs changed 17 times in last 90 days and 14 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 EqLayout::script_subscript_geometry at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uAD6C\uC870 \uD504\uB808\uC784\uACFC \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC778\uB77C\uC778 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/script_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":"src/renderer/equation/layout/script_geometry.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb3da60dc0a662c4dc9b8beb3019f5dbb4832e7099dcecdf7691af7d6d41088"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/table_layout/row_physical_band.rs: src/renderer/layout/table_layout/row_physical_band.rs changed 21 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 13 (its worst body is LayoutEngine::cut_trailing_advances at line 368), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uC911\uCCA9 \uD45C \uC885\uB8CC \uD589\uC758 \uBE48 \uCD5C\uC18C\uC640 \uBB3C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uD1B5 \uC608\uC0B0\uC73C\uB85C \uBC30\uCE58\u201D; \u201Cfix: \uC2E4\uC81C \uB0B4\uC6A9 \uCEF7\uACFC \uBE48 \uC774\uC5B4\uBC1B\uAE30 \uC870\uAC01\uC758 \uBB3C\uB9AC \uC5EC\uBC31 \uC18C\uC720 \uBCF4\uC874\u201D; \u201Cfix: \uC800\uC7A5 \uCEF7\uC758 \uC218\uC6A9 \uADFC\uAC70\uC640 \uC774\uC5B4\uBC1B\uAE30 \uD589\uC758 \uBB3C\uB9AC \uD504\uB808\uC784 \uBCF5\uC6D0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/row_physical_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":"src/renderer/layout/table_layout/row_physical_band.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0430b656f00a3470d77b1b1e3e2a0706ee983469640b93495e4945d59decea00"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/scan/types.rs: src/renderer/typeset/table/scan/types.rs changed 18 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 3 (its worst body is BlockRowScanVars::plain_row_available_height at line 84), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC77C\uBC18 \uCEF7\uC5D0\uC11C \uD655\uC815\uD55C \uBE48 \uC0C1\uC790 \uC18C\uC720\uB97C \uC2A4\uCE94 \uACB0\uACFC\uB85C \uC804\uB2EC\u201D; \u201Cfix: \uC77C\uBC18 \uCEF7\uC758 \uC2E4\uC81C \uBE48 \uC0C1\uC790\uC640 \uCD94\uC815 \uD589 \uCD94\uAC00 \uB760 \uBD84\uB9AC\u201D; \u201Cfix: \uC218\uC6A9\uD55C \uBE48 \uB760\uC758 \uAC19\uC740 \uBB3C\uB9AC \uC7A5\uBD80\uB97C \uBC30\uCE58\uC640 \uC774\uC5B4\uBC1B\uAE30\uC5D0 \uC804\uB2EC\u201D; \u201Cfix: \uCD5C\uC18C \uC870\uAC01 \uAC80\uC99D\uACFC \uBC30\uCE58\uAC00 \uAC19\uC740 \uC218\uC6A9 \uD589 \uC0C1\uC790\uB97C \uC0AC\uC6A9\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/types.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4597c9dbe1cf34c4c863b0e36dd5ab815490b9d11b41927d03129d87defe0e74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/paragraph/metrics.rs: src/renderer/typeset/paragraph/metrics.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 12 (its worst body is FormattedParagraph::flow_advance_height at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC800\uC7A5 \uD45C\uC758 \uD6C4\uC18D \uC6D0\uC810\uC5D0 \uD655\uC815\uB41C \uB05D \uC904\uAC04\uACA9 \uACF5\uC720\u201D; \u201Cfix: \uC7AC\uC870\uD310 \uD638\uC2A4\uD2B8\uC758 \uD45C \uC774\uC6D4\uACFC \uBD84\uD560 \uC870\uAC01 \uC18C\uC720\uB97C \uACF5\uC720\u201D; \u201Cfix: \uD45C \uC55E\uB4A4 \uD638\uC2A4\uD2B8 \uC904\uC758 \uAD6C\uC131\uACFC \uC18C\uC720 \uBC94\uC704\uB97C \uACF5\uC720\u201D; \u201Cfix: \uB2E4\uB2E8 \uB4A4 \uAC04\uACA9 \uC18C\uBE44\uC640 \uD55C\uCEF4 \uC218\uC2DD \uBA85\uB839\u00B7\uCCA8\uC790 \uC785\uB825 \uACBD\uACC4 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/metrics.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9318930258d790cf9ea1d42dfe9db165f9ef7dd91ccd7b75fab3d2e4790b95d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/fraction_geometry.rs: src/renderer/equation/layout/fraction_geometry.rs changed 15 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 13 (its worst body is EqLayout::layout_sqrt at line 200), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uAD6C\uC870 \uD504\uB808\uC784\uACFC \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC778\uB77C\uC778 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: \uC870\uD569\uACFC ATOP\uC758 \uB3C5\uB9BD \uD504\uB808\uC784 \uBC0F \uBE48 \uC218\uC2DD \uD638\uC2A4\uD2B8 \uC904\uC744 \uBCF4\uC815\u201D; \u201Cfix: \uB3C5\uB9BD Print\uC5D0 \uB530\uB77C \uC815\uB82C \uD589\uACFC \uC870\uD569\u00B7\uAE34 \uB098\uB217\uC148\u00B7\uC0C9 \uBC94\uC704\uB97C \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/fraction_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":"src/renderer/equation/layout/fraction_geometry.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67b15a97744869b3efa6443a538ea8681faa87737eb204140b9de8b9d0f275"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/parser_terms.rs: src/renderer/equation/parser_terms.rs changed 10 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 9 (its worst body is EqParser::parse_element_term at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uAE00\uAF34 \uC804\uD658 \uBC94\uC704\uB97C \uBCF5\uC6D0\u201D; \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201CMerge upstream/devel into fix/7873-equation-rm-space\u201D; \u201Cfix(equation): rm\u00B7it \uB294 \uC218\uC2DD \uB05D\uAE4C\uC9C0 \uC9C0\uC18D\uB418\uB294 \uAE00\uAF34 \uC0C1\uD0DC\uC774\uACE0 \uB4A4 \uACF5\uBC31 \uBA85\uB839\uC740 \uAC04\uACA9\uC774\uB2E4 (#7873)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_terms.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/parser_terms.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5fb0600ecdfdc8676fd755eea0dec2c74cfd27a14432b4cb7b0638fcc65acc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/scan/row.rs: src/renderer/typeset/table/scan/row.rs changed 15 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 7 (its worst body is RowScanQuery::plain_cut_physical_height at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typeset): \uBCD1\uD569 \uCE78 \uC548\uCABD \uD589\uC740 \uB0B4\uC6A9\uC774 \uB4E4\uC5B4\uAC00\uBA74 \uCABD \uB05D\uC5D0\uC11C \uB05D\uB0B8\uB2E4\u201D; \u201Cfix: \uAC78\uCE68 \uC140\uC758 \uBB3C\uB9AC \uC794\uC5EC\uC640 \uB0B4\uC6A9 \uC885\uB8CC \uC694\uAD6C \uACF5\uC720\u201D; \u201Cfix: \uCD5C\uC18C \uC870\uAC01 \uAC80\uC99D\uACFC \uBC30\uCE58\uAC00 \uAC19\uC740 \uC218\uC6A9 \uD589 \uC0C1\uC790\uB97C \uC0AC\uC6A9\u201D; \u201Cfix: \uC800\uC7A5 \uD589 \uC0C1\uC790\uC758 \uAE30\uD558 \uC644\uACB0\uC131\uC73C\uB85C RowBreak \uBD84\uD560\uC744 \uAE08\uC9C0\uD558\uC9C0 \uC54A\uC74C\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/row.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/row.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29cfbbde40dce12e8482f8f93b2050b8808733b980c9bff7f646d7fedad1531"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/symbols.rs: src/renderer/equation/symbols.rs changed 11 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 12 (its worst body is rhwp::renderer::equation::symbols::lookup_symbol at line 638), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uC804\uBD80 \uB300\uBB38\uC790\uB85C \uC4F4 \uADF8\uB9AC\uC2A4 \uBB38\uC790 \uC774\uB984\uC744 \uB300\uBB38\uC790 \uADF8\uB9AC\uC2A4 \uBB38\uC790\uB85C \uC77D\uB294\uB2E4 (#7390)\u201D; \u201Cfix: \uBA85\uC2DC\uC801 \uACF5\uAC04\uC758 \uD56D \uC18C\uC720\uC640 Unicode \uB17C\uB9AC \uAE30\uD638\uB97C \uBCF4\uC874\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uCF5C\uB860\u00B7\uC27C\uD45C\uC758 \uC2E4\uC81C \uAE00\uB9AC\uD504\uC640 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: \uADF8\uB9AC\uC2A4 \uAE30\uD638\uC758 \uBCC0\uD615\uACFC \uB77C\uD2F4 \uC2A4\uD0C0\uC77C\uC744 \uB3C5\uB9BD Print \uACC4\uC57D\uC73C\uB85C \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/symbols.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/symbols.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c491b7376db06e94ae618823e54fdce3f4bbd4a12b4986a073c3a08912be132"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/source_font_text.rs: src/renderer/equation/layout/source_font_text.rs changed 10 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 12 (its worst body is rhwp::renderer::equation::layout::source_font_text::layout at line 42), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD55C\uCEF4 \uD589\uB82C\uC758 \uACF5\uD1B5 \uC904 \uD504\uB808\uC784\uACFC \uADFC\uD638 \uAD04\uD638 \uC18C\uC18D \uBCF4\uC815\u201D; \u201Cfix: \uBCF5\uD569 \uC704\uCCA8\uC790\uC758 \uB300\uBB38\uC790 \uC5EC\uBC31\uACFC \uB17C\uB9AC \uAE00\uC790 \uC804\uC9C4\uC744 \uACF5\uC720\u201D; \u201Cfix: \uC218\uD559 \uBCC0\uC218\uC758 \uC815\uCCB4\uC640 \uD569\uC131 \uAD75\uAE30 \uCD9C\uB825 \uACC4\uC57D \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uB300\uBB38\uC790 FontGlyph\uC758 \uC815\uC801 face \uCC38\uC870 \uD0C0\uC785 \uAD50\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/source_font_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":"src/renderer/equation/layout/source_font_text.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c03618ffdf41800d492ec9caa3a5468c2231528384081d449d918b607a6916"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/font_frame_metrics.rs: src/renderer/equation/font_frame_metrics.rs changed 8 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 5 (its worst body is rhwp::renderer::equation::font_frame_metrics::accent_at_dpi at line 200), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC801\uBD84 \uCCA8\uC790 \uC778\uC790\uC640 \uCD95\uC18C \uAE00\uC790\u00B7\uADFC\uD638 \uC544\uB798\uCCA8\uC790 \uD504\uB808\uC784\uC744 \uBCF4\uC815\u201D; \u201Cfix: \uC218\uC2DD \uC804\uC6A9 \uC904\uC758 \uACF5\uD1B5 \uAE30\uC900\uC120\uACFC \uBD84\uC218 \uCCA8\uC790 \uD504\uB808\uC784 \uBCF4\uC815\u201D; \u201Cfix: \uBD84\uC218\uC758 \uCE21\uC815 \uD504\uB808\uC784\uACFC \uC2E4\uC81C \uAE00\uC904 \uAE30\uC900\uC120 \uACF5\uC720\u201D; \u201Cfix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/font_frame_metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/font_frame_metrics.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cd83105189b15fe450a06a4a22750ce21ac95119d2abb3bac710a0b39153a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/controls/shape_flow.rs: src/renderer/typeset/controls/shape_flow.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 13 (its worst body is rhwp::renderer::typeset::controls::shape_flow::prepare at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typeset): \uBB38\uB2E8 \uC790\uAE30 \uC904 \uC544\uB798\uC5D0 \uB193\uC778 \uC790\uB9AC\uCC28\uC9C0 \uAC1C\uCCB4\uB294 \uADF8 \uC904\uB4E4\uC744 \uBC00\uC9C0 \uC54A\uB294\uB2E4 (#8491)\u201D; \u201Cfix(typeset): \uC6A9\uC9C0 \uBC16\uC73C\uB85C \uC624\uD504\uC14B\uB41C \uBB38\uB2E8 \uAE30\uC900 \uC790\uB9AC\uCC28\uC9C0 \uAC1C\uCCB4\uB294 \uD750\uB984\uC744 \uBC00\uC9C0 \uC54A\uB294\uB2E4 (#8462)\u201D; \u201Cfix(typeset): \uAE00\uC904\uB85C \uC774\uBBF8 \uB193\uC778 \uC904\uC758 TAC \uADF8\uB9BC\uC740 \uADF8 \uC904 \uB192\uC774\uB97C \uB2E4\uC2DC \uACC4\uC0C1\uD558\uC9C0 \uC54A\uB294\uB2E4 (#8458)\u201D; \u201Cfix(typeset): \uC800\uC7A5 \uB9AC\uC14B\uC73C\uB85C \uB2E4\uC74C \uCABD\uC5D0 \uAC00\uB294 \uBB38\uB2E8 \uC911\uAC04 \uC904\uC758 \uC790\uB9AC\uCC28\uC9C0 \uB85C\uACE0\uB97C \uB5A0\uB098\uB294 \uCABD\uC5D0 \uB0A8\uAE34\uB2E4 (#8446)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/shape_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":"src/renderer/typeset/controls/shape_flow.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2558fa01ccf6362f63c02b44ec4f5d73fdfe90e8c5b3e13c85b4902c3f2c6fcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/table_layout/reflow_block_frames.rs: src/renderer/layout/table_layout/reflow_block_frames.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 6 (its worst body is LayoutEngine::reflow_cellbreak_row_host_band_height at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix: \uC7AC\uC870\uD310 \uC140\uACFC \uC778\uB77C\uC778 \uAC1C\uCCB4\uC758 \uACF5\uD1B5 \uC904 \uD504\uB808\uC784 \uC804\uB2EC\u201D; \u201Cfix: \uC678\uBD80 \uC790\uC190 \uC810\uC720\uC640 \uBD80\uBAA8 \uC140 \uBB3C\uB9AC \uD504\uB808\uC784 \uBD84\uB9AC\u201D; \u201Cfix: \uC7AC\uADC0 \uC140 \uCEF7\uC758 \uBB3C\uB9AC \uD504\uB808\uC784\uACFC NO_LS \uACA9\uC790 \uC608\uC0B0 \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/reflow_block_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/reflow_block_frames.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"621dcbe5d07afc284332b028869afa8721b8e39114fbcbf6813f894d3912c007"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/canvas_text_font.rs: src/renderer/canvas_text_font.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 5 (its worst body is rhwp::renderer::canvas_text_font::family_chain at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC0C8 devel\uC758 \uACF5\uD1B5 \uC870\uD310 \uACC4\uC57D\uACFC \uB9AC\uBCA0\uC774\uC2A4 \uC18C\uBE44 \uACBD\uB85C \uC5F0\uACB0\u201D; \u201Cfix: \uC790\uC18C\uC758 \uC2E4\uC81C \uC804\uC9C4\uACFC \uAC15\uC870\uC810 \uC18C\uC720\u00B7\uBCF8\uBB38 \uAE30\uC6B8\uC784\uC744 \uACF5\uD1B5\uD654\u201D; \u201Cfix: Canvas \uC6D0 \uAE00\uAF34\uC758 \uC790\uCCB4 \uAD75\uAE30\uC640 fallback \uD569\uC131\uC744 \uAD6C\uBD84\u201D; \u201Cfix(canvas): paint heavy display faces bold like SVG\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/canvas_text_font.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas_text_font.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3217aa710942d7ed9a904321b256bef02cea36b0e66f9f574ed7558b3db4f52a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/native_host/editor.rs: src/native_host/editor.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 6 (its worst body is NativeEditor::update_composition at line 341), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB204\uC801 \uCCB4\uB9AC\uD53D\uC5D0 \uC6D0 PR\uC758 \uD1B5\uD569 \uD574\uC18C \uACB0\uACFC \uBCF4\uC874\u201D; \u201Cfix: reject lossy native clipboard and body edits\u201D; \u201Cfix: guard native command spans before paragraph mutations\u201D; \u201Cfix: reject semantic-control spans in native body edits\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/native_host/editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/editor.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2570ea769f860c6266677405d69903ed74d17280a8495160ba9319e71ac37f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/table_layout/stored_plain_row_frame.rs: src/renderer/layout/table_layout/stored_plain_row_frame.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 13 (its worst body is LayoutEngine::stored_empty_row_frame_height at line 100), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix: \uC800\uC7A5 \uC870\uAC01\uC758 \uAE00\uC904 \uC18C\uC720\uC640 \uC885\uB8CC \uD504\uB808\uC784\uC744 \uCE21\uC815\u00B7\uBC30\uCE58\uC5D0\uC11C \uACF5\uC720\u201D; \u201Cfix: \uC800\uC7A5 \uD589 \uC0C1\uC790\uC758 \uAE30\uD558 \uC644\uACB0\uC131\uC73C\uB85C RowBreak \uBD84\uD560\uC744 \uAE08\uC9C0\uD558\uC9C0 \uC54A\uC74C\u201D; \u201Cfix(renderer): \uC6D0\uBCF8 \uBE48 \uD589\uC758 \uC904 \uC0C1\uC790\uB97C \uBCF4\uC874\uD574 \uCABD \uB05D\uC5D0\uC11C \uC644\uACB0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/stored_plain_row_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/stored_plain_row_frame.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"536b14c143402cc2ec4e414908645cb66632656634aebc69ed20eb7545383e3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/ast.rs: src/renderer/equation/ast.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 5 (its worst body is EqNode::simplify at line 196), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix: \uC218\uC2DD \uC815\uB82C \uCE78\uACFC \uBA85\uB839\uD615 \uCCA8\uC790\uC758 \uC778\uC790 \uC18C\uC18D\uC744 \uBCF4\uC815\u201D; \u201Cfix: \uC911\uC704 \uC67C\uCABD \uCCA8\uC790\uC758 \uD56D \uC18C\uC18D\uACFC \uBE48 \uC218\uC2DD \uD638\uC2A4\uD2B8 \uC904\uC744 \uBCF4\uC815\u201D; \u201Cfix: \uC870\uD569\uACFC ATOP\uC758 \uB3C5\uB9BD \uD504\uB808\uC784 \uBC0F \uBE48 \uC218\uC2DD \uD638\uC2A4\uD2B8 \uC904\uC744 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/ast.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/ast.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e67011e2d953b8fc1b0e5724fb11d506d2767fad8c0e69ee8e1f93a4eba58b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/skia/equation_conv/glyphs.rs: src/renderer/skia/equation_conv/glyphs.rs changed 6 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 rhwp::renderer::skia::equation_conv::glyphs::equation_typeface_chain at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(native): decode equation font codes before character fallback\u201D; \u201Cfix: apply character font fallback to positioned equations\u201D; \u201Cfix: \uBCF8\uBB38 \uC790\uB3D9 \uC904\uACFC \uBA85\uC2DC\uC801 \uAE00\uAF34 \uD504\uB85C\uADF8\uB7A8 \uC694\uCCAD\uC758 \uACBD\uACC4 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/equation_conv/glyphs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/equation_conv/glyphs.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76e5434467b518c0a7029fab97a138f5ee8524a10ab0c3ba88cf1e08402493e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/document_script.rs: src/renderer/equation/document_script.rs changed 6 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 14 (its worst body is rhwp::renderer::equation::document_script::tokenize_with_display at line 18), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 \uBA85\uB839 \uC0AC\uC804\uACFC COL \uB2EB\uD798 \uACC4\uC57D\uC744 \uAD6C\uBD84\u201D; \u201Cfix(equation): COL \uC778\uC790\uC640 \uD45C\uC2DC \uC138\uB300\uBCC4 \uC624\uB958\uB97C \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uCC98\uB9AC\u201D; \u201Cfix: \uD55C\uCEF4 \uBB38\uC11C\uC758 \uAE30\uD638 \uBCC4\uCE6D\uACFC \uBC31\uC2AC\uB798\uC2DC \uBB38\uC790 \uAE00\uB9AC\uD504 \uC804\uD658 \uBCF4\uC815\u201D; \u201Cfix: \uB2E4\uB2E8 \uB4A4 \uAC04\uACA9 \uC18C\uBE44\uC640 \uD55C\uCEF4 \uC218\uC2DD \uBA85\uB839\u00B7\uCCA8\uC790 \uC785\uB825 \uACBD\uACC4 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/document_script.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/document_script.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e298b4ba1a343af61e44cbd82b345d51bfe03a0e3cd5caec7f5d4b915a8edc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/decoration_geometry.rs: src/renderer/equation/layout/decoration_geometry.rs changed 6 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 EqLayout::layout_font_style at line 100), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uAD6C\uC870 \uD504\uB808\uC784\uACFC \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC778\uB77C\uC778 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uC218\uD559 \uC810 \uAE30\uD638\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uC7A5\uC2DD \uBCF8\uCCB4 \uC5EC\uC720\uB97C \uACF5\uC720\u201D; \u201Cfix: \uC218\uD559 \uBCC0\uC218\uC758 \uC815\uCCB4\uC640 \uD569\uC131 \uAD75\uAE30 \uCD9C\uB825 \uACC4\uC57D \uACF5\uD1B5\uD654\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/decoration_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":"src/renderer/equation/layout/decoration_geometry.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9090f9ddfd9dfdc38fe77ba84fb3f46c790d03f88b1b8ce800a782a40468e2a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/continuation/job.rs: src/renderer/typeset/table/continuation/job.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 9 (its worst body is TypesetEngine::begin_resumable_table_pagination at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uB2E4\uB2E8 \uAC01\uC8FC\uC758 \uC18C\uC720\u00B7\uC608\uC57D\u00B7\uBC30\uCE58 \uD504\uB808\uC784 \uACF5\uD1B5\uD654\u201D; \u201Cfix(typeset): \uAC01\uC8FC \uC608\uC57D \uC804\uD658 \uD6C4 \uC81C\uAC70\uB41C \uAF2C\uB9AC\uB9D0 \uD638\uCD9C \uC815\uB9AC\u201D; \u201Cfix(typeset): \uBCF8\uBB38 \uAC01\uC8FC\uB97C \uCC38\uC870 \uC904 \uB2E8\uC704\uB85C \uC608\uC57D\uD558\uACE0 \uAC01\uC8FC \uC5EC\uC720\u00B7\uAF2C\uB9AC\uB9D0 \uBC34\uB4DC \uD68C\uC218\uB97C \uC5C6\uC564\uB2E4 (#8468)\u201D; \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/continuation/job.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/continuation/job.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c270e2703e24a58c0a026cbf76b18ddb45a6ea958a276d54bf2d57b1dc252a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/composer/auto_number_projection.rs: src/renderer/composer/auto_number_projection.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 9 (its worst body is rhwp::renderer::composer::auto_number_projection::project_where at line 86), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(renderer): #8438 \uBBF8\uC885\uACB0 \uC6D0 PR \uBCF4\uC815\uACFC \uAC1C\uBCC4 \uAC80\uD1A0 (#8517)\u201D; \u201Cfix: \uBCF8\uBB38 \uAC1C\uCCB4 \uBC88\uD638\uB3C4 \uACF5\uD1B5 \uC6D0\uBB38 \uC790\uB9AC\uD45C\uC5D0 \uD22C\uC601\u201D; \u201Cfix: \uC800\uC7A5 \uADF8\uB9BC \uD504\uB808\uC784\uACFC \uCEA1\uC158 \uD45C\uC2DC \uAD6C\uAC04\u00B7\uD30C\uC120 \uC704\uC0C1 \uBCF4\uC815\u201D; \u201Cfix: \uCEA1\uC158 \uC6D0\uBB38 \uC8FC\uC18C\uC640 \uBB38\uB9E5 \uBB38\uC790 \uD3ED\u00B7\uD68C\uC804 \uADF8\uB9BC \uCD9C\uB825 \uD06C\uAE30 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/auto_number_projection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/auto_number_projection.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f41b690377bcd637fe5a346db41d54aee02c5b8c19244227ed62aa6a5447901"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/height_measurer/table_wrapper.rs: src/renderer/height_measurer/table_wrapper.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 rhwp::renderer::height_measurer::table_wrapper::wrapper_owns_paint_or_horizontal_frame at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix(typeset): \uD1B5\uC9F8 \uD655\uC815\uD55C \uB798\uD37C\uC758 \uACF5\uD1B5 \uD504\uB808\uC784\uC744 \uD750\uB984\uACFC \uC608\uC57D\uC5D0 \uBCF4\uC874\u201D; \u201Cfix(table): \uCE78 \uC548 \uC5EC\uBC31 \uD569\uC774 \uC120\uC5B8 \uB192\uC774\uB97C \uB118\uC5B4\uB3C4 \uC5EC\uBC31\uC744 \uC904\uC774\uC9C0 \uC54A\uB294\uB2E4 (#8067)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/height_measurer/table_wrapper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer/table_wrapper.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e8c5e234561d582825c4223c0acdfae60c015f7b5231b4e6e499edc85a910b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/paragraph/split_entry.rs: src/renderer/typeset/paragraph/split_entry.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 11 (its worst body is rhwp::renderer::typeset::paragraph::split_entry::inspect_entry at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(typeset): \uBE48 host \uC7AC\uC870\uD310 \uC0C1\uC790\uB294 \uBB38\uB2E8 \uC717\uBCC0\uC5D0\uC11C \uC138\uC6B0\uACE0, \uBD84\uD560 \uC9C4\uC785 \uAC80\uC0AC\uB294 \uCCAB \uC904 \uC55E \uAC04\uACA9\uC744 \uBE80\uB2E4 (#8149)\u201D; \u201Cfix(renderer): align note markers and column zone geometry\u201D; \u201Cfix: \uC2E4\uC81C \uD504\uB808\uC784 \uC18C\uC720 \uD310\uC815\uC744 \uC804\uCCB4 \uBB38\uB2E8 fit\uACFC \uBD84\uD560\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uC2E4\uC81C \uD750\uB984\uACFC \uC77C\uCE58\uD558\uB294 \uC800\uC7A5 \uCABD \uACBD\uACC4 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/split_entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/split_entry.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f4953e3fd4488517ef13ded686a846dfa91dd6118c4221e9a90243766e0b55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/controls/physical_tac.rs: src/renderer/typeset/controls/physical_tac.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 11 (its worst body is rhwp::renderer::typeset::controls::physical_tac::prepare at line 14), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD655\uC7A5\uB41C TAC \uD504\uB808\uC784\uC758 \uC800\uC7A5 \uC904 \uB2E8\uCD95 \uC2B9\uC778 \uBC29\uC9C0\u201D; \u201Cfix(renderer): \uC800\uC7A5 \uD45C \uB2E8 \uC6D0\uC810\uACFC \uC790\uB3D9 \uACBD\uACC4 \uC18C\uBE44\uB97C \uC77C\uCE58\uC2DC\uD0B4\u201D; \u201Cfix: \uD45C \uD638\uC2A4\uD2B8 \uAE00\uC904\uACFC \uD6C4\uC18D \uBC30\uCE58\uAC00 \uAC19\uC740 \uC800\uC7A5 \uC88C\uD45C \uD504\uB808\uC784\uC744 \uACF5\uC720\u201D; \u201Cfix: \uB9AC\uBCA0\uC774\uC2A4 \uD6C4 \uAC1C\uCCB4 \uBA54\uD2B8\uB9AD\uACFC \uBBF8\uC8FC API \uC5F0\uACB0 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/physical_tac.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/physical_tac.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f228a547c37cd1bc702724e993d41b1fa285e61cb0d34a9f5ca1f4f7a8f235dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/table_layout/unit_diagnostics.rs: src/renderer/layout/table_layout/unit_diagnostics.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 4 (its worst body is rhwp::renderer::layout::table_layout::unit_diagnostics::trace_reset_owners at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC6D0\uBCF8 \uCCAB \uD63C\uD569 \uC870\uAC01\uC758 \uCE21\uC815\uACFC \uC2E4\uC81C \uBC30\uCE58\uB97C \uACF5\uC720\u201D; \u201Cfix: \uAC78\uCE68 \uC140\uC758 \uBB3C\uB9AC \uC794\uC5EC\uC640 \uB0B4\uC6A9 \uC885\uB8CC \uC694\uAD6C \uACF5\uC720\u201D; \u201Cfix: \uB85C\uCEEC \uC800\uC7A5 \uC6D0\uC810\uC744 \uAC15\uC81C \uD398\uC774\uC9C0 \uACBD\uACC4\uC640 \uBD84\uB9AC\u201D; \u201Cfix: \uC6D0\uBCF8 \uC800\uC7A5 \uC2AC\uB86F\uACFC \uC7AC\uC870\uD310 \uC904\uC758 \uCEF7 \uC218\uC6A9 \uACC4\uC57D \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/unit_diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/table_layout/unit_diagnostics.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"829e62873272a12d97f1c043ba6c3ec347fb4e0ba4b731410562fa05a4671b4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/inline_flow/table_rows.rs: src/renderer/inline_flow/table_rows.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 rhwp::renderer::inline_flow::table_rows::supports_table_text_rows_with_storage at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): reflow inline table hosts with header and footer definitions\u201D; \u201Cfix(composer): \uC904 \uC5C6\uB294 TAC \uD45C host \uC904\uC744 \uADF8\uB9AC\uB294 \uD589 \uB192\uC774\uB85C \uB9CC\uB4E4\uACE0 \uB204\uB984\uD2C0 \uB4A4 \uB118\uCE58\uB294 \uD45C\uB97C \uB2E4\uC74C \uC904\uB85C (#8507)\u201D; \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix(renderer): #8438 \uBBF8\uC885\uACB0 \uC6D0 PR \uBCF4\uC815\uACFC \uAC1C\uBCC4 \uAC80\uD1A0 (#8517)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/inline_flow/table_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow/table_rows.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2616fc568289695afcc0e0e2e505ce4b5a4b17cf219c9747c49d8d895d4f566f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/composer/frame_geometry.rs: src/renderer/composer/frame_geometry.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 5 (its worst body is ComposedParagraph::paragraph_with_frame_geometry_with_storage at line 88), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uB9AC\uBCA0\uC774\uC2A4 \uD6C4 \uBB38\uB2E8 \uBA38\uB9AC \uC800\uC7A5\uACFC \uAC01\uC8FC\u00B7\uC778\uB77C\uC778 \uD45C \uC18C\uBE44 \uACC4\uC57D \uBCF4\uC815\u201D; \u201Cfix: \uC7AC\uC870\uD310 \uC140\uACFC \uC778\uB77C\uC778 \uAC1C\uCCB4\uC758 \uACF5\uD1B5 \uC904 \uD504\uB808\uC784 \uC804\uB2EC\u201D; \u201Cfix: \uC911\uCCA9 \uC778\uB77C\uC778 \uD45C\uC758 \uC800\uC7A5 \uC904 \uB192\uC774\uB97C \uACF5\uD1B5 \uD504\uB808\uC784\uC73C\uB85C \uC804\uB2EC\u201D; \u201Cfix(renderer): \uC911\uCCA9 \uC778\uB77C\uC778 \uD45C\uC758 \uBD84\uD560\uACFC \uC6D0\uBCF8 \uC18C\uC720\uB97C \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/frame_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":"src/renderer/composer/frame_geometry.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"73918e3ba0e316e9f5e4e8566b54c606dca309602a5d811af459de0999a47cb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/image_geometry.rs: src/renderer/image_geometry.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 rhwp::renderer::image_geometry::normalize_gif_crop at line 8), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: GIF \uC6D0\uBCF8 \uC790\uB974\uAE30\uC640 Canvas \uCD95\uC18C \uD488\uC9C8 \uBCF4\uC815\u201D; \u201Cfix: \uC0C8 devel\uC758 \uACF5\uD1B5 \uC870\uD310 \uACC4\uC57D\uACFC \uB9AC\uBCA0\uC774\uC2A4 \uC18C\uBE44 \uACBD\uB85C \uC5F0\uACB0\u201D; \u201Cfix: \uC800\uC7A5 \uADF8\uB9BC \uD504\uB808\uC784\uACFC \uCEA1\uC158 \uD45C\uC2DC \uAD6C\uAC04\u00B7\uD30C\uC120 \uC704\uC0C1 \uBCF4\uC815\u201D; \u201Cfix: \uAE00\uC904 \uBC29\uD5A5\uACFC \uC800\uC7A5 \uADF8\uB9BC \uC601\uC5ED\uC744 \uACF5\uD1B5 \uCD9C\uB825\uC5D0 \uC804\uB2EC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/image_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":"src/renderer/image_geometry.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"05962d9a719d26fd47f32e095314a39383a8cfe1c5cc66a133d2561a8c1ee5f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/pua_glyph.rs: src/renderer/pua_glyph.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 FontCoverage::register at line 143), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: \uBC29\uD5A5 \uACB0\uACFC\uC758 \uBCF4\uAD00\uACFC PUA \uC120\uD0DD lint \uBCF4\uC815\u201D; \u201Cfix: \uC2E4\uC81C \uAE00\uAF34\uC758 \uC789\uD06C \uD569\uC131\uACFC \uBE48 \uC904\uC758 \uD65C\uC131 \uBA54\uD2B8\uB9AD\uC744 \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uC790\uC18C\uC758 \uC2E4\uC81C \uC804\uC9C4\uACFC \uAC15\uC870\uC810 \uC18C\uC720\u00B7\uBCF8\uBB38 \uAE30\uC6B8\uC784\uC744 \uACF5\uD1B5\uD654\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/pua_glyph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pua_glyph.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a38de568f535c865cbdc1a24231dbdef0e287b9762683c507b0d3e7b1b41cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/negation_geometry.rs: src/renderer/equation/negation_geometry.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 9 (its worst body is rhwp::renderer::equation::negation_geometry::ordinary_glyph at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB3C5\uB9BD Print\uC5D0 \uB530\uB77C \uC815\uB82C \uD589\uACFC \uC870\uD569\u00B7\uAE34 \uB098\uB217\uC148\u00B7\uC0C9 \uBC94\uC704\uB97C \uBCF4\uC815\u201D; \u201Cfix: \uC218\uD559 \uBCC0\uC218\uC758 \uC815\uCCB4\uC640 \uD569\uC131 \uAD75\uAE30 \uCD9C\uB825 \uACC4\uC57D \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uD55C\uCEF4 \uB300\uBB38\uC790 \uD45C\uC2DC\uC640 \uBA85\uC2DC \uACF5\uBC31\uC758 \uACF5\uD1B5 \uC789\uD06C \uD504\uB808\uC784 \uBCF4\uC815\u201D; \u201Cfix: \uB367\uC148 \uBE84\uC148 \uB4F1\uD638\uC758 \uD45C\uC2DC \uC6D0\uC810\uACFC \uC218\uD559 \uC789\uD06C \uD504\uB808\uC784 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/negation_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":"src/renderer/equation/negation_geometry.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcd651fc8e81c7a9d867d8dabbb4012af03c459652a7d3a1ec64c76cd1e00e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/composer/line_breaking/inline_frame_input.rs: src/renderer/composer/line_breaking/inline_frame_input.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 14 (its worst body is rhwp::renderer::composer::line_breaking::inline_frame_input::project_with_storage at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): preserve container frames and trailing anchor rows\u201D; \u201Cfix(renderer): \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC911\uCCA9 \uD45C\uC758 \uC2E4\uC81C \uC904 \uC18C\uC18D\uACFC \uC131\uC7A5 \uBCF4\uC874\u201D; \u201Cfix: \uD0ED \uC800\uC7A5\u00B7\uBCF8\uBB38 \uCABD\uBC88\uD638\u00B7\uC0C8 \uCABD \uB2E8 \uBC30\uCE58\uC758 \uD1B5\uD569 \uBCF4\uC815\u201D; \u201Cfix: HWP \uD3B8\uC9D1 \uC800\uC7A5\uC758 \uAD6C\uC5ED \uB05D \uBC14\uD0D5\uCABD\u00B7\uBA54\uBAA8 \uBCF4\uC874 (#7908)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/line_breaking/inline_frame_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":"src/renderer/composer/line_breaking/inline_frame_input.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"067dfb8c05eb659777a1f83e53617f8808ae37c4957dd4025e48a680f58cdd03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/serializer/mod.rs: src/serializer/mod.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 6 (its worst body is SerializeError::fmt at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: HWPX \uACC4\uBCF4 HWP \uC800\uC7A5\u00B7\uB85C\uB4DC\uAC00 \uC6D0\uBCF8 HWPX \uC758 \uC800\uC7A5 \uC904 \uACC4\uC57D\uC744 \uB530\uB978\uB2E4 (#8310)\u201D; \u201Cfix: \uD68C\uC804 \uB3C4\uD615\uC758 \uC800\uC7A5 \uD504\uB808\uC784\uACFC \uD615\uC2DD\uBCC4 \uBCC0\uD658 \uD589\uB82C \uACF5\uD1B5\uD654\u201D; \u201Cfix(serializer): preserve full-body absolute column sizes on export\u201D; \u201Cfix: \uD0ED \uC800\uC7A5\u00B7\uBCF8\uBB38 \uCABD\uBC88\uD638\u00B7\uC0C8 \uCABD \uB2E8 \uBC30\uCE58\uC758 \uD1B5\uD569 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/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":"src/serializer/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f318e311dc1e0393eea70a04a46b7167164812e26d07279a7414fbecb5076f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/controls/flow_table.rs: src/renderer/typeset/controls/flow_table.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 10 (its worst body is rhwp::renderer::typeset::controls::flow_table::place at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD655\uC7A5\uD55C \uC778\uB77C\uC778 \uD638\uC2A4\uD2B8\uC758 \uC800\uC7A5 \uBC30\uCE58 \uC6B0\uD68C \uACBD\uB85C \uCC28\uB2E8\u201D; \u201Cfix(renderer): \uBE48 host \uB2E4\uC911 \uC790\uB9AC\uCC28\uC9C0 \uD45C\uC758 \uD2C8\uC744 host \uC904\u00B7\uBE48 \uBB38\uB2E8\uC774 \uCC44\uC6B0\uACE0 \uB458\uC9F8 \uD45C \uB760\uC5D0 \uAC78\uB9B0 \uAE00\uC904\uC740 \uB760 \uC544\uB798\uB85C (#7687, #7680)\u201D; \u201Cfix: \uADF8\uB9BC \uD68C\uD53C \uB4A4 \uD45C \uC904\uC758 \uD655\uC815 \uD750\uB984 \uB05D \uACF5\uC720\u201D; \u201Cfix: \uC800\uC7A5 \uC870\uD310\uACFC \uBA54\uD0C0\uD30C\uC77C\u00B7\uBA38\uB9AC\uB9D0 \uBC30\uCE58 \uBCF4\uC815 \uC9C4\uD589\uBD84 \uACE0\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/flow_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/flow_table.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c45ac30b0bd676c311e13c5079260b9fef482b491845a3d5cdfe031fe0247"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/scan/row_entry.rs: src/renderer/typeset/table/scan/row_entry.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 7 (its worst body is RowEntryQuery::split_gate at line 108), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB3C5\uB9BD \uC790\uC2DD\uC758 \uCEF7\uACFC \uBD80\uBAA8 \uBB3C\uB9AC \uD504\uB808\uC784 \uC18C\uC720 \uBD84\uB9AC\u201D; \u201Cfix: \uACF5\uB3D9 \uC575\uCEE4 \uC678\uBD80 \uC790\uC2DD\uC758 \uC810\uC720\uC640 \uBD84\uD560 \uC18C\uC720 \uACF5\uC720\u201D; \u201Cfix: \uB2E8\uC77C \uAE00\uC904\uC758 \uBB3C\uB9AC \uCD5C\uC18C\uC640 \uC7AC\uC870\uD310 \uBCD1\uD569 \uC81C\uC57D\uC744 \uACF5\uD1B5 \uCC98\uB9AC\u201D; \u201Cfix(typeset): \uD45C \uBD84\uD560\uACFC \uC800\uC7A5 \uC904 \uC6D0\uC810\uC758 \uD750\uB984 \uC18C\uC720 \uBCF4\uC815 (#7704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/scan/row_entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/scan/row_entry.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fa757b912064a03298292a2c96a52b6af28016ef0adc66b6cef90d7e80147f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/paragraph_layout/list_marker_geometry.rs: src/renderer/layout/paragraph_layout/list_marker_geometry.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 10 (its worst body is rhwp::renderer::layout::paragraph_layout::list_marker_geometry::list_marker_geometry_for at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uBE48 \uBC88\uD638 \uBAA8\uC591\uC5D0\uC11C\uB3C4 \uBCF8\uBB38\uACFC\uC758 \uAC70\uB9AC \uBCF4\uC874\u201D; \u201Cfix: \uB0B4\uC7A5 \uAC1C\uC694 \uBC88\uD638\uC758 \uCC38\uC870 \uC608\uC57D \uD3ED\uC744 \uCE21\uC815\uACFC \uBC30\uCE58\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uB3C5\uB9BD ASCII \uB9C8\uCEE4\uC758 \uC911\uB9BD \uBB38\uC790\uB294 Latin \uC2AC\uB86F\uC73C\uB85C \uD574\uC18C\u201D; \u201Cfix: \uBAA9\uB85D \uB9C8\uCEE4\uC758 \uCE21\uC815\uACFC \uD45C\uC2DC\uAC00 \uBB38\uC790\uC5F4 \uC5B8\uC5B4 \uC2AC\uB86F\uC744 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/paragraph_layout/list_marker_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":"src/renderer/layout/paragraph_layout/list_marker_geometry.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c460d5e4bd988f40ff8aa94f43d4b82cc23c898967ffda11239643f867d2545"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/parser/pdf/structured_lowering/body.rs: src/parser/pdf/structured_lowering/body.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 15 (its worst body is rhwp::parser::pdf::structured_lowering::body::lower at line 355), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(#8362): \uD55C/\uAE00 2024 \uC7AC\uC870\uD310\uACFC \uAC19\uAC8C \uC904 \uB05D \uC790\uAC04\uACFC \uACE0\uC815 \uC904\uAC04\uACA9 \uAF2C\uB9AC\uB97C \uC800\uC7A5\u201D; \u201Cfix(#8362): \uBCF8\uBB38 \uAE00\uC790\uBCF4\uB2E4 \uBA3C\uC800 \uADF8\uB9B0 \uAC00\uB9AC\uB294 \uADF8\uB9BC\uC740 \uB2E4\uC2DC \uADF8\uB9B0 \uBCF8\uBB38 \uC544\uB798\uC5D0 \uB454\uB2E4\u201D; \u201Cfix(#8362): \uBCF8\uBB38\uC744 \uAC00\uB9AC\uC9C0 \uC54A\uB294 \uC6D0\uBCF8 \uADF8\uB9BC \uB54C\uBB38\uC5D0 \uBB38\uB2E8\uC744 \uC704\uCE58 \uACE0\uC815 \uB0B1\uB9D0\uB85C \uB0A8\uAE30\uC9C0 \uC54A\uB294\uB2E4\u201D; \u201Cfix(pdf-import): \uC9E7\uC740 \uB05D\uC904\u00B7\uD56D\uBAA9 \uAE30\uD638\u00B7\uB9DE\uB2FF\uC740 \uC81C\uBAA9 \uC544\uB798 \uB2E8\uC5D0\uC11C \uBB38\uB2E8 \uACBD\uACC4\uB97C \uCC3E\uB294\uB2E4\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/pdf/structured_lowering/body.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/pdf/structured_lowering/body.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e09cb3f3677d8e05d16d1a87cd33adea5f30259daa5ad940bc953470fb8eaad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/paragraph/forced_boundary.rs: src/renderer/typeset/paragraph/forced_boundary.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 12 (its worst body is rhwp::renderer::typeset::paragraph::forced_boundary::prepare_forced_page_boundary at line 4), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: \uC218\uC6A9\uB41C TAC \uD504\uB808\uC784 \uB4A4\uC758 \uC800\uC7A5 \uCABD \uACBD\uACC4 \uBCF4\uC874\u201D; \u201Cfix: \uC2E4\uC81C \uD504\uB808\uC784 \uC18C\uC720 \uD310\uC815\uC744 \uC804\uCCB4 \uBB38\uB2E8 fit\uACFC \uBD84\uD560\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uCD5C\uC2E0 devel \uB9AC\uBCA0\uC774\uC2A4\uC758 \uBBF8\uC8FC \uBB38\uB9E5\uACFC \uBAA8\uB4C8 \uCC38\uC870 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/forced_boundary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/forced_boundary.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"987efb33a1641b7daae83b35f95a0e269ee9111047d79445b49f70943c023c30"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/svg/font_file_lookup.rs: src/renderer/svg/font_file_lookup.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 13 (its worst body is rhwp::renderer::svg::font_file_lookup::find_font_file at line 146), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uAC19\uC740 \uC2DC\uC2A4\uD15C face\uC758 \uBD80\uBD84 cmap\uC73C\uB85C \uC778\uD55C \uB300\uCCB4 \uCD9C\uB825 \uBC29\uC9C0\u201D; \u201Cfix: \uCD5C\uC2E0 devel \uB9AC\uBCA0\uC774\uC2A4 \uD574\uC18C \uCF54\uB4DC \uC815\uB9AC\uC640 \uAC80\uC99D \uBC94\uC704 \uAE30\uB85D\u201D; \u201Cfix: PR #7600 \uC6D0\uBCF8 \uBB38\uD56D\uC758 \uBC14\uD0D5\uCABD\uACFC \uC218\uC2DD\u00B7\uD0ED \uBC30\uCE58 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/svg/font_file_lookup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg/font_file_lookup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4e83e8cc20e7d5d263d965e6a2b5d4b9284ba2ca1760cdadea1976322b6d02"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/image_resolver/print_tone.rs: src/renderer/image_resolver/print_tone.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 7 (its worst body is rhwp::renderer::image_resolver::print_tone::print_bitmap_payload at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pdf): \uACE1\uC120 clipping\u00B7\uC774\uBBF8\uC9C0 \uD55C\uB3C4\u00B7\uC554\uD638 \uC778\uC99D\uACFC \uCABD\uBCC4 \uC9C4\uD589\uB960 \uC9C0\uC6D0 (#8420)\u201D; \u201Cfix: \uC2E4\uC81C crop\uC758 \uD314\uB808\uD2B8 \uD310\uB2E8\uC744 Print payload\uC640 \uC7AC\uC870\uD68C\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uADF8\uB9BC \uC7AC\uAD6C\uC131\uC744 \uC2E4\uC81C \uD55C\uCEF4 Print \uC0C9 \uC804\uB2EC payload\uC5D0 \uACB0\uD569\u201D; \u201Cfix: \uD55C\uCEF4 Print \uD314\uB808\uD2B8\uC758 \uD751\uBC31 \uC608\uC57D\uC0C9 \uACBD\uACC4\uB97C \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/image_resolver/print_tone.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/print_tone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c825e5d90dbd4bddb871647fb567ad41d521b7e79e3c82d86bd89a197bc73c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/legacy_coordinate_plane.rs: src/renderer/equation/legacy_coordinate_plane.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 12 (its worst body is rhwp::renderer::equation::legacy_coordinate_plane::inspect at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uAD6C\uD615 \uBB38\uC790 \uD3C9\uBA74\uACFC \uD604\uB300 \uC218\uC2DD \uC0C9\uC0C1 \uACBD\uACC4\uB97C \uACF5\uD1B5 \uACB0\uACFC\uC5D0 \uBC18\uC601\u201D; \u201Cfix: \uB9AC\uBCA0\uC774\uC2A4 \uB4A4 \uC218\uC2DD \uD3C9\uBA74\uACFC \uC800\uC7A5 \uD45C \uD504\uB808\uC784\uC758 \uC18C\uC720 \uBCF4\uC874\u201D; \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uACF5\uD1B5 \uC88C\uD45C\uC640 \uCCA8\uC790 \uC18C\uC720 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/legacy_coordinate_plane.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/legacy_coordinate_plane.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0349601a4ea0315bfc1572ec0acc4f72ecac93b23c5a8515dba6cbd05ea4aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/stored_line_ladder.rs: src/renderer/stored_line_ladder.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 14 (its worst body is rhwp::renderer::stored_line_ladder::stored_line_ladder_is_uniform_filler at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uAD6C\uD604 \uD3B8\uC758 \uD50C\uB798\uADF8\uC640 \uC644\uACB0 \uD589 \uC870\uAC01\uC758 \uB192\uC774 \uC18C\uC720 \uBD84\uB9AC\u201D; \u201Cfix(typeset): \uCABD \uB9E8 \uC704 \uB2E8\uC77C \uC800\uC7A5 \uC904 TAC \uD45C\uB294 \uC800\uC7A5 \uCCAB \uC904\uC758 \uBB38\uB2E8 \uC704 \uAC04\uACA9\uC744 \uC6D0\uC810\uC5D0 \uB454\uB2E4 (#8474)\u201D; \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix: \uC6D0\uBB38 \uB300\uC870 \uC870\uD310 \uBCF4\uC815\uACFC \uAC1C\uBCC4 PR \uC99D\uC801 \uC815\uC815 (#8328)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/stored_line_ladder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/stored_line_ladder.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525d8719182cdf1e7a42722d6e34252712586fb3b1b2eb6b06563ce4e9c3136"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/block/unrestricted_float.rs: src/renderer/typeset/table/block/unrestricted_float.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 12 (its worst body is rhwp::renderer::typeset::table::block::unrestricted_float::atomic_external_children_fit_parent_frame at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix: \uB3C5\uB9BD \uC790\uC2DD\uC758 \uCEF7\uACFC \uBD80\uBAA8 \uBB3C\uB9AC \uD504\uB808\uC784 \uC18C\uC720 \uBD84\uB9AC\u201D; \u201Cfix: \uACF5\uB3D9 \uC575\uCEE4 \uC678\uBD80 \uC790\uC2DD\uC758 \uC810\uC720\uC640 \uBD84\uD560 \uC18C\uC720 \uACF5\uC720\u201D; \u201Cfix: \uC81C\uD55C \uC5C6\uB294 \uC6D0\uC790 \uC790\uC2DD\uC758 \uBD80\uBAA8 \uD504\uB808\uC784 \uC218\uC6A9 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/block/unrestricted_float.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/table/block/unrestricted_float.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2303c4bb77535779c0251b0e89b06d715601e1173b73b41918f04aa9c2c4de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/cases_columns.rs: src/renderer/equation/layout/cases_columns.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 8 (its worst body is EqLayout::layout_cases_rows at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix: \uC218\uC2DD \uC904 \uD504\uB808\uC784\uACFC \uACF5\uAC1C MATH \uC911\uAD04\uD638 \uC724\uACFD\uC744 \uCD9C\uB825 \uACBD\uB85C\uC5D0\uC11C \uACF5\uC720\u201D; \u201Cfix: \uC911\uCCA9 \uC815\uB82C \uBB36\uC74C\uC758 \uAC04\uACA9\uC744 \uC2E4\uC81C \uBD80\uBAA8 \uAD6C\uC870\uC640 \uAD6C\uBD84\u201D; \u201Cfix: \uC218\uC2DD\uC758 \uBA85\uC2DC\uC801 \uBE48 \uD589\uACFC \uC815\uB82C \uBB36\uC74C\uC758 \uCCAB \uD589 \uAE30\uC900\uC120 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/cases_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":"src/renderer/equation/layout/cases_columns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8799a41a1a012400d2381b71fd772f860a0b5da98fe85f754340d4356f0b0650"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/paint/metafile.rs: src/paint/metafile.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 rhwp::paint::metafile::image_payload at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uCEA1\uC158 \uC6D0\uBB38 \uC8FC\uC18C\uC640 \uBB38\uB9E5 \uBB38\uC790 \uD3ED\u00B7\uD68C\uC804 \uADF8\uB9BC \uCD9C\uB825 \uD06C\uAE30 \uBCF4\uC815\u201D; \u201Cfix: WMF Print surface\uC640 \uC2E4\uC81C \uAE00\uAF34 \uACF5\uAE09\uC744 \uACF5\uD1B5 paint\uC5D0 \uC5F0\uACB0\u201D; \u201Cfix: \uC800\uC7A5 \uB2E8 \uACBD\uACC4\uC640 \uC6D0\uBCF8 \uAE00\uAF34 \uD3ED\u00B7Print \uC120 coverage \uBCF4\uC815\u201D; \u201Cfix: \uC7A5\uCE58 \uD39C \uC7AC\uC0DD\uC5D0 \uC6D0\uBCF8 \uADF8\uB9BC \uC790\uB974\uAE30 \uC88C\uD45C \uC0AC\uC6A9\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/paint/metafile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/metafile.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07213690ac14235edc75da711576833e69b26590332ca5fb033fdc1b0fca5f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/image_resolver/picture_adjustments.rs: src/renderer/image_resolver/picture_adjustments.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 7 (its worst body is rhwp::renderer::image_resolver::picture_adjustments::adjusted_picture_bytes at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uAD6C\uD615 OLE \uCC28\uD2B8\uC758 \uBB3C\uB9AC \uBC30\uCE58\uC640 \uCABD \uBC30\uACBD \uC0C9\uC870 \uBCF4\uC815\u201D; \u201Cfix(render): \uC77C\uBC18 \uADF8\uB9BC \uC0C9\uC870\uB97C DOM \uC9C0\uC5F0 \uB85C\uB529\uACFC \uACF5\uC720\u201D; \u201Cfix(render): \uC77C\uBC18 \uD68C\uC0C9\uC870\uC640 \uD751\uBC31 \uC0C9\uC870\uC758 Print \uD53D\uC140 \uBCF4\uC815\u201D; \u201Cfix(\uB80C\uB354): WMF \uC0C9 \uCC98\uB9AC\uC640 \uC9C0\uC5F0 \uB85C\uB529 \uBC14\uC774\uD2B8\uB97C \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/image_resolver/picture_adjustments.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver/picture_adjustments.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1e674c1eb56af76a858577a5ddb5872f22ee71ce1f62c2b611a82390b55ae1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/fraction_sup_frame.rs: src/renderer/equation/fraction_sup_frame.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 13 (its worst body is rhwp::renderer::equation::fraction_sup_frame::line_extension at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB3C5\uB9BD Print\uC5D0 \uB530\uB77C \uC815\uB82C \uD589\uACFC \uC870\uD569\u00B7\uAE34 \uB098\uB217\uC148\u00B7\uC0C9 \uBC94\uC704\uB97C \uBCF4\uC815\u201D; \u201Cfix: \uBD84\uC218 \uC544\uB798\uCCA8\uC790 \uC810\uC720\uC640 \uADFC\uD638 \uC904 \uD504\uB808\uC784\uC744 \uBC30\uCE58\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uADFC\uD638 \uAE00\uC904\uC758 \uCD94\uAC00 \uC810\uC720\uB97C \uBD84\uC218\uC640 \uCCA8\uC790 \uD504\uB808\uC784\uC5D0 \uACF5\uC720\u201D; \u201Cfix: \uBD84\uC218\uC758 \uCE21\uC815 \uD504\uB808\uC784\uACFC \uC2E4\uC81C \uAE00\uC904 \uAE30\uC900\uC120 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/fraction_sup_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/fraction_sup_frame.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"48944c61a3e9079142ab7e0f4a021bc9c1e12dcda0e032333736e06e7a07b794"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/document_core/commands/stored_body_frames.rs: src/document_core/commands/stored_body_frames.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 rhwp::document_core::commands::stored_body_frames::inline_graphics_fit_saved_text_line at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC800\uC7A5 \uAC1C\uCCB4 \uB4A4\uC758 \uCABD \uACBD\uACC4\uB97C \uC644\uC804\uD55C \uBB38\uB2E8 \uC18C\uC720\uB85C \uD310\uC815\u201D; \u201Cfix: \uBCC4\uB3C4 \uD750\uB984\uC758 \uBCF8\uBB38 \uD45C\uC9C0\uC640 TAC \uC800\uC7A5 \uAC04\uACA9 \uBCF4\uC874\u201D; \u201Cfix: \uD569\uC131 \uC904\uC758 fit \uAC04\uACA9\uACFC TAC \uBCF8\uBB38 \uC904\uC758 \uC6D0\uBCF8 \uC575\uCEE4 \uBCF4\uC874\u201D; \u201Cfix: \uC800\uC7A5 \uD638\uC2A4\uD2B8 \uC904\uACFC \uD569\uC131 \uBB38\uB2E8\uC758 \uD504\uB808\uC784 \uC5F0\uACB0 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/stored_body_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/commands/stored_body_frames.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7275941723a3484466d4c67ad5170f9cde01394fe885b91ebbf56af39f42d4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/notes/endnotes/fit.rs: src/renderer/typeset/notes/endnotes/fit.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 11 (its worst body is TypesetEngine::judge_large_between_last_column_visual_split at line 1269), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC800\uC7A5 \uC88C\uD45C \uB418\uAC10\uAE40\uC73C\uB85C \uC55E \uBBF8\uC8FC \uC904\uC744 \uBB36\uB294 \uCD94\uC815 \uC81C\uAC70\u201D; \u201Cfix: \uBBF8\uC8FC \uBB36\uC74C \uC18D\uC131\uACFC \uC2E4\uC81C \uAE00\uC904 \uC810\uC720\uB85C \uB2E8 \uC218\uC6A9 \uD310\uC815\u201D; \u201Cfix: \uC2E4\uC81C \uC810\uC720 \uAC80\uC99D \uC5C6\uC774 \uBBF8\uC8FC \uC81C\uBAA9 fit\uB97C \uC644\uD654\uD55C \uD6C4\uBCF4 \uCCA0\uD68C\u201D; \u201Cfix: \uBBF8\uC8FC \uC81C\uBAA9 tail\uC5D0\uC11C \uB2E4\uC74C \uBB38\uB2E8 \uBB36\uC74C \uC18D\uC131 \uD655\uC778\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/notes/endnotes/fit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/notes/endnotes/fit.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef487b6abcc5808f956aa30cab9f7ac2886c834033a0b44be72720d1dbe73514"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/page_layout.rs: src/renderer/page_layout.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 rhwp::renderer::page_layout::calculate_column_areas_with_storage at line 271), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uBCF8\uBB38 \uBB3C\uB9AC \uC810\uC720\uC640 \uB808\uAC70\uC2DC \uBBF8\uC8FC \uD398\uC774\uC9C0 \uC608\uC0B0 \uBD84\uB9AC\u201D; \u201Cfix: PR #7600 \uC6D0\uBCF8 \uBB38\uD56D\uC758 \uBC14\uD0D5\uCABD\uACFC \uC218\uC2DD\u00B7\uD0ED \uBC30\uCE58 \uBCF4\uC815\u201D; \u201Cfix: \uD0ED \uC800\uC7A5\u00B7\uBCF8\uBB38 \uCABD\uBC88\uD638\u00B7\uC0C8 \uCABD \uB2E8 \uBC30\uCE58\uC758 \uD1B5\uD569 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/page_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":"src/renderer/page_layout.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b005feb797416af4e77fbf85fa05329549d72c70048b1d4fe70414f374c0a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/section/heading.rs: src/renderer/typeset/section/heading.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 14 (its worst body is TypesetEngine::keep_heading_with_following_block_with_storage at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): absorb spacing before of the paragraph after a split float continuation\u201D; \u201Cfix(typeset): \uD30C\uC0DD \uC904 \uC88C\uD45C\uB97C \uC800\uC7A5 \uCABD \uACBD\uACC4 \uC99D\uAC70\uC5D0\uC11C \uC81C\uC678\u201D; \u201Cfix: \uC81C\uBAA9 \uACE0\uB9BD \uD310\uC815\uC5D0\uC11C \uC6D0\uBCF8 \uC800\uC7A5 \uCABD \uC88C\uD45C\uB97C \uC0AC\uC6A9\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/section/heading.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/section/heading.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce39476dfe2697c90291b6e04369e96da79d4cafb8e277db13630160095b6902"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/paragraph/placement.rs: src/renderer/typeset/paragraph/placement.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 rhwp::renderer::typeset::paragraph::placement::plan_fragment at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC800\uC7A5 \uD45C\uC758 \uD6C4\uC18D \uC6D0\uC810\uC5D0 \uD655\uC815\uB41C \uB05D \uC904\uAC04\uACA9 \uACF5\uC720\u201D; \u201Cfix: \uC804\uCCB4\u00B7\uBD84\uD560 \uBB38\uB2E8\uC774 \uAD6C\uC131\uD55C \uC904 \uC0C1\uC790\uC758 \uC2E4\uC81C \uC810\uC720 \uB05D\uC744 \uACF5\uC720\u201D; \u201Cfix(typeset): \uD45C \uBD84\uD560\uACFC \uC800\uC7A5 \uC904 \uC6D0\uC810\uC758 \uD750\uB984 \uC18C\uC720 \uBCF4\uC815 (#7704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/placement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/placement.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"483d9a1d442fb0ab1af538284deb2ccd2ee4450c9d965892736cd8827cea4dc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/source_glyph_runs.rs: src/renderer/equation/layout/source_glyph_runs.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 EqLayout::layout_hancom_glyphs at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(equation): \uAD6C\uD615 \uD45C\uC2DC \uC138\uB300\uC758 \uB3C5\uB9BD \uAE00\uB9AC\uD504 \uC804\uC9C4\uC744 \uC5F0\uACB0\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uAD6C\uC870 \uD504\uB808\uC784\uACFC \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC778\uB77C\uC778 \uAC04\uACA9 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/source_glyph_runs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/source_glyph_runs.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fe1649867a51175fecf3bb76dfe6561b178ebdee13c8ef1348828f8b8aebf5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/svg/system_fonts.rs: src/renderer/svg/system_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 rhwp::renderer::svg::system_fonts::family_file_from_database_with_style at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uC790\uC18C\uC758 \uC2E4\uC81C \uC804\uC9C4\uACFC \uAC15\uC870\uC810 \uC18C\uC720\u00B7\uBCF8\uBB38 \uAE30\uC6B8\uC784\uC744 \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uAC19\uC740 \uC2DC\uC2A4\uD15C face\uC758 \uBD80\uBD84 cmap\uC73C\uB85C \uC778\uD55C \uB300\uCCB4 \uCD9C\uB825 \uBC29\uC9C0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/svg/system_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":"src/renderer/svg/system_fonts.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c115865af2df253d8f3fdb40de9f084ea6ff97c9efd782a3a83b5979a8a14144"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rhwp-studio/tests/support/review-runtime-contracts.runner.mjs: rhwp-studio/tests/support/review-runtime-contracts.runner.mjs 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 9 (its worst body is load at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(studio): \uACB9\uCE68 \uAE30\uD638\uC758 \uB2E8\uC0C9 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD6C4\uBCF4 \uC21C\uC11C \uBCF4\uC815\u201D; \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: \uCD95\uC18C \uADF8\uB9BC\uC758 \uAC00\uB294 \uC120\uC744 \uBCF4\uC874\uD558\uACE0 \uC2E4\uC81C JSON \uAC80\uC99D \uC790\uC6D0 \uB85C\uB4DC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- rhwp-studio/tests/support/review-runtime-contracts.runner.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/tests/support/review-runtime-contracts.runner.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"419b7a25c24b1eeb23a2729870f700df71fbb050535c97de8679ad971ef4748d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/document_core/commands/paragraph_format_path.rs: src/document_core/commands/paragraph_format_path.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 DocumentCore::set_cell_para_shape_id_by_path at line 94), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uB9AC\uBCA0\uC774\uC2A4 \uD6C4 \uBB38\uB2E8 \uBA38\uB9AC \uC800\uC7A5\uACFC \uAC01\uC8FC\u00B7\uC778\uB77C\uC778 \uD45C \uC18C\uBE44 \uACC4\uC57D \uBCF4\uC815\u201D; \u201Cfix(layout): \uBAA9\uB85D \uCE90\uC2DC\uC640 \uB2EB\uD78C \uC911\uCCA9 \uD45C\u00B7\uBA38\uB9AC\uB9D0 \uAE00\uC904\uC758 \uACF5\uD1B5 \uACC4\uC57D \uBCF4\uC815\u201D; \u201Cfix(format): preserve flat caption access when sharing cell origins\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/paragraph_format_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":"src/document_core/commands/paragraph_format_path.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"067bcb3e0b946a1ab80c43af218188ba1830bdcf734a8b60cb100346d126fab0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/controls/table_entry.rs: src/renderer/typeset/controls/table_entry.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 rhwp::renderer::typeset::controls::table_entry::uses_decoration_placement at line 57), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(table): \uC138\uB85C\uC4F0\uAE30 \uCE78\uC774 \uC788\uB294 \uD45C\uB97C \uCABD \uACBD\uACC4\uC5D0\uC11C \uB098\uB204\uC9C0 \uC54A\uB294\uB2E4 (#8470)\u201D; \u201Cfix: \uBCF8\uBB38 \uBC16 \uC6A9\uC9C0 \uACE0\uC815 \uD45C\uC758 \uC678\uACFD\uC744 \uD750\uB984\uC5D0\uC11C \uBD84\uB9AC\u201D; \u201Cfix(typeset): \uD45C \uBD84\uD560\uACFC \uC800\uC7A5 \uC904 \uC6D0\uC810\uC758 \uD750\uB984 \uC18C\uC720 \uBCF4\uC815 (#7704)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/controls/table_entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/controls/table_entry.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02abca8a9b17e8f00e2270e144cc31f02d84c2ca6c6ad70d694508cd067808c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/paragraph/whole_decision.rs: src/renderer/typeset/paragraph/whole_decision.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 15 (its worst body is rhwp::renderer::typeset::paragraph::whole_decision::decide_whole_fit at line 6), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: \uBD84\uD560 \uD45C \uB4A4 \uC55E \uAC04\uACA9\uC744 \uCABD \uC218\uC6A9 \uD310\uB2E8\uACFC \uBC30\uCE58\uC5D0 \uD568\uAED8 \uBC18\uC601\u201D; \u201Cfix: \uC218\uC6A9\uB41C TAC \uD504\uB808\uC784 \uB4A4\uC758 \uC800\uC7A5 \uCABD \uACBD\uACC4 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/paragraph/whole_decision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/typeset/paragraph/whole_decision.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efca174bd008dc8fb9deb1e9193edca252e4039a26bea713231d755e1972840"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/height_measurer/reflow_cell_frames.rs: src/renderer/height_measurer/reflow_cell_frames.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 11 (its worst body is HeightMeasurer::reflow_cell_frame_rows_with_storage at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC7AC\uC870\uD310 \uC140\uACFC \uC778\uB77C\uC778 \uAC1C\uCCB4\uC758 \uACF5\uD1B5 \uC904 \uD504\uB808\uC784 \uC804\uB2EC\u201D; \u201Cfix: \uC678\uBD80 \uC790\uC190 \uC810\uC720\uC640 \uBD80\uBAA8 \uC140 \uBB3C\uB9AC \uD504\uB808\uC784 \uBD84\uB9AC\u201D; \u201Cfix: \uACF5\uB3D9 \uC575\uCEE4 \uC678\uBD80 \uC790\uC2DD\uC758 \uC810\uC720\uC640 \uBD84\uD560 \uC18C\uC720 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/height_measurer/reflow_cell_frames.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/height_measurer/reflow_cell_frames.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b422e34f3d4cbb9201362ebfd4ddc11ed9e7d3b0fbae95396928c407950346c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/inline_flow/separator_spaces.rs: src/renderer/inline_flow/separator_spaces.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 rhwp::renderer::inline_flow::separator_spaces::classify_with_storage at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uC7AC\uC870\uD310 \uADF8\uB9BC \uC904\uC758 \uBD80\uB3D9 \uB3C4\uD615 \uC575\uCEE4\uC640 \uBC30\uC81C \uC601\uC5ED \uACF5\uC720\u201D; \u201Cfix: \uAC1C\uCCB4 \uC55E \uC791\uC131 \uACF5\uBC31\uACFC \uBA85\uC2DC\uC801 \uAC1C\uD589\uC758 \uC904 \uC18C\uC720 \uBCF4\uC874\u201D; \u201Cfix: \uC885\uB2E8 \uD45C\uC640 \uC55E \uC5B4\uC808\uC758 \uC218\uC6A9 \uD6C4\uBCF4 \uBC0F \uACF5\uBC31 \uC904 \uC18C\uC720 \uD1B5\uC77C\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/inline_flow/separator_spaces.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/inline_flow/separator_spaces.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c286e4e1924b3d2dfae17a68c0ec437424e475bbba796e89c19ce47594f804"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/floating_equation.rs: src/renderer/layout/floating_equation.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 2 (its worst body is LayoutEngine::layout_floating_equation at line 18), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): COL \uC778\uC790\uC640 \uD45C\uC2DC \uC138\uB300\uBCC4 \uC624\uB958\uB97C \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uCC98\uB9AC\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD\uC758 \uACF5\uBC31 \uD56D\uACFC \uBD84\uC218 \uD53C\uC5F0\uC0B0\uC790 \uC18C\uC18D\uC744 \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uBCF4\uC874\u201D; \u201Cfix: \uBB38\uC11C \uC218\uC2DD\uC758 \uBB38\uC790 \uBA85\uB839\uACFC \uACF5\uAC1C LaTeX \uD655\uC7A5 \uACBD\uACC4\uB97C \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/floating_equation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/floating_equation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a552eea1a0a299ff09894a6f9a0b271139c9db6e9ef57107f6fa46b83d47bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/skia/synthetic_typeface.rs: src/renderer/skia/synthetic_typeface.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 rhwp::renderer::skia::synthetic_typeface::regular_program_typeface at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(skia): raster \uD68D\uC740 \uC7A5\uCE58 \uD55C \uCE78\uBCF4\uB2E4 \uAC00\uB298\uAC8C \uADF8\uB9AC\uC9C0 \uC54A\uB294\uB2E4 (#8125)\u201D; \u201Cfix: \uD569\uC131 \uAD75\uAE30 raster \uD68D\uC758 \uC7A5\uCE58 \uC0C1\uD0DC\uB97C \uCE90\uC2DC\uC640 \uACF5\uC720\u201D; \u201Cfix: \uD569\uC131 \uAD75\uAE30 \uAE00\uC790\uB97C \uC6D0 \uAE00\uB9AC\uD504 \uC724\uACFD\uC120\uC73C\uB85C \uCD9C\uB825\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/synthetic_typeface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/synthetic_typeface.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bc1fce5d8dd112a04cb1e00ae2bc538038079852033968a6b2c98919b7ad78"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/float_placement/rowbreak_frame.rs: src/renderer/float_placement/rowbreak_frame.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 9 (its worst body is rhwp::renderer::float_placement::rowbreak_frame::rowbreak_fragment_bounds at line 12), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC7AC\uADC0 \uC140 \uCEF7\uC758 \uBB3C\uB9AC \uD504\uB808\uC784\uACFC NO_LS \uACA9\uC790 \uC608\uC0B0 \uAD6C\uBD84\u201D; \u201Cfix: \uC0C8 devel\uC758 \uACF5\uD1B5 \uC870\uD310 \uACC4\uC57D\uACFC \uB9AC\uBCA0\uC774\uC2A4 \uC18C\uBE44 \uACBD\uB85C \uC5F0\uACB0\u201D; \u201Cfix: \uC6D0\uBCF8 \uC800\uC7A5 \uD504\uB808\uC784\uACFC \uC7AC\uAD6C\uC131\uD55C \uD45C \uC870\uAC01\uC758 \uC608\uC0B0 \uC18C\uC720 \uBD84\uB9AC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/float_placement/rowbreak_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/float_placement/rowbreak_frame.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6835c6f4670e95c9d535d5e450243b9c34f7734fbf512aab3020246b38b4a97"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/advance_contract.rs: src/renderer/equation/advance_contract.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 9 (its worst body is rhwp::renderer::equation::advance_contract::has_source_advances at line 7), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix: \uC218\uD559 \uC810 \uAE30\uD638\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uC7A5\uC2DD \uBCF8\uCCB4 \uC5EC\uC720\uB97C \uACF5\uC720\u201D; \u201Cfix: \uD55C\uCEF4 \uB300\uBB38\uC790 \uD45C\uC2DC\uC640 \uBA85\uC2DC \uACF5\uBC31\uC758 \uACF5\uD1B5 \uC789\uD06C \uD504\uB808\uC784 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/advance_contract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/advance_contract.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d368eaa9a9ed5246db5e10d54dd0335ea8a1bc066bb071b7ab33c0c6f029a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/font_metric_legacy_hft.rs: src/renderer/font_metric_legacy_hft.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 rhwp::renderer::font_metric_legacy_hft::metric_face_name at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC6D0\uBCF8 HFT \uBE44\uB840 \uD3ED\uACFC \uD655\uC815 \uC800\uC7A5 \uD504\uB808\uC784 \uC6D0\uC810 \uBCF4\uC644\u201D; \u201Cfix: \uB3C5\uB9BD Print\uC758 \uD55C\uC591\uC911\uACE0\uB515 HFT \uD3ED \uBCF4\uC874\uACFC \uBC18\uB840 \uAE30\uB85D\u201D; \u201Cfix: HFT \uC6D0\uBCF8 \uC804\uC9C4\uD3ED\uACFC \uAD75\uAE30 \uAC04\uACA9\uC744 \uCE21\uC815\u00B7\uC815\uB82C\uC5D0 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/font_metric_legacy_hft.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_metric_legacy_hft.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17c47bf8b902929379d843864f0b07e82bcdd07f384c1f3a96284910d629d75"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/skia/fill.rs: src/renderer/skia/fill.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 rhwp::renderer::skia::fill::gradient_paint at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB3C5\uB9BD Print\uC5D0 \uB9DE\uCDB0 HWP3 \uCC44\uC6B0\uAE30 \uC911\uC810\uACFC \uC6D0\uD615 \uBC18\uACBD \uBCF4\uC815\u201D; \u201Cfix: \uCD5C\uC2E0 devel \uB9AC\uBCA0\uC774\uC2A4\uC758 \uADF8\uB77C\uB370\uC774\uC158 \uACF5\uD1B5 \uACC4\uC57D \uBCF4\uC874\u201D; \u201Cfix: \uB204\uC801 \uCCB4\uB9AC\uD53D\uC5D0 \uC6D0 PR\uC758 \uD1B5\uD569 \uD574\uC18C \uACB0\uACFC \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/skia/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":"src/renderer/skia/fill.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e377bf0f96a08e5386bd79c80aa4706905ffe9097b143a7c4a6cd87877e39b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/document_core/commands/object_ops/shape/group_geometry.rs: src/document_core/commands/object_ops/shape/group_geometry.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 rhwp::document_core::commands::object_ops::shape::group_geometry::placement_from_attributes at line 108), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(review): \uC591\uC2DD \uC904 \uC18C\uC720\uC640 \uB2E4\uAC01\uD615 \uACF5\uD1B5 \uBCC0\uD658 \uD504\uB808\uC784 \uBCF4\uC815\u201D; \u201Cfix: \uD68C\uC804 \uB3C4\uD615\uC758 \uC800\uC7A5 \uD504\uB808\uC784\uACFC \uD615\uC2DD\uBCC4 \uBCC0\uD658 \uD589\uB82C \uACF5\uD1B5\uD654\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/object_ops/shape/group_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":"src/document_core/commands/object_ops/shape/group_geometry.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5041a02c40a0c713ac98f524f5c558d508c83da664a5056e635d8c8ff2d65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/literal_text.rs: src/renderer/equation/layout/literal_text.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 EqLayout::layout_literal_text at line 6), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uCD95\uC57D \uC774\uD56D \uAE30\uD638\uC640 \uBA85\uB839 \uACBD\uACC4\u00B7\uC218\uD559 \uC804\uC9C4\uD3ED \uC77C\uCE58\u201D; \u201Cfix: \uC778\uC6A9 \uAE30\uD638\uC640 \uACF5\uBC31\uC744 \uACF5\uD1B5 \uC218\uC2DD \uC904 \uBA54\uD2B8\uB9AD\uC73C\uB85C \uBC30\uCE58\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/literal_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":"src/renderer/equation/layout/literal_text.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"630d1dac336e1be54daee5052b6e77293a5124e7e553ddfe8100367ffa9d837e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/parser_groups.rs: src/renderer/equation/parser_groups.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 7 (its worst body is EqParser::paren_then_script at line 115), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uAE00\uAF34 \uC804\uD658 \uBC94\uC704\uB97C \uBCF5\uC6D0\u201D; \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/parser_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":"src/renderer/equation/parser_groups.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36d638f4ac010d9bb8e3b2091def0b192606173c254d34fad70533d260e95c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/typeset/table/deferred_float_flow.rs: src/renderer/typeset/table/deferred_float_flow.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 7 (its worst body is TypesetEngine::pre_emit_deferred_host_lines at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC140 \uB3C4\uD615 \uD3B8\uC9D1\uACFC \uC218\uC2DD\u00B7\uC5F0\uC18D \uD45C\uC758 \uC6D0\uBCF8 \uD504\uB808\uC784\u00B7\uAE00\uAF34 \uBCF4\uC874 (#8754)\u201D; \u201Cfix: \uB3C5\uB9BD \uC790\uC2DD \uC774\uC6D4 \uB4A4 \uBD80\uBAA8 \uD750\uB984 \uB05D\uC744 \uC2E4\uC81C \uBC30\uCE58\uC5D0 \uC804\uB2EC\u201D; \u201Cfix: \uB3C5\uB9BD \uC790\uC2DD\uC758 \uCEF7\uACFC \uBD80\uBAA8 \uBB3C\uB9AC \uD504\uB808\uC784 \uC18C\uC720 \uBD84\uB9AC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/typeset/table/deferred_float_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":"src/renderer/typeset/table/deferred_float_flow.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8c2abec06c1b24a5d5e9134e3c1e6948399920fa4d419accb86d9bb779a7fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: bindings/Native/examples/qt_gpu_view.py: bindings/Native/examples/qt_gpu_view.py 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 13 (its worst body is GpuViewportController.received at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native-example): handle typed GPU recovery failures in Qt\u201D; \u201Cfix(native-example): avoid retaining GPU windows through Qt classes\u201D; \u201Cfix(qt): cover stale GPU frames while presentation is pending\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- bindings/Native/examples/qt_gpu_view.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":"bindings/Native/examples/qt_gpu_view.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0480d437f8140c941573ac8e7b749c85515e7451dd12eb48a9dea9840bb3ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/document_core/commands/document/hft_outline_fonts.rs: src/document_core/commands/document/hft_outline_fonts.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 DocumentCore::register_hft_outline_font_native at line 30), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: WASM \uC778\uC1C4 \uBA54\uD2B8\uB9AD\u00B7\uAE00\uAF34 \uD504\uB85C\uADF8\uB7A8\u00B7JPEG \uD504\uB808\uC784 \uC77C\uCE58 \uBCF4\uC815 (#8583)\u201D; \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: \uC6D0\uBCF8 \uAE00\uAF34\uC758 \uAC00\uC2DC \uC61B\uD55C\uAE00 \uAE00\uB9AC\uD504\uC640 \uC131\uC870 \uC575\uCEE4 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/document_core/commands/document/hft_outline_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":"src/document_core/commands/document/hft_outline_fonts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c9e5711f2a6d6b9dda8a24f645fabb324bdc16db026f560ff179cf7e81a5cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/text_font_coverage.rs: src/renderer/text_font_coverage.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 12 (its worst body is TextFontCoverage::register at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: WASM \uC778\uC1C4 \uBA54\uD2B8\uB9AD\u00B7\uAE00\uAF34 \uD504\uB85C\uADF8\uB7A8\u00B7JPEG \uD504\uB808\uC784 \uC77C\uCE58 \uBCF4\uC815 (#8583)\u201D; \u201Cfix: HFT \uC6D0\uBCF8 \uAE00\uAF34 \uACF5\uAE09\uACFC \uD55C\uAE00 3.0 \uC870\uD310 \uBCF4\uC874 (#8397)\u201D; \u201Cfix: CSS \uAE00\uAF34 \uC774\uB984\uC758 \uC778\uC6A9\uC744 \uD574\uC11D\uD574 \uACF5\uD1B5 \uAE30\uC6B8\uC784 \uC120\uD0DD \uBCF5\uAD6C\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/text_font_coverage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/text_font_coverage.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d03e23e1bb41e47b744b8dccd29e089ba88ff8bccf3026da690231d9c5d14b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/serializer/line_cache.rs: src/serializer/line_cache.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 rhwp::serializer::line_cache::can_serialize_line_partition at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(renderer): #8438 \uBBF8\uC885\uACB0 \uC6D0 PR \uBCF4\uC815\uACFC \uAC1C\uBCC4 \uAC80\uD1A0 (#8517)\u201D; \u201Cfix: HWPX \uD3B8\uC9D1 \uC790\uAE30\uAC80\uC99D\uC5D0\uC11C \uC800\uC7A5 \uC904 \uCE90\uC2DC \uACC4\uC57D \uC801\uC6A9\u201D; \u201Cfix(serializer): \uC6D0\uBCF8 \uC800\uC7A5 \uD589\uACFC \uC7AC\uC870\uD310 \uD0ED \uCE90\uC2DC\uC758 \uBCF4\uC874 \uACBD\uACC4 \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/serializer/line_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/line_cache.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb84a91ec4748a4b21dba78fb72b6a249a5db1a327e663b3c76395968c52326"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/composer/inline_frame_admission.rs: src/renderer/composer/inline_frame_admission.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 rhwp::renderer::composer::inline_frame_admission::supports_uncached_inline_host at line 5), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(layout): \uC5B4\uC6B8\uB9BC \uAE00\uC0C1\uC790 \uBC14\uAE65 \uC0C1\uC790\uB85C \uBCF8\uBB38 \uC904\uC744 \uAE4E\uB294\uB2E4 (#8399)\u201D; \u201Cfix(layout): \uC800\uC7A5 \uC904 \uC5C6\uB294 \uAE00\uC790\uCC98\uB7FC \uADF8\uB9BC host \uB294 \uC5B4\uC6B8\uB9BC \uBD80\uB3D9 \uB3C4\uD615\uACFC \uD568\uAED8\uC5EC\uB3C4 \uD604\uC7AC \uD504\uB808\uC784\uC5D0\uC11C \uC7AC\uC870\uD310\uD55C\uB2E4 (#8282)\u201D; \u201Cfix(layout): \uC800\uC7A5 \uC904 \uC5C6\uB294 \uAE00\uC790\uCC98\uB7FC \uADF8\uB9BC \uD638\uC2A4\uD2B8\uAC00 \uC904 \uD3ED \uC911\uB9BD \uBD80\uB3D9 \uAC1C\uCCB4\uC640 \uD568\uAED8\uC5EC\uB3C4 \uD604\uC7AC \uD504\uB808\uC784\uC5D0\uC11C \uC7AC\uC870\uD310\uB41C\uB2E4 (#8271)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/composer/inline_frame_admission.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/composer/inline_frame_admission.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceed2d2300db7a80203a7f5a2040f31c7d4ebac83470600860841da70e0f36d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/model/hwp3_page_ownership.rs: src/model/hwp3_page_ownership.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 PageOwnership::restore_section at line 159), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hwpx): HWP3 \uCD9C\uCC98 HWPX\uC758 \uC904 \uC2DC\uC791\uC744 \uD55C\uCEF4\uACFC \uAC19\uC740 \uBB38\uB2E8 \uCD95\uC73C\uB85C \uC800\uC7A5\uD55C\uB2E4 (#8303)\u201D; \u201Cfix: HWP3 \uC655\uBCF5\uC758 \uC81C\uC5B4 \uC790\uB9AC\uBB38\uC790\uC640 \uC6D0\uBCF8 \uBB38\uC790 \uCD95 \uBCF4\uC874\u201D; \u201Cfix: SHA-256 \uBC14\uC774\uD2B8\uB97C \uD604\uC7AC digest API\uC5D0 \uB9DE\uAC8C \uC778\uCF54\uB529\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/model/hwp3_page_ownership.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hwp3_page_ownership.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2900de889f9ebcc76a497e917d2b779427a8fbeffb20f70debeb3c3cf73004"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/emf/mod.rs: src/emf/mod.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 Error::fmt at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC6D0\uBB38 \uB300\uC870 \uC870\uD310 \uBCF4\uC815\uACFC \uAC1C\uBCC4 PR \uC99D\uC801 \uC815\uC815 (#8328)\u201D; \u201Cfix: EMF \uC7A5\uCE58 \uD39C\uC758 \uB2E8\uC704\uB97C \uCD9C\uB825 \uC7A5\uCE58\uC640 \uADF8\uB9BC \uBC30\uCE58\uC5D0 \uC804\uB2EC\u201D; \u201Cfix: \uC800\uC7A5 \uC870\uD310\uACFC \uBA54\uD0C0\uD30C\uC77C\u00B7\uBA38\uB9AC\uB9D0 \uBC30\uCE58 \uBCF4\uC815 \uC9C4\uD589\uBD84 \uACE0\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/emf/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":"src/emf/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25c5e1863288540d8fed39c6394f164979d76d96079957c4603648734b540fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/reflow_float_host_line.rs: src/renderer/reflow_float_host_line.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 rhwp::renderer::reflow_float_host_line::neutral_anchor_metrics at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uB9AC\uBCA0\uC774\uC2A4\uD55C NoLS \uD45C \uD638\uC2A4\uD2B8\uC758 \uC904 \uBA54\uD2B8\uB9AD\uC744 \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uBE48 \uBD80\uB3D9 \uAC1C\uCCB4 \uD638\uC2A4\uD2B8\uC758 \uAE00\uC790 \uC904 \uC810\uC720\uB97C \uACF5\uD1B5 \uBA54\uD2B8\uB9AD\uC73C\uB85C \uBCF4\uC874\u201D; \u201Cfix(renderer): \uC800\uC7A5 \uC904 \uC5C6\uB294 \uBB38\uC11C\uC758 \uB5A0 \uC788\uB294 \uC791\uC740 \uD45C\uC640 \uBE48 host \uC904\uC744 \uD55C/\uAE00\uCC98\uB7FC \uB193\uB294\uB2E4 (#8080)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/reflow_float_host_line.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/reflow_float_host_line.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1102d2af27d1bc2af48498a9f24481023676a39531596273f4ce7d0db7935a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/cubic_sampling.rs: src/renderer/cubic_sampling.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 12 (its worst body is rhwp::renderer::cubic_sampling::rasterize at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uACF5\uD1B5 Print \uBCF4\uAC04 \uAC00\uC911\uCE58\uB97C \uAE30\uBCF8 \uBE4C\uB4DC\uC5D0\uB3C4 \uC81C\uACF5\u201D; \u201Cfix: \uC5F0\uC18D \uC54C\uD30C \uADF8\uB9BC\uC758 \uACF5\uD1B5 \uC778\uC1C4 \uACA9\uC790\uC640 \uB3C5\uB9BD \uD68C\uADC0 \uBCF4\uC815\u201D; \u201Cfix: \uADF8\uB9BC \uC7AC\uAD6C\uC131\uC744 \uC2E4\uC81C \uD55C\uCEF4 Print \uC0C9 \uC804\uB2EC payload\uC5D0 \uACB0\uD569\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/cubic_sampling.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/cubic_sampling.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98710def5d8733b2f52229e28b01cbb0fadad9e7d747e0d8b1297082d291195"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/layout/table_layout/reflow_external_flow.rs: src/renderer/layout/table_layout/reflow_external_flow.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 LayoutEngine::reflow_unrestricted_table_flow at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC7AC\uC870\uD310 \uC140\uACFC \uC778\uB77C\uC778 \uAC1C\uCCB4\uC758 \uACF5\uD1B5 \uC904 \uD504\uB808\uC784 \uC804\uB2EC\u201D; \u201Cfix: \uC678\uBD80 \uC790\uC190 \uC810\uC720\uC640 \uBD80\uBAA8 \uC140 \uBB3C\uB9AC \uD504\uB808\uC784 \uBD84\uB9AC\u201D; \u201Cfix: \uB3C5\uB9BD \uC790\uC2DD\uC758 \uCEF7\uACFC \uBD80\uBAA8 \uBB3C\uB9AC \uD504\uB808\uC784 \uC18C\uC720 \uBD84\uB9AC\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/layout/table_layout/reflow_external_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":"src/renderer/layout/table_layout/reflow_external_flow.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7073ab014ef97649286941d6b311f143a9d99a9da04c02be798697639a20da"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/font_style_runs.rs: src/renderer/equation/font_style_runs.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 rhwp::renderer::equation::font_style_runs::resolve at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): \uAD6C\uD615 \uADF8\uB8F9\uC758 \uAE00\uAF34 \uC804\uD658 \uBC94\uC704\uB97C \uBCF5\uC6D0\u201D; \u201Cfix(equation): \uAD6C\uD615 CHAR\uC758 \uB17C\uB9AC \uC804\uC9C4\uACFC \uADF8\uB8F9 \uC18C\uC720\uB97C \uACF5\uD1B5 \uBC30\uCE58\uC5D0 \uBCF4\uC874\u201D; \u201Cfix: \uBD80\uCC29 \uCCA8\uC790 \uB4A4\uC5D0\uB3C4 \uAE00\uAF34 \uC804\uD658\uC758 \uD604\uC7AC \uADF8\uB8F9 \uBC94\uC704\uB97C \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/font_style_runs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/font_style_runs.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd26195bcc40e52d4e513a32f593a006fa5505a44ef79dcccfe429d2d37379"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/uncached_flow_metrics.rs: src/renderer/equation/uncached_flow_metrics.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 rhwp::renderer::equation::uncached_flow_metrics::metrics at line 6), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(equation): COL \uC778\uC790\uC640 \uD45C\uC2DC \uC138\uB300\uBCC4 \uC624\uB958\uB97C \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uCC98\uB9AC\u201D; \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD\uC758 \uACF5\uBC31 \uD56D\uACFC \uBD84\uC218 \uD53C\uC5F0\uC0B0\uC790 \uC18C\uC18D\uC744 \uACF5\uD1B5 \uD30C\uC11C\uC5D0\uC11C \uBCF4\uC874\u201D; \u201Cfix: \uBB38\uC11C \uC218\uC2DD\uC758 \uBB38\uC790 \uBA85\uB839\uACFC \uACF5\uAC1C LaTeX \uD655\uC7A5 \uACBD\uACC4\uB97C \uAD6C\uBD84\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/uncached_flow_metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/uncached_flow_metrics.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59027294247e517912ae0e063057b817f01d901a16deaefb537664dd5b16d90"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rhwp-ooxml-chart/src/legend_layout.rs: crates/rhwp-ooxml-chart/src/legend_layout.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 LegendLayout::new at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uBC94\uB840 \uD0A4 \uC11C\uC2DD\uACFC \uAC00\uB85C \uD589\uC758 \uCE21\uC815\u00B7\uD45C\uC2DC \uACB0\uACFC \uACF5\uC720\u201D; \u201Cfix: \uCC28\uD2B8 \uAE00\uC904 \uD68C\uC804\uACFC \uCD95\u00B7\uBC94\uB840 \uC608\uC57D\uC744 \uBCF4\uC644\u201D; \u201Cfix: \uCC28\uD2B8 \uCD95 \uBC94\uC704\uC640 \uBC94\uC8FC \uAE00\uC904 \uC608\uC57D\uC744 \uACF5\uD1B5 \uACC4\uD68D\uC73C\uB85C \uC5F0\uACB0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- crates/rhwp-ooxml-chart/src/legend_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/rhwp-ooxml-chart/src/legend_layout.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"268cee61f66ad5431c0f0f515264700ef9302a945955e57b94dcab89ce33b40c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/emphasis.rs: src/renderer/emphasis.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 SourceGraphemes::new at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC2E4\uC81C \uC11C\uC2DD \uACBD\uACC4\uC758 \uAC15\uC870\uC810\uACFC \uBCF4\uCDA9 \uCE21\uC815 \uC6B0\uC120\uC21C\uC704 \uBCF4\uC815\u201D; \u201Cfix: \uC790\uC18C\uC758 \uC2E4\uC81C \uC804\uC9C4\uACFC \uAC15\uC870\uC810 \uC18C\uC720\u00B7\uBCF8\uBB38 \uAE30\uC6B8\uC784\uC744 \uACF5\uD1B5\uD654\u201D; \u201Cfix: \uC6D0\uBCF8 \uAE00\uAF34\uC758 \uAC00\uC2DC \uC61B\uD55C\uAE00 \uAE00\uB9AC\uD504\uC640 \uC131\uC870 \uC575\uCEE4 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/emphasis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/emphasis.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"537749731e8194ae128e9c3bef61c50d66b9cc8780da2bf30f4dcb84a5bc5f64"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/parser/hwp3/paragraph.rs: src/parser/hwp3/paragraph.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 rhwp::parser::hwp3::paragraph::apply_line_indentation at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: HWP3 \uACE0\uC815 \uC904\uAC04\uACA9\uC758 \uB192\uC774\uC640 \uC5EC\uC720 \uC911\uBCF5 \uB204\uC801 \uC81C\uAC70\u201D; \u201Cfix: \uC218\uC2DD \uD638\uC2A4\uD2B8 \uC904 \uC5EC\uC720\uC640 \uC6D0\uBCF8 HFT \uC601\uBB38 \uC804\uC9C4\uD3ED \uBCF4\uC874\u201D; \u201Cfix: HWP3 \uBB38\uB2E8 \uB4E4\uC5EC\uC4F0\uAE30\uC758 \uC904\uBCC4 \uC18D\uC131 \uBCF4\uC874\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/parser/hwp3/paragraph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/paragraph.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89052fc5aceb88c5dccce200caca35c82dc3314bb3afd5a89b19a1982e00033"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/source_roman_advance.rs: src/renderer/equation/layout/source_roman_advance.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 rhwp::renderer::equation::layout::source_roman_advance::measured at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uBCA1\uD130 \uACBD\uACC4\uC758 \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uC815\uCCB4 \uAE00\uB9AC\uD504 \uC804\uC9C4\uC744 \uACF5\uC720\u201D; \u201Cfix: \uC218\uC2DD \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uAD6C\uBD84\uC790 \uC724\uACFD\u00B7\uB17C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uC720\u201D; \u201Cfix: \uADFC\uD638\uC640 \uC774\uD0E4\uB9AD \uAE00\uC790\uC758 \uB17C\uB9AC \uC804\uC9C4 \uBA54\uD2B8\uB9AD \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/source_roman_advance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/source_roman_advance.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f44f4e176ef042b4c4c98b4b2ef117b7f5cbfa6e83fc6ed408d006833564ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/big_op_geometry.rs: src/renderer/equation/layout/big_op_geometry.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 12 (its worst body is EqLayout::layout_big_op at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD55C\uCEF4 \uC218\uC2DD \uAD6C\uC870 \uD504\uB808\uC784\uACFC \uC800\uC7A5 \uC904 \uC5C6\uB294 \uC778\uB77C\uC778 \uAC04\uACA9 \uBCF4\uC815\u201D; \u201Cfix: \uC6D0\uBCF8 \uC218\uD559 \uCD95\uC744 \uBD84\uC218\u00B7\uD569\uACFC \uAC01 \uCD9C\uB825 \uACBD\uB85C\uC5D0 \uACF5\uD1B5 \uC804\uB2EC\u201D; \u201Cfix: \uB3C5\uB9BD \uD55C\uCEF4 \uC804\uC9C4\uC5D0 \uB9DE\uCDB0 \uD569\u00B7\uADFC\uD638 \uAC04\uACA9\uACFC \uBBF8\uC8FC \uC81C\uBAA9 \uC18C\uC720 \uBCF4\uC815\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/big_op_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":"src/renderer/equation/layout/big_op_geometry.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"67853fb1fc0cbe7e937208437cbf1e54975f9902a0e18dfa58e9f705d517f60c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/delimiter_outline.rs: src/renderer/equation/layout/delimiter_outline.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 EqLayout::delimiter_outline at line 7), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uD56D \uACBD\uACC4\uC758 \uC5F0\uC0B0\uC790 \uBB38\uB9E5\uACFC \uAD6C\uBD84\uC790 \uB17C\uB9AC \uAE30\uC900\uC120\uC744 \uACF5\uC720\u201D; \u201Cfix: \uC791\uC740 \uD655\uC7A5 \uAD04\uD638\uC758 \uC138\uB85C \uAE00\uAF34 \uD504\uB808\uC784\uACFC \uCC44\uC6C0 \uC724\uACFD \uBC1C\uD589\u201D; \u201Cfix: \uD070 \uB465\uADFC \uAD04\uD638\uB97C \uACF5\uAC1C MATH cap\uACFC \uC9C1\uC120 \uBD80\uD488\uC73C\uB85C \uC870\uB9BD\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/delimiter_outline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/delimiter_outline.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50abb80c137e98daa41dc8481f68bf8fe2a08268fbaae1cc0dfef3cafa35f88"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/renderer/equation/layout/source_font_advance.rs: src/renderer/equation/layout/source_font_advance.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 rhwp::renderer::equation::layout::source_font_advance::vertical_slot at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \uC808\uB313\uAC12\uC758 \uB3C5\uB9BD \uAE00\uAF34 \uC2AC\uB86F\uC73C\uB85C \uBCF8\uCCB4\uC640 \uC804\uCCB4 \uD3ED \uBC30\uCE58\u201D; \u201Cfix: \uD55C\uCEF4\uC758 \uBD99\uC740 \uCCA8\uC790 \uC2DD\uACFC \uBD80\uBAA8 \uC2AC\uB86F\u00B7\uC911\uCCA9 \uC18C\uC18D\uC744 \uBCF4\uC874\u201D; \u201Cfix: \uC218\uC2DD \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uAD6C\uBD84\uC790 \uC724\uACFD\u00B7\uB17C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uC720\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/renderer/equation/layout/source_font_advance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/layout/source_font_advance.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1a03003ab84383e8c43e8f0c1647f684a357a580397e3c11cd5170eb78a8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/native_host/clipboard.rs: src/native_host/clipboard.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 12 (its worst body is NativeEditor::paste_html at line 169), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(native): preserve copied HTML through clipboard round trips\u201D; \u201Cfix(native): match lexical HTML tag names as bytes\u201D; \u201Cfix: reject lossy native clipboard and body edits\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 09:27:49 \u002B09:00\u0027 --until=\u00272026-11-10 09:27:49 \u002B09:00\u0027 --full-history --no-merges -- src/native_host/clipboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/native_host/clipboard.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07d4a3809414a6c84341bca78755c0a7a7a514503bdb82b77cf6f2d53759318"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 119 significant file(s) lose their only recent owner: src/tools/font_metric_gen.rs, gym/tools/evidence_report.py, src/renderer/shaping_paragraph.rs, scripts/font_rank8_private_qualification.py, src/renderer/shaping_vertical.rs, src/cli/commands/edit/header_footer_content.rs, src/renderer/shaping_context.rs, src/cli/queries/security_inspection.rs (\u002B111 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58035f05c923647805575ff69d87ece0b0479d90ebacdb90e3517c288e705223"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 88 significant file(s) lose their only recent owner: scripts/visual_sweep.py, tools/fidelity_compare/fidelity_compare.py, src/renderer/typeset/controls/stored_tac.rs, src/renderer/font_environment.rs, src/paint/paper_viewport.rs, src/ole_chart/legacy_presentation.rs, src/renderer/layout/table_layout/stored_ordinary_row_frame.rs, scripts/oracle_comparability.py (\u002B80 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9db1d3a5af0148572ea01ab45bc92e762fc84138d4c96e15f7a72189fbfb1e55"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 56 significant file(s) lose their only recent owner: src/eps.rs, src/parser/pdf/recognition.rs, tools/hwpctrl_compat/classify_remaining.py, tools/verify_pi_page_vs_hangul.py, tools/hwpctrl_compat/build_ledger.py, tools/verify_hangul_pages.py, tools/hwpctrl_compat/sweep_actions.py, src/document_core/commands/bin_data_prune.rs (\u002B48 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"76386d37765284feaae0d27db812b94258be1579e52a10d22b4a0bb3f15d7055"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 46 significant file(s) lose their only recent owner: gym/tools/competitive_bench.py, tools/agent_onboarding/rhwp_doctor.py, gym/tools/agent_session.py, gym/core/runner.py, gym/tools/leaderboard.py, gym/tools/differential.py, src/document_core/queries/stego_scan.rs, src/rag/chunker.rs (\u002B38 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"79478c6d7949ddf33094c819587724b2fe6b9c157ed398dc1b994d9ec3d04cdd"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 41 significant file(s) lose their only recent owner: bindings/Native/src/session.rs, rhwp-studio/src/view/static-svg-path-layers.ts, src/renderer/skia/glyph_replay.rs, src/native_host/runtime.rs, src/native_host/editor.rs, rhwp-studio/src/view/glyph-outline-payload-status.ts, src/native_host/accessibility.rs, src/paint/text_v2_export.rs (\u002B33 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"443f7afad8a8b3a06c2d3d403c14c5374ea5eb5c31fe39aade66e41ed76a3927"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 17 significant file(s) lose their only recent owner: rhwp-studio/src/dev/page-scroll-probe.ts, rhwp-studio/src/view/page-render-scheduler.ts, rhwp-studio/src/ui/icon-toolbar-scroller.ts, src/cli/commands/caption_validation.rs, rhwp-studio/src/view/render-surface-budget.ts, rhwp-studio/src/ui/style-toolbar-overflow.ts, rhwp-studio/src/dev/scroll-observation.ts, rhwp-studio/src/engine/input-handler-hyperlink.ts (\u002B9 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3542dbd0bb264227a007c155c5e451ab4314e40d3c7f6e6e873edc8e218e5638"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 11 significant file(s) lose their only recent owner: crates/rhwp-ooxml-chart/src/patch.rs, rhwp-studio/src/ui/chart-data-dialog.ts, rhwp-studio/src/core/chart-data-target.ts, src/document_core/queries/chart_csv.rs, rhwp-studio/src/core/chart-grid-model.ts, src/serializer/ole_container.rs, mydocs/tech/investigations/issue-595/probes/inspect_595_regression.rs, mydocs/tech/investigations/issue-7441/probes/repro_7441_reporter_geometry.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9144c0da236b3f0bb045450956a7410af9086dba3fa11240acf2bed2313af52e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #8: If anonymized user #8 becomes unavailable, 5 significant file(s) lose their only recent owner: tools/hangul_rotation_oracle/oracle.py, rhwp-studio/src/hwpctl/action.ts, rhwp-studio/src/ui/dialog-apply.ts, rhwp-studio/src/engine/line-start-affinity.ts, rhwp-studio/src/hwpctl/actions/clipboard.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eaf9062665f6b3a24b939be382dbd06effe8b01e627d817eaa998499db2b1fa5"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (389 single-owned of 2038 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2038 of the 2715 production source files in this repository met that bar). They are anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: rhwp-studio/src/compare/diff-engine.ts, rhwp-studio/src/compare/types.ts, rhwp-studio/src/view/ruler-pin-geometry.ts, rhwp-studio/src/core/event-bus.ts, tools/fixture_generators/build_issue_505_fixture.rs, rhwp-studio/src/command/field-insert-params.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //  TODO: Not written in [MS-WMF] how to parse this field. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/parser/objects/structure/device_independent_bitmap.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8200cfbe74974145b10f326a477a29a8ae7eff9c36c5bf8475839277ca9e2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: background color \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wmf/converter/svg/mod.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"4088a60569b05e27e3c8c6c9e54ecb9f189d99630bb5ce3c3156c3bfa4ca09d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: current_height \uB204\uC801\uC774 \uC815\uD655\uD574\uC9C0\uBA74 \uBC29\uC5B4 \uB85C\uC9C1\uACFC \uD568\uAED8 \uC81C\uAC70 \uAC00\uB2A5. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/state.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a739cf6f2ac58b2cf17faac92fed54fdd6ae4a91fb637bec8944ccc4a3dfd4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // --- \uBC29\uC5B4 \uB85C\uC9C1 (TODO: current_height \uB204\uC801\uC774 \uC815\uD655\uD574\uC9C0\uBA74 \uC81C\uAC70 \uAC00\uB2A5) --- \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/pagination/state.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a464f9504020223b422e75d9b2b67c9ac649b291b19c3afa197523ae560f247a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // [Task #1138] TODO: layout_group_child_affine \uC5D0 cell ctx propagate (\uBCC4\uB3C4 \uD6C4\uC18D)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0203e145132af127dae06176f6e25b788b3c04ab6b43abdc460a8b2cf15d2d7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // [Task #1138] TODO: layout_textbox_content \uC5D0 cell ctx propagate (\uBCC4\uB3C4 \uD6C4\uC18D)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5699e64fb0de4abd8c3f9c6f56c110f905dd86f993e85598238e544e8987ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: TagID 3\uC5D0\uC11C \uCD94\uCD9C \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwp3/mod.rs"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba8fad6bbbffe9544d52cd2bb143c748a2b564f098d5856fcfdc5c80b47e037"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(v2): use \u0060field_ranges\u0060 / \u0060control_text_positions()\u0060 to split the text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/paragraph.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a12ed3186947c90ceab6261d809399dcd5a0cf3d31b6a0ed87deb0d160377"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ActID\u0060 spells \u0060ID\u0060 where 207 names in the project spell it \u0060Id\u0060: 207 of 209 names in project repository spell the token \u0060Id\u0060 (207 of 209; unit: names in project repository containing \u0060Id\u0060). Peers: AgentLoopOptions.executeTool(boundaryId) (rhwp-studio/src/ai/agent/agent-loop.ts:66); AgentLoopOptions.createBoundaryId (rhwp-studio/src/ai/agent/agent-loop.ts:68); ChatController.executeCommandTool(boundaryId) (rhwp-studio/src/ai/agent/chat-controller.ts:153); ChatController.executeWrite(boundaryId) (rhwp-studio/src/ai/agent/chat-controller.ts:167); rhwp-studio.src.ai.provider.models.AiProviderId (rhwp-studio/src/ai/provider/models.ts:6). Rename to \u0060ActId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/action.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5cca2a172e891a6fca0a98baf0a2a6cd6b2f57a689514f45d8fd7b3f5fe455"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060SetID\u0060 spells \u0060ID\u0060 where 207 names in the project spell it \u0060Id\u0060: 207 of 209 names in project repository spell the token \u0060Id\u0060 (207 of 209; unit: names in project repository containing \u0060Id\u0060). Peers: AgentLoopOptions.executeTool(boundaryId) (rhwp-studio/src/ai/agent/agent-loop.ts:66); AgentLoopOptions.createBoundaryId (rhwp-studio/src/ai/agent/agent-loop.ts:68); ChatController.executeCommandTool(boundaryId) (rhwp-studio/src/ai/agent/chat-controller.ts:153); ChatController.executeWrite(boundaryId) (rhwp-studio/src/ai/agent/chat-controller.ts:167); rhwp-studio.src.ai.provider.models.AiProviderId (rhwp-studio/src/ai/provider/models.ts:6). Rename to \u0060SetId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/action.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae02c4d901599a5cc13917b8105316e91d7a5e258a5b98e02de214d2d8b36e71"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060createObjectURL\u0060 spells \u0060URL\u0060 where 23 names in the project spell it \u0060Url\u0060: 23 of 25 names in project repository spell the token \u0060Url\u0060 (23 of 25; unit: names in project repository containing \u0060Url\u0060). Peers: gemini.geminiStreamUrl (rhwp-studio/src/ai/provider/gemini.ts:160); print-surface.resolvePrintSurfaceUrl (rhwp-studio/src/command/print-surface.ts:38); print-surface.resolvePrintSurfaceUrl(baseUrl) (rhwp-studio/src/command/print-surface.ts:38); CanvasKitFontPlanOptions.localFontBaseUrl (rhwp-studio/src/core/font-loader.ts:32); FontResource.cssUrl (rhwp-studio/src/core/font-loader.ts:79). Rename to \u0060createObjectUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/browser-image-decoder.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da098c400dd859d79ef5526415ab217ddf8da27fe43970c8777222a15bfb595a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060revokeObjectURL\u0060 spells \u0060URL\u0060 where 23 names in the project spell it \u0060Url\u0060: 23 of 25 names in project repository spell the token \u0060Url\u0060 (23 of 25; unit: names in project repository containing \u0060Url\u0060). Peers: gemini.geminiStreamUrl (rhwp-studio/src/ai/provider/gemini.ts:160); print-surface.resolvePrintSurfaceUrl (rhwp-studio/src/command/print-surface.ts:38); print-surface.resolvePrintSurfaceUrl(baseUrl) (rhwp-studio/src/command/print-surface.ts:38); CanvasKitFontPlanOptions.localFontBaseUrl (rhwp-studio/src/core/font-loader.ts:32); FontResource.cssUrl (rhwp-studio/src/core/font-loader.ts:79). Rename to \u0060revokeObjectUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/browser-image-decoder.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5fafef236487d2785abe78b043be4409f69c2d0366f6342855eef23b563c3a"}},{"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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"severity":"critical","fixedVersion":"9.0.5","relation":"separate-copy","declaredRange":"9.0","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":"8c57eff170244ced0c547085218a04dddfa06632e236cd03c868ae9a1921dd9f"},"properties":{"dependency":{"package":"brotli","version":"1.1.0","advisory":"[GHSA redacted]","aliases":["BIT-brotli-2026-111497","BIT-dotnet-2026-111497","BIT-dotnet-sdk-2026-111497","BIT-node-2026-111497","BIT-node-min-2026-111497","BIT-powershell-2026-111497","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2026-6888","PYSEC-2026-1906","PYSEC-2026-2401","PYSEC-2026-4322","PYSEC-2026-4323"],"severity":"critical","fixedVersion":"1.2.1","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":"75e7568e0a65e89c25507d47f8b02c6323e55de66e0570c0fce0aa216d01101f"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"severity":"critical","fixedVersion":"9.0.5","relation":"separate-copy","declaredRange":"=9.0.2","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":"f8514dcb213cc14236595e76c23a547449658abc2e60c2e15d528b10c22f5ccc"},"properties":{"dependency":{"package":"zip","version":"9.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"=9.0.2","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":"35f703bc4e656b7925bc90c6254074538af299dcdea1fc18153e282c6410f58b"},"properties":{"dependency":{"package":"zip","version":"9.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"9.0.5","relation":"transitive","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":"d0eb95ac6445c62f585eb0b84f0339dc86301aac6d2c3da08340b929f355d58e"},"properties":{"dependency":{"package":"browserslist","version":"4.28.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"5b1d07b3a278d5684f95fba6d86f618ab8c3a8157f84667fb52e6ab08c75da7a"},"properties":{"dependency":{"package":"zod","version":"4.6.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","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":"ce1bbd21d1b6cede015a7dfe719c214c142a56262d711a3d9fabfa0d19e89a5d"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","severity":"medium","fixedVersion":"0.4.4","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0.15","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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":"be12c71023c43937a607a177a93163e0581c742a3255ef7103051bf074226b53"},"properties":{"dependency":{"package":"rustybuzz","version":"0.20.1","advisory":"RUSTSEC-2026-0206","severity":"medium","relation":"direct","declaredRange":"0.20","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","severity":"medium","relation":"direct","declaredRange":"0.25","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":"7c3007db23a5f5a6fe8bd967f7893b0eb05c5b31dceb2ec831b5a10efb6e533e"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"severity":"medium","fixedVersion":"0.20.0","relation":"transitive","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":"97f9acf97294564e225b14ed7221f0c3d460a3f268a5555932f08f57aa1aea96"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","severity":"medium","relation":"transitive","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":"2caf71bdb1ec75bb349f8e1b700aec23a693e9b47305bc6672b88432e223c2d6"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","relation":"transitive","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":"b9f4b7488acdccfda09b8b615aefcc3fe45059f848161250c9f018f209b12684"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.14","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","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":"462dfaecb29a9ce618e67297da229012def349091de4679384dd43bbd516fecd"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"transitive","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":"1498add25795868c1716dff3372117d0708b31585a69971570e95939aceb85dc"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","severity":"medium","relation":"transitive","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":"f6d0961735026435728c3259e53db7b83881c7cb013d82f7fba4aaa8ac84ae6a"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","severity":"medium","relation":"transitive","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":"4644fd37efc1aa4460ccdf9b58e3c6c2c915dfc2c75b817b01d7450e63ad2496"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","severity":"medium","relation":"transitive","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":"c8a6854095337b3890ba528193be8614ff7d5a0c0c6a2a84948e33d5e016bb56"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","severity":"medium","relation":"transitive","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":"bb6f9d5399d529f7df3d7677a224757d311fb60a4b667d9278214cadf4b49ff3"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","severity":"medium","relation":"transitive","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":"1ede9cb0ae7133172c0e150a88de1b694acfbfffed8e67c3740760998ed8bc38"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","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":"ca952eb46d11f29544805145b9d41927025f7be9af92d4af9481c5abdb23b0ba"},"properties":{"dependency":{"package":"fonttools","version":"4.46.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1389"],"severity":"medium","fixedVersion":"4.60.2","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":"856b82d52c5d3c8e7b35b647e2456cb1fec64774a629161c99fc3ef630eaf1cc"},"properties":{"dependency":{"package":"ctutils","version":"0.4.3","advisory":"RUSTSEC-2026-0385","severity":"medium","fixedVersion":"0.4.4","relation":"transitive","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":"d7449a10ae0b88c64145bfe45de16c69b945910dd249967af1957cdb23b9c969"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","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":"2df246478c0f0ec4398e04168595fa4660e58cae157fe5bf8fc4f81d00428c54"},"properties":{"dependency":{"package":"rustybuzz","version":"0.20.1","advisory":"RUSTSEC-2026-0206","severity":"medium","relation":"transitive","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":"9048f74910d2e0aeb35fbe6d93867f08fab611d99e2c91e3d4bfb60bfa01ad11"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"transitive","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":"241d5ced2a979c72cbf65a5b2824280f4585a5c4b6bc10066b3c80f4743d74d9"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","severity":"medium","fixedVersion":"0.4.4","relation":"transitive","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":"c2b64fece3d4c3bd41df35338bd93312417ae3435d970ef916ca8d922812d4a8"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","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":"b6aa53f4d672d5ac4a6199be9759c3790b171a7e022ee3c68d2c95e339bdf5b5"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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":"6e307a1106abbd1d3dc3275f5f6873306c80361f08d83194e53fdeb8c3c41ad8"},"properties":{"dependency":{"package":"rustybuzz","version":"0.20.1","advisory":"RUSTSEC-2026-0206","severity":"medium","relation":"transitive","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":"f7ff2c9ac2f1143a0ba117b6484261b5903858a7b9ff969f019502e04465f446"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"transitive","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":"90cf8ae130aff7af336b01cc888c451c73752d43eccdbedb92cea1617eba205f"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.29","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"07f2e64b59e58ad4af16d1e9bf407a2f83591faa909a26fe19692f34b7e35585"},"properties":{"dependency":{"package":"fast-uri","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.2.3","relation":"transitive","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":"144fb0bf51fce950cab71c6363c59805e6b83c2580f769bab62e4d4160c6001a"},"properties":{"dependency":{"package":"glob","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"e5f40f271eaf395ecab36360038e9bb1f6ca4fe1befec053934487bab5b6bb94"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"70c606a5c3cbb3ba60c8cc5cab3f4245338bb1b7698fc8871fe10e99fc34a01d"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"edf7683d1bfc42c967c3733e556ea7a9fb22c99b5d6dfb91c93cb7d4b256e80d"},"properties":{"dependency":{"package":"fast-uri","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.2.3","relation":"transitive","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":"26b556b48aff799c33b358c19e29aad6be37066d2a7b918964d23937ecc11cd8"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"4f505b02c1ef9979a0d267939db2b7a6bf55f721cbd633759f1d67338d957e24"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"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":"25b3a8704c79c4898779632356c66a0a6222501f5f0975b8156e71d44a9d4cf0"},"properties":{"dependency":{"package":"serialize-javascript","version":"7.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"low","fixedVersion":"7.1.3","relation":"direct","declaredRange":"7.0.5","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":"5a1eb98f02f45fe38c95636f702b906c902485a303bd67998c6742cbcbf1ddaa"},"properties":{"dependency":{"package":"serialize-javascript","version":"7.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"low","fixedVersion":"7.1.3","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dc077e9f090b26903e322e969bb48979a91b27198ae11d9cf7bf19a04036e0"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d78bda6a0a693454108b401c605f60e77dcf117060e44bad817ded93974049"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/eqedit/latex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61dd3fb5877100f5940389cf99e9173cdf999188792610ef7bb8fa612f6023d"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 22 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/doclang/writer/otsl.rs, src/doclang/writer/custom.rs, src/doclang/adapter/geometry_pass.rs, src/doclang/mod.rs, src/doclang/resources.rs, src/doclang/adapter/table.rs, src/serializer/hml/head.rs, src/doclang/ir/prov.rs (and 14 more) (25 orphaned of 2038 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2038 of the 2715 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/geometry_pass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b952b54258f48c803274e091bc863bfba958a320e1db8d7385517ade32d423"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/otsl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a482a28f26bf30a2aa16c4cfea93c1800d6418350aba979e5a0e03daf3225ca1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13529e69abdeb8b2eccd46806e40d761ee830a34ab01d82c1c191563a32c7735"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/custom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f093e18379ef812db94fa126fb1b6b9a426fd0982e1b404152a435c74c23bad2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f383e6c09ea9fbeb64ef17fe0321226c3cd54104bdc4ef224c24bcd0814f54"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3c98acb0d56322932c9871503b2bfb8b8fb06f60eb4aa5079298761307e79"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/adapter/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dca9aca08a86066242eada6a5c417fe22a02ac38486086b482467ed20dcf4d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hml/head.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a139fc77c4a6eba46037bdc775aa64e11bc870f400ee24e12f3eb2324943c35"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/ir/prov.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b972611b062bf4376ea775a0b8314f27f8775b300eac31f858e469192f79971"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/history/idb-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"effd2a3cc9c06b0cc7f7f91bb272cc598a2e104bb3d46235a4aac05888ff6b8a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/writer/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b8b636d46febf9d7da455a55b0b0e1e1dec68090b564cede8dc8fc9da7d381"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/ir/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5658827e79612bb0ca39146731c553c6e47c12ead28e8442b2933c9beadd99f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/loss/report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98038a6f14fbafb635d81197de6530db6c53975e97f2e58d5c3ecd3320321a84"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/hml-save-capability.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcf27fa6a2bc9abfb8723d80bb4c5840149b89fc70244757c5da733b978d42a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serializer/hwpx/static_assets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2881b3e566356756611ca84acbd275f6cd5ec6eda01b12824c7c2581d83e38"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/atomic_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"818195589345571f5496d06ad92e8abf68b562f7b59eea6f703506a14eef8efb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hml/encoding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d596f37f1577fb64e3d5ed3f9359b8da6f3c3086321b1d90b059a5d754b7b8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/hml-save-format-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d11900405d5e420b4e8c423c335062ec56f8e11a0c0ac7a5ad1b454d0b0039"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_hwpx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f6ba32258b59fd933eb2ae038d458ba65d7659122b7c970c94f8570a47589"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/save-target.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a0fae202a16a41c52726f6f0ec29ad2722d6933ff643aa560d5af14a60000c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doclang/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b15818b40703419e20a6d7376c5a81fdd561759e61268d1a2bd0d552401fad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/swift/Sources/Rhwp/RhwpDocumentTextView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3454249e947d0e53338f06184b5adb4d06fcad3ff2f8453f7625852049686ad6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rendering.rs \u2194 state.rs: \u0060src/document_core/queries/rendering.rs\u0060 (context document_core) and \u0060src/renderer/pagination/state.rs\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 100% of the time (10 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060851ca270\u0060 fix: \uD45C \uC55E\uB4A4 \uD638\uC2A4\uD2B8 \uC904\uC758 \uAD6C\uC131\uACFC \uC18C\uC720 \uBC94\uC704\uB97C \uACF5\uC720; \u0060ecaad39a\u0060 fix(typeset): \uCABD\u00B7\uC885\uC774 \uAE30\uC900 \uC790\uB9AC\uCC28\uC9C0 \uADF8\uB9BC\u00B7\uB3C4\uD615\uC758 \uC138\uB85C \uBC34\uB4DC\uB97C \uBB38\uB2E8 \uC2DC\uC791\uC5D0 \uACC4\uC0C1 (#7696); \u0060788349c8\u0060 fix(layout): \uC800\uC7A5 \uBB38\uB2E8 \uB05D\uACFC \uC55E \uAC04\uACA9\uC758 \uC88C\uD45C\uACC4\uB97C \uC870\uD310\uACFC \uBC30\uCE58\uC5D0 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7fbdff3ee26381eb7ddbb81aeac59cb4846d665cdbc05fb36ecb40cdd5821b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: json.rs \u2194 canvas_render.rs: \u0060src/paint/json.rs\u0060 (context paint) and \u0060src/renderer/equation/canvas_render.rs\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 71% of the time (20 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u00604dbb274b\u0060 fix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0; \u0060eae23ccd\u0060 fix: \uB3C5\uB9BD Print\uC5D0 \uB530\uB77C \uC815\uB82C \uD589\uACFC \uC870\uD569\u00B7\uAE34 \uB098\uB217\uC148\u00B7\uC0C9 \uBC94\uC704\uB97C \uBCF4\uC815; \u0060be1aac16\u0060 fix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5fdde53a3ba72ddbd01498c1fc154944f634a3a597960de11fad612ffa52c3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rendering.rs \u2194 tests.rs: \u0060src/document_core/queries/rendering.rs\u0060 (context document_core) and \u0060src/renderer/pagination/tests.rs\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060851ca270\u0060 fix: \uD45C \uC55E\uB4A4 \uD638\uC2A4\uD2B8 \uC904\uC758 \uAD6C\uC131\uACFC \uC18C\uC720 \uBC94\uC704\uB97C \uACF5\uC720; \u0060ecaad39a\u0060 fix(typeset): \uCABD\u00B7\uC885\uC774 \uAE30\uC900 \uC790\uB9AC\uCC28\uC9C0 \uADF8\uB9BC\u00B7\uB3C4\uD615\uC758 \uC138\uB85C \uBC34\uB4DC\uB97C \uBB38\uB2E8 \uC2DC\uC791\uC5D0 \uACC4\uC0C1 (#7696); \u0060788349c8\u0060 fix(layout): \uC800\uC7A5 \uBB38\uB2E8 \uB05D\uACFC \uC55E \uAC04\uACA9\uC758 \uC88C\uD45C\uACC4\uB97C \uC870\uD310\uACFC \uBC30\uCE58\uC5D0 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fc1c061890208cf91f84f04893ca3308cb90668a6942f01f913853ae6b5d52"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: provenance.rs \u2194 gen_agent_codex.py: \u0060crates/rhwp-contracts/src/provenance.rs\u0060 (context crates) and \u0060tools/gen_agent_codex.py\u0060 (context tools) sit in DIFFERENT parts of the tree yet change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006015d65b00\u0060 feat(cli): charts \u2014 \uCC28\uD2B8 \uBAA9\uB85D (#5051); \u0060ad0a336f\u0060 feat: threat-scan \u2014 \uBB34\uAE30\uD654 \uBB38\uC11C \uAD6C\uC870 \uC704\uD611 \uD0D0\uC9C0(\uC77D\uAE30 \uC804\uC6A9 \uC548\uC804 \uC5D0\uC5B4\uB77D) (at that commit the file was still \u0060src/provenance.rs\u0060); \u0060b24cea3b\u0060 feat(armor): \uD504\uB86C\uD504\uD2B8 \uC8FC\uC785 \uBC29\uD328 \u2014 nonce \uACA9\uBCBD \u002B \uC8FC\uC785 \uC2E0\uD638 \uD45C\uC9C0 \u002B \uCD9C\uCC98 \uD45C\uC9C0 (#4850) (at that commit the file was still \u0060src/provenance.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rhwp-contracts/src/provenance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6199319d8bdf8908f7da1936de1718493b54a3a29d8eb7d0077f549ea87f8e1f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rendering.rs \u2194 page_number.rs: \u0060src/document_core/queries/rendering.rs\u0060 (context document_core) and \u0060src/renderer/page_number.rs\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060851ca270\u0060 fix: \uD45C \uC55E\uB4A4 \uD638\uC2A4\uD2B8 \uC904\uC758 \uAD6C\uC131\uACFC \uC18C\uC720 \uBC94\uC704\uB97C \uACF5\uC720; \u0060ecaad39a\u0060 fix(typeset): \uCABD\u00B7\uC885\uC774 \uAE30\uC900 \uC790\uB9AC\uCC28\uC9C0 \uADF8\uB9BC\u00B7\uB3C4\uD615\uC758 \uC138\uB85C \uBC34\uB4DC\uB97C \uBB38\uB2E8 \uC2DC\uC791\uC5D0 \uACC4\uC0C1 (#7696); \u0060788349c8\u0060 fix(layout): \uC800\uC7A5 \uBB38\uB2E8 \uB05D\uACFC \uC55E \uAC04\uACA9\uC758 \uC88C\uD45C\uACC4\uB97C \uC870\uD310\uACFC \uBC30\uCE58\uC5D0 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bd5d13716e2eceebcc1bdaa2d388b900b47d03f02ce7cd99305c659dcb548c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: RhwpNative.cs \u2194 mod.rs: \u0060bindings/csharp/RhwpNative.cs\u0060 (context bindings) and \u0060src/native_host/mod.rs\u0060 (context native_host) sit in DIFFERENT parts of the tree yet 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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060a92974dc\u0060 feat(native): integrate bounded Windows D3D12 texture bridge; \u0060d9570e04\u0060 feat(native): integrate bounded Metal Flutter texture bridge; \u0060b97dad94\u0060 feat: expose native multi-page view state to application hosts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/csharp/RhwpNative.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef8af5fda0a3d03270d1188dbf28415551687d1496215a75ce85bc02d24c02a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: json.rs \u2194 equation_conv.rs: \u0060src/paint/json.rs\u0060 (context paint) and \u0060src/renderer/skia/equation_conv.rs\u0060 (context renderer) sit in DIFFERENT parts of the tree yet change together 53% of the time (19 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u00604dbb274b\u0060 fix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0; \u0060be1aac16\u0060 fix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720; \u0060b6947263\u0060 fix: \uC218\uC2DD \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uAD6C\uBD84\uC790 \uC724\uACFD\u00B7\uB17C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b7462eb79d349fbc83116331071b15d31db2c31c95fcde0138ff34b8de48a9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: state.rs \u2192 float_placement.rs, tests.rs, tests.rs: \u0060src/renderer/pagination/state.rs\u0060 changes together with 3 other files \u2014 \u0060src/renderer/float_placement.rs\u0060, \u0060src/renderer/layout/tests.rs\u0060, \u0060src/renderer/pagination/tests.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":"src/renderer/pagination/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69482b30f58695f6c027060c50fe94b86f6051e284ceb703643e40e5a88bcb56"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: page_number.rs \u2192 tests.rs, state.rs, tests.rs, typeset.rs: \u0060src/renderer/page_number.rs\u0060 changes together with 4 other files \u2014 \u0060src/renderer/layout/tests.rs\u0060, \u0060src/renderer/pagination/state.rs\u0060, \u0060src/renderer/pagination/tests.rs\u0060, \u0060src/renderer/typeset.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 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 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/page_number.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c595913dbcb50229fa7bfee90a420927150c10f15e73a135de5eba7433a1530"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: layout.rs \u2192 page_number.rs, engine.rs, state.rs, controls.rs, vpos.rs: \u0060src/renderer/layout.rs\u0060 changes together with 5 other files \u2014 \u0060src/renderer/page_number.rs\u0060, \u0060src/renderer/pagination/engine.rs\u0060, \u0060src/renderer/pagination/state.rs\u0060, \u0060src/renderer/typeset/section/controls.rs\u0060, \u0060src/renderer/typeset/section/vpos.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":"src/renderer/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7ba81ab8631b8b96fc7bc391317ff371b9bd5bd4bc4dbe1962b4e9d9b9c54d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: canvas_render.rs \u2194 svg_render.rs: \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/equation/svg_render.rs\u0060 change together 96% of the time (27 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 27 shared commits counted here, the most recent 3 are \u00604dbb274b\u0060 fix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0; \u0060eae23ccd\u0060 fix: \uB3C5\uB9BD Print\uC5D0 \uB530\uB77C \uC815\uB82C \uD589\uACFC \uC870\uD569\u00B7\uAE34 \uB098\uB217\uC148\u00B7\uC0C9 \uBC94\uC704\uB97C \uBCF4\uC815; \u0060be1aac16\u0060 fix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ef2c8b47fac2edc6c8acb0afa01a83a2028d8417a43ff1d6072537a7caffe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: svg_render.rs \u2194 equation_conv.rs: \u0060src/renderer/equation/svg_render.rs\u0060 and \u0060src/renderer/skia/equation_conv.rs\u0060 change together 89% of the time (25 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u00604dbb274b\u0060 fix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0; \u0060be1aac16\u0060 fix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720; \u0060b6947263\u0060 fix: \uC218\uC2DD \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uAD6C\uBD84\uC790 \uC724\uACFD\u00B7\uB17C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/svg_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2489c0f70b6d1b5b70bcb35e357b52c3c871cd27833426479f80f36dd933b06"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: canvas_render.rs \u2194 equation_conv.rs: \u0060src/renderer/equation/canvas_render.rs\u0060 and \u0060src/renderer/skia/equation_conv.rs\u0060 change together 89% of the time (25 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u00604dbb274b\u0060 fix: HancomEQN \uAE00\uB9AC\uD504\uC640 \uCCA8\uC790 \uBA54\uD2B8\uB9AD\uC744 \uC2E4\uC81C \uCD9C\uB825\uC5D0 \uC5F0\uACB0; \u0060be1aac16\u0060 fix: \uACF5\uAC1C MATH \uD654\uC0B4\uCD09\uACFC \uC7A5\uC2DD \uD504\uB808\uC784\uC744 \uAC01 \uCD9C\uB825\uC5D0 \uACF5\uC720; \u0060b6947263\u0060 fix: \uC218\uC2DD \uBA85\uC2DC\uC801 \uAC04\uACA9\uACFC \uAD6C\uBD84\uC790 \uC724\uACFD\u00B7\uB17C\uB9AC \uD504\uB808\uC784\uC744 \uACF5\uC720 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed48e4aa22c5dd08bd96f727b48670cec3b465fc0a545209fa7027ac33dad0b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: canvaskit-renderer.ts \u2192 canvaskit_policy.rs, box_types.rs, canvas_render.rs, svg_render.rs, equation_conv.rs: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 changes together with 5 other files \u2014 \u0060src/renderer/canvaskit_policy.rs\u0060, \u0060src/renderer/equation/box_types.rs\u0060, \u0060src/renderer/equation/canvas_render.rs\u0060, \u0060src/renderer/equation/svg_render.rs\u0060, \u0060src/renderer/skia/equation_conv.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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaccc9cf88cd1fc94cdd3615e5a0149c3d20e403a7063b7a2ff063fb0d2fc27"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: types.ts \u2192 box_types.rs, canvas_render.rs, svg_render.rs: \u0060rhwp-studio/src/core/types.ts\u0060 changes together with 3 other files \u2014 \u0060src/renderer/equation/box_types.rs\u0060, \u0060src/renderer/equation/canvas_render.rs\u0060, \u0060src/renderer/equation/svg_render.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":"rhwp-studio/src/core/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e502d27c3784f1d7dd46a4093435d2431e7f29369ce4501074c35da363191c23"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: json.rs \u2194 schema.rs: \u0060src/paint/json.rs\u0060 and \u0060src/paint/schema.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u0060ecb8e0af\u0060 fix: \uC790\uC18C\uC758 \uC2E4\uC81C \uC804\uC9C4\uACFC \uAC15\uC870\uC810 \uC18C\uC720\u00B7\uBCF8\uBB38 \uAE30\uC6B8\uC784\uC744 \uACF5\uD1B5\uD654; \u006047b3ab93\u0060 fix: \uC6D0\uBCF8 \uAE00\uAF34\uC758 \uAC00\uC2DC \uC61B\uD55C\uAE00 \uAE00\uB9AC\uD504\uC640 \uC131\uC870 \uC575\uCEE4 \uBCF4\uC815; \u006038ad228e\u0060 fix: \uAC15\uC870\uC810\uC758 \uC2E4\uC81C \uAE00\uB9AC\uD504\uC640 \uC790\uC18C\uBCC4 \uACF5\uD1B5 \uBC30\uCE58 \uC5F0\uACB0 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/paint/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a3a436cb9d87f82364bb3bc477aec4a42385d92cb62afb1353f59ec9a6fc4a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mutation-method-registry.ts \u2194 wasm-bridge.ts: \u0060rhwp-studio/src/core/mutation-method-registry.ts\u0060 and \u0060rhwp-studio/src/core/wasm-bridge.ts\u0060 change together 68% of the time (13 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 13 shared commits counted here, the most recent 3 are \u0060f8f3625d\u0060 feat(picture): \uB2E4\uB978 \uCABD\uC73C\uB85C \uB04C\uC5B4 \uB193\uC740 \uADF8\uB9BC\uC740 \uB193\uC740 \uCABD \uBB38\uB2E8\uC73C\uB85C \uC62E\uACA8 \uBD99\uC778\uB2E4 (#8557); \u00606638b6c6\u0060 feat(picture): \uD45C \uCE78 \uBB38\uB2E8 \uC548\uC5D0 \uADF8\uB9BC\uC744 \uB123\uB294 insertPictureInCell (#8556); \u0060b96229c1\u0060 fix(studio): support paragraph formatting in nested table cells \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/mutation-method-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f487fd28dbdbbcddbc594887aa08c78d33df8cd1c3a1fc887592c7dbdcd67ff"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: canvas.rs \u2194 table_cell_content.rs: \u0060src/renderer/canvas.rs\u0060 and \u0060src/renderer/layout/table_cell_content.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u0060b1b639f8\u0060 wip: \uC644\uB8CC \uC140 \uC678\uACFD\uACFC \uC6D0\uBCF8 \uC608\uC57D \uB192\uC774 \uBD84\uB9AC \uBC0F \uD68C\uADC0 \uC9C4\uB2E8 \uBCF4\uC874; \u0060a86e1f96\u0060 fix: \uCEA1\uC158 \uC6D0\uBB38 \uC8FC\uC18C\uC640 \uBB38\uB9E5 \uBB38\uC790 \uD3ED\u00B7\uD68C\uC804 \uADF8\uB9BC \uCD9C\uB825 \uD06C\uAE30 \uBCF4\uC815; \u0060215c6720\u0060 feat(render): expose source paragraph ranges for split table cells \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cf9d78d0f3b9aa237550815f451924c2cb5a6119c156007b04210181df03b4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cursor.ts \u2194 input-handler-keyboard.ts: \u0060rhwp-studio/src/engine/cursor.ts\u0060 and \u0060rhwp-studio/src/engine/input-handler-keyboard.ts\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u0060942cb8db\u0060 \uC218\uC815: \uBAA8\uB450 \uC120\uD0DD\uC758 \uC140 \uBC94\uC704\uC640 \uD45C \uAC15\uC870 \uBC0F \uD3EC\uCEE4\uC2A4 \uCC98\uB9AC \uC815\uD569; \u0060e0561df6\u0060 Task #6741: \uC140 \uBE14\uB85D Delete\u00B7\uB418\uB3CC\uB9AC\uAE30\uB97C \uD55C\uCEF4\uC5D0 \uB9DE\uCD98\uB2E4; \u0060cfa4ccac\u0060 \uBA38\uB9AC\uB9D0/\uAF2C\uB9AC\uB9D0 \uD3B8\uC9D1 API\uC640 \uC774\uBCA4\uD2B8 \uACC4\uC57D \uC815\uB9AC (#6461) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6de8fb1afc5e8848f218e24337067b4fee8aa55877cc97a1a7ba4b422cc118"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 gen_agent_codex.py: \u0060src/main.rs\u0060 and \u0060tools/gen_agent_codex.py\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006015d65b00\u0060 feat(cli): charts \u2014 \uCC28\uD2B8 \uBAA9\uB85D (#5051); \u0060ad0a336f\u0060 feat: threat-scan \u2014 \uBB34\uAE30\uD654 \uBB38\uC11C \uAD6C\uC870 \uC704\uD611 \uD0D0\uC9C0(\uC77D\uAE30 \uC804\uC6A9 \uC548\uC804 \uC5D0\uC5B4\uB77D); \u0060b24cea3b\u0060 feat(armor): \uD504\uB86C\uD504\uD2B8 \uC8FC\uC785 \uBC29\uD328 \u2014 nonce \uACA9\uBCBD \u002B \uC8FC\uC785 \uC2E0\uD638 \uD45C\uC9C0 \u002B \uCD9C\uCC98 \uD45C\uC9C0 (#4850) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a4d7216f74eb47e5dd6a8131a7a7882efdfdceaee137e5a1bc8f6d358854ca"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: canvas.rs \u2194 table_layout.rs: \u0060src/renderer/canvas.rs\u0060 and \u0060src/renderer/layout/table_layout.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u0060b1b639f8\u0060 wip: \uC644\uB8CC \uC140 \uC678\uACFD\uACFC \uC6D0\uBCF8 \uC608\uC57D \uB192\uC774 \uBD84\uB9AC \uBC0F \uD68C\uADC0 \uC9C4\uB2E8 \uBCF4\uC874; \u0060215c6720\u0060 feat(render): expose source paragraph ranges for split table cells; \u0060e386f9b7\u0060 Expose logical clipboard editing and native paragraph refresh contracts \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6d76563b3a9eff3d4490d617db4bfe414a10169ea6f0f1d136cacd9dd218b2"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.93: rust-toolchain.toml declares Rust 1.93 as this project\u0027s toolchain file, and Rust 1.93, superseded by 1.94 on 2026-03-05 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-03-05 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcafea13d39a7b26cfa29db0d7e3226dcef2e27b484ec53673e33069a76ab09a"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dfd87e29b9d7d03d5a1fb2ead87ccaeb9787d55f5d2d158ea6cb1b3a7f9d9c"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"12447a88632beaf3584d10a686c67acf35b00c4462464b4a35ef78ca2c2a64d8"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fb8dbd1cb10fc86122f1c0b49ddefefa14db2eb623d58b09cc13dd8e8a596a"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec87dc69dc575486bca5d33b4621bc425299ff725384c204de35f2284b6b25"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee3691cda0a8c8176a70fb86f94046e61c0d89365cd8c46014d787c5b5e0ce"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2b2832523d4842f7be95eb2101efae39f06235c7774a1b7238fc20547c8ad5"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f94d3ae9d0a899dfb18afc44c9f7d8af2cb3f0716e5a0316d57ec7f2b15ce9a"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1445f665110bfc1b1f20d457ef7d4a1e00aa16341545e3a16dc359bab7cd83e7"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77f399cefc377bf5f51c5195ba91317808aaefabf46fd3cc910361512eb9282"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"483f9ac150d3e24ae0d75c985b955b6be20116e8cfce7beaccd52f07eb6b897b"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db0d46d6c2b2911be57629f87ba365039f671195c02a185531d6327241e60ad"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4b2a5c4d0beb78b9dec214785b26d2cda23afe96be7400d7b35d16b8f4da0f"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbec24dae3e751e177f4b22250689fc157619b4a41d6c1d7a5e3b49e482193f3"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc2d9fbd998d50c85da264938564df7bd730b5f9e29fcc81109bfd7e5c074a"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed14a002213d49651417618d7a58716917c14c352b71cf9bc3e3671cfb4a2db8"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"143c6d837ffeb16843ebbf2bfb92c1d01049773409bb4c9ab157d6ef905d0362"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc749eb2d7dcf5fe4e9ce77790f16689d4886b26230d926e18848a66e70d91da"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a194fe4a8691c95ea428018567466fb56224e6f3791c52136d9dfe66dfdba2"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"909188ce5e3dbcdd59644976aae2bb8d4ce435f558a0e57f0cb41ef41d4ac205"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e1c1a68216923e0246b465d1f443f9ccae880a337aa312f038e113da30622"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d499b39053f9953a062bcb5468dbf382e7bb4a1993ee6f2d51cfceefce380290"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71352f38eec93239849b4ded9c0b8109682695ff872442801ffafddf9aa8883"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5479c41d6ad9b789f58464c0e579393163b296570220fffe2cc8f988993c56b6"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"29629ab8c57bb7c050c81668b8cf09d1f46fde160fd80a09b60c493258e00fbb"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9f7defb2d8846811ddf8d85d41a2937eb0e885412f0a806fc2a38ed1620a98"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b520f217e2f2e9eb15b67f245b50e6ebadc3db698d00c1a00a6f29ea6a805d"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac34c668bf5edffa832b31dcfe777f53b2fb35e08ae65ddd3d426fca8860bc4"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3a0c08818723d6e09fb5b9ab5ef932048569326fca75dc3e0faa5537357133"}},{"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":"mydocs/pr/assets/semanticist21-20261005/browser-review.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e58d178c6019f9e19734c600ada3f809896de7df371d5c038496087b2f7970"}},{"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":"mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ce00bdda7c26c3b414c679c40fb0a71c2430f048db5617b758fda3dc798dd"}},{"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":"mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4cfe3d47f4bbe3d83de12ebe699fe359f30364c806c936c24f03215b19f2a"}},{"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":"mydocs/pr/assets/semanticist21-20261005/kerning-browser.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3061ca761bd5db6ef9a47401daad183c123955efa99ae72f256023072d66c4"}},{"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":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a3c53a2add118db02235d3e80f589824d39326f197bdb40d22c2783c356127"}},{"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":"mydocs/report/edit_demo_4664/park.html"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae8b571535f8b84feb6e981c77df7cc8056520b5c7c6e8be300721b48ffc640"}},{"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":"mydocs/report/edit_demo_4664/park.html"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"deeeeb8a26d0cee7bddb5fc91812a5a7997b4180a1aa256e5edd6ad1e47eaeeb"}},{"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":"rhwp-studio/index.html"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c4ff77594bb372fee839779c9cf2f4d8671b53a3630b35dbe5326b3d5b39a"}},{"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":"rhwp-studio/index.html"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"a177b3ddbbbaffee338d9a6960b9f4bfa112c37f80884471a0f173424faba315"}},{"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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc410d7839d40e3e2d96c2a89e98a42590bf19040b4d8489cc03aa573328851c"}},{"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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49ea3f5ddf27874aa0de688cae69d866895429650fe2396ee44e41feae82c6a"}},{"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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9672635ee4964d1fb29a2b2ef7bbbfd0ec8b4012a8b3808db40e41394c57cc55"}},{"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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f641015cdc7896e205d9ec5023f5014efc2646601e9d2e2c82c91ae17df49f3"}},{"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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71d2889fcb9b9a20bad93adc9aeef9096af57ebef76f8f81eac43971d22e55"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Cspan\u003E: This \u003Cspan\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5383925e1d90b709c69ba193f20aa094156c0e32dac0c66a531504937ff6357b"}},{"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":"rhwp-desk/ui/index.html"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e665e941cd756d8d41943d512dfc72e751be37111a14bdcf99cd482beceff351"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b596e9f1afe0481d512050a7831f90ccdcba6d2c42492028743010a64bd957"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Cspan\u003E: This \u003Cspan\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b378ef087b7c1f0439d1931556fe69bf14dfced7e35b609609dc5908998ca2"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Cspan\u003E: This \u003Cspan\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/content-script.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1b88aa670d2cc3bee0f6e1f3d2ecae394d2178e0fed854a4ac87aeb8930b6"}},{"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":"rhwp-safari/src/options.html"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e5c7a8fa33c015419b5818da624fc43d7a54620ca20b2b5171e4a0758158ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"531a3f1863ab07bf577e2fe0a1a8af2735283ddbb6d4650fcb495ea692b0fe44"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/hwpctl-test.html"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"631e81e30ccb0c4204748d7a083b4c69422b35fe7dd279039e8b469a2a1de6dc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/hwpctl-test.html"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe731bb7becc01e12c978f7641ad2d7981b92fdddda7e78a14992a011d51c35d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7584f0b4ffcec37c78c8be140d907dd4ec84309ff08231a8e9e70d6a0f87af27"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/ui/ai-settings-dialog.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f577af511f4a34fdac0f794aa32da221d09b1548ee83e6bfe0ad6466348bcb0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b825a7cd0096068a265b3e3a9950f113b987d70d30fb327cb5bed34598e900"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3623b86c867b6b0f9fa0cab6863243b2362487b95c52eac4da3cc51013504c0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef79f68fa43452728ea422d8c2812fdd4d9f9a8628a8ee7b4e51a876496b83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9886acbb3af84f3fcf23d277bb72915d2a7bbddd0bf372399ac165be55a36e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5bc5dec70ddd6481db265cf8ea20d1b9422795ada7ead71aea9a346a8abdb2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"768c9519abdb8c915ffa1b4acd04d390ef71f1db0f6e94b9de52438f12e969f3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6612f69927f53b229753a944f5d33d21702dfd71b557dc79da1dab74082c7daf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897db3e49c2a79843b4e2d702cabfa019d5f7bab64feec8de3c3a302061c12a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"839cfb801d4e417da2934840114eac44dce2bfc52fd998cc418e4fb969a7c693"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea7fffff0e34220fdc1a96060152ecd4b4e8c348aa320312d42246528531788"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b2d0a147e9ef7e66a31258fc07a86e012c0b3496bc893f5538ed5bdcdcb263"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"041b833b93bab0c4c11878d0fb957a636c26fe5de3a8ba33713ee8f4c0ef1c24"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5042e0d0d5aa6ab5462859d0098976a6dab9780d13cd0fe0ce92c610bd67e11"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b5394bd5c95da03022f82bd1800a7c56865ebe0d482d65d8ebb7344e071175"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde575e7872b9fa5ea36c96517a9209d26712101b8c51ecc723eb71e7b009fc1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c801f50c7e26ac9c8c67acf855a5cf380bd6bbd5a33030326376273139fb61"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbef7f4de19178fafe095cdee7df39afc3169d4b3ec5df710a71e655e19ccd9b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c018dd53c086033fbe9b064db5eb1af7b0ab4ba13b9c9d2552190e6b5d59539"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb4774416538c6bb43f6d31b3f634d9f797e5fee8df28919f2493809aaca645"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9045c1c7551c8513171028d8691d5d117765c09d4166f79ebfe0b1500747a40f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef932daf1469b36eb357980d3ad07d09a49b5c176ccd24ad5e6a9b0909ac7d24"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2feb3d95daafd5ca6ea4f21d0b1d5c03f05d8d7563aa7098ce9b3708e3ee23"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5f669f99b51a9fef97285ac08456ee67a952ec8f3a8fbaef5a43d473fb4a1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a6787feb67164038fea0b89337c435dd6e80046967dea2683704f4a3f33a8e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68c66f52f46f26e13b69dc87697d11ed712051a252d93538df4cba28c77f541"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"554ecca018ecd6e55961e38e9c6202cceec1c3acdb733d05fd2a47bdc1d818ae"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0d675d3bd5d7896286d13343adea0e8747a1ee4b36927efb1d6294e570a225"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"028fe010dab515c2419ffb95492ed54991b7d2b03672fe3e65f67791df9a9d10"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"34286fdd4d71033b21180ee6c30801b462136df02eab4e4f76c96dfb00190cd1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d5fc8080a52e2835c887c71249a2c14c61857e89b5c159d3260fc23b7b0582"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7907728bb95072c6c07b90812169edb27c2ba073e9ed5838cea7f546cc07287e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c6facab9ed23484409b2a6d7858a05bb0054b730fe1386e200bdb463be1d74"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abf5c91e44718a79b26d40f5f89fa319b620ad0824d57fee0d29e3a3114f5c1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36743c2f55a443c1995f656071725810063a6717af491f11eb0b00df42d90ea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421307780389e20dcc16ce7fa5ba6403147df006cd3767ca53626df07d1d63d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3f8c1050a2b7276dbf17156d993cab56ee864feac73d85276a2353f5bb6483"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b662e66f2f5d3e899de4b32631136a678260c78464dfa081807083645523a752"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"997f47ef64960c9024bb8cd0fc1b10e8b58db40102abaccfd00c197c66c3e127"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6becf081b150ef0b1e6c965af0a610c71dbbf50c66ef8d4666bbff9650d80ffa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"868955a0654edb199c94b970f768952b6bd2eef09f2709601054f111aadcbe67"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"433dd49dadbc74e96d51be5d441eeba7304441832c4b087f6a6458a197526697"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2d5d45d198f4cc050414ebff66e70e8087582c8d279f46c643237ff2ddb41"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"de77a7858f88b3bbbc32c12ebcbd758d0e7b27d7422f9df750ea131108337f3c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7a9ff33e8cae61e97f87ba9a8f12102c2a6efafa482d58d2856f15c8ee7bbc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b9bafdc23a60b47ce5a052a16d77a3b4530eeea8d519432fad826f49ae2b8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e504563f8bf92274ecd6a8e6d370288a552332ec4de274d2878d743b6939428f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"280ed3aa075cb6d34f952af7a4463111f2cf6786bcd929ea00024e6453f73e49"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f002ddc71ef1c6f4ad2ef48e458705c3316e64c510846795780b1e563ed1e4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9570f4d4fa74cfacb8450473abe33905255b1bab826340ce07276d8de725b0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a6ad1e1e34a80a433c3f7f9b5eb2dc6b16b34e383e7e0d8c150c2e01a53f3d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b169552715470acfce9b89bd34e73c645284582f63a7e8c6204c467e4593c7b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ad6f91d545dd8e722be0af80c29e44269af01b8dec422f23f6d8948a5ff0b2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3aa51df0b2f3dde66cd430e91ea8871bb502585c6202fa4e63e4f865c184e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61201450f4fca951abd2370b99e99f161295296889edfb01142fb3c11660bfa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b138571f489c38cdc87b0e4a60f3c0df82355248b2d7b4695aa0d0ac1f1167bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/font-set-edit-dialog.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"30340964c4d4ade0cfe579c63dec6054046db723a7d5a732347c3c6dc92dd056"}},{"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":"rhwp-studio/src/ui/font-set-edit-dialog.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b6f22c22c7039e588edc3b7d1918d029941aed92d3a370551fe7eb8f47c7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/font-set-edit-dialog.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d890a19bba5358633d9d51119fb764ebe004be671c1d40da2ba749dbf252b103"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/font-set-edit-dialog.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04ac0c42de10b10ede749487632bc4be3788f5c305392a6033c3157034bba99"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7127579357754115482e9fd602c77ac59d45d8314d12f17cfc01756d522008"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e9734b42e338f833a71aa4c0fff449cbfd04cdb75c64bf859fff0db2586474"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/goto-dialog.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f211512907e20892bb9198d9f1f86bed436ed571c2c65b956e1cd4a0b93bcc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/goto-dialog.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"feeedee978950724496a8d9a3dd5e439cecfa82d69956178f7f2208d5b908524"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/grid-settings-dialog.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2bba1dcab18e31560c15638490614b15fe5da80de725d5b4a05423641c990"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/new-number-dialog.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66cdaf25185f4d7f79570966e852aef4a4da0c43a527fdfcd1e978ead5f66d6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/new-number-dialog.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"685b6682dfc2d65bd19a9bcefcdf0e09485593ce4753a04ab4b499afac0a5258"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45c115306d9195950da74463f7b1cc6a6c3600f125c504fc9cdfb745626660b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78fe1b64c58cfa24d1fa0b546a130d37adcd2a59cf64c82197787ed605ed2d9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e413abccc195999b948a5b708bc173b763246125c849839bffaeb8c1e9af4ed1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac252f8bd300d8ad3b1b925bf708efff2eefaba1d72f6ce834ed597f35b1009d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7464f82edfb720d00af04620c3615f1352f7f2e6a85df723494be4353b2646"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a534ff7d80ef134a886793a75bacd94b558a5f8b180632f32624826d4c380cf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf6a04d7a0d14391af9549e48e64f464344a26ff4d11df9bad90046678f83f9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df5fdcca09e682b111e28d7deb890be7dba0b8a43688b3e9582735ee8bac7e1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f40dd0b98ee68766e357d46167148cff521296ac0d1ef8ff7b64bc9a11c4ed6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"410abb5e6feb6691383be4f826ba123184bb1bc7374d93e1b583057ee12df5f4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d641dfbd5015be49f0c5bbb209ce617ced400fd5aed1cd38598ea77b2fba4a61"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cad101b0487cdd084f6a04569d67dda0c6cdf1d477cfb3bbf7dead823aa467"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7e1349381b52293e2d909ffeb8d695ce0d8f814a55bfdc2e579296dfc74e88"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf00d3c5b0adcd2686e7e05188742ae134568444daf3cbf7b92acdf9cf70ec7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76d3d609a440c2992a9846fcbb3ebe5beac71e111fb6f740a7a06cf5fe1303c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fdacc2480133a838e1ba08b6584caf04818d830f3d382c0773b050c284158f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2204eefeeeedbbfda1cc66d234906dfb23a486521bf38f97dbb482d6650bf571"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"169d2440c7f6163820e1d3ed0e8f8bc3823f756344140f7d4bc8e8369cc65dc8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8b8bdbfb3be6042304b5b6dafa3ffb3cccd1b8665498444d9650387efcef4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a1018a120a0680f8d2c83b61aa7384205fdda31d1b18522f021010efdd706"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-helpers.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce280df3f4e06f507393a3d8dacb2a53fd507acc5891953ff8bf7f9b1f06c79"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9db06cae63264cbb11e6542247725028806f33d2230c9bb3d45e2227191099c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"73006a699ae21149515441a4f6ae3a11c5d227278a9a7eb85705991619fcd9e3"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6877ffd3044bc01e402924359bb4aff23fb49dedc14c0b613305a5101a578c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf0323dfa86b6592f91ea0c25dc72688ccf998a756729df3875ee830b6260bf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d1ff28bf30b41c63977737bb533d1a20f31a3ae6bfc206606e4ba1eb565d49"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff2c9a9d2fa42b63de33e1f9fa0e0085447a56bfe0a5d058893c24758ba479e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fae1274f6a245ddb229784e8db833a8aca675d7a139eae12324ccad7ddd461"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaebdddaa185c825c610fa1c83d5b82e6fa79cf8b299cc956d734211bf13d00"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"658a5b5904941ecfcf751936bd8446555ed6e2e4291cb5d7a4ac7624aaab6350"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae98e7b28a87ea800b6f9526452a1618b2a284d4571b67991fa0c90ffdc5c2fa"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97da95b5089a72a5887778c1adb51c4330b571e630a71c2d900461bd2c4d786"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974ebd1a91ffc354f4dbea0875f1e72104ed4d60c721fa82d60fdd6c6262d22"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"009007564c33ce7980c09645f76ae4d407176cb9402fb6015c1a92f7eb51263a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4164550d7465db9d74f81c583838d113cdf21e85b96c15a06d34ece5886ece4f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c68d625935bcbcc83c17d3112a63745bcb3defe28bc66ca8e3bcfc56524a51"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6862a8b0092a039d3be0c8b4c05d78cdea3d7ca5050f602cdfc7e1f0c8c22d2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ac60405f04d0af082189aa603cd6a9659865b77a502d29cf1b7f8f73d69ce"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8efd6297e9e4915c927f38a052b6491e57a12b1e7cb1598a5ee0a6aac7a835"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a30d6865647a0cfe9ac3b90e3c86611cebd118a19f6a043874decf4a12664"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/save-as-dialog.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"215836163f6876c68515b671eaa3cdb904cf2cd6706684044667c03bdd9338a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/save-as-dialog.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe4877eda9ad3a0fd5bfd51493a827bac5fc4714aa54d8542b6c31512d0d8eb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/section-settings-dialog.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"362b25a5a2319a6de4b21c1800b8e93e41fc425739fe60acb8b43a6ed3df25fc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/section-settings-dialog.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa1e292202ccb5724c7356808ada16e89191a1c5614df6541402c8cacc93edb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"00687cf0e4ec112fea9049e417b6651fd07ea0e3652832a4a60b3d3ef6a72015"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b0dd47bacb8f6e3e1b52a54993b9ac53266c8785db446a5d47a85a5c2071d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24deb4d5a6ee156e7385c7f65872bca8d05ec304e6fd35958d141cf0423ed0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"07805e113ade7eaacf2c76bdf4f44a89b21b3b2c7e28e004346bf571c309cae2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8278b3d1a2c5ba1bbf3bd8a18590d62459c87919d92e786383f4c1677394aaec"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46513a50a4b5fd618d9b0233dd821649de11b02357f2c801cd8e8fcdccc801a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f511afa967a38c3f7e7ce81d6b2c3570ee2ffcced87ffb88763ff8f75c371f64"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d2821602bdead0559fa730e5a978ae0230494dace6b04e3975d71a5c9a5cf4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877dce63ff8c0279f00f099ae610d339f56ed009e5e279f73a5ff6571f88b74"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ef4e7ae0851906825943b11e8e282dd619176e4046ebec6d2f9b0b7cb3d301"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dd2a895c1aed1ed044308c33bdf8321061fd2e57835cc4a4d37b0a056dfe57"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142fc9f65871f1728d0e4f53a89f0d08a91ea3305e0fc4c1877186b2f3df291"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3359cbe8638b30184622a50ff17e2fbc638353a4e67c6f19b4e3da0b9bf4753"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"374a58f935dbbf97451c149928188fde98e4020f2773f12008db6624e1dec3e9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1468eb8455b9a2821d69109ae3eea02990473491ad2a4473f5cc464d58649697"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c253193b1beca957d5024590514504c5828e45316b32c31bb874629b6a536"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40b4d1641043222c73825197c4ab03cd9e927df385db2af8d55a04229657a42"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2faf5687d59ed961144e42631cd86d037266c52d8792220255e96097a19921a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ded4d4ce4e1f0f75c3abcdebba55de080a88e895686b8cc0144db5026d63bd2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"340be6d07f7dd85a8638c620fb12c45b0ba87b7983ae9fcbcfa654f8c8ee2675"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83402b9df27f740b1199ffcade5d11b3b830f9b92f6ae11b4e01d95cedd114"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca1ea9b2b2226664a07d9212d0c84ad7099df2d64070324eebcb1c06c515e3d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf44e4d9ef053f34f7ad30f9950d32fb6af8d58e677cfde62694d6b49f270b14"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8117722af2969822624f8fa199940bbf2143f48cf8d0b11924ddf1d0bca70f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9bf211cd352ed8440b72d5c614af8ce3c2e8b964e49178e08c57080377b852"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf1f9f8b40392a1e04e64fe94dec99933b6d23e4174117c0b60d7fd7d199e7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label for=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-row-column-dialog.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2ab2923c05bda5de55a7510be8e65ec6487c94bdca603df85d5327c307d39e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-row-column-dialog.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17ed5c0c6abef6eec0d2be3b92f01f20e8b15867666535cc9d145d15bcb5b3d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa1fb2c3f07dab4a2ccafdb94bcbd50e583d396e8c33442550b566ca084b5da"}},{"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":"data/font-metrics/adobe-core14/MustRead.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"760f4185b5d11591a7f3a436adcd41fe131cc2c7c76a3e35c78919b562476e01"}},{"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":"data/font-metrics/adobe-core14/MustRead.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92f7dcf3a2f09f955f6ce7f2785c80ff26494d575adf378486f47db420d3276"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data/font-metrics/adobe-core14/MustRead.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"02250ff72dd9d78afc14d3ce8111ad98619e9eeb4e3f7446c7b1bdacba8f9a2d"}},{"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":"mydocs/metrics/2026-07-04-r1/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"118925635c10b9dd82158dffef3473c70109113414babb85bf5d117de564c860"}},{"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":"mydocs/metrics/2026-07-04/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71142397d89f0f2ff660b36193f8073e62f108ce7aef9014b55c32368ffc67e"}},{"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":"mydocs/metrics/2026-07-05/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd909949baf27fa05089aa7a8e0da740fabc3756a5d361a4540a8d65b1ea59b"}},{"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":"mydocs/metrics/2026-07-06-r3/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3c010d260de81be26870aab5790e6b2ba0c1c517e8637cfcdd5c0c25e6789"}},{"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":"mydocs/metrics/2026-07-06-r4/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdde91161324fdee08cbdf23b0a41814297a6ff8b3bc2cdaa7791036ed4f7fd"}},{"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":"mydocs/metrics/2026-07-07-r5/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c524281cdbdf9c486a25d32a3e915db0966c9ada3dcae7bc81969da31282cead"}},{"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":"mydocs/metrics/2026-07-08-r6/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9209fcda203e262269150f57c7a3bf6ebb163f6ad40c1493fab7116efaa9b20f"}},{"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":"mydocs/metrics/2026-07-08-r7/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a4f46230383b159db09d858f8b383d809fa50f47e7b56549ce8ec80aedd4e2"}},{"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":"mydocs/metrics/2026-07-08-r8/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a078089e7f5c19e36ecd93b8851670b67e217dd2de45e3effbe3469e503d5f4"}},{"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":"mydocs/metrics/2026-07-09-phase2/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9df8fcfe870c8eb912f10905e5493811b5b0fd4a8e58033ce8d34d5bfc33fd0"}},{"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":"mydocs/metrics/2026-07-09-r10/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b24bfc6cbb781e13f34486c16f9b1ab0cf12f437110cee508b88b91c94477"}},{"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":"mydocs/metrics/2026-07-09-r11/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"094dd5ed2bb20d9388d33d7facf56884fb7b1e457cabc622559efa948d4547f5"}},{"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":"mydocs/metrics/2026-07-09-r12/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279a8e4622ddd7480add4a020b52d8cd91d4f89e23a89cacecb8ac1bbc9af2a"}},{"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":"mydocs/metrics/2026-07-09-r13/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dda2d2a120bcde71189f166aac060cc4986e8af0d2407d9bf387124795221d"}},{"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":"mydocs/metrics/2026-07-09-r15/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e520697443606ff277788890fc4be93a8f8c27eabb0aece12372aeb7e6b8355"}},{"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":"mydocs/metrics/2026-07-09-r17/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23963b7998e9c21747096b94ec5874fef99a3350dafd07b200bb57a77348ab1"}},{"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":"mydocs/metrics/2026-07-09-r9/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d47e3be5e4390d389f80a63375a2351bf5c025e113dc01f61e4c62fd77f35"}},{"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":"mydocs/metrics/2026-07-10-c2r1/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f720042b271b92cf1db3f2ddb79ce00a892d54eacf4b0294bbd11abf025babea"}},{"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":"mydocs/metrics/2026-07-11-c2r2/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"823caf7064b3404173aa91f8c95d6ab81411d22944ea778221de94ccafc6dea3"}},{"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":"mydocs/metrics/dashboard.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0818a9c807acfd16f306700d6c675d43d537d77eb8e8070c35b56f440a52b90d"}},{"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":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"844d352af9120a13c28a785c8949996ca295c182e4deaf4739829aeae91c2f5b"}},{"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":"mydocs/pr/assets/issue7470_rowbreak_stage1/gallery.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"026b498e5dec0d53b724882d00b0263bc80f2aa4a6da5181cb92f123abac27af"}},{"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":"mydocs/pr/assets/pr7109_hancom_pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a217ff397a033dcd2229fd738812f9679ad6eefd5dbd49b0c173f8b2cea6a7"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7109_hancom_pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f008b6c710f347d17c1a5ebf0f6efa2584e77ab73f963775bf2eb13316e4f8"}},{"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":"mydocs/pr/assets/pr7109_hancom_pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c7ba2a50edbc54f13b19efd7b64e3a4f6ed00323691aad471b6f362ee7f2fb"}},{"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":"mydocs/pr/assets/pr7152_comparison.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73254406af253a07d89a501c0d3ce8a97f3c2ff65d53a2d6809890ef4c96a1ad"}},{"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":"mydocs/pr/assets/pr7152_negative_report.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18600ad10b89db346e38af22adec5549ac28faaa228122259fd94ffcf057e9f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_negative_report.html"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c412fc26f4f5a6bd1b0323b702b45f247dd443d66f9fb5e40c04fd67e3792823"}},{"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":"mydocs/pr/assets/pr7152_responsive_report.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfca55b7d4b267cd423e209123ae21386fdeefb4d1afd29d860a9a12f27441d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_responsive_report.html"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ce66f5fc707caa5af43984c723e3ae14634715d947cab314c34b244629b61"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6122/issue6122/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258a5485eead2d8809b80d86a0df94699c81becc820d2ce2465f01cb27512dfa"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6154/visual-sweep/issue6122/issue6122/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18caba97f24a93be1945e5876139d68004ee08507d665040c926fcb2c8dff2"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6122/issue6122/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f87be13087aed3630c0944119c5c936650cffa8f565eb0657d0d87e932c1795"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6123/issue6123/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71c35b92371dcbab3b9de365909a09212344821ab0578b1beebfccc3455702"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6154/visual-sweep/issue6123/issue6123/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de6fa215352597007988a5b927f2c9447e8b0db6c46fd519345513da0c14323"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6123/issue6123/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea014d827b3503a1bde34f5d79be2fbe74e4d08afd3b1e4daaff946c2c10003"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6124/issue6124/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"440cfc05bd9b106352bda1a5a80c894fca228c9ca39fc5458b51e47d140f3ac6"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6154/visual-sweep/issue6124/issue6124/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fef30a202130a8da2c136034aa0f5ed0e2bd3f353332b12536b6faced48172"}},{"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":"mydocs/pr/assets/pr_6154/visual-sweep/issue6124/issue6124/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b4a3b60906dad9030d22807ec497728fc26c804802c59f28ed3ef350fec369"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue5700/issue5700/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eaf960fafabb8d819240bdd6d1dcff72a14d2e273ead7b4a305d37ff817c1b"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6159/visual-sweep/issue5700/issue5700/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f2f727f62734db5b9eaff88d295fbd357169077874b813bed2fc1a33dacfa6"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue5700/issue5700/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46330aa21bc5ae91701d7109ff0d65a4951e632114d31dadbeb64f8ce7145dc"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue5701-original-p76/issue5701-original-p76/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af474ae47bb8466ee7883661a76e95054a0bde6921b16fb4fb10aeb73eba060"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6159/visual-sweep/issue5701-original-p76/issue5701-original-p76/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2541b2982a742774debcabde7992aa59357c75edd078811cfd6d0084dd18ffbe"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue5701-original-p76/issue5701-original-p76/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a790a869b4a65324ec4db339a690b19ff4286a625787ea8ef4fcc10a3abeb3ec"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue6126-p3/issue6126-p3/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123949cbb2877d14d61d63a361ae4b6ca2ce99cad32dd34fff7bad8a55903bcf"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6159/visual-sweep/issue6126-p3/issue6126-p3/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6153af87038b57a35cf71482e9e9274f82c699028c9301c338b8d465042970"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue6126-p3/issue6126-p3/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03288f97bfd26c185442d4b50a65daa219e937bb7772de2992b1433b81945b26"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue6128-p4/issue6128-p4/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c7a8fc5e1c1f75c052c9a40bef5b2e2346aa11b37db8cde5315b4b50957f78"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_6159/visual-sweep/issue6128-p4/issue6128-p4/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0b522b9c6462246ff4ac2b2b89e476b773947f8c6968b235d0f2bdeaf1bf99"}},{"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":"mydocs/pr/assets/pr_6159/visual-sweep/issue6128-p4/issue6128-p4/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e3977620be90542479b4ec51b2d92d394d47a2bde0522b8db8c7625fd93f11"}},{"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":"mydocs/pr/assets/task2809/issue-2809-split-alignment-report.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de66cd3f2745aa8eecebb08d85f157c879b2303be6764ecacb255451e5945fa"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/task2809/issue-2809-split-alignment-report.html"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ee4b9ab13aa395cd9056ef4c4c006dd76187dd7a99d5c4524f46e85ab978ab"}},{"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":"mydocs/report/assets/issue7449/report.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcab541ad1597d25a847ebc77ea1004ca83222065fedbc83ae4f46c9993320d"}},{"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":"mydocs/report/assets/task_m100_2164_visual_sweep/issue2164/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b0af6709423de0fa7885ec444f5fde4bae8e602976606bcb0d3c2451fcde8f"}},{"ruleId":"AC3","level":"error","message":{"text":"Document \u003Ctitle\u003E is empty: An empty \u003Ctitle\u003E gives no page name in the tab, history or screen-reader page list. Put descriptive text in the \u003Ctitle\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/report/assets/task_m100_2164_visual_sweep/issue2164/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36717e0bfc0bf2e4fc952ee8102196821cecdaf2f38e3703fa649a1729c0c84d"}},{"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":"mydocs/report/assets/task_m100_2164_visual_sweep/issue2164/pdf_bbox.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a733c2a6993e4245591eb72f1abeb865eee30420a9ea02f0a45822730774de"}},{"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":"rhwp-chrome/options.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0a64ce76a8a6be3c58dc859c4034931e2e412177fd63978efb1609551fee7"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch1\u003E heading: An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it\u0027s decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/options.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d983c12d29a98e51beba30ff4f20b2e0777f1a1415457cecc917cdc8743a551"}},{"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":"rhwp-firefox/options.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1ad09e339d928789bd116aa2895ca090fe2f5a75387d7943d81c3f7ebe6672"}},{"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":"rhwp-safari/HWP Viewer/Shared (App)/Resources/Base.lproj/Main.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05d5d6dbdc5023c47e254f5a1c7fc26c90b7c0445d80042cef84cb3eb90bc41"}},{"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":"rhwp-safari/HWP Viewer/Shared (App)/Resources/Base.lproj/Main.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e81e012dd42f8112b6535477f634f8346bf9d3b3d909127a088b25653487012"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/HWP Viewer/Shared (App)/Resources/Base.lproj/Main.html"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5400a95f6a06b73bff12e21327b829f664999e1a99985cef4187d730238be0"}},{"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":"rhwp-safari/src/options.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccf8eea44f94efcd22c7cd569c82e6c6d8507767a80d1e6a2d56624a309dfc2"}},{"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":"rhwp-studio/hwpctl-test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae5fa60e829d0808588a2602fb570e0834ea324338fea44697339dfaf754a98"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/hwpctl-test.html"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7910c21aad9bfcde91ad6e8d1040dcd3bc3aaf207eb370131125dfe261947"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/about-dialog.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8721d619967963d447236224f485cc88eac1741fe566820a71ebd1e067e213"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff5dd655aec71b87c9202660a63b2a58072ccb511e679d231b07640897a22c"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f54d9b526b5adad28a704b1180c41ca7da1b68f6f311a28b36262a4c7f4ab7d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c0e6ce3289dd72d42d5d9812c02f94e2df9b4b81da7947b180277c19117e6"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb4111e93183f3fdd85b3f2db697a2bf0e347b7f1fe2188b85cc42c236af0bb"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ce63e7c49cbe90266811e4774653273b2041393f96f87e29c55c0c44e5505b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"351d83a4b49c744484f99105ddbeb49e75987cb77154ebfd9a5d6f3fc9ae3b7b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1b88bbb5b6f78868b16823efbdea41eeb1388b1110fa020b5aa0f6bee56194"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac869ea92c052a257e372a7b5c36d508fbe8ec416ab6cbad06522150ad5ff36"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cf8dfa11c534982a01c3f6c7b914ec0bdb705fa9f21a11e7f04e84fc0c226e"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2de963c30ef64ca85af2dd5ac802c75ec349af1904cdeea7630e807c34d558"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/content-script.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a39270fb05fcc1624161c8233c94099bd24d93c02b088bfaca50c4744591d"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/content-script.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b38e2f82e6585c8a16bd8f754c5d4872eddc69026ce62584f1ac09918d8818"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4722737796b2412099fea30d2a7df7802f1315087364aa8e001f538c7077b1"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b2ce1803146d7ddbdb42a808542a3d3ceb8c64631c974be71010a6f519ef2f"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d88a17314cbf8c53b37e2c1982117d2e542d620b840673b2b8ef89e1538d2a"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6767fe179bc87ac92c19a3c32b970d7413d24163afde6aefb55c9109ec3d8dc7"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077bb41857a1e2d83344a93a8c67d6c93b56848da217dc72cb7697a8f959175"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b8cc4187a8a6308ad674c44ab953557364e63493a35841e654432ab5c4fc5b"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac56a8f3743407cefa14a04bb85a4bdd8229a09feead24a2799f77ddd86cb4"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .menu-title with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/index.html"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"28631902fea36cd02aa3177b77474044452476f1368f278c964adcf8e1fb324e"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .md-item with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/automation/menu-dom.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f58f87aac0a2800085ccb6a9506c82c9075f05d66e694ed796b6d4372de82"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"063cef876de14bcd2a27a7818758b070dd52da7c3f4c5251acab1ea648d1973f"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/context-menu.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa175fd12fc44f204f8f2b505e493dda224aecda76e89d3876770136ae25a62b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/font-set-dialog.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5951b6bc87f749050d2e64c64e8a6600e3316c3b85664c142a8bd4a743539d91"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/goto-dialog.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f6af7742351b50181aaf28798756abc10bb54f4751b80482ebdcd5599aa616"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/local-context-menu.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"608a74953e5170ea1f5b389b9ed019b0d4dde5f8c3bbcbcb887e13ea21e4e803"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"492fc2550943ff160f65db60f350ad8f6d50da9e2e231ed1d9e6c6a63b0d5dd2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b19ad4b69bfc370900586834db7db1e9c54910b6173f537fb2accc32fe0e351"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-dialog.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31cc46d50b994ef16bf30162344f230c19b919b76955b03c1eb0c291a34c892"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3315b34d2d9d80ba21e490c3f85491f4abfa5ebb66f1b2636fa88d7e8093d41"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .sb-hl-swatch with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9913d1617f46953b3696aecbf415fd724cfedcb483c2119d9468396cad0d39"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022separator\u0022 that no keyboard user can reach: This \u003Cdiv\u003E announces itself as a role=\u0022separator\u0022 and is operated by pointerdown, pointerup and pointermove, but nothing can put focus on it: no tabindex=\u00220\u0022, no key handler, and nothing in its scripts moves focus. A keyboard cannot produce a pointer drag, so the control cannot be operated at all (WCAG 2.1.1). Give it tabindex=\u00220\u0022=\u00220\u0022 and move it with the arrow keys in a key handler (with aria-valuenow for the position it holds)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/side-panel-host.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5843c44db83d976a65624e8fe87714d5956dad5657d60bee35018451ff1d55f2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04924d8c6c780a7ab7298afefb97b8fcc17039ef03beb421aff9cf2c54dadf"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f2085b3732b1b926a08f39cd229880f023119c74f7f2b84b296f9e6981880c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-04-r1/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1bd7cbfcaac85680f00ad63c818fcb354f723152df0346d8596c95e2f5c68e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-04/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"27922e07eacad0d623a83741aec2f8b389c29951be8a56e65156bf6b8704a21f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-05/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b3d18d6b7e96a82aa1a2381ec328bcb13765b0a0f08cf9c8517473e46550f8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-06-r3/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"308df1f27e344534abe68534e1edc8018e904652ede4bc82be34c25e4c74da96"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-06-r4/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba2771fcf6a8160ec62f5337bd99b590c575f90bace1f829fc510554b368031"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-07-r5/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2250fb5663e3b3f664840b226da65ee5821e389b4774499962f0249d04eec48"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-08-r6/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b94285d9f67c07da1f91900384a9703261262e608af90606021f3f6702faac7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-08-r7/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a1ba46e7e2346958e629ee238429e3f0e09eac742c6405fc13b2c37dbedd5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-08-r8/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b3d6a6f58ac543d882b90c0b1846c865d54611fd9e07fe69db1656bf8345da"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-phase2/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da3268246200cfdebf6dc9cdd2411f5d06c446455a4b01e88f612f267eaa313"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r10/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"57006c26af402f2daafbba45e3ff0cc9511d44135bce78cccd4145f6994b3e89"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r11/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c361ff531e20cdf2cf87df7c0b45d4dfcf3014b0711eafbe03c188d682751ae"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r12/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aa26789e7733c5d4f27d6ea0eaa42cb2c3eded73caf67e211af6cf9fffcad8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r13/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b565dfc80c7a7de0dc861df75eacac7eb628bd9b07fc0f3575605dd585500"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r15/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4d52e9982a2011cccd12924203769932fda80af7755c1c70dcf4eb7baffd87"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r17/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a410907c7588e4f25142d09b98dfcdfddffb6389f2e2de4a3851c4c601456"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-09-r9/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f323fa1c7248b52a5540caf2ba2ffbbd7da041f582a3be5407a10ccaaef035"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-10-c2r1/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"26841130f8c1038f6771ca707258884030306bd20c156aaffb112a6cfc21e662"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-11-c2r2/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a499e0df8856b3e49e2b0c302cb0f2872f14fb04996095c5e8503c4b836c479"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.chart-desc\u0060 sets color: #888 on background-color: #f8f9fa \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/dashboard.html"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"48addf5c6f87c10106be6db09b684aa006d68dce04c72f7e732ecddc24168891"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.screenshot img\u0060 moves (\u0060transition: transform 0.2s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_negative_report.html"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355934c1d3a7fa6cfda7420323a98f08c646f72a7b07ec53f55cd864e594868"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.badge.pass\u0060 sets color: white on background-color: #28a745 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_negative_report.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddea1bfa98d9f06a3b1d4fdbe306213412745d768fd4e8db2ad74587f0ca4def"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.screenshot img\u0060 moves (\u0060transition: transform 0.2s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_responsive_report.html"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2dbe5b046a19353bf50b64c112bdcf15c89377c8a050b67e5af0add0854384"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.header\u0060 sets color: white on background-color: #28a745 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_responsive_report.html"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5367cc3281c2c1c54ad21e756ed672e75bbbd2425cb0dd0c120c5349a0fe9b88"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.badge.pass\u0060 sets color: white on background-color: #28a745 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr7152_responsive_report.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b4f0b354be1bcc0ed0a9702c53e55832aa478873368210afdb4a6272f095bf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.screenshot img\u0060 moves (\u0060transition: transform 0.2s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/task2809/issue-2809-split-alignment-report.html"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf92c34f13ad5d78a078ce391fbdebced1a9c56d46a0fbad9912a4fc40ea20f9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.header\u0060 sets color: white on background-color: #28a745 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/task2809/issue-2809-split-alignment-report.html"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"64742bf1a584e8a71703deaea341c95c8e6a84ac55bd52fe0aeec14aa93c4e37"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.badge.pass\u0060 sets color: white on background-color: #28a745 \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/task2809/issue-2809-split-alignment-report.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"325675a8082d8e2ea0eb4063bfd64bfcc5d629eabab84f064b57d565f94deb5e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.toggle .slider::before\u0060 moves (\u0060transition: transform 0.25s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6138d29623bb6c89c0dcaa6356b5b7c0066d13456063065cdde9334acc325"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.0:1): \u0060.add-domain button\u0060 sets color: #fff on background-color: #007aff \u2014 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b73f192a313d4a885f78a0c5a5efe7b1a6d853a051b31494542c7f6e78b0ab1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.0:1): \u0060.log-btn-primary\u0060 sets color: #fff on background-color: #007aff \u2014 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"98db7afe8bd3ba08b5a0c458e6b435862bf160ed588dec6b778667a8af9360cb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.3:1): \u0060.log-btn-danger\u0060 sets color: #ff3b30 on background-color: #f5f5f7 \u2014 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935ce47b5ef7b385a5f3a8131d0757dbf3b0f35bc536e421bfd238b20020144"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.3:1): \u0060.log-table th\u0060 sets color: #86868b on background-color: #f5f5f7 \u2014 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/options.html"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb434d02f243beff3b0d1928f31804dd577b1cab7fd36a72f2f467786b8ae8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.code-area\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/hwpctl-test.html"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dda0b46e132dcf62e43f3fa6a2124becbe98233f56f7109188f563383410f1a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060.protected-cell-hover-guard\u0060 sets color: #fff on background-color: #d54f33 \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/styles/table-selection.css"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9132d31434906d9a16ae1a5efe163cc2a331f734232e51110b2ba3247199c3bd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.5:1): \u0060.palette-hint\u0060 sets color: #6b7484 on background-color: #1b2029 \u2014 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff33284ae4f4a56ab332a88f1d847ba2c6f4bb33d15a195da2450199dec35b23"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.btn.primary\u0060 sets color: #fff on background-color: #5b8def \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c6857971605d9d9d09c66291bd2a2090d8185b6959ed93c67ed624b68bd99f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.5:1): \u0060.palette-foot\u0060 sets color: #6b7484 on background-color: #1b2029 \u2014 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cdccfe538015a9bf082515689ebafd62f586ebab0994a3eed5479f03225244"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.cp-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/styles/command-palette.css"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"75109fa677a39fd56d5afc56d7b0466bdbe13e6733c3548b70440e0b57c92d0f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.form-edit-input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/styles/form-overlay.css"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f14fcea4d491eb4a0864226dccc2939d31336ebfaf68d504033147206a5673"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.palette-search input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497bc839a6e083e59fab7eab9ca2667e0d9f9422e95dd5668b9c584f7df4bdf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.field-row input[type=\u0022text\u0022]\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e54c6adcbe608a8500fc1eb489adc114272c4ef4af5622bc346b7a9dc04d3f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.flag-row input[type=\u0022text\u0022]\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32da3aeb42c1caf07afaf77ab8298523181dfb0a489e3657f0270c2117d70dd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.dialog-pdf-progress-bar\u0060 moves (\u0060transition: width 120ms linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/styles/dialogs.css"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042647ef87bb6def61642f47bc9b45d4fe34e8322d3998b7ccb820cb3ab581f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-action-arrow\u0060 moves (\u0060transition: transform 0.15s, opacity 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/content-script.css"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f0ba2f6c8367b6ceac61fe92fa500710cc99a378f3e7373c142d0cc99c9d73"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-card\u0060 moves (\u0060animation: rhwp-fade-in 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.css"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de2201b17df4fc04e4c3187de6097106cc4d592a7ada87b3bd8090539369af5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-thumb\u0060 moves (\u0060transition: transform 0.15s ease, box-shadow 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.css"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b2d33093d357e121583587a240b04537d71ce67717b7b7cf56ac24c88b1fc7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-action-arrow\u0060 moves (\u0060transition: transform 0.15s, opacity 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.css"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3f3797cd93c7cb4baff87c755e88e6688c6b78ef67da52aa91a4648e2cf0d9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.btn\u0060 moves (\u0060transition: background .12s, border-color .12s, transform .05s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"409cba2a3ab2a8e0e5c9ce2ae11c3aa5535c0eec24276f00667326519b264903"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.queue-bar \u003E i\u0060 moves (\u0060transition: width .2s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7712cf04387e879a72b71d7efe99af353509cd909f72b75c706b7a9d366a14d2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.fleet-stat\u0060 moves (\u0060transition: transform .12s ease, border-color .12s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81ee8f82f2975aad8593e7d78fbeaf3df85167322639e6f29db75bda55368e8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.card\u0060 moves (\u0060animation: card-in .18s ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e493db12f67980d01918d4c40e15cf74233bbc99907de769f13f6afb7cc64012"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.toast\u0060 moves (\u0060animation: card-in .18s ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/css/app.css"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb94ecf5ddf3e600d977b39b96a1cb1b26a24c4422a77e73ebfb7bdd72c4660d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-card\u0060 moves (\u0060animation: rhwp-fade-in 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.css"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"65492e876475ecaf376ff5b4ddf0c613c68bd02fe3ae6d87cd3e6c5bde58c318"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-thumb\u0060 moves (\u0060transition: transform 0.15s ease, box-shadow 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.css"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5866dee6cc9fee9090d3ed4e4899247e3f6281d3bb8afe28102fb05fcf8c491d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rhwp-hover-action-arrow\u0060 moves (\u0060transition: transform 0.15s, opacity 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.css"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c017d3c715f6b6e5f89e0ee7c900c57b376c8b49c013324bfb8e907f9610e2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: CONTRIBUTING.md links to \u0060mydocs/tech/typesetting_architecture.md\u0060, but \u0060mydocs/tech/typesetting_architecture.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CONTRIBUTING.md"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d7561ca3612b727003c5867a0b2d260507fac890cf9bd95c2333392a30deb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: CONTRIBUTING.md links to \u0060mydocs/tech/chart_ole_v1_boundary.md\u0060, but \u0060mydocs/tech/chart_ole_v1_boundary.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CONTRIBUTING.md"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb4b4549a0946026452a47ac60d307c833ca85105295f72c651b1b94731ea33"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: CONTRIBUTING.md links to \u0060rhwp-studio/e2e/MANIFEST.md\u0060, but \u0060rhwp-studio/e2e/MANIFEST.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CONTRIBUTING.md"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"953ccb6a8a74ba096de91e8e46cb665b87d4316966e31b10d334cf222585aca9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md links to \u0060mydocs/release/release_notes_v0.9.0.md\u0060, but \u0060mydocs/release/release_notes_v0.9.0.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fda7bd8a88350366d7e87dcfafd1a3d129fea02fa422781993644c4ad0b15d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md links to \u0060packaging/crates-io/README_PACKAGE.md\u0060, but \u0060packaging/crates-io/README_PACKAGE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab0e783650f4e3eb7f8cf1c1db7d79594722186327ada9abf0351f861735e27"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README_EN.md links to \u0060mydocs/release/release_notes_v0.9.0_EN.md\u0060, but \u0060mydocs/release/release_notes_v0.9.0_EN.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README_EN.md"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d45bf565c6f9ba6f34c6fbf7a536770ecff9362381aeb86604ced838254490d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README_EN.md links to \u0060packaging/crates-io/README_PACKAGE.md\u0060, but \u0060packaging/crates-io/README_PACKAGE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README_EN.md"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f03b52abb9a7a9fbadc13628b4e3929879ffb450444d03d02ff08eb387ef50"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: fuzz/README.md links to \u0060../src/serializer/hwpx/roundtrip.rs\u0060, but \u0060src/serializer/hwpx/roundtrip.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/README.md"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3192d6cd7af81351d6bc9e67e5f27a90582e305d63f934d565b1afbb5488ebd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/README.md\u0060, but \u0060mydocs/tech/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8ef0e8eb01185d49dfa5354b413541374fa71b02fa05a823e1a3de68f6c6b3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/hwp_spec_errata.md\u0060, but \u0060mydocs/tech/hwp_spec_errata.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e872c6d4fa03ac82f91b779db5ff40b0f4708e3ba770e0ca386927166180321"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/\uD55C\uAE00\uBB38\uC11C\uD30C\uC77C\uD615\uC2DD_5.0_revision1.3.md\u0060, but \u0060mydocs/tech/\uD55C\uAE00\uBB38\uC11C\uD30C\uC77C\uD615\uC2DD_5.0_revision1.3.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2483a0c690105140b80a57ac66ad7dc1c78ab01c3960ad65c2b9f8c1b647c5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/document_ir_lineseg_standard.md\u0060, but \u0060mydocs/tech/document_ir_lineseg_standard.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"438152bc5f59f959c20666f82227ab9d5db4e1623cea5adf82a6b7adee87a127"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/rendering_engine_design.md\u0060, but \u0060mydocs/tech/rendering_engine_design.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8faaea0abd15b04e2bf067ccbfbbeef2191e94d85995479873bac4d15e8048"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/text-ir-v2.md\u0060, but \u0060mydocs/tech/text-ir-v2.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec725f107edb32752c3311c33b464cbd0e72cb4142835a4146825eeb60e80f4a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/table_layout_rules.md\u0060, but \u0060mydocs/tech/table_layout_rules.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffff1d624ecc7f585dbf7b2cb5a527e2ce51ee562c5d94b96fc3ab3579663154"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/typesetting_architecture.md\u0060, but \u0060mydocs/tech/typesetting_architecture.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"02989d6d9f586744132f9d8d7de5084a909db72771c3119203d54c9c6e06f7c8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/font_fallback_strategy.md\u0060, but \u0060mydocs/tech/font_fallback_strategy.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9146e5c238059b1f0159606a051f34781c7b72b55667ac176114362aaaafd48"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/edit_action_undo_redo_architecture.md\u0060, but \u0060mydocs/tech/edit_action_undo_redo_architecture.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974e5137f53edb9aeca8995d64d8f37162eb9efd180fa9ff8a2300bdfcb7878"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/parser_architecture.md\u0060, but \u0060mydocs/tech/parser_architecture.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fff70329c85b71b92e2246b1e38aa1139bceb2e80434516102af54eb43c39e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/thorvg_decision.md\u0060, but \u0060mydocs/tech/thorvg_decision.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a36cd86ec808f1a0bea568e6369376cca89b546ca6bada74debab95eabf3e7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/archive/dev_roadmap_v1_backup.md\u0060, but \u0060mydocs/tech/archive/dev_roadmap_v1_backup.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd0f32544b98dfe054df782608dc77fd049029844d535913357c1e4e9847305"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060tech/investigations/README.md\u0060, but \u0060mydocs/tech/investigations/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b16742a8fea409c788131053655cc0866d420df2ad575ba28df6ae09986e49"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/README.md links to \u0060troubleshootings/README.md\u0060, but \u0060mydocs/troubleshootings/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/README.md"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6abbfb91a3ed32ab4d9b5b300bc50aee7c7ff35503a10977907e659d9b407"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tools/README.md links to \u0060../../scripts/tests/test_gym_authority_ledger.py\u0060, but \u0060scripts/tests/test_gym_authority_ledger.py\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/README.md"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"448fd6ac001c530e51b14484c1b05f20de6833cd3160f8a5c56c0b2edf1a6e15"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tools/README.md links to \u0060../../scripts/tests/test_gym_oracle_probe.py\u0060, but \u0060scripts/tests/test_gym_oracle_probe.py\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/README.md"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf384afb2c964730b664b45f11f455588a00f2c973d63bfb2b86a4dbc0432528"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tools/README.md links to \u0060../../mydocs/working/archives/gym_oracle_probe.md\u0060, but \u0060mydocs/working/archives/gym_oracle_probe.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/README.md"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd162bc91328c15104494fb57ef2e53064c1e3830772c72ac5851fec870cfb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tools/README_leaderboard.md links to \u0060../../mydocs/working/archives/gym_leaderboard.md\u0060, but \u0060mydocs/working/archives/gym_leaderboard.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/README_leaderboard.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f431c55a62aaf40a739220c9237ecd7f9588572dbfda388b8310004b1d2dc0f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tools/README_robustness.md links to \u0060../../mydocs/working/archives/gym_robustness.md\u0060, but \u0060mydocs/working/archives/gym_robustness.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/README_robustness.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8144725db9c77ee000762a85f518ff98070145aa67639d9556e8bc22ab5a5a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/tutorial/README.md links to \u0060../../mydocs/working/archives/gym_tutorial.md\u0060, but \u0060mydocs/working/archives/gym_tutorial.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tutorial/README.md"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbced9712e61fe59d1007b518b7f33de1c961eb259617fa207e6e98a571298"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../tech/README.md\u0060, but \u0060mydocs/tech/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e18fa3faf3d7fe469dbcac9fb2f117d8e83da0f5d51d123bfa5d395fb86f44"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../packaging/crates-io/README_PACKAGE.md\u0060, but \u0060packaging/crates-io/README_PACKAGE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a42bc05d4468db607921f83152fada401114a7aa671b34c828d54ed88acacc"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../tools/fidelity_compare/README.md\u0060, but \u0060tools/fidelity_compare/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f418f3dbfd1bcb6880912ccb84cdcb1920778046dae949162148b42076ee0a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../tech/hwpx_hancom_reference.md\u0060, but \u0060mydocs/tech/hwpx_hancom_reference.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e867b9ae78fc2ffd69dd7dd0fbbf2effb437286a25d02b599d23eb6feeb90"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../tech/render_backend_fixture_catalog.md\u0060, but \u0060mydocs/tech/render_backend_fixture_catalog.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"90789fdaa8d9604ddd1d840d9cfbdcb41dae6f068891f6e1da5789587b479a48"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../tech/render_backend.md\u0060, but \u0060mydocs/tech/render_backend.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9acb888f7390856be9e8722a69b465659f9208c5794cfba150b28d1c0af5e9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../working/assets/issue6042/README.md\u0060, but \u0060mydocs/working/assets/issue6042/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"855ad96e0b86b7cfce0bf3e147452cd2d63390e16aaa99c3736556a1a452533d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../tech/font_fallback_strategy.md\u0060, but \u0060mydocs/tech/font_fallback_strategy.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4225ea59745741c1d1cdd4defd394ca68c2d749b941eaa5f67637980cd31e84"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../npm/hwpctrl-ocx/README.md\u0060, but \u0060npm/hwpctrl-ocx/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd357d10610f010da2ac1fced04ac9396870b1dcbfaec2852eee0c4803755ee"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../tools/hwpctrl_compat/README.md\u0060, but \u0060tools/hwpctrl_compat/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"523cb59f572a6921ee90bd963da4c8e4213826f9e3b99f782de8bdc7edbd29c6"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../src/renderer/equation/README.md\u0060, but \u0060src/renderer/equation/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e871378827372f8926f882a8b07103718897ae72e0468073ec9bdc122e8abc4e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/README.md links to \u0060../../src/renderer/equation/dispatch.rs\u0060, but \u0060src/renderer/equation/dispatch.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/README.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a16749af94eb7545a51d5052d3ee8779204a6ea452bac1fa21761a8f3357691"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: data/font-metrics/nimbus-roman/README.md links to \u0060../../../pdf/issue8174/fonts/URW-FONT-NOTICE.txt\u0060, but \u0060pdf/issue8174/fonts/URW-FONT-NOTICE.txt\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data/font-metrics/nimbus-roman/README.md"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aee7b30692e5a2ccbc97007216898e5de384ca3f4f2500c62aa443b84bc8de"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: data/font-metrics/nimbus-roman/README.md links to \u0060../../../mydocs/working/task_m100_8174_t03_font_fidelity.md\u0060, but \u0060mydocs/working/task_m100_8174_t03_font_fidelity.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"data/font-metrics/nimbus-roman/README.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef31b363be9650ace3c23f3401004618882eb74e2b40ed1d1913d50590f9dca"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/corpus-diagnostics/README.md links to \u0060../../../mydocs/working/archives/gym_om_lr_cd.md\u0060, but \u0060mydocs/working/archives/gym_om_lr_cd.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/corpus-diagnostics/README.md"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1e7988a90f1daf886b9127aaba516916d754476e0311892c6b2bae6957172d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/layout-rendering/README.md links to \u0060../../../mydocs/working/archives/gym_om_lr_cd.md\u0060, but \u0060mydocs/working/archives/gym_om_lr_cd.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/layout-rendering/README.md"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e507888916d52fbd33b046a6ea2adeda1a670868ed1128345f104309e844cb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/objects-media/README.md links to \u0060../../../mydocs/working/archives/gym_om_lr_cd.md\u0060, but \u0060mydocs/working/archives/gym_om_lr_cd.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/objects-media/README.md"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e1f7f6003cde03ba8ecaa90b3d8d8ac9c6c9e701e7d7a6128fca4f548ab03"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/self-description/README.md links to \u0060../../../mydocs/working/archives/gym_self_description.md\u0060, but \u0060mydocs/working/archives/gym_self_description.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/self-description/README.md"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ff5bc749225c54569f0f0d61874532874befe53127a8ded3d0f8dacc49c8e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/serialization/README.md links to \u0060../../../mydocs/working/archives/gym_serialization_exceptions.md\u0060, but \u0060mydocs/working/archives/gym_serialization_exceptions.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/serialization/README.md"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb6d8d0c8df82d5cc499b5109e6653859245559ed8f9ff3becef95ad888649f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/serialization/README.md links to \u0060../../../mydocs/working/archives/gym_serialization_pack.md\u0060, but \u0060mydocs/working/archives/gym_serialization_pack.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/serialization/README.md"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81deb8c9e1942bc67b99feb2eb9ce6df4b2b4176bf2cd01a43ace489c67b50"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/table-editing/README.md links to \u0060../../../mydocs/working/archives/gym_table_editing.md\u0060, but \u0060mydocs/working/archives/gym_table_editing.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/table-editing/README.md"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64042d494319d388113c2220a88462153c2f0111d022fbcbcef871e3cc54cd0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/table-editing/README.md links to \u0060../../../scripts/tests/test_gym_table_editing_pack.py\u0060, but \u0060scripts/tests/test_gym_table_editing_pack.py\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/table-editing/README.md"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"6170cbdc78218c3d3f08bc5bc17c311b26dd20d479bdcf1c4ce0596284f80c20"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/text-editing/README.md links to \u0060../../../mydocs/working/archives/gym_text_editing.md\u0060, but \u0060mydocs/working/archives/gym_text_editing.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/text-editing/README.md"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa9021b2b47228aead45ba8dea0fa573c5cbabe8bdd04c9ed5618e4ecdb8226"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: gym/packs/text-editing/README.md links to \u0060../../../mydocs/working/archives/gym_text_editing_exceptions.md\u0060, but \u0060mydocs/working/archives/gym_text_editing_exceptions.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/packs/text-editing/README.md"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea13873ef628e3ed02e0abcc8059b66ba1da9c4750c3ce0ca233e9c1d6642884"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/manual/verification/README.md links to \u0060../../tech/render_backend.md\u0060, but \u0060mydocs/tech/render_backend.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/manual/verification/README.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c9805083958f6c2b5315bf2ed9b77588f5d6a8e50a030bd672a233fde7454"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_field_group_owner_20261021/README.md links to \u0060../../../working/task_semanticist21_20261021_group_active_field_owner.md\u0060, but \u0060mydocs/working/task_semanticist21_20261021_group_active_field_owner.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_field_group_owner_20261021/README.md"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c30935d5bd1b128b48e7bf4e3671973205c6fa061783faad8c558f1683afe8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/README.md\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20f15442a12ba8250770959d92da15a7af1272884568ad96485854506980d6f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-false.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-false.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18d19e5ad230f3cfe4e22eb72cdaaf1144412f6196d968385d2dc447f0454df"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-false-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-false-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f9deea13c09a3f2f606b820a5462a3f8b6219f64b26df41beadb1aec66c80b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-false.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-false.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d393e9a3087a95087e75316dc37e13b6fbaf0c4dd80e0037200a498394f85"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-false-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-false-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9fc189c1bd94067cf7b7c397f902407e2ca42487a26888b56e6227983898bf"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-true.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-true.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908d611a5e02a059fd7595664b7a4539022f94e35c506646ed34a2aa52cdea4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-true-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-true-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ec318d7ab42b7a6547e616e5c79a03294714f410385be4af89a112792af8f8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-true.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/nonbmp-endnote-true.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b363d127e8a835714ee383755fb6e93c7b38e7ce0252dbd718de8f7404b16d91"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-true-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/nonbmp-endnote-true-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"512bc7c63f29c6669333c36f0796d4530697229912d31ac8d073c89462814521"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be5b1705160a0afc564ab5f1729239492e7f179a92cd730a69a12d728db9cd5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d818324686e2a8b99b186362a1119c9cb9e95fe2b826cb353884aeb9ffd075"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b4f4d5e88fcfe7cfda73527fadba661ccff192fddb4479969e9c74cf82e74"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-left-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"450fd8e1dd5e4188dd29b35f0e08c452d513e57c162b1dc24cb610fdb5f65581"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a312083934f545a1dfffd5df3fac81e7b221fa30d07ab6a4c5d8bc114f446df0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d98f91e8e4f0139422bb52be6ba05d66a996919cdd292a68ac112ee5a394e0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2463804fa72830d59226f8bb20cf07c648d24fe0fa1454b8401778ddcd1f4df9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-false-right-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"77351dde49c3d6b681d04b206f691f9ed8691adb82d6591303c8dbb0130f824e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"65df045351924b3c3467bac7ee81902a8291c97112da773cb0b15f08c6291f1c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b4c1a9d3e3460a5b382c4b8ca385395f4dc19c4db1b4ac45fdba04a56570aa"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4844da1de04aa34de62c89891b8db25f84407ecc3a53cf00259539e726d24a07"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-left-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8cb7e41b1574f70f37467fb3574678f0765f70b83409ec2004c9627efdbf84"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right.hwp\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919a15ee40052951477fc713bbba013e0ab6b174d3aeb9b098532d2f7986d7e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right-hwp-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e76e364d155f24ea3b1c3ce3a4be49bcf2a7b2dd13925fa40dfd06704f86ab"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right.hwpx\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f4831a0b2a153d67153035f7aad10d988efb61f4260873410135ec9d04cb66"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/active_regression_qualified_20261026/README.md links to \u0060../../../../pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right-hwpx-2020.pdf\u0060, but \u0060pdf/issue7819_char_overlap_caret_axis/same-anchor-terminal-false-note-first-true-right-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/active_regression_qualified_20261026/README.md"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3835bb438530ad7c58f74096d010c854827c4f5bce931e7630d78ffbd6674ec5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/approved_planet6897_20260925/README.md links to \u0060../../../../pdf/issue6907/pr7393-source-2024.pdf\u0060, but \u0060pdf/issue6907/pr7393-source-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/approved_planet6897_20260925/README.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d4f8fad003fadb1e919b73c4542ff4e8e812a88f315e0c9a14ad788208b12"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/approved_planet6897_20260925/README.md links to \u0060../../../../pdf/issue6907/pr7393-roundtrip-2024.pdf\u0060, but \u0060pdf/issue6907/pr7393-roundtrip-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/approved_planet6897_20260925/README.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2a18e343880197449af6576dd042e5dcd39f637a3b617adf000b55166cc3d2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/pr8061_cell_picture_layer/\u0060, but \u0060tests/fixtures/pr8061_cell_picture_layer\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe25c19bcc469f5cb7fd3b8b6df3f66924fa81db0a322bfdcb9455ad7e656a8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md links to \u0060../../../../pdf/pr8061_review/\u0060, but \u0060pdf/pr8061_review\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62fc835b3032775a73260bc1c2a882d239d4c23b80cc82afe2ce08b82326158"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/pr8061_cell_picture_layer/expected.json\u0060, but \u0060tests/fixtures/pr8061_cell_picture_layer/expected.json\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a27c4015f39b1256e135e0a1590ce8db7820caa4df0a4302fb8d3ecb123c43"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md links to \u0060../../../../tests/cases/verified_cell_picture_layer_scope.rs\u0060, but \u0060tests/cases/verified_cell_picture_layer_scope.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d611d857c28e64bf1b138c5554272f59599d5eb9a00951ce38fcad0c9e7c7e1c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md links to \u0060../../../../tests/cases/verified_rowbreak_successor_print_frame.rs\u0060, but \u0060tests/cases/verified_rowbreak_successor_print_frame.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/cell_picture_layer_qualified_20261026/README.md"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd1ced24545658fee18aa98b1815589ea539c4538acf712256367fb55306039"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/chrisryugj_20261031/README.md links to \u0060../../../../pdf/lseg-05-tab-hwp-2020.pdf\u0060, but \u0060pdf/lseg-05-tab-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/README.md"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8b374742a1ded171c048be9b31bc63009c0b97f24f9205f57ee00744a99b8d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/chrisryugj_20261031/README.md links to \u0060../../../../pdf/pr8224/lseg-tab-insert-2020.pdf\u0060, but \u0060pdf/pr8224/lseg-tab-insert-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/README.md"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"202499e1560c1ac8395c0aa7050a817a6d371567a3b5e13931552949aee4dc6a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/chrisryugj_20261031/README.md links to \u0060../../../../pdf/pr8224/lseg-tab-delete-2020.pdf\u0060, but \u0060pdf/pr8224/lseg-tab-delete-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/README.md"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5a6fe7900b51b6a48e919383562dc514034b74cacc4911ee16761872495668"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/chrisryugj_20261031/README.md links to \u0060../../../../pdf/pr8224/lseg-tab-split-2020.pdf\u0060, but \u0060pdf/pr8224/lseg-tab-split-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/README.md"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b83a5c5ef798fcfd5d5a7ae356f3fd4855e4bcbdef5f796a34b79665cfaedf"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/chrisryugj_20261031/README.md links to \u0060../../../../pdf/pr8224/lseg-tab-split-merge-2020.pdf\u0060, but \u0060pdf/pr8224/lseg-tab-split-merge-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/README.md"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a690b653439c8887c4f0e784749c94f39bfffe40d960d5752e0f8c6b1b5ee68"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/computed_successor_spacing_20261025/README.md links to \u0060../../../../tests/cases/verified_computed_split_successor_spacing.rs\u0060, but \u0060tests/cases/verified_computed_split_successor_spacing.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/computed_successor_spacing_20261025/README.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4203de8327b7ced22d1d2183c751e8f7e233003eaa8d4acb92870fd1e3b6185"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/computed_successor_spacing_20261025/README.md links to \u0060../../../../tests/cases/verified_computed_split_successor_multiline.rs\u0060, but \u0060tests/cases/verified_computed_split_successor_multiline.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/computed_successor_spacing_20261025/README.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7a71f197e4b10087cbf9d3110b2eeaabdbfde60fa967307f27fdea96ad5ba3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/dependabot-20261102/README.md links to \u0060../../../../tests/fixtures/pr8309-latest/textbox-saved-bottom.hwp\u0060, but \u0060tests/fixtures/pr8309-latest/textbox-saved-bottom.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/dependabot-20261102/README.md"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"08815c532fdfc10a569173a693862353458ceb0078f84d009f3257ff1a39f5c2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/dependabot-20261102/README.md links to \u0060../../../../pdf/pr8309-latest/textbox-saved-bottom-2024.pdf\u0060, but \u0060pdf/pr8309-latest/textbox-saved-bottom-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/dependabot-20261102/README.md"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaa04b11274319c1f33e2235b9e835a91086db5d8002e58f0ee005ff7981e50"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/dependabot-20261102/README.md links to \u0060../../../../pdf/issue8399/A-hwpx-2024.pdf\u0060, but \u0060pdf/issue8399/A-hwpx-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/dependabot-20261102/README.md"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"391e8a1daaa8ef9e984a37fee44e5cf7a26feda564957a9c959774e8608d8f9f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/dependabot-20261102/README.md links to \u0060../../../../pdf/issue8122/textbox_valign_no_lineseg-webhwp-print.pdf\u0060, but \u0060pdf/issue8122/textbox_valign_no_lineseg-webhwp-print.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/dependabot-20261102/README.md"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf3a1a6f5287eb0bcec63091d40833c0a6500998d6bfaed294b81c52266d2ef"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/dependabot-20261102/README.md links to \u0060../../../../pdf/issue8160/wmf-fixed-face-dx-independent-2020.pdf\u0060, but \u0060pdf/issue8160/wmf-fixed-face-dx-independent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/dependabot-20261102/README.md"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea882f7e1e5cf765fbe8827c573ee910b789fb58445010754f5da4fb31cd0476"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/group_picture_outline_frames_20261021/README.md links to \u0060../../../../pdf/2025%20\uD589\uC815\uC5C5\uBB34\uC6B4\uC601%20\uD3B8\uB78C%28\uCD5C\uC885%29-hwp-kopub-2024.pdf\u0060, but \u0060pdf/2025 \uD589\uC815\uC5C5\uBB34\uC6B4\uC601 \uD3B8\uB78C(\uCD5C\uC885)-hwp-kopub-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/group_picture_outline_frames_20261021/README.md"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb6ba78870a5cf80aed9ec444aa22f8738e4e339d90203eba9462c490712935"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/hwpx_cell_frame_print/README.md links to \u0060../../../../tests/cases/hwpx_cell_frame_print.rs\u0060, but \u0060tests/cases/hwpx_cell_frame_print.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/hwpx_cell_frame_print/README.md"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7cd9d53bd0e2185d23285617780092756d9beea4fb7a1e9748f46d8eb386da"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/pr8093_form_caret/form-slot.hwp\u0060, but \u0060tests/fixtures/pr8093_form_caret/form-slot.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc9657bc3d27f28c2733c368f763d2875fdd0a4828b155c357f51694891f451"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../pdf/pr8093_review/form-slot-hwp-2020.pdf\u0060, but \u0060pdf/pr8093_review/form-slot-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"15972e63c0a527d275f7fa8c98a78f159290623911e10a679290c6ce57a618f5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/pr8093_form_caret/form-slot.hwpx\u0060, but \u0060tests/fixtures/pr8093_form_caret/form-slot.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db90e1f67401e470d1d9106610b44eb4a63f7195c9e265544067a36891d97e2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../pdf/pr8093_review/form-slot-hwpx-2020.pdf\u0060, but \u0060pdf/pr8093_review/form-slot-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0659c9d234aeffdc3b03ec23b0b985ad5af3ddddba095d85096268bb93ac9a3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../tests/fixtures/pr8045_square_wrap/square-hancom2020.hwpx\u0060, but \u0060tests/fixtures/pr8045_square_wrap/square-hancom2020.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6cac3b56139f5fa0fa4cd1ec3015fbde67c85a7e038711fb38c5e0e30b5f64"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/inline_wrap_qualified_20261026/README.md links to \u0060../../../../pdf/pr8045_review/square-hancom2020-2020.pdf\u0060, but \u0060pdf/pr8045_review/square-hancom2020-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/inline_wrap_qualified_20261026/README.md"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ef7d0dd6318bc8892d936866aa6aa2bf54c93e2154b94b9dd7ecb7981e9f4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/integration_20261031_full_image_crop/README.md links to \u0060../../../../pdf/pr8040/exam-social-insert-2020.pdf\u0060, but \u0060pdf/pr8040/exam-social-insert-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/integration_20261031_full_image_crop/README.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4616d424704128f61a3a0a5d64535ff7ec8b5dc90e4e7edf44a4a4123778d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/integration_20261031_full_image_crop/README.md links to \u0060../../../../pdf/pr8040/exam-social-insert-delete-2020.pdf\u0060, but \u0060pdf/pr8040/exam-social-insert-delete-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/integration_20261031_full_image_crop/README.md"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"94331f06433c53f00abfc6426de16207a1a48e93dfda05da20b65066c65e5500"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/intrinsic_heavy_face_20261026/README.md links to \u0060../../../../pdf/pr8025_review/README.md\u0060, but \u0060pdf/pr8025_review/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/intrinsic_heavy_face_20261026/README.md"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad88f961eef434bf4daf77ab2668527c3c591aaf67c8eeba9fb3baf11ffee5e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue1949_legacy_character_plane/README.md links to \u0060../../../../tests/fixtures/issue1949/LEGACY_CHARACTER_PLANE.md\u0060, but \u0060tests/fixtures/issue1949/LEGACY_CHARACTER_PLANE.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue1949_legacy_character_plane/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c542b7f95e8213fc4728fdee4961bc117fcf0ca33fb19a74c853926efc8ae3f6"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue4138_line_advance_20261025/README.md links to \u0060../../../../pdf/issue4138_line_advance_20261025/split-current-2024.pdf\u0060, but \u0060pdf/issue4138_line_advance_20261025/split-current-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue4138_line_advance_20261025/README.md"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55c4724a4d17641c7938f166b0e6bff543ee1d33d0c7a167cd965a49e51808"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue5874_synthetic_italic_20261025/README.md links to \u0060../../../../pdf/issue5874/italic-repro-hancom2020-print.pdf\u0060, but \u0060pdf/issue5874/italic-repro-hancom2020-print.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue5874_synthetic_italic_20261025/README.md"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e8fafb2d72d75890db1f4370aa78a79d9d15a8b1fbea3b1b61146a560d6c3c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/80250_regulatory_analysis-hwp-2024.pdf\u0060, but \u0060pdf/80250_regulatory_analysis-hwp-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6481cff918e8edf585391ec4f10a3aee65612773853a8eed9fb4d861053b75a2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue5941-1480000-201900698-2020.pdf\u0060, but \u0060pdf/issue5941-1480000-201900698-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6223fbc57292a80c66c087df9c7850f248a149c37080ef80310f981d6fbc8c7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/3249937_asset_management_rules-2020.pdf\u0060, but \u0060pdf/3249937_asset_management_rules-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3662558e6c34ed57b51116119beeacdab167a8a3cb46b592ef4bb9001bacc305"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/task2097/75544_pii_bunseok-hwpx-2020.pdf\u0060, but \u0060pdf/task2097/75544_pii_bunseok-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6d7335ed30b61abf5dcc5eaf484ed518032850a3eaf3ecdfbd300af8ae5713"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue3637/press_release_split_cell_nested_table-hwpx-2020.pdf\u0060, but \u0060pdf/issue3637/press_release_split_cell_nested_table-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d771c4bff0abc4b15daaac44460a633f76ba9053d3cd2cc56fdee0a7d9149"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/rowbreak-problem-pages-hwp-2024.pdf\u0060, but \u0060pdf/rowbreak-problem-pages-hwp-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dde3feca63ef0e3fd3155c520d093db8cb46f555018c8ec972439aefb27cc79"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/1613000-202200037-air-traffic-controller-cbta-2020.pdf\u0060, but \u0060pdf/1613000-202200037-air-traffic-controller-cbta-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2279e07c0a95dc51455ecbcbc8cce6a486270b5541ee7d581304076161ae302"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/70833-electrical-safety-rule-regulatory-analysis-2020.pdf\u0060, but \u0060pdf/70833-electrical-safety-rule-regulatory-analysis-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"957cc73dc39c0a7a3c5123da0067ee45283abdf6ff7dc56ba20d9691518ef4d2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/30269-anticorruption-recommendation-toc-2020.pdf\u0060, but \u0060pdf/30269-anticorruption-recommendation-toc-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b309c24c9bbc8769fcc4b75c46e2b45d63c4a62215ed681b1aada5cdf75291"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/exam_eng-hwp-2020.pdf\u0060, but \u0060pdf/exam_eng-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"db88d71d32161614908e1e4c310ef7803bf6dfb8c8ef75ea0fa10a28d97e3009"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/hwpctl_API_v2.4-hwp-2020.pdf\u0060, but \u0060pdf/hwpctl_API_v2.4-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16612a7cede0f34ccb8217ac4b10f35fbaf4f226731411a9aa1a8fbe4a5df6c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue7382-regression-review/issue1937_rowbreak_footnote_overpagination-2020.pdf\u0060, but \u0060pdf/issue7382-regression-review/issue1937_rowbreak_footnote_overpagination-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"96450e5289298cabb03af38437cba16d7258a0fe0e26bf356e944bc18a5293f1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue7382-regression-review/1480000-201900042-chemical-labeling-standards-2020.pdf\u0060, but \u0060pdf/issue7382-regression-review/1480000-201900042-chemical-labeling-standards-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d83262e8677de807d8196e99671613ef9fb32cdc4e417c45014ae246b7367d4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/\uD55C\uAE00\uBB38\uC11C\uD30C\uC77C\uD615\uC2DD_5.0_revision1.3-hancom-official.pdf\u0060, but \u0060pdf/\uD55C\uAE00\uBB38\uC11C\uD30C\uC77C\uD615\uC2DD_5.0_revision1.3-hancom-official.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b874d87e40370e497d79011fe6a9c12176b1717ac308fd3b1c07fc0e6e2556"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue7382-regression-review/outline_navigation_panel_demo-2020.pdf\u0060, but \u0060pdf/issue7382-regression-review/outline_navigation_panel_demo-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b46a0429d2fc98ba0272cdd68f5028bacf300976f327f185746f6fabb0c18f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/78494-virtual-convergence-industry-decree-2020.pdf\u0060, but \u0060pdf/78494-virtual-convergence-industry-decree-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b771a57ac2cd108b28a72aa9e58c4b19c79d29d64af7a62263024ab89e74c9f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue7382-regression-review/outline_navigation_table_cell_number-2020.pdf\u0060, but \u0060pdf/issue7382-regression-review/outline_navigation_table_cell_number-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782203eae8fafffcb0de26f9440829d14dc912aea0d791b48e85dc5a690f9db"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/1480000-201900042-chemical-product-labeling-study-2020.pdf\u0060, but \u0060pdf/1480000-201900042-chemical-product-labeling-study-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f1cf27ff04b8fae670a6dcdfc6284bea6268dcbc242f97abc7cba5c60b8fb8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/rowbreak-problem-pages-hwpx-2020.pdf\u0060, but \u0060pdf/rowbreak-problem-pages-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aaf3de5735caa4e13734c116d5edc529de9ce0c89105eaec57b7b5e521d969"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/1341000-201100013-cyber-university-application-2020.pdf\u0060, but \u0060pdf/1341000-201100013-cyber-university-application-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe2887226a072ad066ecea86263d853955601d93d6b1d1df16ce641aa0cc04"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/task2319/20544835_jinan_apt_form-hwp-2020.pdf\u0060, but \u0060pdf/task2319/20544835_jinan_apt_form-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c6f3e64cea641a714406cf19862375c09424a9d955f5bf48a977bb9dbd63c2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/HWP5-nopassword-123456-hwpx-2024.pdf\u0060, but \u0060pdf/HWP5-nopassword-123456-hwpx-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e15ec1b3015288ef71fa8a78977bd6c64640a685e0fe61080abe80eb17e3fa"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/basic/issue2007_nested_cell_pagination_42065-hwp-2020.pdf\u0060, but \u0060pdf/basic/issue2007_nested_cell_pagination_42065-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d65780497de558bcbb6ce67850efcbdbe5cd6b35ab87afdf409933854450dc7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/task2146/21761835_jeonjik_exemption_table-hwp-2020.pdf\u0060, but \u0060pdf/task2146/21761835_jeonjik_exemption_table-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a0af5978c58986ca53b773129844aa6a7c9b6883989df1e6a5067d4f8ec277"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7445/README.md links to \u0060../../../../pdf/issue3637/regulatory_impact_nested_table_escape-hwpx-2020.pdf\u0060, but \u0060pdf/issue3637/regulatory_impact_nested_table_escape-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7445/README.md"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4df9f324e6ac60c14d4e7194f5fef91a962d4902977f69ee364232b2a35ce7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-extended-script-frame-20261012/README.md links to \u0060../../../../pdf/issue7642-extended-base-script-diagnostic/README.md\u0060, but \u0060pdf/issue7642-extended-base-script-diagnostic/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-extended-script-frame-20261012/README.md"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1374827a7799fcd311a946af156c9c3e6f62c12fd8b2807f49abf0f9f8668663"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-extended-script-frame-20261012/README.md links to \u0060../../../working/task_m100_7642_stage171.md\u0060, but \u0060mydocs/working/task_m100_7642_stage171.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-extended-script-frame-20261012/README.md"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75bfca805762c92ad43575685526d7402b238f0eab9540a5e301ee4adf405ca"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-failed-regression-diagnostics-20261012/README.md links to \u0060../../../working/task_m100_7642_stage144.md\u0060, but \u0060mydocs/working/task_m100_7642_stage144.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-failed-regression-diagnostics-20261012/README.md"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"094dd777c0604474e2b81f302a60cde737dd547ae47b30dce6e2962ea5f12924"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-figure-space-contract-20261012/README.md links to \u0060../../../../pdf/issue7642-figure-space-diagnostic/README.md\u0060, but \u0060pdf/issue7642-figure-space-diagnostic/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-figure-space-contract-20261012/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5470bd2d425be831aa164ff271a095552a40a9029975456ef7cfa010fdf2f1b3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-greek-spelling-20261012/README.md links to \u0060../../../working/task_m100_7642_stage172.md\u0060, but \u0060mydocs/working/task_m100_7642_stage172.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-greek-spelling-20261012/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e58092b685173b57203f6e8c3a4370cb7528aab7009dc7a353cc805ec17ed46"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-greek-symbol-contract-20261012/README.md links to \u0060../../../../pdf/issue7642-extended-base-script-diagnostic/README.md\u0060, but \u0060pdf/issue7642-extended-base-script-diagnostic/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-greek-symbol-contract-20261012/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2ee8c3d20692b7192971e2fe2242763fd1a2797cdc071260ea8e04dc04e268"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-metafile-frame-20261012/README.md links to \u0060../../../../pdf/issue7642-metafile-primitive-diagnostic/README.md\u0060, but \u0060pdf/issue7642-metafile-primitive-diagnostic/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-metafile-frame-20261012/README.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd9966f9ef3762e6d7b702d30275d868daa75cced4b44e3d5e97991c4e6f454"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-metafile-frame-20261012/README.md links to \u0060../../../working/task_m100_7642_stage176.md\u0060, but \u0060mydocs/working/task_m100_7642_stage176.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-metafile-frame-20261012/README.md"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674e2cb8823648d5564ea63182a0f35cf3e01985c2435d83d8a62a1fcaa5315"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-operand-frame-20261013/README.md links to \u0060../../../../pdf/issue7642-operand-frame-diagnostic/README.md\u0060, but \u0060pdf/issue7642-operand-frame-diagnostic/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-operand-frame-20261013/README.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab88d98c02f67d7774682b1fe2bb5ba4e65c2f2df9ffff6dbcc7786357de01bd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-placeholder-tab-20261012/README.md links to \u0060../../../working/task_m100_7642_stage144.md\u0060, but \u0060mydocs/working/task_m100_7642_stage144.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-placeholder-tab-20261012/README.md"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9170401b20db4dbc1f349ec0ff9d551a605a68d26cc1c3f2bf749be38451ad"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-prep-note-frame-20261012/README.md links to \u0060../../../working/task_m100_7642_stage163.md\u0060, but \u0060mydocs/working/task_m100_7642_stage163.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-prep-note-frame-20261012/README.md"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b131f657373995a66bdecb181eb09a46debf97cd1c1e8bc5643b06d33ccff8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-saved-note-axis-20261012/README.md links to \u0060../../../working/task_m100_7642_stage164.md\u0060, but \u0060mydocs/working/task_m100_7642_stage164.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-saved-note-axis-20261012/README.md"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d34b0b277f110a124e0cdbed2b25782aca9edb2ab6474edc041270c2189769"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-wmf-independent-print-20261012/README.md links to \u0060../../../../pdf/issue6469/README.md\u0060, but \u0060pdf/issue6469/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-wmf-independent-print-20261012/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e682fbb5a9194aaa1dd7400d5afba9b10c30a3ca7923bff65dae114bc3da226"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-wmfc-content-20261012/README.md links to \u0060../../../../pdf/issue6469/README.md\u0060, but \u0060pdf/issue6469/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-wmfc-content-20261012/README.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8ef0cf1273475c01cdfc45d9871b954abbf73664d1f9a1b2667b441b2c5b4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642-zero-note-boundary-20261012/README.md links to \u0060../../../working/task_m100_7642_stage143.md\u0060, but \u0060mydocs/working/task_m100_7642_stage143.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642-zero-note-boundary-20261012/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1df2eb59132762a75204adacc9c348043e6863d45591968b45c55430fd89c9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_boxed_digit_backend/README.md links to \u0060../../../working/task_m100_7642_stage439.md\u0060, but \u0060mydocs/working/task_m100_7642_stage439.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_boxed_digit_backend/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5101ec03192b8954d3140caae8c97b10b2ff90555b5694500bcbc2f47031657f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_hwp3_authored_heading/README.md links to \u0060../../../../pdf/issue7642-hwp3-original-print/print-provenance.json\u0060, but \u0060pdf/issue7642-hwp3-original-print/print-provenance.json\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_hwp3_authored_heading/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8920e18d704769d630e75eb6c7418720d7214cdf562e55ec3cf09aa3c0172"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_hwp3_authored_heading/README.md links to \u0060../../../working/task_m100_7642_stage1533.md\u0060, but \u0060mydocs/working/task_m100_7642_stage1533.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_hwp3_authored_heading/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a726d12e392074f60eaefddca2482b6007e8e23b49b255f9f2afd8062e25587"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_prep_completed_table_page/README.md links to \u0060../../../../pdf/issue2006/1790387_prep_final_report-hwpx-2024.pdf\u0060, but \u0060pdf/issue2006/1790387_prep_final_report-hwpx-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_prep_completed_table_page/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a991402707fa3537e4c0114db0f932be8907f8a3647805a0d57083708ec27f9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_prep_completed_table_page/README.md links to \u0060../../../../tests/cases/verified_prep_completed_table_page.rs\u0060, but \u0060tests/cases/verified_prep_completed_table_page.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_prep_completed_table_page/README.md"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b31b0612288ed8c96f2c08d474ab00405a641b7095602c63543e8531c7d2e82"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7642_prep_completed_table_page/README.md links to \u0060../../../working/task_m100_7642_stage1577.md\u0060, but \u0060mydocs/working/task_m100_7642_stage1577.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7642_prep_completed_table_page/README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee42a5aeb0c8995bf100407c105877a838bc1daa785bab2e012fc65d16b1938c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7756/README.md links to \u0060../../../../pdf/\uBCF5\uD559\uC6D0\uC11C-hwp-2020.pdf\u0060, but \u0060pdf/\uBCF5\uD559\uC6D0\uC11C-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7756/README.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bfbcf3d5add0be98cb932feaadd68e437b19e0b97c008b15e3a76132dfdc72"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7902-final-20261016/README.md links to \u0060../../../working/task_m100_7902_stage3.md#\uBB38\uC11C\uBCC4-\uC644\uB8CC-\uD398\uC774\uC9C0\uC758-px-\uD68C\uADC0\u0060, but \u0060mydocs/working/task_m100_7902_stage3.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7902-final-20261016/README.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a800817c208b07bdda707d91fe3056c11e30be3e023202b03a14fc57ecc871"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7902-final-20261016/README.md links to \u0060../../../working/task_m100_7902_stage11.md\u0060, but \u0060mydocs/working/task_m100_7902_stage11.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7902-final-20261016/README.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4f9f178dbb519cfc007f31a217e73ff989f1a453800d640d6957fb1c57f4d4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7949_7950_20261017/README.md links to \u0060../../../../tests/cases/issue_7950_pdf_paint.rs\u0060, but \u0060tests/cases/issue_7950_pdf_paint.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7949_7950_20261017/README.md"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6d831e8696618d308b01d4d72352a2fe21974842a396b31f0e68d514b1f2e6"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7949_7950_20261017/README.md links to \u0060../../../working/task_m100_7949_stage7.md\u0060, but \u0060mydocs/working/task_m100_7949_stage7.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7949_7950_20261017/README.md"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41e5850d0bfda36e72763d42c8120a8a41aaf62a8fa422dad6f6757ac2d951a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7955/README.md links to \u0060../../../../tests/fixtures/issue_7047/housing-lease-standard-form.hwp\u0060, but \u0060tests/fixtures/issue_7047/housing-lease-standard-form.hwp\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7955/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b924db7b44e69fe6725246106f3ba7acdcdfd8f34d7f8a1674eedbd9538cd772"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue7955/README.md links to \u0060../../../../pdf/housing-lease-standard-form-2020.pdf\u0060, but \u0060pdf/housing-lease-standard-form-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue7955/README.md"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9968398ea5aa75ee849afef4aba59df498981a3f8b14d38e025ac263fccaf07b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_1891_legacy_hwpx_current_frame/README.md links to \u0060../../../../pdf/issue1891/80168_regulatory_analysis-hwpx-2020.pdf\u0060, but \u0060pdf/issue1891/80168_regulatory_analysis-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_1891_legacy_hwpx_current_frame/README.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ad0dab714b65e31aec5ca3b59834d2887c00a465a71f67bf8d2458ccb1ce3c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_1891_legacy_hwpx_current_frame/README.md links to \u0060../../../../tests/cases/issue_1891_legacy_hwpx_current_frame.rs\u0060, but \u0060tests/cases/issue_1891_legacy_hwpx_current_frame.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_1891_legacy_hwpx_current_frame/README.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdf8c275acd29a681aa618a5ff9b9e917437ae109f45bb2970449650acfc2c2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_536_seo_rii_20261017/README.md links to \u0060../../../working/task_m100_536_integration_review_stage8.md\u0060, but \u0060mydocs/working/task_m100_536_integration_review_stage8.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_536_seo_rii_20261017/README.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2d3375d204b2a108ed3e6887a0fea67764143936b81c205edc349ab42faa27"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_536_seo_rii_20261017/README.md links to \u0060../../../working/task_m100_536_integration_review_stage7.md\u0060, but \u0060mydocs/working/task_m100_536_integration_review_stage7.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_536_seo_rii_20261017/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2b1fd9b847a1fca0a22081a2c95e717c1b38bc2af1fb91cd2f47b281b4c40e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_536_seo_rii_20261017/README.md links to \u0060../../../../pdf/issue7751/README.md\u0060, but \u0060pdf/issue7751/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_536_seo_rii_20261017/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c7ddca1e21739a4df9e9d31b2647db3786c1fbdf475613700c3856aa188f7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_5790_charoverlap/README.md links to \u0060../../../../pdf/issue5790_charoverlap/issue1880_takeplace_oracle_p13-2020.pdf\u0060, but \u0060pdf/issue5790_charoverlap/issue1880_takeplace_oracle_p13-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_5790_charoverlap/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"49580ac3c563dd0db02a4b8edfc1e2632ffd8ed800c05b3f8a01f24db8602692"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset--1200-picture-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset--1200-picture-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c313c7146907c14c651b64ea0c13b14c5b17b8a4ccee01b2e7e3dad4368a2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-0-picture-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-0-picture-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"514107331b132412ac6bd25959c1836f07c460dd04b86a21b43df2fb275ca3e9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-1200-picture-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-1200-picture-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed67edfa39ecd784c53f2031e592879f61797741f3da5221bde484c4b2c04b90"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-2831-picture-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-2831-picture-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"25778d15f45ddad5f662caf95793c12f53fca47efb1ea823a39902924d125df0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-1200-table-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-1200-table-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0068962f9fb9cf50288b7329071e216dba0b17bd0cf2685424aee245852706"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-3518-picture-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-3518-picture-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e45bbc2946977e23a9c52aa8fae67fb5f91bc57dfb0035f30aae20f01763f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-60000-offset-3518-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-60000-offset-3518-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0355698ffaa5d425c15ca6673b5cc982023cb1a5c9df36e0e48f3e81bf0a87f7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-3518-table-first-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-3518-table-first-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"477f8338a3d6d400fc3d9191dc478ac0165e4372dce3b105cda784f3421884e2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-63000-offset-3518-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-63000-offset-3518-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9fb083625ba63357df6b44d6158250edbf3efd183b6d3229ea3ce7c2ffa5a7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-62000-offset-3518-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-62000-offset-3518-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"434b830e3def0ab4d15fbbda53a201ba33f45cd1b01a661aea426a14ab4a9d9b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-65000-offset-3518-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-65000-offset-3518-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f142ac73e56fc32e82d770381ee79a98102c555bd04ebdbccb95946af631c1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-68200-offset-3518-coherent-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-68200-offset-3518-coherent-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f53c1a767a43178972469f90d61f3703267121a7703b7cbd613f4464834082c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/original-slice-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/original-slice-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6f4de5ac008ace7b64caceb87ef8bd9a72f9986942ee2f65af7d2a7902625"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/full-source-156483831-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/full-source-156483831-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4ec96e6c3b853d0afddc0eb247ef15ea4a2127fa1339f4d6ab80dae0a98809"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-0-picture-first-coherent-successor-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-0-picture-first-coherent-successor-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb951737c13028c8691586552c022afcf70d40f028469b045533bfd439f4a8d1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/offset-3518-table-first-coherent-successor-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/offset-3518-table-first-coherent-successor-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a9a212ac7c63314e0c4290f2e70f7a85e9c59031e9d67d5590e241bece67dd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-60000-offset-3518-coherent-successor-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-60000-offset-3518-coherent-successor-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580a3ae39f903d1984c301cb7384789c53db8c2df1b7881dd81d7bb506e1b39"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../pdf/issue6133-mixed-host-line/picture-height-68200-offset-3518-coherent-successor-2020.pdf\u0060, but \u0060pdf/issue6133-mixed-host-line/picture-height-68200-offset-3518-coherent-successor-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34734af6ca8ca1c9a423bdcad1e3516d7a43c0563b582b0e3bb2e7ae55b6198"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md links to \u0060../../../../tests/cases/verified_mixed_float_tac_host_line.rs\u0060, but \u0060tests/cases/verified_mixed_float_tac_host_line.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_6133_mixed_host_line_20261025/README.md"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"17135638789e09fedc8ee6809084d12f22e5fe7c223b8e46c253f83d46fb333a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7280_typeset_refactor/README.md links to \u0060../../../working/task_m100_7280_stage58.md\u0060, but \u0060mydocs/working/task_m100_7280_stage58.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7280_typeset_refactor/README.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296ab89a0292b2ad9998f11f5bb131a07832a965504bff73786a34ae8d5136b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7280_typeset_refactor/README.md links to \u0060../../../report/task_m100_7280_report.md\u0060, but \u0060mydocs/report/task_m100_7280_report.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7280_typeset_refactor/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1d3e6fd8eac84410b7ece73b203ab00a1dad40b87f3065d6afe831e26b9a6e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7280_typeset_refactor/README.md links to \u0060../../../../pdf/issue5809/156518601_p1_square_host-hwpx-2020.pdf\u0060, but \u0060pdf/issue5809/156518601_p1_square_host-hwpx-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7280_typeset_refactor/README.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c620b0f6f1d1fda1c7aaebf25502de1a5da031853e9fa1b831e177e195cd7e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7280_typeset_refactor/README.md links to \u0060../../../../pdf/1480000-201900042-chemical-product-labeling-study-2020.pdf\u0060, but \u0060pdf/1480000-201900042-chemical-product-labeling-study-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7280_typeset_refactor/README.md"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c87a2cea39d1ac74b1ccc8d89a435c37e300dcfb7af9f22ffe538043575743d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7688_renderer_backends/README.md links to \u0060../../../working/task_m100_7688_stage7.md\u0060, but \u0060mydocs/working/task_m100_7688_stage7.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7688_renderer_backends/README.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d21527ba14be68970cb9084150977665858cb76a398a2ae3d1c73615c0ab4b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7688_renderer_backends/README.md links to \u0060../../../report/task_m100_7688_report.md\u0060, but \u0060mydocs/report/task_m100_7688_report.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7688_renderer_backends/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b0492d1f3d38b1037425172a74caead0d1fbe2f0fa33a8b78f43510bf3465"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7688_renderer_backends/README.md links to \u0060../../../../pdf/issue7333/aaaaaa-2020.pdf\u0060, but \u0060pdf/issue7333/aaaaaa-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7688_renderer_backends/README.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19e56fea3cff1a30a02f9df0e09fc04534ba8f7da22f7b4580c8d164ed91d3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7710/README.md links to \u0060../../../../pdf/field-01-hwp-2020.pdf\u0060, but \u0060pdf/field-01-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7710/README.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0d4042b93d6031c79aa14bfba6923776d3fc51df10c15e39cf3ed1132da7f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_7819_caret_axis/README.md links to \u0060../../../../tests/fixtures/char_overlap_caret_axis/README.md\u0060, but \u0060tests/fixtures/char_overlap_caret_axis/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_7819_caret_axis/README.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af2b0a03edeb037df3ebc9f7b4fd6b3d28b8f0e75d9782285e149452826cc1e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8105_complete_cell_closing_slot/README.md links to \u0060../../../../pdf/issue1880/issue1880_takeplace_host_before-2024.pdf\u0060, but \u0060pdf/issue1880/issue1880_takeplace_host_before-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8105_complete_cell_closing_slot/README.md"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c38e9032d31c2ed8fc06253a3734bed0b89e208879312fe6facd9c9634d14d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8105_complete_cell_closing_slot/README.md links to \u0060../../../../tests/cases/issue_8105_complete_cell_closing_slot.rs\u0060, but \u0060tests/cases/issue_8105_complete_cell_closing_slot.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8105_complete_cell_closing_slot/README.md"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0935fe1c27b88a910d29b684a69381f02161507205dd4bcbeeedb11e5d192ec0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8150_kitty/README.md links to \u0060../../../report/task_m100_8150_report.md\u0060, but \u0060mydocs/report/task_m100_8150_report.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8150_kitty/README.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdee6997ed0dabe307b49301ce320f583f086b21d61041740f60dbe41397c74"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8150_kitty/README.md links to \u0060../../../working/task_m100_8150_stage3.md\u0060, but \u0060mydocs/working/task_m100_8150_stage3.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8150_kitty/README.md"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4460fd871c3d7ee279f595108bedf27b27b562e96007e968f59eb13722624771"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8183/README.md links to \u0060../../../../pdf/issue8183/README.md\u0060, but \u0060pdf/issue8183/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8183/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b0c4402053609bc0e862c60f450ec71cae36e101c227ebb83bb404f3935c4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8183/README.md links to \u0060../../../working/task_m100_8183_stage3.md\u0060, but \u0060mydocs/working/task_m100_8183_stage3.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8183/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c08734bc696d8c026ed6651441953eaef59323ac4cc0d1b58b79d89e7932aba"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8266/README.md links to \u0060../../../../tests/fixtures/inline-control-move/\u0060, but \u0060tests/fixtures/inline-control-move\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8266/README.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f762471fe119d8af976453aad8bb16b32abb1e67bf96d4a361851949d6488cb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8266/README.md links to \u0060../../../../pdf/issue_8266/\u0060, but \u0060pdf/issue_8266\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8266/README.md"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa3d53e7714527df97112ed5d402a84c0f316630d343bd699d132f2bf93f6ce"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8266/README.md links to \u0060../../../../tests/cases/valid_inline_move_fixture_contract.rs\u0060, but \u0060tests/cases/valid_inline_move_fixture_contract.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8266/README.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"525453f49265313d919af02b4b7688201edc5f64c0448d9a21e29a8be2c92bf0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8598/README.md links to \u0060../../../../pdf/2022\uB144%20\uAD6D\uB9BD\uAD6D\uC5B4\uC6D0%20\uC5C5\uBB34\uACC4\uD68D-hwp-2020.pdf\u0060, but \u0060pdf/2022\uB144 \uAD6D\uB9BD\uAD6D\uC5B4\uC6D0 \uC5C5\uBB34\uACC4\uD68D-hwp-2020.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8598/README.md"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fab793b62a145f5711f8b0ff904b1cf5660ef21bde64686160167d32eec5cd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8598/README.md links to \u0060../../../../pdf/2022\uB144%20\uAD6D\uB9BD\uAD6D\uC5B4\uC6D0%20\uC5C5\uBB34\uACC4\uD68D-2022.pdf\u0060, but \u0060pdf/2022\uB144 \uAD6D\uB9BD\uAD6D\uC5B4\uC6D0 \uC5C5\uBB34\uACC4\uD68D-2022.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8598/README.md"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7281d134afe6e63bc9290a8c93b6441a98f0008799b63916f1a06dc896ca92"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8598/README.md links to \u0060../../../working/task_m100_713_clip_contract_revalidation.md\u0060, but \u0060mydocs/working/task_m100_713_clip_contract_revalidation.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8598/README.md"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c925944d0c1cb560f25cd189c716ea0302759b324a89c09b8f6c53bb7249bbfd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../../pdf/issue8687/font_list_name_fallback.hwpx\u0060, but \u0060pdf/issue8687/font_list_name_fallback.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d06d7c9fb987add1953006f74ab68ebaff963a831c2344db709d3a47a53bd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../../pdf/issue8687/font_list_name_fallback-2024.pdf\u0060, but \u0060pdf/issue8687/font_list_name_fallback-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"817f2a4052f6ef31ebd50a3f6f48347a6ecbf690670f42bd7dfb1f44a3bea65b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../../pdf/issue8687/font_list_name_used_fallback.hwpx\u0060, but \u0060pdf/issue8687/font_list_name_used_fallback.hwpx\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1344a1081b555b2a3a5f37ffeaa9b838a79c4bbf09ba68367aeb93541ce0fc70"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../../pdf/issue8687/font_list_name_used_fallback-2024.pdf\u0060, but \u0060pdf/issue8687/font_list_name_used_fallback-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e53cc985efc518f216f087c5502dbab95b1d0f67b75d556ed87f988708176"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../../pdf/pblsketch_review_20261030/header-footer-paper-frame-2024.pdf\u0060, but \u0060pdf/pblsketch_review_20261030/header-footer-paper-frame-2024.pdf\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d8c047a916c0ef640c09f83a21037424b5271bd9e7c2fa5c18fdbb9099ce5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: mydocs/pr/assets/issue_8687/README.md links to \u0060../../../report/task_m100_8687_report.md\u0060, but \u0060mydocs/report/task_m100_8687_report.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue_8687/README.md"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"df029f4d48b0bb6be743a831ae6809832e174675ebb5d6cdff6482153cf80942"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 3/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060rhwp-desk\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/cdp_screenshot.cjs\u0060 reports through \u0060console.*\u0060 at line 7 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2c1ab8fcc0eaf3c7b9ab846af8a6fd6b3133fcaf6142e0e14d237cd5331903"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/cdp_screenshot.cjs\u0060 reports through \u0060console.*\u0060 at line 8 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"193cd50eabc145e34939398a1ca29a696b5d9489539995381c8afaf99fdf151d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/cdp_screenshot.cjs\u0060 reports through \u0060console.*\u0060 at line 11 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6794529880505bd6091658e59678cad132268b90a26234cc6ee75bc12512654"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/cdp_screenshot.cjs\u0060 reports through \u0060console.*\u0060 at line 18 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"913f8621eba57491e29ef8008d7ab0c05734c8df874579a8b4826f8acc15a057"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/cdp_screenshot.cjs\u0060 reports through \u0060console.*\u0060 at line 20 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bfed332508f343c0c330e3e5bfca96a522ae403b508195b0d653e1d647747e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 589 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"daec884f2837556c77ba37c0d7eac3c9c7d2b2a37043f22da41143ac356d3e66"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 605 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9acb688ef245237fa14953fff28d92714919caff5d3279816307f753c7f89c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 623 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0371a84dc2379321d150622c233659c14bda1c93f58bb8bfa715b6b8ebc53d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 644 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"167661c4e12344bd9bf9e38877ab472708676d66ef1ebafd06a5a7343f36c944"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 679 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4c0f8574126b5ac0061cd1420f7d6ecba08e902d8c85cf4baa11975b6982e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 873 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac32b4b36afb591b3bb3dbf4098ec7264844422af19475d1de7fd6766e0a84"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/view/canvaskit-renderer.ts\u0060 reports through \u0060console.*\u0060 at line 935 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7dade25480a4ce72324d3e8472d24af8cb6dab897da4fa35fd2b6208911f4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ui/dialog-apply.ts\u0060 reports through \u0060console.*\u0060 at line 40 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/dialog-apply.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a792c3dd4cd03f2b1edbb247929c5a6ddf3778aa41a87a6bce8241d9858cf04"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ui/dialog-apply.ts\u0060 reports through \u0060console.*\u0060 at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/dialog-apply.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5809380fa610a8dae4ea0925e812d263f857d0f3d1051602075e4bf9f92818"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/recent/recent-open.ts\u0060 reports through \u0060console.*\u0060 at line 70 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/recent/recent-open.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b805555e6feaec6a2f77e39dfd7a41aeff51cf8c700c3c67dc4cc12b265037c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/plugin/host.ts\u0060 reports through \u0060console.*\u0060 at line 313 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7cd20c238917003f29635e82e26ddc0171b0fb75bc606c4aea780568954534"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/plugin/host.ts\u0060 reports through \u0060console.*\u0060 at line 399 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5374eaba513276af3ffaf622e9c9acfb8e2762b30c128495175a3be8d057213c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/plugin/host.ts\u0060 reports through \u0060console.*\u0060 at line 425 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0b808785e87d3d3aef5c4c41790347b837d236686179357af2638f6977eceb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/action.ts\u0060 reports through \u0060console.*\u0060 at line 89 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/action.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1f1308145d430e2fd56300cbcbdf1780ff5f12be092305ef05f8a86a1f42fa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/action.ts\u0060 reports through \u0060console.*\u0060 at line 103 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/action.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c884447c64c14ab910f7ed69fedd660bc4b285ca095636a683f51328fb94ba8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/action.ts\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/action.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe9a3c98218b06242b9d473231562df7f8692c5afba9fec4429cd8c80d3f392"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/clipboard.ts\u0060 reports through \u0060console.*\u0060 at line 16 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff01bc254f3cea65b6b62528aa84772e2d81c3dcc80525966b8750e19274968"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/clipboard.ts\u0060 reports through \u0060console.*\u0060 at line 29 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d738a835d44d485385d8e45ebe30259b138e8f36a7f4581b0aeeaaa6bde8f3f3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/clipboard.ts\u0060 reports through \u0060console.*\u0060 at line 45 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed918e9e89af24a913250b1b49e257bc3fcec674a5f537d2ce3ede69129ac6c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/clipboard.ts\u0060 reports through \u0060console.*\u0060 at line 57 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c495d6b3e5de10d064e2d6adf0875ac406ef8accf1a01d986622cfe09fed2e7d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/format.ts\u0060 reports through \u0060console.*\u0060 at line 102 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/format.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7e9b3d6781f22957d7d88970d5d2f9c709ab5c092caf01a9de77e1464943b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/format.ts\u0060 reports through \u0060console.*\u0060 at line 117 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/format.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336b204fe8070047e4c78813019fc084ebaaa6b3725ff8f49324722190ea2aa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/format.ts\u0060 reports through \u0060console.*\u0060 at line 133 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/format.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"afceea359f75146666ed2585dae5b3fc57de63e971d558400f912c0f5ed550ee"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/navigate.ts\u0060 reports through \u0060console.*\u0060 at line 65 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/navigate.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d01c35333a836fd808a8d683d6f6dcb89723780fc1e065fd696154d1aa5b759"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/page.ts\u0060 reports through \u0060console.*\u0060 at line 43 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc705850977d8d0c8452114bcaff9e95fe508efb656d22190bb1d829faa2bc5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/page.ts\u0060 reports through \u0060console.*\u0060 at line 71 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938b900556f433217319534641c145b16cba3089674e1fd4a856d1b36765a7d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/page.ts\u0060 reports through \u0060console.*\u0060 at line 78 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5fe4e84e7a781a561cbea93ec079cb30147568e6139419d51a1c8613e0aa36"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/page.ts\u0060 reports through \u0060console.*\u0060 at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d5d86ad5496e4fa834c63abdc8d97e078aea60890c19763adfa0ceeb8d420"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/page.ts\u0060 reports through \u0060console.*\u0060 at line 88 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af25fc66a14e18d1906f7713651725f38f175150aec13de9ea337522ae2f638"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table-edit.ts\u0060 reports through \u0060console.*\u0060 at line 31 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"571744254bd8ddc4a93c9fba9b3c42ae96b662fb8dbd982b784b7a3578049d1d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table-edit.ts\u0060 reports through \u0060console.*\u0060 at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f5ba475adb9887907a1990489574f62d53fc666bb239d1be2bb523c29639fb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table-edit.ts\u0060 reports through \u0060console.*\u0060 at line 68 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ecde0e5b2429f34e1786fe63297cf94ae7799f5802d914a82ddd33d131545"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table-edit.ts\u0060 reports through \u0060console.*\u0060 at line 88 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"abef4f5801e1774d9d93dc540c8c70e13f0e97303d0142e7a15bfa84ed0a946a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table-edit.ts\u0060 reports through \u0060console.*\u0060 at line 98 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"edca94a828c0a6ec926d208c9095f3aa41ad33cd2ef43076f86a3804ff03cc96"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table.ts\u0060 reports through \u0060console.*\u0060 at line 37 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c2f423f10a1c384c90c12afbfb8dcd6151fbe3d43c86741d1d1643cfebfeb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table.ts\u0060 reports through \u0060console.*\u0060 at line 42 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"89464998eaa2317d4235653c75af35c6e8363ed07f6a27b2d35b61a26bda6ab6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/table.ts\u0060 reports through \u0060console.*\u0060 at line 49 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe09cf1d67ceb8d1f585872b07190afc2bbb9d22e15f0fa46b26e7153fbf8d4d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/text.ts\u0060 reports through \u0060console.*\u0060 at line 23 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a00df26a5009d481b5318425d7cb2b6275041262e7ea18d8cf018b1121c8ddd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/text.ts\u0060 reports through \u0060console.*\u0060 at line 40 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"51afd6b719856e6b9a5053847ffecbdfea9a5bf36c185029f687b2d39f1ebf9e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/text.ts\u0060 reports through \u0060console.*\u0060 at line 57 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634919fe40febdedf93d5326c24bbf520e5a802fedcae8681ec4dd6c7c13f98"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/hwpctl/actions/text.ts\u0060 reports through \u0060console.*\u0060 at line 74 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c86ad3e0b6f94e1b39a34b0bab827740c74759bd4f7125163bdc3ce2a819609"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/command.ts\u0060 reports through \u0060console.*\u0060 at line 2710 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abd26ff45e77cee6cd866b325aa497674d3f333b1115116ed9c1702359f2bde"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 933 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce54a222a2f5742cadb07f4ee7f733e12dad4f008bdf66717b71995e61079a3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 964 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d037ba9b0bb1746203ff4941c7510b3d91847275872f63b560bc202e412ff3db"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 988 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6c5eb77423e876a4b3307550535e5c51d6f12df1b7a86079113160f0c5fcc5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1064 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"4325b9e2179d3e7f420f48a70a15541b868e25bbd3e380f61004f04fba4e944c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1110 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22f1e2d59103ce48ecae963d650c5504b026ce577aba8214c677efe2c6ef40"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1152 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f07d2603f1d70e2b47f052b3b4d1732bcb7290e3ba00e5601c4e27aca93692"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1197 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f15b9f1da39c8b9323bb03e25f596f8642a8687acd7f113e9d16d42e2555c8f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1243 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b3bc2ec215227971c17503a791ab6eccc90237ead6b32b969677e83f14d66e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1302 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd1e6d1e8e558ac9d37e64ea3fb9621368222e30485749ec3976ef65e58b62f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1330 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"09737bb15ee123539bc3e62c7a7cec72e5d0865eb1d9e21d366c7e951750f256"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1422 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93a3c886188a3ddf2fbcc92715fa48e320ba2f4b4de7aa0e0bbaa8a51b1dda"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1511 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a112466f01b9d38f07d07b5fd9e7aabc9e14813233dad1746ea79a5abb633925"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1523 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"464830d0c544ee6c1d231333c5db5633ab252ecaf723f04fd3fbf978c4b0eaf5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1531 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"053c481a52e966dbf235f47df15207387aee0c0c05fd692a98b40ac5366a201a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1567 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"0170ea9dd2412acb24bd945c28b2f3f9b958a43aa1dc502b510678ae73bac9c7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 1748 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9009d309e9161678bc455be3732881b7dbb0dd56415c82c071ad3bc39dac30"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 2278 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5cbb791fda61069c609b870f22e06918c89d2bbf5c9a2621e102144cd8359f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 2350 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"478abaef5b080c28659c5eeb6e1ff1716a7759d2823f397b306f995f94914914"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 2379 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac677062307a32dc5ccbac8124b92b57842964e5d88d109d4dbecd0f72cc212"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/cursor.ts\u0060 reports through \u0060console.*\u0060 at line 2405 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2e460896f3aaf01fc5b222817c5bdd35f43fbb4ec9a122ef7e86085c66b15a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/input-handler-text.ts\u0060 reports through \u0060console.*\u0060 at line 613 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93ae8ae68057d12b60452838b5509d5c28fe39c28700bf1af46d65977bb715"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/input-handler-text.ts\u0060 reports through \u0060console.*\u0060 at line 623 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcea566be733b0351e0f97e157781d569f7098d323e116ed1d585dfdd97f618"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/input-handler-text.ts\u0060 reports through \u0060console.*\u0060 at line 644 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"be13ead11dd2e9ed069566884651fda395c1c4b5861b17bc3eb90f585cc6eac4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/input-handler-text.ts\u0060 reports through \u0060console.*\u0060 at line 774 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea25d6edabb8321c9016d791784f401c9db25b3fd946b3b30eb33db7ee160b4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/engine/input-handler-text.ts\u0060 reports through \u0060console.*\u0060 at line 793 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf25e32532c27769ab44c0d246f4fc81a2a1fe222939c3ddc814e9f34a1ce0f8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/document-agent/controller.ts\u0060 reports through \u0060console.*\u0060 at line 887 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f826351e03687a2e0d798189d7aeded1a376bdf6a9abc033f01386ada7508d4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/canvas-metric-session.ts\u0060 reports through \u0060console.*\u0060 at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/canvas-metric-session.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0bc3fdc22f056786ca07a69d180f80504b48811930ec83b838aa0a766be4fc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/command-error.ts\u0060 reports through \u0060console.*\u0060 at line 119 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e7f708ea2cf7ed2296daa312c0d3c9e3a6b6016a7cf9d82b5ae4f4144780f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/event-bus.ts\u0060 reports through \u0060console.*\u0060 at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/event-bus.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2334a63071c7773caf5fbae34c8b8951aa3a993a25ff06b78b2fbe4a7b57632"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/export-content-loss.ts\u0060 reports through \u0060console.*\u0060 at line 164 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/export-content-loss.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9387c3505160c9cb86c4b0a095c64c53b3e58f47b01c5a05a5054ad3e71007"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/extension-settings.ts\u0060 reports through \u0060console.*\u0060 at line 123 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/extension-settings.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef77883a7142e84205973c062909551868c68f436964f5931dd8ac670f88c1e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/host-font-provider.ts\u0060 reports through \u0060console.*\u0060 at line 117 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/host-font-provider.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef6b11c156293025b16d0a2d479c6336c5789b109fc1caf737349bb06598eac"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/local-fonts.ts\u0060 reports through \u0060console.*\u0060 at line 984 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f70951d610e5728ce86d5f00605f39bca0ca7d526e2bc109ea5eabda99e5a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/local-fonts.ts\u0060 reports through \u0060console.*\u0060 at line 1116 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab71a6ade4348259a9519d359b1324759bcd1f79e33b9f4d63acc117f8c1ecb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 69 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b16f127209375408d1959397065d04a59f147d3f91270e02d5e2c50a031e97"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 75 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef995335c1abe52eabfa0e9120bf38ed45f9d151128dc858cfc769dc96151a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 77 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ba9c86490dee0955877441892253af392cf9b77e670a6114b9f6ac29b08a57"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 105 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624bf97a415ca7b79a108c7e2c830b3c80fbfe5b7f15384345d16abbe1da086"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 114 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8375219aa64e327de30bf0b91a6be2771b59f51027c4f0fb20c47c2e271ee"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 147 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae805637a2121a9ac3fcaa8479334e086e1cf0b832d27c1c7058d67bd2ce2ded"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 156 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2772b4e364387b354e6e99fa48511d1053f758382b2ea00b9e4d79b4c8d2ffc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/core/rhwp-dev.ts\u0060 reports through \u0060console.*\u0060 at line 243 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaeb93a9ce6f075bb3840f151f4ce1aca84c59a879696d2f7afe352ff876d0d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/dispatcher.ts\u0060 reports through \u0060console.*\u0060 at line 55 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/dispatcher.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d5dfb3cfdb95a19778df584eec47addba4a743b32728761fb18ca057146d9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/dispatcher.ts\u0060 reports through \u0060console.*\u0060 at line 74 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/dispatcher.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab344d334290b3180988a8110e1e65de28596ee6f7236660f01279e56374dde"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/file-open-picker.ts\u0060 reports through \u0060console.*\u0060 at line 66 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/file-open-picker.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1458ce7f4c2369eae4628ccee114901cd1766432e680a4dfd39fa68450f1d65"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/edit.ts\u0060 reports through \u0060console.*\u0060 at line 223 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/edit.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21fee17fd410fad4cd1bfed56e26a48b6bc735570bda938c648e964945304a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/edit.ts\u0060 reports through \u0060console.*\u0060 at line 226 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/edit.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc1812e8f57c2eec74e5179cdf4dbc3cca9db4d67af97940fd8e735b67ddeb3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/edit.ts\u0060 reports through \u0060console.*\u0060 at line 237 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/edit.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4bfe009f9a75900d9807f76c74a717293a307daec6153f69c621069e7e1817"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/edit.ts\u0060 reports through \u0060console.*\u0060 at line 255 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/edit.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e370a6c21c2f29c87ae0a9860fb19b6cfc3d617a41dcc8e7ec6f1dfa5563632"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 129 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b8b65749f4898f04c7315bfcf66cd2beb04e050b001bec68444184c8cf8cb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 198 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e911f1f6480a52dffd4c62dda0f8f8d36169803dc22da4d336e4d5943f22202"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 208 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56ee3e85b181d7e076edf44c3f5dc4b22e4aa5398055515f9a2b4eb45ef7726"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 382 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c433608be694361d2744478b59161b21617d7befa2cc62e684c852a9927334e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 384 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd607332f532ba03f52384422a04d8367c895800bc5b9a2214ccd6ea28f11da5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 411 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d216b8046bebfdca52747b79c8cbec98f220cbf626025a24cab24baa832b99"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 473 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"70129c051cecb2dfddebb4394dbe34ea58a4a34a3542bdc5fb044a03850ca1e1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 505 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9177ad049ee92dd704c27aeb51bd9b711ab814d0e24b98217dbf45fb0f15b4d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 536 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e7cec44d401400aea1a0c8a485b5433643a1f6f0162a07836d6d886a47149d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 565 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"61214abd10d42413a31acbd1b2b68381b10454a977c205d0ed1adc699ca25d91"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 587 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61120bcfd8a07c2ec894672bafb06aae9da564256e59ef9f35ed32eca318c2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/page.ts\u0060 reports through \u0060console.*\u0060 at line 608 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"99051a33fb866fcfbc9e7ad74a446b9211923cf0e74a84cd8911e0f5011d9910"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 41 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4b7dcb2a5319908e5ea60df783417a7270922211d61274343be918daf3ad73"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecc2cf454f54cb4af576f0ef2ae7ed831986e395ee73a40da8f6d7d1d797942"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 844 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"e162e34b97001e7a959e7d732b1bf6ba734b210a09e7e629dcbbb0972de48819"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 1057 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"725f649ce05c498aff7d1d7a17efef6424c2c3ff8f12b323d4a4d66671b0dea8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 1102 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f38cc7bdf277b9c19415433b7e97d0912e34d186f8c902bc0f3b083c8f45a41"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/command/commands/table.ts\u0060 reports through \u0060console.*\u0060 at line 1147 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"08901df236ab9a57938a4396c2ef3dd6c1d50ee38fa5f0d29657a58cdde0608d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ai/ai-context.ts\u0060 reports through \u0060console.*\u0060 at line 52 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/ai-context.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98d764e1a43bc133436a7643e5d4c71a5e47a1720fe7f2cde69e5f039f3ec0a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ai/agent/chat-controller.ts\u0060 reports through \u0060console.*\u0060 at line 162 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5277eee4ddab0f2a9dbd121a1e5e8fa928c9ba9ca83d39d1bc8b640c94a8c5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ai/agent/chat-controller.ts\u0060 reports through \u0060console.*\u0060 at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"840d8a8ec8281e6fa9627c735d6369b390d5fe6f6c848b6587a95ef39b6624e6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rhwp-studio/src/ai/agent/chat-controller.ts\u0060 reports through \u0060console.*\u0060 at line 227 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7883133dcb01dccd80c35866afb83b6641d758ea5cb1ae78f48e8a11fcc38e0"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf68ee1ea2969cbbdae4336ca738b5320c565628ea6ee894219d523831dd0f17"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cf9f649050f253ca219245bd478659b21c0d8ae489509ceb944051937e6479"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ea0242cff5594e08bcd88d9191d7148cf39cf6c14de8aba003a0805520706"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33350638bc2a20f45c0f8135ddcad54b2a73e3b5abd0f987c046e4391fabd56"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4394b163c11cd1ba72ca4260a5ed3b9b2c6a48d2cb02ecfe1eb22bdcf4f2af8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca149ef1d018fea125d0f85765967b7f22fda7a57bc2240bf28d3d43d89965f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd2670a1e33b67395ff7010ae425a5f4ef7077283fc1817ed44b8e97eabd8e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff778767049211ff540f05609da209e9b3f3cb9d4fcaedf7493dbd4ef737a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35473593dc66164ecbbb97334616de48da0f9cce4e778aa214e7597e43ad020"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f74f016ebf3f5b7b559ed583f05a36c164e85e2eb84eed3788a4e45ca30eb31"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060hash\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd5259bc3d0e29b180df218c1cebd8fdfc3e24bd12671e947359a413fed78a4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0536aa3b693ab2ef5020c690fdfa8fd84ba89f2e49c924aba7ce1e2b260faf65"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to provider.sendExportSvg\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/extension.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b903bddd1006092a5abd75bf194f06d899e2fa7e29adb50969543f0467c67e1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to provider.sendDebugOverlay\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/extension.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b276966d7f9d9eba22357431b6cfe67d6ad5af5b899a3cc48071266cd6080f30"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060cmdDumpParagraph\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/extension.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06936ceca21a6c51327ad85ae0098bea82c3b4dbc1ab9ed80e1382b30ba600"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to webview.onDidReceiveMessage\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4810f4238add3d92571175b0e29910e82ef8a4e4b0eafb52982be7c75425507e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060collectPostmergeDurations\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf896c2f7b1aebcd7fe69d504d3232414f0a5fab486b54c3672c1bca760ba36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060collectPostmergeDurations\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3d4f7068db10d2325e689ea200d5cff3836695a7c2d92df4c504608c5bacea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc8ddec2e443a99ac4314a90522dfc85d343e2768a6ed9328edd3a5d8086445"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d78ffa791a8312740fe36096bed1bcaa0a3788230f0447f1e665555160c64e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d0cd3af25f4c53e3d94527c6b727a0b87bdfc5359b64ff92d9a1d4e4c78605"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd03df424ff2259b1fcd72c2995aa5daa6192d5e5fa1a75815db95d5cba64c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"62377a002d9f9b2305e87b7b67cfabbddaf83ab00bf77e36d3918a587abe6ffa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a56a5a63380737364a6af860416802dc714ca8a7f1f6c0c7d7e57695cce3e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f456bee6b8033398ec17035dd00bc52db4ef59665e88df868e8a9f79ec5b88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23615280ecda75cc13ab326dd3604ed86c341e0393bc240ea53492618058163"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da249eb1437b57560a85983c3e01a0dcac367f6d2916af69265142ac17e361"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d9ab49b886a4f640d0aabe374db0e44156a82c6b3cab00b0f6352634cf047"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932bdef6b9be72b8510e416323b07da1c95395edd36d44218c4c1ed5be8bfbf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e41b3de2b50716eaec2095c6d97c1c61c79e40cc87a5f822b97ede324c656"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d7d02de74193b7782c8ee60f7807cd22992905485ab24894543dfb60e6d3bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060studioModule\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed667aa8f0d272b29beb9db4e2771682ffdf037e84e7a999653dd0e75e9d2978"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe6dcca7a716fcea2570bf8112d101feb751fce64db3cdd6a07ff57a6741d6b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583d563e4f848dfe022fa1b5590d9af264387354a4dd6fa6bc1231e3a9aa6c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9317090dcc9dbc4ce92707ab7399f4b173773a362db4a99745f4958df0e19fbd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac13a0697ce29d1af278566dfde39fb1dcdb8cfe37967ad1776031912320813"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e9c64a4d3bec02de2461f46a4ff86c67787d9b07e7743e4ca499bdcd58609e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"da18e803dda14d960784e35d10a294e57ffa4b147196b3f94bb9573d34b8b802"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec726c0e95987eacd9da69bd031d4a4369617d4dfe142d003738d639ccc6883"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbe31d238cebc0d4c5970a85073ace09bb237cf5acd9ade87520ca3da76a4b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"243e8803762013b04da060e194a03c1a49fcc77a710274062447582c2928dcb2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0665845eaad40487a2ec4b774c9e05604ec3458522b9ba597605bf56ee3c018"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b10abae0681e42b761b431a16b3f071748d70017ddc304b011ed9b1409f812d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to embedded.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"97beae855770aafe20b6b0ffa99a91a1315ff6911a1dec877dd41a186c2040a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb8a9e1a207c2824ad76c84d0d01b45e45a09e13cffb7c3439812b406051fa0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9397e00a620b7d346132860a4e6d8662016ba4148c565d53bee6af3451d1ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc13262d91abdddc9cd7d6ca79e09e42c8b6d7daa642305e66053d2c178ec7b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"467654c727699a065a68e8ec5124180bbc1ac0885b79d9892f917601a7d4b2b4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"993e9758b835d59f6e0b908630f542f8884608248e72f7739eee323fa0be8a60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060worker\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c800c5044022c34d31b28cb6380483da37f9096851adf352f621dda45fe0f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43812537c2aa0ff5c66770151762e88727d70efb98f8788c6ca6fd80374d7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"448ae1459d615178a4a113a4aee33487e7a730d1d4308dbf945ad0772cad2b40"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbd717bdc0a841c5b3a38bea6213cbe8353a6cb4d157b103447e59b11709b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e111b7079b0e131fe65b6284988f1b11471051e542e045a0bb466de8fba344d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to Array.from\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e643458aadbd0c7a994d83c745ac2d7d1c584f5ef4c85c23aa4600a14c978b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"838328d1621678fd9ca2be8a3155ccc5644113fd546f26613886d4af451a852d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"986590bba401f7f255764e838783a83abfdecd151934c4f1d0fe5d96faa3fcdd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"4336edb83ca786d60f8b4b3d368fb08f795bad9d9786fde12f5eac884c91cdab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ce59fb3babb47d02d7e014c2f3d6862e2a7f4aeba8552f829bad2c67bb646"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statfsSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff213f7267c4af8b22996797ff23af7413ffd4225f9165a09c1d90a49b22279"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb3dffa00d21dd104fa6122af854b10b761c22400a3a770d37088f782dd3bfe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060buildFullCoverageManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db7030393e8b2b8e3205ed1f338ea6b6e3fe35cab432c2408be157c4a1fe818"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"050d004728fea84525a1e7aae755a93281cd99047ffa4efec11b1593e5b4262e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f95d00d5771bdc83a977e40a476fdab2dbc198ac29dc2d2f201e464fae3d88c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3cc96f57aea41e8551cf49070bf96147d7b12ba57ea94594a208004a50f369"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d67cb5c9bf7665b69ad79914e0f5eae3cd7f83133cbd07858963cdbbd742f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdba5cfc9fcda4760c392d3da7f3367b128bb1038542116a4e529b9405263735"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b01b6f6d8924c36e13c81f6bf8200d82bf2ce1cb43fc5cc5d26ce2e10213de4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a99f36b07221987e15e9bcd96e6595390bc4ddfe587fda822ef55d14b69da3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092f132833620df5d775d07e9f9b075e68109364af65219e1aa7bdacc97c191"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f1531e44ef19743b0d87c2539951f54bc7af5601c2a400aa74a8f3b7db2360"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"03223221fd84d8d76c5f6325e6216be2806b2e192899bd511523f3991d4c84e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2978642dfba5a3a5acf77356581af8f81e5a4e7e3b196ccd4e644b5c34ac0c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602445a4de63f05fd01daa8d0f29ea6c3215897be9bceb1cf35f02456eabba8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b55e156ce54e481d7d318ce45dfab052dee3c165c8e18359f3fee144a9d31ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runWasm\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be117cfc8d44bfd6d5cad79a9997055f52dc839390eb2fa9b82eaa320655229"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060runWasm\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b098390a779adf82c43038666de230b9c972344f4367906ceab7b254d0c116ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a833690ad51b674d23ee9c5fee69f5e1299a11c2d95f893940d20f015b0e73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f41b843584321496dbc8f1c0ab997b4d962e8478f3f359da06da67b463a8ebe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2602cf860603254dd95541f73d2ffad8b479faebc149186149294b831fa07be"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cfc1fcb210a8d9b3bae2e4676d50b49451bb1e117f8dd649f55b185c512310"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa792f4164e044f63408aa5b438199858ef4b518c943107b7497c2c392b6eb89"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299c680fa6fdc1b1bb6be19d8739bba929f45590f17630d77f9c1c761556411"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9bcd7aac60e8bc5e9ec2e48776b38a0ecc2c393c62842996a86e7764d7d369"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a7acc7a8dea764071056fe100fb13973b4d4abd76b2e24a5876bf15fb97e2f"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 748 typed \u00B7 529 plain JS \u2014 the untyped files are gym/tools/from_e2e.mjs, gym/tools/from_e2e_contract.test.mjs, gym/tools/from_e2e_exceptions.test.mjs, mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs, mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs, mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs (\u002B523 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 12 sibling directories (36 clone groups): 36 duplicated blocks under rhwp-studio/src/ have copies in at least two of the sibling directories ai, command, compare, core, dev, document-agent (\u002B6 more sibling(s) not listed) \u2014 21 of them are reported below, and 15 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 36 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 36 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 36 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":"rhwp-studio/src/recent/recent-store.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d8388feb8020a2b3aa28ee50bce46eed8e507a06d379d480271d30fc60f0b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 10 sibling directories (34 clone groups): 34 duplicated blocks under the repository root have copies in at least two of the sibling directories mydocs, npm, rhwp-chrome, rhwp-desk, rhwp-firefox, rhwp-safari (\u002B4 more sibling(s) not listed) \u2014 25 of them are reported below, and 9 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 34 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 34 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 34 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":"rhwp-chrome/content-script.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fef7576004f87c774188f5dd8948d3271f38431f47f8611301cbb3d42aaf17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (6 clone groups): 6 duplicated blocks under mydocs/pr/assets/ have copies in at least two of the sibling directories chrisryugj_20261031, hyunmyungjanelee-20261106, issue8174, pr7518_p22_spacing_20261004, pr7518_p39_wrapper_flow_20261005, pr8309-latestbase-20261102 (\u002B2 more sibling(s) not listed) \u2014 4 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 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 6 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3a6e8a4839932791d7a0e5badd0056ca410da9118e4fcc7b46f947c140a5a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (325 identical lines \u00D7 2 files): rhwp-chrome/content-script.js:4 \u00B7 rhwp-firefox/content-script.js:4 \u2014 these 2 files are line-for-line copies of one another \u2014 325 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d7005cab00b8dce9f7b03299fbca0be6ae5ffca3aa98287bc7e6d743ab95f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (204 identical lines \u00D7 2 files): rhwp-chrome/sw/thumbnail-extractor.js:6 \u00B7 rhwp-firefox/sw/thumbnail-extractor.js:6 \u2014 these 2 files are line-for-line copies of one another \u2014 204 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7561ceee5d0bad1afa116c96089a3f1a87b17fb8e511e11ebc93084c5a721f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (131 matched lines \u00D7 2 locations): rhwp-studio/src/ui/local-fonts-modal.ts:33 \u00B7 rhwp-studio/src/ui/validation-modal.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 977 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":"rhwp-studio/src/ui/local-fonts-modal.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cca01eca4ea52d53c4f4c4036f8ec2d52311f3f4dfb4e5d96926070b007b6e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (131 matched lines \u00D7 2 locations): scripts/font_rank1_runtime_boundary.mjs:85 \u00B7 scripts/font_rank7_runtime_boundary.mjs:49 \u2014 the two spans are one implementation copied and then locally edited \u2014 1050 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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d7b151ae07be55e1c9e0d13448ef179b1ce3221f373adab6401fae376966e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (126 matched lines \u00D7 2 locations): rhwp-chrome/sw/download-interceptor.js:31 \u00B7 rhwp-firefox/sw/download-interceptor.js:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 892 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":"rhwp-chrome/sw/download-interceptor.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3e9a491f6ab9d79f3c85a43dcb576b05ac8a3fa69850c8c5bddd1f7eae3c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (106 identical lines \u00D7 2 files): rhwp-chrome/sw/fetch-security.js:7 \u00B7 rhwp-firefox/sw/fetch-security.js:7 \u2014 these 2 files are line-for-line copies of one another \u2014 106 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4e0da802ee0ac7569ecda2d811336928e4ac51ea9e0edbc7d56dbfef7a6b82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (105 matched lines \u00D7 2 locations): rhwp-studio/src/ui/field-edit-dialog.ts:79 \u00B7 rhwp-studio/src/ui/field-insert-dialog.ts:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 834 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":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8f88722176a9ef7ce921fd83761e55722b802764a511a956789793dc7555d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (84 matched lines \u00D7 2 locations): rhwp-studio/src/ui/bookmark-dialog.ts:29 \u00B7 rhwp-studio/src/ui/symbols-dialog.ts:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 616 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":"rhwp-studio/src/ui/bookmark-dialog.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ce2fb79333e4ee1b371a296c4610a9302fed7b6aeadb20a17384dcfdee4954"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (81 identical lines \u00D7 2 files): rhwp-chrome/dev-tools-inject.js:3 \u00B7 rhwp-firefox/dev-tools-inject.js:3 \u2014 these 2 files are line-for-line copies of one another \u2014 81 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0a0e90caffe948f3a10db828b9f3a6643aea6885c1e42ac445f60190f4a96a"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (77 identical lines \u00D7 2 files): rhwp-chrome/build.mjs:7 \u00B7 rhwp-firefox/build.mjs:7 \u2014 these 2 files are line-for-line copies of one another \u2014 77 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/build.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c135ed6cfb66da205cc2fe8d5e596d97f34fe0938d93e5501a6406945fe6905a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (76 matched lines \u00D7 2 locations): rhwp-studio/src/recent/recent-store.ts:61 \u00B7 rhwp-studio/src/recovery/autosave-store.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 598 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":"rhwp-studio/src/recent/recent-store.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fa0be7a30e6ed620486acc63b302cc466f9818d769559366697d986c841060"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 3 locations): rhwp-chrome/sw/download-interceptor-common.js:17 \u00B7 rhwp-firefox/sw/download-interceptor-common.js:17 \u00B7 rhwp-shared/sw/download-interceptor-common.js:17 \u2014 the 3 copies are spread across 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1200da0eb1d14e795f3de4a78335005113a5a85110c6323325d8b15deb150b"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (74 identical lines \u00D7 3 files): rhwp-chrome/sw/download-observer-state.js:6 \u00B7 rhwp-firefox/sw/download-observer-state.js:6 \u00B7 rhwp-shared/sw/download-observer-state.js:6 \u2014 these 3 files are line-for-line copies of one another \u2014 74 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed503e1ad5a55377f8e01341ace8b10a9b734ef6abc63f74a8703ccce1f102d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (71 matched lines \u00D7 2 locations): rhwp-studio/src/ai/provider/gemini.ts:200 \u00B7 rhwp-studio/src/ai/provider/openai.ts:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 417 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e969a122cd9f1b34e4b04355c6b9a0e54495a1eb0f1e20ac6cec175930fc5e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (67 identical lines \u00D7 3 files): rhwp-chrome/sw/document-url-resolver.js:6 \u00B7 rhwp-firefox/sw/document-url-resolver.js:6 \u00B7 rhwp-shared/sw/document-url-resolver.js:6 \u2014 these 3 files are line-for-line copies of one another \u2014 67 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/document-url-resolver.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5c99cd1d65d94d434dbf1faa64379d1a2ca8dcbe0c6509ff31043f6cc42e42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (67 matched lines \u00D7 2 locations): rhwp-studio/src/ui/context-menu.ts:30 \u00B7 rhwp-studio/src/ui/local-context-menu.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 478 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":"rhwp-studio/src/ui/context-menu.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7b4b88c03d79e6cc487e4c049d1541897d0204e4a7d16154c8c9dd154a6161"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:362 \u00B7 rhwp-studio/src/ui/history-dialog.ts:333 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acb9076fa4427a1149e693b7abeed03fc6d6f5f3ca7eff7edebb1e2af0327dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (64 matched lines \u00D7 2 locations): scripts/cell-lineseg-agreement.mjs:247 \u00B7 scripts/layout-coverage-sweep.mjs:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 503 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":"scripts/cell-lineseg-agreement.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d205dbc3fc42aa3f990194d211a1a6b979ef55d58565a3ca0ec342e80701fba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): rhwp-studio/src/history/idb-store.ts:118 \u00B7 rhwp-studio/src/recovery/autosave-store.ts:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 527 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":"rhwp-studio/src/history/idb-store.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"91407036f49dad4b5e83afee4e172b67ddb7cf1bbd29a48f0a257f1e3c24049a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): rhwp-studio/src/ui/hwp-password-dialog.ts:9 \u00B7 rhwp-studio/src/ui/hwp-password-dialog.ts:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 419 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":"rhwp-studio/src/ui/hwp-password-dialog.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13a8ee4ea3f796be86bd124783bc25ba00c1b8aa8a5a82a6e0444bd2754ae10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs:6 \u00B7 mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 1086 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ddb52fd1a7aa0c55d0cf58616482c7e4d7e3f3f6970ed6b2acf655939b03cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:2323 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:2430 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c165dc22b1394457010ac2bc56555be200808072e5c40f2162de0a11dd99f869"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_runner.mjs:544 \u00B7 scripts/font_metric_coverage_full_manifest.mjs:406 \u2014 the two spans are one implementation copied and then locally edited \u2014 357 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":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa430eb8ba79ef157fc59d8e4e2b889a778ef51a4fb569fffbf544004352f8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): scripts/run-adapter-diff.mjs:117 \u00B7 scripts/run-prop-roundtrip.mjs:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 304 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":"scripts/run-adapter-diff.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"642a5224bed9007c2cd0a23832f6fd48895e3389e98961cc8c724ae5154a9db1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:221 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:215 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8709c97b1ace974ffd17ee7df78a1fbcf7c52bfee9065c5e38670dc6d581942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:510 \u00B7 rhwp-studio/src/ui/history-dialog.ts:481 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6debf0896c4cef7e05c593a6d3631bff12b9d1c65672da23bb205990a886c3f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): rhwp-chrome/sw/message-router.js:18 \u00B7 rhwp-firefox/sw/message-router.js:17 \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":"rhwp-chrome/sw/message-router.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52b2cdedc62ee40695da3676d81bed237607e8336ac60a0ca688b17481e1d0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:2199 \u00B7 rhwp-studio/src/engine/command.ts:2252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0796063280721499c71898b4f5de363c5d7d70cd61317b1d11fcf83046701465"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): tools/hwpctrl_compat/runner_rhwp.mjs:228 \u00B7 tools/hwpctrl_compat/runner_webhwp.mjs:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 342 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":"tools/hwpctrl_compat/runner_rhwp.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b87e6463a5b84e888dfcd5f1882dac5a2cd53963ccc3560cca725312ac3e5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): rhwp-studio/src/ui/page-setup-dialog.ts:323 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1520 \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":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf780eb0faa089152dab8cbe95f133d48a97ad0a00ac0ac4cc4332544626d88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:52 \u00B7 rhwp-studio/src/ui/history-dialog.ts:61 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ec4d2f3e3ecf4fb02885411e4e623bea90797f8db1bfe33dc255ca179226db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): mydocs/pr/assets/pr8309-latestbase-20261102/reproduce.mjs:8 \u00B7 mydocs/pr/assets/pr8309-maintainer-20261102/reproduce.mjs:8 \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":"mydocs/pr/assets/pr8309-latestbase-20261102/reproduce.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"90060225390c53014d7db625fad2cf0dd8ac20b37276c4b5cadcdf7e87a346eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 3 locations): rhwp-chrome/sw/thumbnail-decompression.js:4 \u00B7 rhwp-firefox/sw/thumbnail-decompression.js:4 \u00B7 rhwp-shared/sw/thumbnail-decompression.js:4 \u2014 the 3 copies are spread across 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/sw/thumbnail-decompression.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b0b97295878ad5508979096a47859d8958e64191f532f02b4cbc08e00aac61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:388 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66c8ee2138d8068848d04a3d2e66129fe4f425688d497a85ef9bb870483d5af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs:25 \u00B7 scripts/export-wasm-for-sweep.mjs:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 480 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":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7a7c7ba4d44a2678acb8b43fc04f452b437efc4415a6067bef17cf03710e38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:465 \u00B7 scripts/font_rule_ledger.mjs:628 \u2014 the two spans are one implementation copied and then locally edited \u2014 292 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"817cf55f8889c6feee4bfecc67d3ca0e33549e26c7c96a34a5da41a028d2c122"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): scripts/font_typesetting_risk_publish.mjs:351 \u00B7 scripts/font_typesetting_risk_rank.mjs:1037 \u2014 the two spans are one implementation copied and then locally edited \u2014 309 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":"scripts/font_typesetting_risk_publish.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a3a865968b5bdf8d9e20c8aae238e56a3043b200efabb7006dc6af7c3fb92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): rhwp-studio/src/document-agent/controller.ts:518 \u00B7 rhwp-studio/src/document-agent/controller.ts:697 \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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb622cc38c8042c5e364b8af14fa8fac4eab026b7cdedb898760ef90b037870"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): rhwp-studio/src/ui/drop-confirm-dialog.ts:14 \u00B7 rhwp-studio/src/ui/unsaved-changes-dialog.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 228 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":"rhwp-studio/src/ui/drop-confirm-dialog.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf7e6568ded6548e47d8a8bae39f95e2c4e6fe62d04e44bf2335a3f0f5e5f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): rhwp-studio/src/ui/zoom-dialog.ts:136 \u00B7 rhwp-studio/src/ui/zoom-dialog.ts:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 180 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":"rhwp-studio/src/ui/zoom-dialog.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdb1f96f4cbbeb6ec2735eaf0cfe2bc2b9673cd1d5b1d8876bcc9d799ca9014"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:37 \u00B7 scripts/font_metric_coverage_checkpoint_runner.mjs:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 220 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7501e587d8314024d7078195ab7abb43f011b872af1c8f0bb31a995358660c5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1758 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1905 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcd611e519f7ed71b775576e6a4f650c1299bfa0712a46162b6e0b0c17237ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 4 locations): scripts/font_metric_lineage.mjs:116 \u00B7 scripts/font_rule_candidates.mjs:45 \u00B7 scripts/font_rule_candidates.mjs:340 \u00B7 scripts/font_rule_ledger.mjs:528 \u2014 the 4 copies are spread across 3 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16c4c533b537485df35e546dc2c7b0ff6e31aaedb1263d1bc9ce2ab7a483ba0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:792 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111ba1542b951581892b653203bae1592702e14c4d3faf92ee275c92ad73865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-props-dialog.ts:122 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:337 \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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbbdc23e67b09c684f2984b9072d3277c641e6d63a10a2af65fa0122222942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): rhwp-chrome/vite.config.ts:10 \u00B7 rhwp-firefox/vite.config.ts:10 \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":"rhwp-chrome/vite.config.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdd5f6f4bdf73a70f6cf174630040f86d49db6af49041c7f3f4379123b47ab9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:168 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:309 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1075f5858f755c2afdec529868783163bf3304d1a6d075b38d2741a5a7501927"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): scripts/font_rule_registry.mjs:66 \u00B7 scripts/font_rule_registry_v2.mjs:87 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"483637909024624488790bc870f3a2c8e80ff924483183264dd891db092bf1f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): scripts/font_typesetting_risk_evidence.mjs:605 \u00B7 scripts/font_typesetting_risk_rank.mjs:1062 \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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"40667d99f2f28312806026f9f060af571f98bf444ced3164ee8ac94d8cba991a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): rhwp-studio/src/core/extension-settings.ts:69 \u00B7 rhwp-studio/src/core/local-fonts.ts:743 \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":"rhwp-studio/src/core/extension-settings.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3035e229334b8b2d574bfc1b7216b77cfbcc97ce596c54cbc73f6507fd4923"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): rhwp-studio/src/core/local-fonts.ts:772 \u00B7 rhwp-studio/src/core/local-fonts.ts:801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaad86f53e54b36a58993d31d650b32c0f2848bc24966956fa0008b6a26f00d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:4605 \u00B7 rhwp-studio/src/engine/input-handler.ts:4664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4605}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d4b310a8fbcb991e7011ee0f3bd0d135b73dfb09b9147484d35b0b6f53d016"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:173 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:174 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59152b1f87a54cd47df7bf7b1eeb68f087f6f17bbf047ad2ca5fddb56d52b7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:327 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:891 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca083fd0e9ce2694226eac82c8efb158c014fe4c5c53dd460a0ff4ddb2f8470c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): rhwp-studio/src/ui/cell-split-dialog.ts:30 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:159 \u2014 the two spans are one implementation copied and then locally edited \u2014 184 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":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef878a072dc045c42152d004a279c03acf13c86bdeddea697efcedff056392f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): rhwp-chrome/sw/viewer-launcher.js:8 \u00B7 rhwp-firefox/sw/viewer-launcher.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 229 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":"rhwp-chrome/sw/viewer-launcher.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe9f0b7ae0f04c64458d7ba143fbdd4449d7e7d0346ec8f878e01ec0ec3a221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:1279 \u00B7 rhwp-studio/src/engine/cursor.ts:1307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45526e230d16be79ccb6811f29e2f0228a185e9a98c9bbc47ebd7968e9f7973"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:256 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:841 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814e4482a96c4f4a6cce90153eb993ffe04ff64da95af1a1c0c63e988d5e808"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:444 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1109 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbef7d5dc6e197becd1917154bd29a47a5c1a001f67ef8e19f66f53fdfb8829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:494 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1160 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9c6b82ef408eceb8aec6dbed110f26e647a4b2e26ab4f2f3e63466ac29556d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:451 \u00B7 rhwp-studio/src/command/commands/page.ts:514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e467070f3670efbf18f749ad6f78fa7bda6f4bba93da859ba3db04ff6295402d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:531 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1240 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c9f9ca284b2875ef00bb98f103dbd7b8ce6f448c60708f58a8b8846078abde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): rhwp-studio/src/ui/hyperlink-delete-dialog.ts:4 \u00B7 rhwp-studio/src/ui/hyperlink-dialog.ts:139 \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":"rhwp-studio/src/ui/hyperlink-delete-dialog.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaacff4f36341d1879d3c0865adfa738373f1af7553a9491df3ad9042ffa41dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/font_metric_coverage_contract.mjs:455 \u00B7 scripts/font_typesetting_risk_rank.mjs:370 \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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3948ef449f37378639b8eb8b2fd86eed8caf11d12ecd08b8bc65628e63b80d35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): rhwp-chrome/sw/context-menus.js:4 \u00B7 rhwp-firefox/sw/context-menus.js:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 106 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":"rhwp-chrome/sw/context-menus.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"93da91cdc92c0ab6232b19f1c3d0d93f074ead600fdeaf0579e0906469bf4160"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1174 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1248 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b265ea9b9b79f19c5857a1abac8b4bbe0cc200b278a04af8f1545ba994e12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:750 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:358 \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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6500bc6c59711b673db870c5d7ddadf5c09a8b55297d300410e11030c601581"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:11 \u00B7 scripts/font_rule_registry_v2.mjs:28 \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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf559e503732b2cfc8ff1930a3b2dce8153c09e315625ddc0c26553d4196903a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/kerning_q1_baseline.mjs:313 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:314 \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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca8a5587c02fe4d4a09f7431237806aef0c71e8a4a9068fbfe5e473650f43ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): rhwp-studio/src/command/commands/insert.ts:131 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:160 \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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3de8c5e25a5cd80d20c64b91465e164e307488afdedd73b89c55c3e022ce06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): rhwp-studio/src/core/selection-page-hints.ts:58 \u00B7 rhwp-studio/src/core/selection-page-hints.ts:93 \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":"rhwp-studio/src/core/selection-page-hints.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"214499459de3e6a8cff86e40e8a77616a54f23c83e01b75a14ad9881bf9fe970"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): scripts/font_typesetting_risk_evidence.mjs:33 \u00B7 scripts/font_typesetting_risk_rank.mjs:24 \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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0512f31024da2481c3102b4a49ea35df16707d8fc33ba9e09f40745b232ed08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3610 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3700 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfd065bf73960359813271b63d4c6dedfe700e322b27dbc6f59b6c007fcf3a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1761 \u00B7 rhwp-studio/src/engine/command.ts:1893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0fb38a51a1a40ce0190e3a855a9d785e1f6c345f48126dfd355e0343daf4f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:1104 \u00B7 rhwp-studio/src/ui/page-setup-dialog.ts:323 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1520 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb38ed31efc84e1dd128de5287f77a697d98129017c2433f427b89fff6a2aeae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:1092 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2585 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae2ea9a930f9bf384bea5222a4994868fe3a5bad1582ec97d3be783b6be83c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rhwp-studio/src/ui/table-create-dialog.ts:307 \u00B7 rhwp-studio/src/ui/table-create-dialog.ts:331 \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":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd0a805f61959ab74cc33e5b85ed2256369be08c4c95cb878317d94bb145ccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:488 \u00B7 rhwp-studio/src/engine/command.ts:611 \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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"041bc74c30edad9741820128d2a9b13ee04c6c48bbeeb9feeceffb69d1e0ceb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): rhwp-studio/src/recovery/recovery-ui.ts:84 \u00B7 rhwp-studio/src/ui/pdf-save-format-dialog.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"rhwp-studio/src/recovery/recovery-ui.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd05a2ab481ebcd131ddf417c661164d0f94b5d8820939a382b01ff702bd5d3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:228 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:810 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d5739c8e8e376d50e6eb02482890f6d0927b379f1efe62d72751d5a157558c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): scripts/refresh-nextest-target-duration-policy.mjs:73 \u00B7 scripts/refresh-nextest-target-duration-policy.mjs:115 \u2014 the two spans are one implementation copied and then locally edited \u2014 240 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":"scripts/refresh-nextest-target-duration-policy.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6bf908b38726e7060226bae3ec1d584a932ffe78de5036cf7fb2fa6606cb9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): rhwp-studio/src/core/chart-data-target.ts:202 \u00B7 rhwp-studio/src/core/chart-data-target.ts:283 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e816f3da11b76459c99473a2db822749df83222e91c783cef81d39703819be97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rhwp-studio/src/document-agent/controller.ts:457 \u00B7 rhwp-studio/src/document-agent/controller.ts:635 \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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e9b4a52de5a4f0bffb497dc9a37dbacf4d371350307e58bef32a273d4325df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:1073 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:760 \u2014 the two spans are one implementation copied and then locally edited \u2014 191 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cadf94177c71e59aef458a2a4fdc82856b70df772470062d179a1aac8cbdb18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:6173 \u00B7 rhwp-studio/src/engine/input-handler.ts:6195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6173}}}],"partialFingerprints":{"codehealthFindingId/v1":"393dcdc0baea248ba511dba2c5a57c2d8dc2013d742928d26df47a2e4a89f26d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-split-dialog.ts:98 \u00B7 rhwp-studio/src/ui/cell-split-dialog.ts: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":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"240d9a3e04e060d04cdaf6fe2c68815f58b458de47c261a37fcd781e660546d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rhwp-studio/src/ui/confirm-dialog.ts:23 \u00B7 rhwp-studio/src/ui/drop-confirm-dialog.ts:27 \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":"rhwp-studio/src/ui/confirm-dialog.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d497f6c7e3c3c7b52753f0679766fb067ef3af200661d4da8e87300901b9c8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1030 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1061 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf35a1526ebf310085538ae37c668ffa88d78a41a849383030762635c432f02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/collect-nextest-target-durations.mjs:11 \u00B7 scripts/select-nextest-archive-targets.mjs:15 \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":"scripts/collect-nextest-target-durations.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f7dc05c81e4b38703e3c96130df71b59411e0b8df49e1a4666c5730ec020e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/core/local-text-replace-result.ts:21 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:199 \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":"rhwp-studio/src/core/local-text-replace-result.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8219f112789f98fb75b656e8c7e41cd87b508877f5fb1f6ebcf8bd63dad5b0fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2343 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b15d865a7f07bd9306c6e4b6731ebc5aec5309ae893fb72cd07076596d4c06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1888 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d017e60826133b7f407dfa0f6bd92d5367b4ebcc895578052bfc13b89b87a2ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:285 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:871 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea89bb0320952a8099716c86b94d36c08ce23cbb736fe80cc95b5bedc6adcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:420 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1055 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ced4031b60b96624361aab735663f21df551be8b654ca3184f74618fda037d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/ui/section-settings-dialog.ts:337 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:365 \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":"rhwp-studio/src/ui/section-settings-dialog.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7e50e049824d2d8a7ef369e86d0b38b32c3f2dfcb92b6f668d2a5b34f30d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rhwp-studio/src/ui/table-row-column-dialog.ts:68 \u00B7 rhwp-studio/src/ui/table-row-column-dialog.ts:158 \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":"rhwp-studio/src/ui/table-row-column-dialog.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ebf3590e2a138dd60904b4491ca6c62543bfd3a0e44946813fb2146a41f79b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): npm/hwpctrl-ocx/src/index.mjs:2443 \u00B7 npm/hwpctrl-ocx/src/index.mjs:2525 \u00B7 npm/hwpctrl-ocx/src/index.mjs:2555 \u2014 all 3 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ecc281a3fcf25c24e240e212ef15e2ec14a2bbb0aec1cfb3c8461ccb733b0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:1051 \u00B7 rhwp-studio/src/command/commands/table.ts:1096 \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8058d88990b44cba213ea55b3934e7f1938821b6e483fc686628a1d0274aca47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1234 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3805 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac2c061fc701b3d11400df74913e619c1f5798af5748745f5d46212629a6a3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1466 \u00B7 rhwp-studio/src/engine/command.ts:1485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7c61b53a5a5bd88c59e7c81df68d26bdd066bda610743df65e9d54063aba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:330 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:411 \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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55d8d1b6399f8adb46ed486c91181ac90fc943f5a5d6c07aa1cbcdefb57fd29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:266 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:82 \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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f184d9dccfcdef1cef28c73b54736f4a4480e3a0eaecf7588de70a9af1c362"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1260 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1626 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1667 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7fa3dc1117d7e32b543b302dd245713385b312e2e32273514370e8d30b1e34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): rhwp-studio/src/view/flow-image-clip.ts:119 \u00B7 rhwp-studio/src/view/flow-image-clip.ts:268 \u2014 the two spans are one implementation copied and then locally edited \u2014 186 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac5b14811a5d258b584d6fd075db9824422ce54e6d6d60e915ed9dd0eba663c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/font_typesetting_risk_rank.mjs:279 \u00B7 scripts/oracle_profile_contract.mjs:352 \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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"011d633a25d26d90e7f7b3f180c4ec95dd695fe0c3d54d8279a9f98e56429e9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2465 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2501 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"622022df073a9bf01048f15372caf013cf9af777506a65e9b55b2eaabcdbe61d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): rhwp-studio/src/engine/table-resize-renderer.ts:201 \u00B7 rhwp-studio/src/engine/table-resize-renderer.ts:251 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"rhwp-studio/src/engine/table-resize-renderer.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbce8dfc07c4f4eab7a68c2b1d476bca8017f3f5918438cb890ff0d12e99a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): rhwp-studio/src/ui/cell-split-dialog.ts:44 \u00B7 rhwp-studio/src/ui/find-dialog.ts:151 \u2014 the two spans are one implementation copied and then locally edited \u2014 111 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":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6962fb9d870c61879ce28ed7ebcb22e09db76757e55e8cc49d1221b0a95a6a41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-result-window.ts:120 \u00B7 rhwp-studio/src/ui/compare-result-window.ts: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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"25df769d1d240cbf99ae2f1e4d14e33052b75896fb2a1291b908582bf88e46bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2112 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1468 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3d714f645b7c0ae8c081690000369797c4fa9277b078af323a422f2630d72d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): rhwp-studio/src/ui/style-dialog.ts:269 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:332 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"rhwp-studio/src/ui/style-dialog.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a433f6cb5fca1b614f3d7e347bd0515f19d5d2696d116c1ff1be8ee830514942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:1390 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f84903b8c3377687fb4770e7a97ffd96b3e1c10047281214258144ed5e7d15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rhwp-studio/src/view/ruler.ts:649 \u00B7 rhwp-studio/src/view/ruler.ts:833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f05c9391e35f995f48689ca6b1f9d6bc29ce4b9d503748423219c7922089067"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): scripts/ci-impact-policy.cjs:671 \u00B7 scripts/ci-impact-policy.cjs:727 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2776e2c430e5535732eb0fc3d6cbbb971a33689525123c413cf9467ca5178"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:84 \u00B7 scripts/font_rule_ledger.mjs:87 \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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e9d6495033e58da5aaaf84951b29cbb3c259ee766a7553327e4244c9eb495"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): rhwp-studio/src/command/commands/format.ts:35 \u00B7 rhwp-studio/src/command/commands/format.ts:52 \u00B7 rhwp-studio/src/command/commands/format.ts:68 \u00B7 rhwp-studio/src/command/commands/format.ts:232 \u2014 all 4 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":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd6da5cf5af3fa55bd97a776885dce31011a276e9f4ac6269a205c48c7d8322"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:573 \u00B7 rhwp-studio/src/command/commands/page.ts:594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3810a40fc9a74abcbdec5fc9037a6ae96ba56ebbb5461f3220c6c3804729ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rhwp-studio/src/engine/caret-renderer.ts:181 \u00B7 rhwp-studio/src/engine/field-marker-renderer.ts:78 \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":"rhwp-studio/src/engine/caret-renderer.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"990300fbcf5e4b08c9e30f1c87004ce9036f596c9f14c9948c5aa162bd0d5b42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1187 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df4493fc4551f15dbe3bb3608785c241488cdb4bb10acf51df74a5b74803f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rhwp-studio/src/engine/table-object-renderer.ts:177 \u00B7 rhwp-studio/src/engine/table-object-renderer.ts:287 \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":"rhwp-studio/src/engine/table-object-renderer.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"324be780ea1ffd6083a00e3e6fbf2cf496b4a183c7d88afafefc16708313c2b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): rhwp-studio/src/ui/find-dialog.ts:151 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:170 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ca7340e62db65955a24c2abdb391a21473ca7e374318a9d0b8e2d41cbfb44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:609 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts: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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ea515824ddd009505baa3e322e90be9e7ef5c95d0c70f22f8677d4707fb675"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/ci-impact-classifier.cjs:486 \u00B7 scripts/ci-impact-policy.cjs:1137 \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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2676be135f3abbb726b69450786b1eb6af8a7125d7a34bc92347e0c2cfa35da1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:371 \u00B7 scripts/font_rank8_trace_baseline.mjs:373 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"0927952624703e01e8eeb30b243e7ed050551c49a485eb4fb0804b5dee5b547f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/font_typesetting_risk_evidence.mjs:580 \u00B7 scripts/font_typesetting_risk_publish.mjs:354 \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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c417ab2bc3138bbcc0730ba5cb3dc830233c0153e16e0a1bc6e66a55dea3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/survey_korea_downloads_font_jsdelivr.mjs:453 \u00B7 scripts/survey_korea_downloads_font_jsdelivr.mjs: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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613fa7f9987a32188d176d8db0b1961aa52a24d27349d14e92a04f887922670"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6 locations): rhwp-studio/src/command/commands/table.ts:490 \u00B7 rhwp-studio/src/command/commands/table.ts:510 \u00B7 rhwp-studio/src/command/commands/table.ts:530 \u00B7 rhwp-studio/src/command/commands/table.ts:550 \u00B7 \u002B2 more site(s) not listed \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c770f37ba35cd001eef6a9173296733ea01f57f779df23f14db19fa2cf63f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:510 \u00B7 rhwp-studio/src/command/commands/table.ts:550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0da8ecbb94d0cdc89ea0b17159a31d3756a94117b2342bab89d97551f8c17a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:570 \u00B7 rhwp-studio/src/command/commands/table.ts:590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82dab22ef561d9313daddf1b864168f40f9953379e21a5d0d3480b4815e9749"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:964 \u00B7 rhwp-studio/src/engine/command.ts:986 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1da017394138bd630c3835d923d49a36ec5295aacfa4f9f9d39cb00edff09bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-text.ts:830 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bc07e670aa8d8cfa28e9927a5aac6b4ebade7c433e7511ca988e9abcdfd2d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): rhwp-studio/src/engine/input-handler.ts:5207 \u00B7 rhwp-studio/src/engine/input-handler.ts:5231 \u00B7 rhwp-studio/src/engine/input-handler.ts:5285 \u00B7 rhwp-studio/src/engine/input-handler.ts:5308 \u2014 all 4 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0571adeb39b5a727f4f724a3accc3c9024beb1eb12faaf2401c7fcad46b7a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): rhwp-studio/src/hwpctl/actions/text.ts:19 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:36 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:53 \u2014 all 3 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":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"030b706d8e4af5385461b428a66d7819113d7457debf1d48c002f5674de88b02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:790 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:972 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80bf14b96be41e83577e6322389338a3cd2c42a6991848099e947e4049083b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1789 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1846 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1908 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa010af0ad4adb6499acb7bce70dd1459fbf388b0d344c3bd2daeb9bedf94ba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:254 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:439 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:659 \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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc57013ea570dad2c7913cfeba1de40a14bd3761f93240754489549e3cd63a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/view/ruler.ts:562 \u00B7 rhwp-studio/src/view/ruler.ts:759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1fcb5f4a3978407d0956c65d20c607bfc4324340e8372285b3830a20cebc62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rhwp-studio/src/view/static-svg-path-layers.ts:313 \u00B7 rhwp-studio/src/view/static-svg-path-layers.ts:338 \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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3f3556c713b44e75fc688cc462e1d4c0670ee87315e282e342736fb3808131"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:351 \u00B7 scripts/font_rule_ledger.mjs:615 \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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bead6d00a4fd02a5d690f8041fe13f9811a3539628237f1bccd42bf736ad9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/font_rule_candidates.mjs:65 \u00B7 scripts/font_rule_candidates.mjs:360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_candidates.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"426695d4fd19e89a641e2f9715c501f39131e9d94c090d44f2be1138b7810bbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/font_typesetting_risk_evidence.mjs:513 \u00B7 scripts/font_typesetting_risk_publish.mjs:338 \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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7b26908618204983769d4338fabffba6992879f4a559ca99871e3e6a4ddf32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/editor/index.js:329 \u00B7 npm/editor/index.js:358 \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":"npm/editor/index.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb46168747eb7af719f86d403f52090ce05d2f9bb0aa7d71df8904db9628d1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/editor/index.js:347 \u00B7 npm/editor/index.js:377 \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":"npm/editor/index.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7416180b86da739ec5abd85cb0c3b4d7b3919583399e079335ed842d42af8005"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:310 \u00B7 rhwp-studio/src/compare/diff-engine.ts:335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"41659ef621e5c76c3abc20979c5949a40de87cf50132b6744def275416db76c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:955 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e288c393bacc3a4efc83206818c1221cae3269dc98f01f36b78cb5f7d7a7328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2614 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"849dd7427bde23a53d3eaabd0e728f716a5f44ac2f3fefcad065df46cab95cf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:2528 \u00B7 rhwp-studio/src/engine/command.ts:2900 \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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"46455ebded38a65ef874d23fe33d564b73a242b2365ff9b839c0190917eeb133"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): rhwp-studio/src/engine/deferred-pagination-runner.ts:71 \u00B7 rhwp-studio/src/engine/deferred-pagination-runner.ts:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"rhwp-studio/src/engine/deferred-pagination-runner.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"926cbaaad7bb3d1d7b7c4a19c0d3dfb9b93d15d67167b9199feae5f207bf720c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1599 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1615 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"086eae129fe40b4366a3fea918f0805041852b05d59995acb019aafb60a6c427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:5256 \u00B7 rhwp-studio/src/engine/input-handler.ts:5272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400cf2af6696210c5dbd95b8efcfbe06d4240d6eb65adf66499c939c40e91a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-tab-builders.ts:180 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0286a9822ea3acdb1c4662b4b52b8ac346e47ee3ff80904c50ac6c6e566b4c83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/view/canvas-view.ts:1958 \u00B7 rhwp-studio/src/view/canvas-view.ts:2423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d88a6821323d6fdcbea7939ca5137c0432ac31cb1b3d04177d421b8b9ac8e57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:4576 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:4609 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4576}}}],"partialFingerprints":{"codehealthFindingId/v1":"39706d96cb8935380834e1f3a6937f6ca8adf0351a3c4114885a0e4027d2a6e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): rhwp-studio/src/view/canvaskit/css-color.ts:328 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:345 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:367 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:390 \u2014 all 4 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2949b0c5421736bf278089868a76e61b6afd20a6e7496e920454c356a01e5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:355 \u00B7 scripts/font_typesetting_risk_publish.mjs:410 \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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa8169e4c15d649db1513bc2346b5aa19c89b86715c2fa5741db4f45211a8c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_runner.mjs:21 \u00B7 scripts/font_metric_coverage_full_manifest.mjs:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6343ddf2259dbeb31bb0c55304c6b1156871d264ee7f27c7d8ebfc9cac75517d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/font_rank8_trace_baseline.mjs:255 \u00B7 scripts/font_rank8_trace_baseline.mjs:277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9905632d306eb80655c175aace6ef43461b20aa573a459a2e86fc244c136044"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/font_rule_projection_baseline.mjs:84 \u00B7 scripts/font_rule_registry.mjs:95 \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":"scripts/font_rule_projection_baseline.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"416a192b5a409dcce90a2d931456f9477e8c55bbd5760d90d97b323c8133a165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/font_rule_projection_baseline.mjs:106 \u00B7 scripts/font_rule_registry.mjs:117 \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":"scripts/font_rule_projection_baseline.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82d6197de5592e39224fe64a2f20783aa9976a31731f69a56eb1e0b407f3ef2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/kerning_r4e_failure_matrix.mjs:247 \u00B7 scripts/kerning_r4e_runtime_parity.mjs:361 \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":"scripts/kerning_r4e_failure_matrix.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97267251e957927970d73750b84c08db2777a42bdccb16aafd6b088056e975a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:226 \u00B7 rhwp-studio/src/command/commands/page.ts:239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcf1f918f216a1bba876af81538e3cd7db67d1e6b1780aab809bf45c30ae884"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): rhwp-studio/src/command/commands/table.ts:453 \u00B7 rhwp-studio/src/command/commands/table.ts:468 \u00B7 rhwp-studio/src/command/commands/table.ts:603 \u2014 all 3 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec1c289fa1e7986dcf863c84d4f655e9835183c573d090eba267204dd55e039"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2275 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2290 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb8be82d98f1f6b8c37fc90d4b39a116f87d812ca210206601f5cf6d87c53f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:1506 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1808 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3668 \u2014 all 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c2b1c3a2ea585ca90a41e4ad54dccf3057d44dbcf8051c65a6d07fcd31351f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2584 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2599 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"49de0d02aac33929901ee6d4b922627f8e22f504309b50d1274a03b8c2af89da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): rhwp-studio/src/engine/cell-selection-renderer.ts:103 \u00B7 rhwp-studio/src/engine/table-object-renderer.ts:440 \u00B7 rhwp-studio/src/engine/table-resize-renderer.ts:280 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/engine/cell-selection-renderer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a8271a9979cf8230366b139504c53eb674552505bd9ec4bb300ee1778edb80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:2212 \u00B7 rhwp-studio/src/engine/cursor.ts:2535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8857d75826602aed525c2b89cbf895b1ce4bf1dc2a0bc7cab7dd35d66b2b7f57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:2346 \u00B7 rhwp-studio/src/engine/cursor.ts:2375 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ee039b1e856b1c9dc5208707565518764690543dbdbd5a11b17e457b0ef168"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:368 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5174ce30920e17c46e7c21ac0ca9fdd1b05d37515963247306220dec5ac61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:453 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:705 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5441baded68537521c8580d6cfa8a78e7b365d9a3435d3b0fede04f7ab7788b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:925 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd88451f587c6da29b84e75099a5db6b9af7b83a1ee481f2ae6802531cbd2ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1141 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1162 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3987216f4e9a9ab0f5de81d98ce80bd7c7a68cd9f3e8f8975db41d623666b11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:878 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7919edfce4b0a90e14026078d68d2c50a35d9d87156b7ae3214890c47b0c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): rhwp-studio/src/main.ts:635 \u00B7 rhwp-vscode/src/webview/viewer.ts:120 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"rhwp-studio/src/main.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f5dd3f8486a44810cc20be1dfb828812d48271ef2469c97d8ac0b775bd5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): rhwp-studio/src/ui/cell-split-dialog.ts:49 \u00B7 rhwp-studio/src/ui/table-create-dialog.ts:270 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bc20701037ded4ea0e5c3a99d10170f3a3029873376febc61e8a0d6d489e45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): rhwp-studio/src/ui/compare-result-window.ts:96 \u00B7 rhwp-studio/src/ui/find-dialog.ts:151 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"086fb19e38e81456330301dfaa792feeb7e45b4e5fb5b7c3eececdbe2a4fc3c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rhwp-studio/src/ui/options-dialog.ts:269 \u00B7 rhwp-studio/src/ui/options-dialog.ts:288 \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":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb4bc328ca75776f9f8f35428ae2ce302b63bae6ce5c50146df45fd45fac6ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:38 \u00B7 scripts/font_rank8_trace_baseline.mjs:90 \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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c5bb570e0a50cd9df13534686de6a15bf0cce7e0e8617075b2f4694cf02913"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/font_rule_projection_baseline.mjs:604 \u00B7 scripts/font_rule_registry.mjs:876 \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":"scripts/font_rule_projection_baseline.mjs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a1cc9e3d6f9a247b621c31382094c80d3e986192621d3229fb4d02e0632602"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/font_rule_registry_v2.mjs:651 \u00B7 scripts/font_rule_registry_v2.mjs:785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553f43b64d36111213a37f0172fa758f6f93df3ffdb2e6358ebe51202d07eb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/font_rule_registry_v2.mjs:1087 \u00B7 scripts/font_rule_registry_v2.mjs:1115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c1e7b59b1ace2a84478ef19ffbe88e152e65121087102078881ca5f67ecc8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/kerning_r4e_failure_matrix.mjs:31 \u00B7 scripts/kerning_r4e_runtime_parity.mjs:30 \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":"scripts/kerning_r4e_failure_matrix.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"997c9cb8c66d334a92f519874ee70d49086a537bda44a838f6ffd96d53956a96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): mydocs/report/issue8168_topandbottom_tac_picture/make_unverified_inputs.mjs:21 \u00B7 mydocs/report/issue8282_hwpx_reopen_tac_picture_square/make_inputs.mjs:20 \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":"mydocs/report/issue8168_topandbottom_tac_picture/make_unverified_inputs.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde08575f37407917008282b0df6dfd0dad62fb0288adc7c9241764f31a35089"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-desk/ui/js/cards.js:208 \u00B7 rhwp-desk/ui/js/cards.js:228 \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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd694e61bbec44caac0c978922ae1e620d37229bda13bf84f3e1781f633d532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/command/commands/format.ts:408 \u00B7 rhwp-studio/src/command/commands/page.ts:609 \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":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c229a5416ddf349eb9b39b8f6d134939e1bc5c707936593279bbbf0bfaf9a22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): rhwp-studio/src/command/commands/insert.ts:518 \u00B7 rhwp-studio/src/command/commands/insert.ts:530 \u00B7 rhwp-studio/src/command/commands/insert.ts:542 \u00B7 rhwp-studio/src/command/commands/insert.ts:554 \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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"613f0f16efacea6b40e532566d0a5e8387c45111d39b420d4ad9567a7d02e2e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/command/commands/insert.ts:576 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:266 \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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e3197e7b4fb74bea4b9ea0f66a3a1847a909849f0accfb7d0add8570fa0de6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:875 \u00B7 rhwp-studio/src/command/commands/table.ts:939 \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"120e167c12c316483f4bc712f2d8a62c633ce46ba3e52ed8ce81f18574b9fe96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2378 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2399 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c445d673ff07ba4b47a718b16694f496d09f634adba2d5079d00cbda2799256"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2732 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2746 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edfe2cac49eabd4e24d87db9b86c11aa4388c866fa4fe22341967def6c45abf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3475 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3512 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db2b1b6a4451a17eba2307d7100b55ed9dcc98aeb9ba8957535c8c40619beb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3931 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ca9879668c261ad2bad287903068d2b4c8c3d01d1166f14469b347cf9e0fed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:931 \u00B7 rhwp-studio/src/engine/cursor.ts:962 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55b4a0b85b9606ecef2e98e50e108f8991ac223969bb5e04d0dcc7aac022a34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-connector.ts:240 \u00B7 rhwp-studio/src/engine/input-handler.ts:1190 \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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe210f391fb7e7dc0bd3dfff14b1fa10dea0afe4c316c1a99f0ca789727cf53e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:292 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:343 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2681cffb531be5c76e11eab3dcf9bd2cdb7cb163991c604bfb3d67d95d5414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:162 \u00B7 rhwp-studio/src/engine/input-handler-table.ts: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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b445a2d7470d3f9d44b5780c54089f214082dd82fc96a1c6469226d00183ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:1480 \u00B7 rhwp-studio/src/engine/input-handler.ts:1505 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4ac20752d8c209c5244e333c2a4db2b0d9927ad9c41f7453b0ed09075cedb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/actions/text.ts:49 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/text.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae412f643f7746476c3941e147fa074075b7e45e72cd89bfbb10d3d56957851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): rhwp-studio/src/recovery/recovery-ui.ts:107 \u00B7 rhwp-studio/src/ui/cell-block-delete-dialog.ts:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"rhwp-studio/src/recovery/recovery-ui.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3553caeca16f2a6fae2935aaf4e0e4f7933a6df484c04743d352fd473a72a3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): rhwp-studio/src/ui/bookmark-dialog.ts:342 \u00B7 rhwp-studio/src/ui/style-dialog.ts:261 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"rhwp-studio/src/ui/bookmark-dialog.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"50269ad34b29c2a30878c9c1df1b6849c503221772b0f95708f8c65c0dcbfe34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:731 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:345 \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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58744e8fcfd0f8e14f628b1fe7d2dea0cd5a1edb52d37b7878b2ad6fe99dae7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:776 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:26 \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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b679e866079ae28143994c11d96a36432645054cff03bf9de36457f7a25137"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-props-dialog.ts:104 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:313 \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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b8e99422da2dbf2345eba5a00a6c41b304e65ae953f94072fcb6e5b7c8ceca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-props-dialog.ts:429 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2604 \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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed7b39c9273f7b2510095a20752e96d921008c1f83c25b49ee6d05ec5aeabc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): rhwp-studio/src/ui/formula-dialog.ts:256 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2112 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1468 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6bfb54a528da118557e16413c4a0c8973ad830af9060b9ebaf9dbf678c9a84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): rhwp-studio/src/ui/hml-save-format-dialog.ts:35 \u00B7 rhwp-studio/src/ui/save-as-dialog.ts:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"rhwp-studio/src/ui/hml-save-format-dialog.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd2f842175407a2239eef35b4789408e52c8d21e08265e5efe495c77084ebf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): rhwp-studio/src/ui/picture-props-dialog.ts:713 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:754 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1617 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1641 \u00B7 \u002B2 more site(s) not listed \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5eb4cc4fcb7683790f21381fe691bbadf963590400eba4358828fbabaffdbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:994 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"81846e940638873e7651d409f6a7281e2b47598faa53628ffe2e8878fb194361"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): rhwp-studio/src/view/canvaskit/css-color.ts:195 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:446 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:464 \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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c38b3f3ac95efd635637c30794a422031313ede838c1f4a029254d0d5bde4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/replay-plane.ts:20 \u00B7 rhwp-studio/src/view/canvaskit/replay-plane.ts:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"rhwp-studio/src/view/canvaskit/replay-plane.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c7ec49387f97a811f719c0660b94edc38537e15f488474db8c2e22dd21b40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/flow-image-clip.ts:201 \u00B7 rhwp-studio/src/view/flow-image-clip.ts: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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b4a75433ebf16b6a439e6f3d1f0a3fd8a754e8a382f1e9a6892c78426bcd6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/page-render-scheduler.ts:79 \u00B7 rhwp-studio/src/view/renderer-session.ts:78 \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":"rhwp-studio/src/view/page-render-scheduler.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81cad07ed27dc25ea2c724d95b5191e42179327e40a216d967541e02c8d24e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/page-renderer.ts:344 \u00B7 rhwp-studio/src/view/page-renderer.ts:358 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"445c0bfbf2e76aaa2f24289a63b3443711590f0ae83163bbf783ef3d09fd0190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/page-surface-lru.ts:65 \u00B7 rhwp-studio/src/view/page-surface-lru.ts: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":"rhwp-studio/src/view/page-surface-lru.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec84b5cdc232a57727d18093945f46266850df4128533352059eeaae856c80f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/static-svg-path-layers.ts:333 \u00B7 rhwp-studio/src/view/static-svg-path-layers.ts:355 \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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"facdfde5b278a3e9b241f99b244a874d7f777ca29740db55cc424567c8ef262c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-studio/src/view/viewport-manager.ts:226 \u00B7 rhwp-studio/src/view/viewport-manager.ts:254 \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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9008b5e1a9ae56427ac982a8d233be6cde51f9f6353bd4798fe375d8d0d8f139"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): rhwp-studio/src/view/zoom-fit.ts:62 \u00B7 rhwp-studio/src/view/zoom-fit.ts:83 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"rhwp-studio/src/view/zoom-fit.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2696e2c23a9f30167b18a7e466e22b9ccf813b8a3b2d98ec756edc7a847e8a66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rhwp-vscode/src/hwp-editor-provider.ts:27 \u00B7 rhwp-vscode/src/hwp-editor-provider.ts: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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1208bbe911b858fca2cf9c049fce7cc0506f56e5519c8d2594d321160fa69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/font_rule_ledger_evidence.mjs:774 \u00B7 scripts/font_rule_projection_baseline.mjs:576 \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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3261d6342e220869b28ad803fe7c3641fb96a04f2d7eca4821f511031a16ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/kerning_q1_baseline.mjs:84 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:31 \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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"776da73549002410505ce7ce7a7c00419310da8b4a30b4b498f09fab82f68447"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/verify-trusted-postmerge-ci-reuse.mjs:463 \u00B7 scripts/verify-trusted-postmerge-ci-reuse.mjs:481 \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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbe72d8a0eb40e8cdc195a6e5d9b2d87ef214268f5515cf3ff394ce6c805b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): mydocs/report/issue8168_topandbottom_tac_picture/make_unverified_inputs.mjs:17 \u00B7 mydocs/report/issue8271_hwpx_reopen_tac_picture_float/make_inputs.mjs:13 \u00B7 mydocs/report/issue8282_hwpx_reopen_tac_picture_square/make_inputs.mjs:16 \u2014 the 3 copies are spread across 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/report/issue8168_topandbottom_tac_picture/make_unverified_inputs.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba6b6e55578746a4a6aca08659f5bbab432920b6a8d4f0d9a0822a4e51e2971"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/hwpctrl-ocx/src/index.mjs:2165 \u00B7 npm/hwpctrl-ocx/src/index.mjs:3039 \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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4457679a32e155646bd3166d2a261fa877c4a3b342e1cd9983a94ed764369d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/hwpctrl-ocx/src/index.mjs:3527 \u00B7 npm/hwpctrl-ocx/src/index.mjs:3567 \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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b552c328140f81a86abf844201a73828d2dc2e2975e8238db1dd10fded777a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): rhwp-firefox/background.js:12 \u00B7 rhwp-safari/src/background.js:523 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"rhwp-firefox/background.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"88214097fc269e39571d45189e2240f998a249fd381c4045d402526e23e79d92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1107 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1764 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2dd4b55920912963ce06eb360ae8b4e14761a0a717a5f313c3d1f3d41042b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1576 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1735 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f56233d842bff04f8d2598a469cc2bb6ec61448538bc9b8bd817d9f5a630a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 12 locations): rhwp-studio/src/command/commands/insert.ts:466 \u00B7 rhwp-studio/src/command/commands/insert.ts:512 \u00B7 rhwp-studio/src/command/commands/insert.ts:524 \u00B7 rhwp-studio/src/command/commands/insert.ts:536 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 3 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52cb9577495b3cc7caf8c2ab8dd5d37e65bed54a1c06f637b5ec67836a3fa56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): rhwp-studio/src/command/commands/view.ts:36 \u00B7 rhwp-studio/src/main.ts:1467 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"rhwp-studio/src/command/commands/view.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8975977d7251d2559ab8a2f438c056f6ec6c22ad1bee5c5e71d77655b4c83bd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:1590 \u00B7 rhwp-studio/src/compare/diff-engine.ts:1652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3171b7beb60b4a1359b0d966525d95dad0390f42e48d59d65f7a9cbc134287b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:1817 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2507 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e9f041f2a84d1f8a93a0bfa0da75eb8328f3539ce8dfd1a4b6ba63dabdcf60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): rhwp-studio/src/core/native-pua-font-session.ts:82 \u00B7 rhwp-studio/src/core/native-pua-font-session.ts:120 \u2014 the two spans are one implementation copied and then locally edited \u2014 103 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4a44b51f0635d0645579f0a51ec3a280c848f85f09eb8cdec3ea7d7cb6d97b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:165 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:191 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf31fe0164d78f195f7746e335c0179876d908b5f721e797facc4febfc7dc592"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1118 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1140 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d649392b2a602d37cf19a24c5e45f08c6e5f2ce430827954243e5dcd9293096"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3379 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3411 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9f0da2b33d9d528065028c2059d34bf80a62bfa047be348f09b8170b337d41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3543 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3560 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"df516e24c723d98c499b2866f1c9352029d9ab44a39d6cbccc7cb850016835a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/caret-renderer.ts:29 \u00B7 rhwp-studio/src/engine/field-marker-renderer.ts:31 \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":"rhwp-studio/src/engine/caret-renderer.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc24c1e578460240d1845d714e4508ff51a82c31b40e73735f439e15181194d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): rhwp-studio/src/engine/cell-selection-renderer.ts:13 \u00B7 rhwp-studio/src/engine/selection-renderer.ts:13 \u00B7 rhwp-studio/src/engine/table-object-renderer.ts:87 \u00B7 rhwp-studio/src/engine/table-resize-renderer.ts:37 \u2014 the 4 copies are spread across 4 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":"rhwp-studio/src/engine/cell-selection-renderer.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcf9716abb823a20de07db8964d5cfe6f957c26da697bbdf5e67f1a04e2fd1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1102 \u00B7 rhwp-studio/src/engine/command.ts:2515 \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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d695a7d81b3e4e8f865634774bb0634001149ced6f6599e4857cf9de5a5e31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:1180 \u00B7 rhwp-studio/src/engine/cursor.ts:1225 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6c16397b567e8240d569e2ff14fa591229a7b4c8856f4e3805812d5f39d3d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-connector.ts:216 \u00B7 rhwp-studio/src/engine/input-handler.ts:1172 \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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ced6b55d341ea393821846d40d6588224a829290ab602fd8358b2d64f3d5965"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:320 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:368 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eafb0be210214811718cc38df84e2f997328c21823be4df0be1e4275377cb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1745 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1759 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee65365dc9eb236dfe412f236ce1194a770988af1ad03e7ffde6fabbf3783456"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1124 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1212 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1252 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a330999dfb3223991ddfbe03935f7a926b248abfe0c161db9db02fe786a5f9b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1771 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1838 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7160f2bc268f9ad05392f76d347f733aae4dde3e230594881298dd7fc7769f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:691 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d50879e6b620a830c24e3ee1b12230f9362cd4d9f7b795bd00363ad50546edb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:5001 \u00B7 rhwp-studio/src/engine/input-handler.ts:5019 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c71909267eea8358e42c34f59d4b9a717a35f8577372794d27c13d72688ecad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): rhwp-studio/src/history/idb-store.ts:31 \u00B7 rhwp-studio/src/recent/recent-store.ts:61 \u00B7 rhwp-studio/src/recovery/autosave-store.ts:62 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/history/idb-store.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849104afcebf99ddb0fdca7fe3332fc9951ef2d91bff12349d8e8f2e46fffe3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/actions/page.ts:68 \u00B7 rhwp-studio/src/hwpctl/actions/table-edit.ts:85 \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":"rhwp-studio/src/hwpctl/actions/page.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aae7a4b057b5f10f9b28e7898d86f4dbb9678f66d9e8491c5bf55e235cdcaef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): rhwp-studio/src/ui/cell-block-delete-dialog.ts:79 \u00B7 rhwp-studio/src/ui/confirm-dialog.ts:33 \u00B7 rhwp-studio/src/ui/drop-confirm-dialog.ts:37 \u00B7 rhwp-studio/src/ui/unsaved-changes-dialog.ts:47 \u2014 the 4 copies are spread across 4 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":"rhwp-studio/src/ui/cell-block-delete-dialog.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c0f140dfb106600df2a081388141d4513f1eee17b3eeb548171835cfe933f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:742 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:763 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f187cddfd8e44711d859270ac005863fdc2765843e2dfe9a1de3ab2aff2f7ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): rhwp-studio/src/ui/char-shape-dialog.ts:502 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:521 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:551 \u2014 all 3 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65293cb9fa025fef2efd6c9e86e8505644abe82f81b3292a7c10ae4138e98d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): rhwp-studio/src/ui/compare-result-window.ts:96 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:170 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad88119a128fd1ea3451953f9c8886adda6927b92e471ba46bc62c5b21ecf59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:141 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:60 \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":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d77bcb6b16c759074b0703aaced3b555c50a06957ae94d7aaf316ed8433094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:463 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2639 \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":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d02b30413c1b744930ab27ad0676cc3bf7270726a2b7975be5af3b7640cc143"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:528 \u00B7 rhwp-studio/src/ui/endnote-shape-dialog.ts:551 \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":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a660efd7efcfa5905b5473adf27eaadee966d3c024ad84e322925f74b66f70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): rhwp-studio/src/ui/find-dialog.ts:157 \u00B7 rhwp-studio/src/ui/table-create-dialog.ts:270 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb958da56a725642f761fd3da67751615985d9e58daf7bf14bc1c6c0ae0b9d0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/numbering-dialog.ts:307 \u00B7 rhwp-studio/src/ui/numbering-dialog.ts:343 \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":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfae29cab59486f155f4bd656eba7791686f2b215c3f3facf63b6ac57e47ab2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:491 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:503 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4354f55161c6350e292e3a5299767ca17abc29094fcb2c2ee3ed7f4483432a73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2639 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:613 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56dc9f1c2eae7af2197d27d57ccc2870af78f97cd282c6fc13a653035f8de7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:360 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts: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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd69db99b5319d47d432471c87e9d877f01a70d0bc70bfe76ead861d8f836c68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/css-color.ts:358 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:406 \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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8320b019d7cd7f0e4d45d0210089b8cd367e1fc56724bb472cfee2de0f367e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/font_decision_trace_contract.mjs:97 \u00B7 scripts/font_rule_ledger.mjs:71 \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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be04a9292af313f5d814da7349a192f88cd4cce10bacd959cefd802fcfa7254"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:310 \u00B7 scripts/font_typesetting_risk_publish.mjs:351 \u00B7 scripts/font_typesetting_risk_rank.mjs:1037 \u2014 the 3 copies are spread across 3 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b939b24544b2f15257f6d3eceee6b299b0637152fcb56d4718718914e1b98e68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/font_metric_coverage_contract.mjs:50 \u00B7 scripts/font_rule_ledger.mjs:68 \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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb22d7b3fdee562549333de33a2fbd30338e9d8d44a0425534a1f4650cfd91a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/font_metric_coverage_contract.mjs:84 \u00B7 scripts/font_typesetting_risk_rank.mjs:78 \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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3315192a7182c3d8b8a46df9efdad1cb3bfb4dc810bc03f9f54b8f2fb22eb46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/font_metric_coverage_supervisor.mjs:281 \u00B7 scripts/run-rust-test.mjs:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"scripts/font_metric_coverage_supervisor.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"454bb7f97998c82cf2dd043c6c0f5d9d0f1269b3d3298402cef03299c7e834c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:71 \u00B7 scripts/font_rank8_trace_baseline.mjs:224 \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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad6a37c65a3379792cc568389d0f8491928d6c81592d50e73064ca9a42c5d96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/kerning_q1_baseline.mjs:98 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:51 \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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43cb7f016b9575fd88d2b1dc13440c4b4f92f9e70116dfd15fcc9df6dba012f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/rust-test-suite-manifest.mjs:895 \u00B7 scripts/rust-test-suite-manifest.mjs:1029 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"508240d513873e824429f72839dcdb0a70e0b90b4b002857c6c508b71ae74e5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/survey_korea_downloads_font_jsdelivr.mjs:671 \u00B7 scripts/survey_korea_downloads_font_jsdelivr.mjs:724 \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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3719aadcf7543aabf7349f6d414ee2dfa87e6f49ab74bb5fb19207235002c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/hwpctrl-ocx/src/index.mjs:1116 \u00B7 npm/hwpctrl-ocx/src/index.mjs:1146 \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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99f04380dcee35076a9a8ca1a467d1abefe21e25213b7caacb2a9eced1945a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): rhwp-studio/src/command/commands/file.ts:887 \u00B7 rhwp-studio/src/command/commands/insert.ts:635 \u00B7 rhwp-studio/src/command/commands/insert.ts:651 \u00B7 rhwp-studio/src/command/commands/page.ts:417 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb723939aa5d296dedd2de4394a773507ec68f0b0011c6ef6b0919cd4e57f631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:56 \u00B7 rhwp-studio/src/command/commands/page.ts:82 \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":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d111b2c03981499b679b2dae219605bb7a6b45fe62dcef4d475d292cfc013a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): rhwp-studio/src/command/commands/page.ts:549 \u00B7 rhwp-studio/src/command/commands/page.ts:573 \u00B7 rhwp-studio/src/command/commands/page.ts:594 \u2014 all 3 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":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcaa99dc2f3ed5966388e50ff1a816d59c7c96aa34a32cfc66be6b0851d73e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:903 \u00B7 rhwp-studio/src/command/commands/table.ts:934 \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"5247d446d2a3a1fbd79fe1e5994c7b9982f597b6224d9dccc40860d205f0965b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): rhwp-studio/src/command/commands/table.ts:1017 \u00B7 rhwp-studio/src/command/commands/table.ts:1066 \u00B7 rhwp-studio/src/command/commands/table.ts:1111 \u2014 all 3 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af12d5dccfc352eaddafbf1feb9fbcc97b8360fe0676c8a394f504efc7a1e4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2347 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2426 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"074906796ff2503456234b0629f2b31efc83a37aa2c904de8c14508623a556db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2744 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2759 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2744}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d6a5f0d57c6735db009e36ac6eee7e3fabb537c23eca316a7c000144ffc27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:1272 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1290 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1310 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1327 \u2014 all 4 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae8c78b493a507f04e530265572ad86a2d7b358af167daf90f4e0ea914a691"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/document-agent/contract.ts:66 \u00B7 rhwp-studio/src/document-agent/contract.ts:93 \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":"rhwp-studio/src/document-agent/contract.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a545fe1e80ddfe0a9e7ae0420c6663d554971eb1bfe7b362f493403ae02bc76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:2014 \u00B7 rhwp-studio/src/engine/command.ts:2065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb0d679b262c3a306ae48a9a3ccae0444ce2340fb842625f3b23276c684e451"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:2419 \u00B7 rhwp-studio/src/engine/cursor.ts:2582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f84fbaab1629e2d988de1771536cea7dd2c425cf1d6329f06a9e7e5748c399a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:192 \u00B7 rhwp-studio/src/engine/table-resize-updates.ts:36 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1071958a0d4cdb98d4ed0e156f6b39ed7b0ebd46a48ee02ed2a75ff667174b3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:730 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:744 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:754 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:764 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb783753ce6b046d0ff9ebebbfff268c9039a43333ff1df60227299759355b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:968 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:987 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dac85f8ff5cbe609e4064dd2c238cd140d3ea04ec53f0c537029dd175e411fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1148 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1290 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9562e3874f5d682564cf6320867555447e32c3e7ae3552d8b04ec5f06f35e6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1707 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da3c999fa88809329bd53c1e66165e38ffeffa706c98262a8bdba99a0d7d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1069 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1087 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1148 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1169 \u00B7 \u002B1 more site(s) not listed \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d096e42023bd2bf90b7fd9cccccca338e2a41ffe6e0080169e78c8e29b1e43b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:1032 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:1044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6331c7c484f578351168a19645867e42c7fa586c059a7fd87097a3bc84855a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:1063 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:1288 \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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d6a034c0c1538a4302a28d1180b816232a6afc9f5f8610e0bef34965ac7724"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:95 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a8f0eeeff89112808fda70d73aba1595a0b2bcb5b2321efaf255c475c1cca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-text.ts:768 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:788 \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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"95daced2f7f8b1a424e618026f5116700f43a05ea8c35e48ba0b2c7af1b97076"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/actions/format.ts:100 \u00B7 rhwp-studio/src/hwpctl/actions/table-edit.ts:66 \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":"rhwp-studio/src/hwpctl/actions/format.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"77825e6132bc9c4d82ec0e1058713dffa3137d179a25642cd1247c123fcf9699"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): rhwp-studio/src/plugin/host.ts:210 \u00B7 rhwp-studio/src/plugin/selection-text.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c315a603247fd14d557c76c1062d5e3830fefdd16e0b4d7828c8328f4d15adc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/bookmark-dialog.ts:212 \u00B7 rhwp-studio/src/ui/find-dialog.ts:287 \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":"rhwp-studio/src/ui/bookmark-dialog.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5513534d5c46c73ef9fa60f8ff26a6152ed2c1d1c6fab76a8d6cb902c5824759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): rhwp-studio/src/ui/char-shape-dialog.ts:426 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:605 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:424 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"813dfaf366a7dd3b739c9cca9cc92ef271dbaa0a56745337bf607ad74e1355dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:518 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:548 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b5a79e8efe7bd8c564df7c4234b0eb8a0eeed7cfad5bec45d7cde0027519d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): rhwp-studio/src/ui/command-palette.ts:83 \u00B7 rhwp-studio/src/ui/local-fonts-modal.ts:180 \u00B7 rhwp-studio/src/ui/validation-modal.ts:167 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/command-palette.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d24807ba832c545419662ff4c18930e6defd36ba3a91af707323c50f4156470"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/find-dialog.ts:178 \u00B7 rhwp-studio/src/ui/find-dialog.ts:215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd82c547c8bd95d13aadc958664001320f02be081f89fa99dbdae50d49e5ab63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/find-dialog.ts:345 \u00B7 rhwp-studio/src/ui/goto-dialog.ts:204 \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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4217b71dd6e8a0ca36bd7bc878b4d5410a32ab88a66ebb75b5b6cf3fdba85daf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): rhwp-studio/src/ui/goto-dialog.ts:51 \u00B7 rhwp-studio/src/ui/new-number-dialog.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"rhwp-studio/src/ui/goto-dialog.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc81a404d610ec4af6e31b90e9cd3841d03253044cc12b6e10f822a7aaea98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/menu-bar.ts:53 \u00B7 rhwp-studio/src/ui/menu-bar.ts: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":"rhwp-studio/src/ui/menu-bar.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8743dc9b05605f6f4bee8fd3056ab7588d767304dad90dcc01260010d5bdc104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/menu-bar.ts:87 \u00B7 rhwp-studio/src/ui/menu-bar.ts:129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/menu-bar.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec621c76d80a0896eb8857dd4d1a4f60d11c88099fe4c1a307287fa519f898f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:310 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a20e43c6d8bec65d96c9e20481dbaf1b7500615e066fdf1ca72df27489fa46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:348 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts: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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ed1ac74ea7a005e0ac1bce5801b4f283b14ca04b437d7960e43f508914daa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:451 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7a281a7f0e606a99fddecb57430c0aeb1c45bf852427446cee3dd61faa0873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1111 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf7908cf96e121287573a90a57d24b04e962b35468646b9accc6a4adaa93641"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1498 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1768 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892aaa0b9508ea57bd34c70cff0ef20967c2fcc8fb16247c5048f9fdcdb940c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/save-as-dialog.ts:75 \u00B7 rhwp-studio/src/ui/save-as-dialog.ts:89 \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":"rhwp-studio/src/ui/save-as-dialog.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1de42d80085a7eb5117c02eec65f6e1d91a144f759ed73b97f8995770d55134"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/ui/style-edit-dialog.ts:255 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f094abe88425f362099e934df5c534acb6cbea5429fad37f6912ac773c9f81de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/view/canvas-view.ts:265 \u00B7 rhwp-studio/src/view/canvas-view.ts:2041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f133cd54938c58476b73eb6977d5d0b82e9f6c631eef68c0baa8b9bf53eb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:2775 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:2786 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc514cbeae69aa6af5f083af9a01d10b1b41d135a4212eaa7ec2f614f7d7d586"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:6236 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:6246 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd83e5c730f8a48006bfa4bb2fa087294c8ea946a472c60955b525d3302bef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/view/glyph-outline-payload-status.ts:501 \u00B7 rhwp-studio/src/view/glyph-outline-payload-status.ts:515 \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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f182d8de3906e77fa2f6b04b63653462d323ffcc6e042b15f855ba9c4b696ea1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): rhwp-studio/src/view/grid-overlay.ts:7 \u00B7 rhwp-studio/src/view/grid-overlay.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"rhwp-studio/src/view/grid-overlay.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2ad00771222863b78fc7cbadf14ebdbe8bf076437f29818c7f88287df4a1bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): rhwp-studio/src/view/page-render-scheduler.ts:256 \u00B7 rhwp-studio/src/view/page-render-scheduler.ts:345 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"rhwp-studio/src/view/page-render-scheduler.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c578a97c28b87a8bb3c8e40b63d8c21823f5c7c61a826bad3431f73f926e6115"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-studio/src/view/static-svg-path-layers.ts:1204 \u00B7 rhwp-studio/src/view/static-svg-path-layers.ts:1234 \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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a710345877546fe0b6bfce4ac3ee602386ccd626117939adfe3e5365d86b999a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rhwp-vscode/src/hwp-editor-provider.ts:114 \u00B7 rhwp-vscode/src/hwp-editor-provider.ts:157 \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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"60514cd73644f4176e39f4a51399632dd0ced14ae204cc4251a2d63fa1c025d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/ci-impact-policy.cjs:696 \u00B7 scripts/ci-impact-policy.cjs:716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-impact-policy.cjs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"b278a76334b8c845f9ae0933e68ef694f3d7a1cff20141ad8a52b1c80188d552"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:20 \u00B7 scripts/font_metric_coverage_checkpoint_runner.mjs:21 \u00B7 scripts/font_metric_coverage_full_manifest.mjs:12 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4253d4e9c2cbc879ae91951cd3d6acb726b883577f42ba46f132ebfa5fee3c2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:326 \u00B7 scripts/font_metric_coverage_full_manifest.mjs:423 \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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9b90849b26b878cb60bc4f08f9e2972fd932efffe4710d37395008999633b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/font_metric_coverage_full_manifest.mjs:433 \u00B7 scripts/font_typesetting_risk_evidence.mjs:625 \u00B7 scripts/font_typesetting_risk_rank.mjs:1082 \u2014 the 3 copies are spread across 3 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":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85336c8a2a9a06939ba8e9763801769d68e6dad02c4c033399178d09c3d43c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/font_metric_coverage_pilot_selector.mjs:208 \u00B7 scripts/font_rank8_trace_baseline.mjs:419 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":"scripts/font_metric_coverage_pilot_selector.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b0da67485b85fbd1a05a117ef933179f0c63e925a844bb5907a1f69d3d302"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/font_metric_coverage_pilot_selector.mjs:215 \u00B7 scripts/oracle_profile_contract.mjs:899 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"scripts/font_metric_coverage_pilot_selector.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae62372c166a0f23f6c74e30211b1a4d641ec3443f77938dbb0aaa6f17b372c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/font_metric_coverage_pilot_selector.mjs:215 \u00B7 scripts/rust-unit-test-tiers.mjs:650 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"scripts/font_metric_coverage_pilot_selector.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef008715953cff1634dae0de01f5242f542ec80caed697584f2184e48703f85f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/font_rule_candidates.mjs:158 \u00B7 scripts/font_rule_candidates.mjs: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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bd00bd17dc12c2a5de348a00e37596ab9df1768316d6b428ff462972bde59f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/font_rule_mutation_rehearsal.mjs:70 \u00B7 scripts/font_rule_registry_v2.mjs:1043 \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":"scripts/font_rule_mutation_rehearsal.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fad82e0b33755c747ee46dbd7599e1fa43441abf6a677f7bd7694c1820f2ea5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/font_rule_registry.mjs:377 \u00B7 scripts/font_rule_registry_v2.mjs:296 \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":"scripts/font_rule_registry.mjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"634867d1544473ad6ee3bdcb8def506b8deb2a662b9a83f3fca6dfa84b903733"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/kerning_r4e_wasm_embedding_probe.mjs:86 \u00B7 scripts/oracle_profile_contract.mjs:899 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"scripts/kerning_r4e_wasm_embedding_probe.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2328adb568569931a7c05b4316702877446c40b6ef7a8b7ee617788b089ef30a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/editor/index.js:302 \u00B7 npm/editor/index.js: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":"npm/editor/index.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"13384eee3f53842db09da51528e799b8d3e71fc6d4b3cd75861deb88de5f54e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/hwpctrl-ocx/src/index.mjs:3167 \u00B7 npm/hwpctrl-ocx/src/index.mjs:3236 \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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a5838a6b5715bbaf82d5995759922a7a6f55b5109e04c3ef7ea0a4fb03954"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-desk/ui/js/cards.js:146 \u00B7 rhwp-desk/ui/js/cards.js:158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83226231893f02b010be5b032af2bb64227f275827fca97df8e62e8014e751a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-desk/ui/js/main.js:646 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:337 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:365 \u2014 the 3 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c158e002482397811ddd96337d3f08f58a5205bb1e05bb3b3b0760fe4c46fd5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): rhwp-safari/src/background.js:107 \u00B7 rhwp-shared/security/filename-sanitizer.js:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 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":"rhwp-safari/src/background.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"92062a82625755eae10c7f28ab14e5c96bcf025dbd4f2419baf51dcb027cc584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): rhwp-studio/src/ai/tools/write-tools.ts:1143 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1335 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1491 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1708 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16777707dbfd9796d74814d381b180ef6ca6c0956771cba4af822e2f2ba1ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): rhwp-studio/src/ai/tools/write-tools.ts:1501 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1824 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1986 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:2035 \u2014 all 4 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"9187aae06296655ce52c78760d0559e289d3c926beb6f5bf80d4cce425df92e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1810 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2837734c894f40e44b13c1a3ec111afa0fc6f159e08de7e0c40f275f75128dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:233 \u00B7 rhwp-studio/src/command/commands/table.ts:267 \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"34414ffb5233b14bfc2f08bfc91c04fbe101eff4d3e813213b7eaeb1227d52e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:1067 \u00B7 rhwp-studio/src/compare/diff-engine.ts:1093 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7fcd70d8993902c2b311bbf1afad77249144e7f54165a1aeb0a9cba179787"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:1580 \u00B7 rhwp-studio/src/compare/diff-engine.ts:1641 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf5a8c25bce909d86bfc045018500df8e6ebbaf113f51326825662e6b1e567b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2300 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2319 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b1e55b85dfaba3ede267c9eacfefa8623a9d6028cc8b727161095aee15afb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1465 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1493 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad80a4ee69a7a0e42dfeb3fad64d589559e263682ef6445ad0290b7db84baf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2695 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2712 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e15cefa0985485d83b0dc01f35ecd5fcbc0fc44deaddcc61994ff742882eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3447 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3466 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0742f98f48068c65eed0b5328c659588d65f8892d14b0166fd4702cd350762"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:375 \u00B7 rhwp-studio/src/main.ts:659 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01193dd7cd3667fc036b7dcfadfa05143efbbc324300caffb8b941a8cd13440"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): rhwp-studio/src/document-agent/controller.ts:440 \u00B7 rhwp-studio/src/document-agent/controller.ts:498 \u00B7 rhwp-studio/src/document-agent/controller.ts:614 \u00B7 rhwp-studio/src/document-agent/controller.ts:788 \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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5977a22a6b48a61e13a0b55bc071d649d83bbaf6345f64d56b9d2ced62170eda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/caret-renderer.ts:74 \u00B7 rhwp-studio/src/engine/caret-renderer.ts:88 \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":"rhwp-studio/src/engine/caret-renderer.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cdeada110c2e93ba20bc9e74e093645a8130ccaacaa13fc603f9b8f2d81000"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:603 \u00B7 rhwp-studio/src/engine/command.ts:642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d340f10fb2e24e5af2b61f9986d84dbcb3357db4f6169cd8731806260a5329ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): rhwp-studio/src/engine/command.ts:1714 \u00B7 rhwp-studio/src/engine/command.ts:1746 \u00B7 rhwp-studio/src/engine/command.ts:1815 \u00B7 rhwp-studio/src/engine/command.ts:1878 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e157ca98561cd4a2b97be2203da1851f4f1b48aebbe213ae20c465be08bbe6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1986 \u00B7 rhwp-studio/src/engine/command.ts:2040 \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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cda2ec0a1a74b85e88ea8c9ca22df7d6f3d4184d7bc485a56683736a783ade"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:2189 \u00B7 rhwp-studio/src/engine/cursor.ts:2231 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"844917995e407d3c229038f4c7436cf2da36ea8705be352dda410e5178bfd6b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:997 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:1063 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7f9faf1ab5d7a8b596dd7baf40f3889ab84461526c0781184fe820a6f27b5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:2248 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:640 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"393b8a4cf7afb45f65d4ca92dc5140e81f0ada7e64adb0bad7d5e5c5f0ff4b41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:2297 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:2412 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ee209f7b47642cdadc2e16e2df73c58a9f9a69854f9aa65b2aca1ea095a62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1687 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1698 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1709 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1720 \u2014 all 4 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"000a06b3f66a6b0663e5bbcd0ca9e37cb197f76990cf9a85a1b7fe8939fc3309"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:861 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cb77c1dbd927aafe04ff5ef6498bef8f2ba2d26533e0e530e3bf00ff1ee979"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:688 \u00B7 rhwp-studio/src/engine/input-handler.ts:4700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"646e4950027fbe561a4adba30e88249479fec237b1a4571fa35b266f5b460e4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:1195 \u00B7 rhwp-studio/src/engine/input-handler.ts:1468 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc6aaeb04f64c026657d6a0d1a46a06f13b230bdbf468cbf354fce643dd7598"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:1543 \u00B7 rhwp-studio/src/engine/input-handler.ts:1578 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"16caf8cb35f9b74a8d3a015ab3480493bcc514c14beb7ebd98d6a334a59f008f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/engine/table-object-renderer.ts:110 \u00B7 rhwp-studio/src/engine/table-object-renderer.ts:314 \u00B7 rhwp-studio/src/engine/table-object-renderer.ts:416 \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":"rhwp-studio/src/engine/table-object-renderer.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d684d78a7bbf1ab0ecb278d8caaaf247d64eee469dce095834dc5d06b407d14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/history/idb-store.ts:48 \u00B7 rhwp-studio/src/recent/recent-store.ts:79 \u00B7 rhwp-studio/src/recovery/autosave-store.ts:80 \u2014 the 3 copies are spread across 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/history/idb-store.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d17739846488208265afb91bf8126107830111f9505f5b0692f0649079384c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): rhwp-studio/src/hwpctl/actions/clipboard.ts:14 \u00B7 rhwp-studio/src/hwpctl/actions/clipboard.ts:27 \u00B7 rhwp-studio/src/hwpctl/actions/page.ts:41 \u00B7 rhwp-studio/src/hwpctl/actions/table-edit.ts:29 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 4 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":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"067d4f4d8bd1d66001911afce46dd069480635f67a4dd3f2d7a0099ba108a979"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): rhwp-studio/src/hwpctl/actions/clipboard.ts:29 \u00B7 rhwp-studio/src/hwpctl/actions/table-edit.ts:50 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:23 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:40 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 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":"rhwp-studio/src/hwpctl/actions/clipboard.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8efe961437c1eaadbb0b3ad28a372a1bb92aea154fa949a73f34bc78f382488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): rhwp-studio/src/ui/cell-block-delete-dialog.ts:46 \u00B7 rhwp-studio/src/ui/hml-save-format-dialog.ts:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"rhwp-studio/src/ui/cell-block-delete-dialog.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b93754e48bea6315f98b6588b722c18c694dbd5d38bad6653d79a68543b562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:14 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:20 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90100b078ce8d262f618cf2dff84229775a0fb1d8275bb6e7a1e6a0c4cf309b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:211 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:217 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa43de0ab1cd6b75985131a6ec45ce832cb51c455ab60ace3220c3c80ed6270"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:382 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:852 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1008 \u2014 the 3 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f848177611381bf4b7337c89b563c73a04a6a5070b167e7a617fe6612407146"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/char-shape-dialog.ts:1121 \u00B7 rhwp-studio/src/ui/para-shape-helpers.ts:25 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2621 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ef95f80cd30e8fc63ef4d968acdaa1e7fa2abaa70ba5d105f52a3d66b29173"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/column-settings-dialog.ts:116 \u00B7 rhwp-studio/src/ui/new-number-dialog.ts:62 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:144 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5856f7c0a9603711a3a22955d665d6b13f0d39bf2ef7ea5bce21018ccf96308e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:317 \u00B7 rhwp-studio/src/ui/history-dialog.ts:269 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8da66d3c0778259bf63716262cbea8a003c20f6aba8fdb757958cee4eb5b228"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:390 \u00B7 rhwp-studio/src/ui/grid-settings-dialog.ts:118 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:346 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f9a041adbe48c422a5edb7fbadde0666186c6b378dc2d6c19058f52a2bcc2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-props-dialog.ts:185 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:408 \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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"44847e178ea3005d5330e2ac5c8a7ed9bdcb8c3db25e88b32f93db4b1d0216d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/font-set-edit-dialog.ts:79 \u00B7 rhwp-studio/src/ui/font-set-edit-dialog.ts: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":"rhwp-studio/src/ui/font-set-edit-dialog.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e268db4b9fe01deda7d28bfe23e2229b97665244173cf210485376cc23acf93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/page-border-dialog.ts:373 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:389 \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":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a2ed52bf36b309fca8daee48503e7738f13f21e5b12a068037e980e9353112"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/page-setup-dialog.ts:113 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:237 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:468 \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":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a2f366399072499e75d064494b32654144aefd484a893fc9d7e0423face21e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:472 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:509 \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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f9232583215fa969e70088d7d6b203ebda5e1ff6948797d6d1ab380461dd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-tab-builders.ts:460 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"841b0d4953ac4c65187d350d5f691b2c969c318ff7c419641f676ba3a06ca6af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:572 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cd18be526b5440382986e96222545d2a6f6ab3a131e1dbab28b099c9b18ae6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rhwp-studio/src/ui/picture-props-dialog.ts:837 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:998 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1361 \u2014 all 3 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a3855362d9d00e46a674dd2de16107bf5a4145c17dc1292f4900459110b082"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1437 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ca65053f6d29beabf20c9b8c54ee929dc3a099f84a3c719a2dc3e9c0115c33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/style-edit-dialog.ts:95 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts: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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2953cfd2fd5d11f2e9dd7bb98435727d38103d254b124423e1d31e3eac3454"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/style-edit-dialog.ts:236 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:262 \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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f1d243cd1c376560c0c3e9beddfbc89fb44a39860509fadc4fd3229774006"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): rhwp-studio/src/ui/style-toolbar-overflow.ts:123 \u00B7 rhwp-studio/src/ui/style-toolbar-overflow.ts:192 \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":"rhwp-studio/src/ui/style-toolbar-overflow.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"581d92316adf2675bd5139d840be4a09793586c0bbd71d89bdd2a806e664c351"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/toolbar.ts:132 \u00B7 rhwp-studio/src/ui/toolbar.ts:488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38a038c765de5ec91048acb2030d5211eedab622125726211e00f3744df6c54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/toolbar.ts:162 \u00B7 rhwp-studio/src/ui/toolbar.ts:463 \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":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc9982760cc6ec6b478122c4394f9ed9efb48de3fe547c03d6868aeb3c6e0ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/ui/zoom-dialog.ts:119 \u00B7 rhwp-studio/src/ui/zoom-dialog.ts:225 \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":"rhwp-studio/src/ui/zoom-dialog.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef596bd36b01329819e7cd0fd2e43982a0ac459c4538f8f87f350bfdafdcd950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:593 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:651 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"19026e960ed7c65f00d76fd0bcf1da74084ab0d64327f7e1f909692473b2ed98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:1673 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:1710 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"260476ff4d6b1695168ef549b1dab1608a4f4af18c06460ce7d54a2528caee69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:3329 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:3344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3329}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b99b27cfdb6ee14b5755c79537755a6ff412aa1deb8e6e3559288e366e1907"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:6116 \u00B7 rhwp-studio/src/view/canvaskit/image-replay.ts:59 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d703b0be4f112fe1d63e991c0c5d0791330b857dfc04859df9542c81fa8b9ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:5321 \u00B7 rhwp-studio/src/view/canvaskit/equation-glyph-outline.ts:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a334e736634112e3d278501723b24066c71d01311d26ac9cb3a74235fb8ef42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rhwp-vscode/src/extension.ts:56 \u00B7 rhwp-vscode/src/hwp-editor-provider.ts:129 \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":"rhwp-vscode/src/extension.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"951a8b2f9f0b486a0224ba2b64213e6e924f6097fa2eceb978890ce50a01f0b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/font_decision_trace_contract.mjs:295 \u00B7 scripts/font_metric_coverage_contract.mjs:456 \u00B7 scripts/font_typesetting_risk_rank.mjs:371 \u2014 the 3 copies are spread across 3 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a7f56ef3304782d6a78b8f5e4b04b97e6b2c98d9536e884743abc68e2b2c00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_metric_coverage_contract.mjs:68 \u00B7 scripts/oracle_profile_contract.mjs:48 \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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ba26181a5cbc3544a37c852a2d738f7e5c7009754923971733c490cbd47e32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:183 \u00B7 scripts/font_metric_lineage.mjs:211 \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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9a11f18128b5f98b71bba5f45453a67b817aa621355f10df259e803a66a5cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:442 \u00B7 scripts/kerning_r4e_failure_matrix.mjs:262 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaab058decb39d8046536c3a52c662a7b7692a31e31faea3e328a75c2856a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:442 \u00B7 scripts/kerning_r4e_runtime_parity.mjs:377 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e9fc663a048fbf2bd989823e525ef8512734fecc5cc2206caa5aa5717d348a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/font_rank8_trace_baseline.mjs:27 \u00B7 scripts/font_typesetting_risk_evidence.mjs:43 \u00B7 scripts/font_typesetting_risk_publish.mjs:33 \u00B7 scripts/font_typesetting_risk_rank.mjs:34 \u2014 the 4 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. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6316cb76b0487e58e0a3f045ea30effa28afdc5934029fc8dd41c9bbacd45b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/font_rule_candidates.mjs:24 \u00B7 scripts/font_rule_projection_baseline.mjs:106 \u00B7 scripts/font_rule_registry.mjs:117 \u2014 the 3 copies are spread across 3 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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d6136da1cb7b0b526747d05f208eea5c8ae9f7738823ea1fb4c13021e0df01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/font_rule_ledger_evidence.mjs:601 \u00B7 scripts/font_rule_registry.mjs:315 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1caeeeb8e3c1969b9df86599bd5be1801fe51594374059e68aebdaeb9a6855"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/font_rule_lifecycle_audit.mjs:45 \u00B7 scripts/font_rule_registry.mjs:109 \u00B7 scripts/font_rule_registry_v2.mjs:155 \u2014 the 3 copies are spread across 3 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":"scripts/font_rule_lifecycle_audit.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aa74d8f08e6476d18171ab1f458c10e5b00ddcd3c6b9c57d6626bda34b01d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_rule_lifecycle_audit.mjs:238 \u00B7 scripts/font_rule_registry_v2.mjs:1826 \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":"scripts/font_rule_lifecycle_audit.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81efa8342a61af22a032caf92b002151428283133c1b8fc62f62bdf05a23446"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_rule_registry.mjs:12 \u00B7 scripts/font_rule_registry_v2.mjs:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7915b74a0dbc3c3142274914dfcb6de352137a3982cfd3650209d8a8e9818b73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_rule_registry.mjs:346 \u00B7 scripts/font_rule_registry_v2.mjs:217 \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":"scripts/font_rule_registry.mjs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f7c1376f7280eb20dce6b8ad0a8280cd258d6df5b1fc11735abcec2fc12c9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/font_typesetting_risk_evidence.mjs:662 \u00B7 scripts/font_typesetting_risk_rank.mjs:1102 \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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac5b5fcb6f24ff9c1dfaa4397cd6c4336dde9f7a10af275e3e70b2e524a1830"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/kerning_q1_baseline.mjs:164 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:212 \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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac651472e745e7550fa03497fa78563c920d6314f559bdd8e0795add2afd1129"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/oracle_profile_contract.mjs:119 \u00B7 scripts/oracle_profile_contract.mjs:128 \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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9411e7edacc18a7e27f47082692f6c45bef58184c31dc1fd76fd2bf23a89069"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/oracle_profile_contract.mjs:899 \u00B7 scripts/rust-unit-test-tiers.mjs:650 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d01347bba376da7108eaacdbd1c2ac58ebc48ba054482a33b1ef8c27938446"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/rasterize-svg-webfont-workers.mjs:24 \u00B7 scripts/rasterize-svg-webfonts.mjs:468 \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":"scripts/rasterize-svg-webfont-workers.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb70fe701aecccf51a1797e6732b09ebe1ad77c2ddf72c4220cd12d49b36623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/rust-test-suite-manifest.mjs:208 \u00B7 scripts/rust-unit-test-tiers.mjs:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"961a980dfd48ebd6ad9891b86a2fb13dd038f3a71fbe59eec456aa48e0977829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/verify-trusted-postmerge-ci-reuse.mjs:438 \u00B7 scripts/verify-trusted-postmerge-ci-reuse.mjs:453 \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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7471f152ac37167309f7502768504de4f04358ff27cb58b80d5a5f3960790cf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs:16 \u00B7 scripts/export-wasm-png-for-sweep.mjs:198 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd39b9c835aa78aeb95e56b0acdd290becf16c266733325abe000190f87b16f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mydocs/pr/assets/non_draft_20260914_studio-server.mjs:2 \u00B7 mydocs/pr/assets/pr7142_server.mjs:2 \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":"mydocs/pr/assets/non_draft_20260914_studio-server.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8e9981d547bbecbbda751d715ba40a61abe8a837408b57fd1bc5c38aded9c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): mydocs/pr/assets/semanticist21-20261005/kerning-browser.mjs:1 \u00B7 mydocs/pr/assets/semanticist21-20261005/query-geometry.mjs:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 114 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":"mydocs/pr/assets/semanticist21-20261005/kerning-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8162b167f1526af667e9ba2338635c187e52889dded06d759e133ac643d4e3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/hwpctrl-ocx/src/index.mjs:2416 \u00B7 npm/hwpctrl-ocx/src/index.mjs:3015 \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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd327ca49fafbb576dc496faaa129a9d36895965828449a4ab62565eca7bb029"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-safari/src/background.js:73 \u00B7 rhwp-shared/security/url-validator.js:15 \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":"rhwp-safari/src/background.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd204665647974689da90c49e7d11fe146861108c5eeb1dae9a38d7960468b07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-shared/security/url-validator.js:138 \u00B7 rhwp-shared/security/url-validator.js:174 \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":"rhwp-shared/security/url-validator.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6696c03a2ecd5ef1462d01432072472030ce0aa8f07eeadf2b04a8eed5e3d8ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): rhwp-studio/src/ai/tools/write-tools.ts:1336 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1418 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1754 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1788 \u2014 all 4 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b260b6386823c074e68929edb9ef89d40b7fb49c4aa1ae95a5b551427d2f724e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/command/commands/file.ts:635 \u00B7 rhwp-studio/src/command/commands/file.ts:713 \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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"da820699ec4b81be12bd745b3353815711ab06e68eee9f8c8918218c592d9cab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/command/commands/insert.ts:812 \u00B7 rhwp-studio/src/command/commands/insert.ts:832 \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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"6206654b23655c0fa1842887ad7ef01920d9b0eff5450ed6d8560f9ab5d1f50b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:78 \u00B7 rhwp-studio/src/command/commands/page.ts:155 \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":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3933680e7d2fa62e99556ccdea4df8613cedc882555783ecd092ea3a973423b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:1073 \u00B7 rhwp-studio/src/command/commands/table.ts:1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c83f19d9fe9e8a85caeba77b56dc58e14ac1188c2179b40b75a0b810dff1ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/command/commands/table.ts:1084 \u00B7 rhwp-studio/src/command/commands/table.ts:1129 \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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e37e47b725f18e762a9189243ed2bb72bc87fbd92f41545d23712b586e12c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/compare/diff-engine.ts:540 \u00B7 rhwp-studio/src/ui/compare-dialog.ts:556 \u00B7 rhwp-studio/src/ui/history-dialog.ts:523 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988240fc2a3fe70963968ff115aa897af6e13064a8a6e67b9fb0b6337a43885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/compare/diff-engine.ts:667 \u00B7 rhwp-studio/src/ui/compare-dialog.ts:429 \u00B7 rhwp-studio/src/ui/history-dialog.ts:400 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"588f5feb6924e8a80b954ede148d6854531c8a22d04368b54773610517e2000f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/compare/diff-engine.ts:694 \u00B7 rhwp-studio/src/ui/compare-dialog.ts:543 \u00B7 rhwp-studio/src/ui/history-dialog.ts:514 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ebb8288ecd39f94563a8cb79d22d14f8531ce8c796dbaf9ccf60ca465f8857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:1365 \u00B7 rhwp-studio/src/compare/diff-engine.ts:1380 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a86af0af190eb90614c11e115f2401f81e0e334e79aba2c6943d9875fbe67e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2229 \u00B7 rhwp-studio/src/compare/diff-engine.ts:2239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"09520ed6866940f0b12de21177560666c6ea1f73f0db1338829fd76fda3d6b33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/compare/session.ts:23 \u00B7 rhwp-studio/src/compare/session.ts: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":"rhwp-studio/src/compare/session.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeea696b03b23ed1aa75dcd5eeccf60bf8c80330ff37fa10eb3d07537f3d89d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): rhwp-studio/src/core/metafile-font-session.ts:35 \u00B7 rhwp-studio/src/core/native-pua-font-session.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"902f784679cc928589bb6de6cb0a0954fff2136803f6618e9c65eeb950216618"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:850 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3553 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886a4ed786d2194209efce0de332821b945fa0df3eeada37ac04ba9ff0c4e88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1652 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3263 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d47622a00e6e8e15184dec7c9eeaeae8745f7920d766a8e35597165d1221041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2371 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70ac95a85e1bca01dde81c537c19958f358401c232ead2c1e1d754c8c7fbb5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3117 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3129 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dfde16c293ab6c336c1ceb6b5f518a671c82ffedbd803e6138674c0ce8e5d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1852 \u00B7 rhwp-studio/src/engine/command.ts:1913 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"586e5f2b5b86e8f89cde474e6c75a1c6d14b62d41bb0e331d5d0eee076015be5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:652 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:552 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"378439f216eb7d81ec1b120bbfa4cffc694d158c7838cc116bf7ff2af9f01b91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/engine/cursor.ts:2315 \u00B7 rhwp-studio/src/engine/cursor.ts:2352 \u00B7 rhwp-studio/src/engine/cursor.ts:2381 \u2014 all 3 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4543ced9ab420631e40111a5af5da55ea5ffea02f449007a6e4c3ca6e2929ae6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1993 \u00B7 rhwp-studio/src/engine/input-handler.ts:3169 \u00B7 rhwp-studio/src/engine/input-handler.ts:4733 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9a1e37cbbac4e3d6b440f7667dea1890339a1131591b5ab4963760f42bf522"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1446 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8ea1ceb736e31be0f44e50d4ffccc7b5eb3a2b8da5423ffcd8f12784f43b28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:418 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:737 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1392 \u2014 all 3 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c5e8c477e01c1b4e083100d60342e43a2ec1bbe657d7516d7f6ccb4274f061"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:481 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:679 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1574 \u2014 all 3 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab43c3a2065649ae83cc983becf4c330300f6bebd7fb1eb3b9fe7e2982ec70bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:1115 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:754 \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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"543ea7e3ff9faa13af01f10b581b0c7903ee23fe2875d80a5fc6cb7ed6a0ac69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:1841 \u00B7 rhwp-studio/src/engine/input-handler.ts:1885 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"944856c35e5f8e740d19e0b7ceebaf0bbf7cbffde53a14dd9235bae445243c20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:5426 \u00B7 rhwp-studio/src/engine/input-handler.ts:5435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac1627ddb69209bcd94084c95da1a0b29c411436985cd0146857875ff65b29f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/actions/table-edit.ts:15 \u00B7 rhwp-studio/src/hwpctl/actions/table-edit.ts:36 \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":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbed414fec407ba596c5e492b47752637df1b573f8f6453e20d1aa20987dda1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/recent/recent-store.ts:93 \u00B7 rhwp-studio/src/recent/recent-store.ts:102 \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":"rhwp-studio/src/recent/recent-store.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"495385c3d16663fa8313eddc9e11c638a4b176c2374df61519feb944187ab4b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): rhwp-studio/src/ui/about-dialog.ts:70 \u00B7 rhwp-studio/src/ui/options-dialog.ts:135 \u00B7 rhwp-studio/src/ui/options-dialog.ts:160 \u00B7 rhwp-studio/src/ui/options-dialog.ts:261 \u00B7 \u002B2 more site(s) not listed \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":"rhwp-studio/src/ui/about-dialog.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b08699bc5c53178e747f0f22cc4fecc6dd1d5b85042dc2b2f92be69499fbd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 21 locations): rhwp-studio/src/ui/bookmark-dialog.ts:120 \u00B7 rhwp-studio/src/ui/bookmark-dialog.ts:184 \u00B7 rhwp-studio/src/ui/cell-split-dialog.ts:85 \u00B7 rhwp-studio/src/ui/compare-dialog.ts:89 \u00B7 \u002B17 more site(s) not listed \u2014 the 9 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":"rhwp-studio/src/ui/bookmark-dialog.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"86469b9a114405f75b2f9f79e22a569b998c0087a1f9e7b1e73f0250ea40cffc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:599 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ede36e922dce62a00c2e117883083ff4526580cd422331e7ab6d483bb04a38c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:949 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1078 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a93cd75886b1a1065347d8628f90b8d69a8107cb7f5f37c078d885d7f61d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:1017 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1397 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1455 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e47c5ef9d01a376f32685bce2f9bc75397e7432a34721f45971fb5e822f2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/cell-split-dialog.ts:147 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:531 \u00B7 rhwp-studio/src/ui/table-row-column-dialog.ts:94 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8033cb16f1d8d9abfc0b43954baee19cdd1a14a62d1ade246f5322bb03b0ddd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): rhwp-studio/src/ui/cell-split-dialog.ts:201 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:256 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:251 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:374 \u2014 the 4 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. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-split-dialog.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8846be04b069f25bac5719f1cae92781054a0a51d35bf87949e44c3ab859a4fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:456 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:104 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0281a9e4ffd7f71bd48f9af68fabcd3f602f95af26568f88640aa48922ce174"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:590 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:767 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe166b26e0bfa5405c0c06a206a29c8340f02ca88f1ec7abf360bb508360821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/char-shape-dialog.ts:685 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:130 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:345 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28288a086f86c3916ba8ab8496b7c1cc476447da4bbbcf32b1e8e7be875900a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/column-settings-dialog.ts:8 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:11 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e4f8a94d6e59fe06aea3762135fd453f78249d9e67191ddaea32262931103f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): rhwp-studio/src/ui/column-settings-dialog.ts:39 \u00B7 rhwp-studio/src/ui/hyperlink-dialog.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"rhwp-studio/src/ui/column-settings-dialog.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e560cbc0b8a6ff2bdc3f9ed012f278786b80ca63409de97599d66775adc4f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/compare-dialog.ts:132 \u00B7 rhwp-studio/src/ui/options-dialog.ts:100 \u00B7 rhwp-studio/src/ui/options-dialog.ts:333 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25394565455eb99996ce4e725d1b32cc137ba722ca36dcf91b2156c0f5e023a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:266 \u00B7 rhwp-studio/src/ui/history-dialog.ts:261 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"277080d37b0a6d566a31fc3cf04f031fca830575da649ee271c9f54e55391d48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-dialog.ts:347 \u00B7 rhwp-studio/src/ui/history-dialog.ts:291 \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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fddb6a367ab313dff06e1b9244a28694b636a6cccf0a1443241ebce336d4485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/compare-result-window.ts:159 \u00B7 rhwp-studio/src/ui/compare-result-window.ts:167 \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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34c5fc69af6db3cbd88305aac4f3089ba4dd41b33bcd576e770ad07d17a686a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/dialog.ts:70 \u00B7 rhwp-studio/src/ui/symbols-dialog.ts:221 \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":"rhwp-studio/src/ui/dialog.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4107c6f6bfd7a84c18d5b157d631466e3a89b172985a8c673a0ee89a677fc419"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:318 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:108 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:317 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e3dd920596a2eba402f6203b3cce3b8ce2564c52a4fa644da328ed87cd051"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): rhwp-studio/src/ui/field-edit-dialog.ts:112 \u00B7 rhwp-studio/src/ui/field-edit-dialog.ts:132 \u00B7 rhwp-studio/src/ui/field-insert-dialog.ts:64 \u00B7 rhwp-studio/src/ui/field-insert-dialog.ts:83 \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":"rhwp-studio/src/ui/field-edit-dialog.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0ebbd2dfb69e0c5e851be1e4ef584e231c6d77c2d00632d474ecc0acc8bf23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/field-insert-dialog.ts:106 \u00B7 rhwp-studio/src/ui/formula-dialog.ts:146 \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":"rhwp-studio/src/ui/field-insert-dialog.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0167cd36fed86f2de6d42cfc7392a46dce88f756ced60dea126c88c8843014d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/local-fonts-modal.ts:53 \u00B7 rhwp-studio/src/ui/pdf-print-dialog.ts:36 \u00B7 rhwp-studio/src/ui/validation-modal.ts:61 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/local-fonts-modal.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c23de308175688c99c2b08b264c701b44963a57faf09e8b947c234ccdded408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/numbering-dialog.ts:277 \u00B7 rhwp-studio/src/ui/options-dialog.ts:355 \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":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b0ad30dd2d3394a2fa0347c1e29229c48ad30ab2d7a183eeff49250066a69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/options-dialog.ts:87 \u00B7 rhwp-studio/src/ui/options-dialog.ts:255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cea11f0146ec90a0dac3c0c938a59ebaf1224de6e085a6a4a907175ae8656d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/options-dialog.ts:123 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:113 \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":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d3e84157c33cb8affc3283438bdb70785722f191b754a7d676ad677f576a12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/page-setup-dialog.ts:12 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:9 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4e536e914e5c6515715a77ae63c37feaf3543c5fe1a12743cbf0a2659896cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:335 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ab37c6186f3572e8413175cabc20708748b12145237c10c6682976a6998484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:385 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts: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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbd64f313a3dd63d984de5202648ccb70071e4cf0e2110173e9b1bec23d47c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): rhwp-studio/src/ui/para-shape-tab-builders.ts:424 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:442 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:537 \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":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a70b6612ab890dbe3feebcdc715c223cf065f274ae9df68b86989cef27591f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:596 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"485c003463d37d474ca1433244480b5b66bfa5e0ab104bbf427d3ebf2be839ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:729 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:739 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9403daa9d6f2bf13ba5fb207334192d2d7cfecb55b36f23bd0ef5f410f0777ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1729 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4db2f3d86f67e9ce3470744cecbcf2b0f826c7878e459255e6876bd06aa376"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2224 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2380 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cc5ca4a6c75889e91e58aa56ee8ae048047060d2a85976b29dac5968afac0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2242 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2387 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce545fe13a81ea25c85461a21b5be0a84945a5d190af2f8dcb7fabba770d022"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:549 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d0f056cb289c66e3a85c8f8543780dfd2c634fe36030815def419981fb7e9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:847 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:914 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9c731cbd990088f0f44ad4fe1226448e4304c641a6a4f6929a6d9b2e5bbedf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:4568 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:4595 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22f64f5526eb1f016166c18e8590121abeb50c8359a3081b3cb0d6aa495c66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/anisotropic-image.ts:18 \u00B7 rhwp-studio/src/view/canvaskit/anisotropic-image.ts:58 \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":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb6db0ca28139837ba579cfbb783e4e7ade4572125bbb59adecc5b5b9cb0c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/css-color.ts:505 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"91478bf097d988e98ecd499b7d94afbb6cfc6a93441f2334ff314441a0bca616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rhwp-studio/src/view/ruler.ts:538 \u00B7 rhwp-studio/src/view/ruler.ts:548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3913239cbe7cadaff8112297429ff215659a9439ef805d341e71bc2b78ab8a1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/ci-impact-policy.cjs:946 \u00B7 scripts/ci-impact-policy.cjs:1012 \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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb3cdef642ec53dafe877894c9c7be2f03d8b36e9bbda3313caae19e070e320"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/font_decision_trace_contract.mjs:112 \u00B7 scripts/font_rule_ledger.mjs:120 \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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf490812387297a0311a6b9b18ffc9ad42e8f88b00268449030349a593bf535"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/font_rank1_runtime_boundary.mjs:58 \u00B7 scripts/font_rank7_runtime_boundary.mjs:175 \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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1990bb7d313b67b13e39e04c880089be430b0aa8b1ee8a228cbc64760a978c25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/font_rank7_runtime_boundary.mjs:319 \u00B7 scripts/font_rank8_trace_baseline.mjs:339 \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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8ca1f8b0624c1ce43fa8c0a32548ef54b6a425be9a36cd50b3757a4a590ed4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): scripts/font_rule_candidates.mjs:13 \u00B7 scripts/font_rule_lifecycle_audit.mjs:38 \u00B7 scripts/font_rule_projection_baseline.mjs:84 \u00B7 scripts/font_rule_registry.mjs:95 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_candidates.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c59ee2b05059991f21b453eec9df9cfe354461dc57bf27689ebe12c7a3c472e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/font_rule_candidates.mjs:268 \u00B7 scripts/font_rule_candidates.mjs:424 \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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a92823b7c6509215d11f5513982b257b1f2ca31e135fe2222ed0d704b34e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/font_rule_registry_v2.mjs:667 \u00B7 scripts/font_rule_registry_v2.mjs:805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"489b20c8c478285065b4fe2c74b3ef502c09b49f5eedbdca307700182d93742f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/font_rule_runtime_snapshot.mjs:223 \u00B7 scripts/oracle_profile_contract.mjs:902 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"scripts/font_rule_runtime_snapshot.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac2b8711da0213831f6e947ac5cbc00220a22fb3364fe71c76cab1fa2fd655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/kerning_r4e_failure_matrix.mjs:134 \u00B7 scripts/kerning_r4e_runtime_parity.mjs:197 \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":"scripts/kerning_r4e_failure_matrix.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04436aeb837ceacd28f0b584477a9d9d1df9a57ccf33167f476c784cb0ab90d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/verify-trusted-postmerge-ci-reuse.mjs:188 \u00B7 scripts/verify-trusted-postmerge-ci-reuse.mjs:248 \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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b2cc7e0b979f72aa240b6daea4cd6b2c351a76ba0afe6a37463acef40eac8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/verify-trusted-postmerge-ci-reuse.mjs:219 \u00B7 scripts/verify-trusted-postmerge-ci-reuse.mjs:267 \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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46b359c27a77ee8ac9e4782dabe64885c479164647fa3a80746f344af9cb6a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): gym/tools/from_e2e.mjs:364 \u00B7 gym/tools/from_e2e.mjs:816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/from_e2e.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c06ee3cd240d2bc454a6c96416ea98359cc0788c2fdd1a2b8e47d1d8e62c4e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs:7 \u00B7 mydocs/pr/assets/semanticist21_20261105/validation-r5/api/claim-probe.mjs:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"146ce006c83f6273ae29954b1af4b6dcbd908cbbffc806ebe4473381c98506a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-forms.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-open-races.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-races.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery.mjs:2 \u2014 the 4 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. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-forms.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dbab0a918c7c415d41b8bc7fdd69d2d40d1871a6a9d33a24b1f43457494682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-desk/ui/js/cards.js:166 \u00B7 rhwp-desk/ui/js/palette.js:137 \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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f62145596cf611ce0b23187702a8a661c309bac03e5451f7add3f7f5e52398"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-desk/ui/js/main.js:190 \u00B7 rhwp-desk/ui/js/main.js:381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"726624e2704332f71dafd76b05f83aa0f5e526ff7420b8f7542b53117911f950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-desk/ui/js/main.js:459 \u00B7 rhwp-desk/ui/js/main.js:467 \u00B7 rhwp-desk/ui/js/main.js:477 \u2014 all 3 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b4d0e3dbb27e9b37ae9c7e241bb1272dca383da8485b3557bc25b018e0a68c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-desk/ui/js/main.js:471 \u00B7 rhwp-desk/ui/js/main.js:481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e12b3e9fbb6e819d2b013fc564aed5375c5098a505eda56de8c581c96565799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-safari/src/background.js:16 \u00B7 rhwp-shared/security/url-validator.js:40 \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":"rhwp-safari/src/background.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6eadcd170697c6c16cfb530dc08d66d0241cc475a73c0d44b2e57c6f848ffb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-safari/src/content-script.js:481 \u00B7 rhwp-safari/src/content-script.js:538 \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":"rhwp-safari/src/content-script.js"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9e3b5d4e862a59b7cf8a4c4794e61d5e9f55d2d56ac150899601145ca93345"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-shared/pdf/import-worker.js:69 \u00B7 rhwp-shared/pdf/import-worker.js:81 \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":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5ecfdae28e81cf93fbe0e1774f7fa88f0ec1bd1a20ad8e8cfdfbfc853317d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/schema-validate.ts:69 \u00B7 rhwp-studio/src/ai/tools/schema-validate.ts:81 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/schema-validate.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e425a4e37bab427d379dcc2d77d45da5e0e4a1680e5ce4d7b1a51b9d035400fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1167 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1582 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abdbb352c65c1c3378929322bcf63ed8315cf65cbcb3549aa3aee88f565a404"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1188 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1334 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c258774586cf5f06e050ec2561d3ca6347a4736e9e8dc7cce66eca4e697a92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/ai/ui/ai-settings-dialog.ts:113 \u00B7 rhwp-studio/src/ui/compare-result-window.ts:126 \u00B7 rhwp-studio/src/ui/compare-result-window.ts:144 \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":"rhwp-studio/src/ai/ui/ai-settings-dialog.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd5346241a15eb49d585c553e23120f0b43cc7339ffb8aa399636e9ebe37772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/ai/ui/ai-settings-dialog.ts:147 \u00B7 rhwp-studio/src/ui/options-dialog.ts:103 \u00B7 rhwp-studio/src/ui/options-dialog.ts:336 \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":"rhwp-studio/src/ai/ui/ai-settings-dialog.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1321eeef2ea83f8a75fe84e00a5b72614632c556f9688cbc8c3acd808e584538"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ai/ui/ai-settings-dialog.ts:171 \u00B7 rhwp-studio/src/ai/ui/ai-unlock-dialog.ts:30 \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":"rhwp-studio/src/ai/ui/ai-settings-dialog.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"58db70e4b63b1a12447be94a541db89ea9dfb6442a70eead940601abe9f13658"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/command/commands/file.ts:694 \u00B7 rhwp-studio/src/command/commands/file.ts:753 \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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"535be60b6d9929bdc94bd16db1fb369ccdb8527054ded92a1650c76042fe56e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/command/commands/format.ts:468 \u00B7 rhwp-studio/src/command/commands/table.ts:388 \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":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c2add3802951e13c2e6dcc1a4d69d0ccdcc033774fc85d39dfbebaabaf021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12 locations): rhwp-studio/src/command/commands/table.ts:138 \u00B7 rhwp-studio/src/command/commands/table.ts:411 \u00B7 rhwp-studio/src/command/commands/table.ts:488 \u00B7 rhwp-studio/src/command/commands/table.ts:508 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b215b866cf4adad6e737b17fec67ccd29236bb4f60193ec8d2d86afed9b6469"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): rhwp-studio/src/command/print-surface.ts:59 \u00B7 rhwp-studio/src/recovery/recovery-ui.ts:43 \u00B7 rhwp-studio/src/ui/local-fonts-modal.ts:90 \u00B7 rhwp-studio/src/ui/local-fonts-modal.ts:129 \u00B7 \u002B2 more site(s) not listed \u2014 the 5 copies are spread across 3 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":"rhwp-studio/src/command/print-surface.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e979f9249b6b0a96ee212d007a08322473b2350f4e4291c22251314ee99b8705"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/command/print-surface.ts:75 \u00B7 rhwp-studio/src/command/print-surface.ts:144 \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":"rhwp-studio/src/command/print-surface.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"887ac701503d007b144c0b9e29516fe10f37ed95a7ed5838a1fbcc4ca4ff11d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:2818 \u00B7 rhwp-studio/src/ui/compare-result-window.ts:244 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6af806ace22e642057c928729d9225c38a09850c560696b8eb650c0bc947f59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/core/local-fonts.ts:326 \u00B7 rhwp-studio/src/core/local-fonts.ts:335 \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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f0e2084d1450a78f88178f560141253ecfcad06d3382b501225a2cc95bf55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): rhwp-studio/src/core/rhwp-dev.ts:38 \u00B7 rhwp-studio/src/core/rhwp-dev.ts:88 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"373c1f9c2ca80be9feca5f8924d2289161bae70d537d50ce9caaa981c7efb0ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1155 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2842 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e78ab0aafaa0134963cb04602c676858d437c6f45770040d60514b5b861877"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): rhwp-studio/src/core/wasm-bridge.ts:1622 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1953 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1986 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2937 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdb6400cb5c610cbc5773557595ca7d83c3c8078d0599889764080de7cf6ff4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): rhwp-studio/src/core/wasm-bridge.ts:1637 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1991 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3075 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3149 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"7805d86ff2638040a8473b6f7b2f72ee167fb45c4472a69c187638f274f75728"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): rhwp-studio/src/core/wasm-bridge.ts:1722 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2001 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2722 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3092 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7e7d8352385e703329e346c37ca0f306e160b5c4e010ab8261a0978b095189"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:1999 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2014 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3303 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee24b42ce20ea56eeb65e137b3f2806268307bf1d6c5bc0680255233724ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:2070 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2111 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2970 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3325 \u2014 all 4 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba75766821804134db67c80fcb9f33c93472fcf010a2f2021298967ed104cd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:2106 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2727 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2780 \u2014 all 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19145db2abf05c51fb3ee2c58dae1497c0dcb87b8339646f0a498ef0ece7881"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2456 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2621 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8678fd3bc477e23fbaf4ff2bf92c74559b43861e30b6bd62b42acd0270ae7fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2952 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3435 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2952}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee07f3400cf9a5d904152acf5c64c18f5a5d6db126cd4c40965d58499e40e31e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:3097 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3315 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3582 \u2014 all 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003c77cf4ac241cba72df58340407467a650f5123874ecfd50ae40f54980cd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:3246 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3257 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3320 \u2014 all 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4915bab8c5dd6c40cf2006b70e1b964967de93051f9d4f0d4801f0c855319f36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:4141 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:4157 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":4141}}}],"partialFingerprints":{"codehealthFindingId/v1":"615d9822fcde95352e63f2b27ea75fee63dfeeff82474c8daeefa524a35a5ca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:808 \u00B7 rhwp-studio/src/engine/command.ts:929 \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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b81df168567ed76535f5e73aab89ad0fc0356a8b2db3fad0e40c4101ebfff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:1086 \u00B7 rhwp-studio/src/engine/cursor.ts:1203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a55657c895109747469c67d1d2a6eb70b10213632d79e3f909b680b91a9d2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/field-marker-renderer.ts:48 \u00B7 rhwp-studio/src/engine/field-marker-renderer.ts: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":"rhwp-studio/src/engine/field-marker-renderer.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a4a942ff9307a19fd94a8f633688344f57c237a39f71ed0c5b7ded51ecd5ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/history.ts:65 \u00B7 rhwp-studio/src/engine/history.ts:80 \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":"rhwp-studio/src/engine/history.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba2937f66196f683856736ee8cdc340aaf586020ac6152700417fe446e71d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-connector.ts:80 \u00B7 rhwp-studio/src/engine/input-handler-connector.ts: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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"902d504bc08b34c6751633408e01a941679c519f9051c6805c644a4a441a9294"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:2228 \u00B7 rhwp-studio/src/main.ts:1116 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f935004908d67a3a0649daa3a38d42318bc96f97c039998fb4b8ab32ff15024a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:583 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:597 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b5b30afeb634fb731bc29412b102fd55fb7b3bb4adef033540991a416d702"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:812 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ce714750d2a5f0d90e59d351fd3d4c3768498cbe7e9264d8f1d0b69289e766"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1810 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1860 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afbfae9335be74174aca2de561933e179a5c3bdd3c71e1343addf694a89569c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1905 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:1076 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:300 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:763 \u2014 the 3 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7447eb9081d37b3ec9be6b1411303e7c50f3f3c65cde3e47ccd61405220367a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:829 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d9233665a1f83e4f979d07521221be8ab5b8d6460422e6e4b9cf949853a38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:434 \u00B7 rhwp-studio/src/engine/input-handler-table.ts: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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5048c2c3ec26891b073c4942d3e57994b883ea0a4195910eb5c1e01b9491dd35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:639 \u00B7 rhwp-studio/src/engine/input-handler.ts:1399 \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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4376387149f72bcb46151a22fbb974063d864234e699a5b5a3dc279b418255"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-text.ts:211 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:283 \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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1786ef73b1ecfa81dfbf36445b3f49f1bfe5b4207168384654ff0a7e59acf3c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-text.ts:659 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f626d995597871db0d8ace75483eba4d1deed92f322561a01b028c6da15f793b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:3045 \u00B7 rhwp-studio/src/engine/input-handler.ts:3069 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc0170c0f041a5ae0abdc1ee360dd4a1ddac5ff43a20c53642fc90f6ff117dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:3166 \u00B7 rhwp-studio/src/engine/input-handler.ts:4732 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b2351aad82ee11b0bc0381253781e4331e1fd70533b0208fd08eeae3d9f505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/history/idb-store.ts:89 \u00B7 rhwp-studio/src/recovery/autosave-store.ts:153 \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":"rhwp-studio/src/history/idb-store.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"463feae99ca1f84441301db493c628d5d322d60eeff948b0f8ea5c98f321794b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/hwpctl/actions/table-edit.ts:6 \u00B7 rhwp-studio/src/hwpctl/actions/table.ts:15 \u00B7 rhwp-studio/src/hwpctl/actions/text.ts:4 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/hwpctl/actions/table-edit.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ac52f86c7353928e2763d48c879ebc7f678d040a0470a656e0464c47f499f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/index.ts:237 \u00B7 rhwp-studio/src/hwpctl/index.ts:262 \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":"rhwp-studio/src/hwpctl/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"474e84336dbf7a9a099c2f90fb2aca1ff6038b3acca568ffc904719f8dbe747d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:728 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:742 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:763 \u2014 all 3 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"281d424211fc2c2ecd48d9ff7d602b54de46d5eec3b60ec3c36ae52a26dd14ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:756 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:779 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f84c18660f2f2c2fda4b5070cb1a8d71dcd90a609a9d8aec87a0dcd53129bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:306 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:430 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b517db3204a238e45c0746f80074086b103430f23791d2dc41a85bc5623d9af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): rhwp-studio/src/ui/char-shape-dialog.ts:317 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:418 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:484 \u00B7 rhwp-studio/src/ui/char-shape-dialog.ts:507 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"787af799b81d81c0de1446a6ac7d014a09b63b56b61a57147608712c10c234cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/char-shape-dialog.ts:1072 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:936 \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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"3864bdf89eb5aee0088e174409971719ff8d3a8ed9df352253c49fb050feab55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): rhwp-studio/src/ui/chart-data-dialog.ts:113 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:135 \u00B7 rhwp-studio/src/ui/font-set-dialog.ts:58 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:352 \u2014 the 4 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. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f226862dfd6c1fa68d48af9698134dde0e741164343b166e4859e57718a88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/dialog.ts:30 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:112 \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":"rhwp-studio/src/ui/dialog.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3683868382f7c8c6b1020cf9fd32edb2eb13d470273d3715fa0f03fe7210155"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:390 \u00B7 rhwp-studio/src/ui/field-insert-dialog.ts:102 \u00B7 rhwp-studio/src/ui/find-dialog.ts:226 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1060 \u2014 the 4 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. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe42d6373aefcc9cb12b9337e932ce0d1900e40046240ac685cabcfc49945b75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:785 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:32 \u00B7 rhwp-studio/src/ui/picture-props-apply-model.ts:233 \u2014 the 3 copies are spread across 3 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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"145e25820e0675020abe4ad93c727b4c2cd74df38f6ce2c681001b28e7bea544"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/formula-dialog.ts:141 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:131 \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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"de425640f8b680b6b238940b8bf84ce61914ddb1edf59d86c41d51222f1dc2a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/page-border-dialog.ts:144 \u00B7 rhwp-studio/src/ui/page-setup-dialog.ts:244 \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":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"048ba25f6fbe26b1c34c3bf865be23b3620c0ccd53d5e0d90e0370539f637503"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:641 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8889696589e3f7fea1b1fb50a0d8d83984ea1171446e7650b31476b36b9e9b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): rhwp-studio/src/ui/picture-props-dialog.ts:670 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:764 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1283 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1486 \u00B7 \u002B2 more site(s) not listed \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87d9f90537a4dcbeaf45f1b544d77fcdd3faef018c9d40ffcb04732278cf462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1153 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5db363cd719d55ddaa518cc3ccfcd5bf90277b5342757bddd85d189ae8c9576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1310 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1337 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2def4ee1e6ba054a7c97299345e8f44001442fd0d70aa3844afb0403e00213c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1398 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487e84b25479b371a9e2b988ce90e200f759785b39f4c4efd13d418915db258"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2078 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2093 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b259cd0357049f414a75c4624157fb47d3d2d1b7f1076e56e2a7c916b32629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2212 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2364 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5325d60d6178fc1f5351423d286bbfe841964e6d731d0f7ac84b24d5aa161a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/ui/style-edit-dialog.ts:133 \u00B7 rhwp-studio/src/ui/style-edit-dialog.ts:143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b93ef6ffe39d4afa46c83cb7ae153fafaff1ac72aae4dd0852789f3116132"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rhwp-studio/src/ui/toast.ts:95 \u00B7 rhwp-studio/src/ui/toast.ts:116 \u00B7 rhwp-studio/src/ui/toast.ts:131 \u2014 all 3 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":"rhwp-studio/src/ui/toast.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2932cb3ed5fd458903b41766c0c9330ba7590d408a841f8a9868346590a25b1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:2265 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:3091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ff184b7e40125da19cf0b12ccf180f67f100fd57d195642d39ad9cb7e1233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:3119 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:3231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e5c422b59b7be042b4869884caefb4b9e5d731a683170e941c6e9fa4526b61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:5566 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:5593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5566}}}],"partialFingerprints":{"codehealthFindingId/v1":"701a896f4e0c0ba7bb81e75b05ecd85a2e4a876e188af45b76bd39e03424887b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rhwp-studio/src/view/page-scroll.ts:131 \u00B7 rhwp-studio/src/view/page-scroll.ts:149 \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":"rhwp-studio/src/view/page-scroll.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2f118ebbe49d0652828d8a1370c2ee236bb7b754f35053ce5fc69daf388d0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ci-workflow-evidence.cjs:22 \u00B7 scripts/ci-workflow-evidence.cjs:62 \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":"scripts/ci-workflow-evidence.cjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e81ec92527aed0daaabff5c0e5faf870c10b903ad0e583ad5a3c9bf6f80fda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/collect-nextest-target-durations.mjs:116 \u00B7 scripts/refresh-nextest-target-duration-policy.mjs:150 \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":"scripts/collect-nextest-target-durations.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e201d6c91b2b6c2a639fdd033507104de9fad55ad43ad14798a9a2fd7860be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/export-wasm-png-for-sweep.mjs:410 \u00B7 scripts/export-wasm-png-for-sweep.mjs: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":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a7617ee96cfe4a982386267d732d7b12d5c2ae229f1719c94aeaab822a6ce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:209 \u00B7 scripts/font_metric_coverage_checkpoint_finalizer.mjs: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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c70859b265ba3f5975d9dceb41880ca759b9134925657e066f9b9a2d25309ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/font_metric_coverage_contract.mjs:792 \u00B7 scripts/font_rule_candidates.mjs:796 \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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"190311f84343aa2533f3e2279acda2df59eb6df8400b53db0b3a1da4924b550d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/font_rule_registry_v2.mjs:1382 \u00B7 scripts/font_rule_registry_v2.mjs:1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6390508135dfc3db8efa82c66930e73137a406953f842917e60ce71635655d89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/kerning_q1_baseline.mjs:195 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:236 \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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e419ae4639038e527013b15cfdefa955ca9ee347afd4d995e6d0a1b18870e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/survey_korea_downloads_font_jsdelivr.mjs:1048 \u00B7 scripts/survey_korea_downloads_font_jsdelivr.mjs:1055 \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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f94d1a9bf784899dc03d2a6425ead2d9ea843c736dfd24fb47e7bf6d860946b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/verify-trusted-postmerge-ci-reuse.mjs:579 \u00B7 scripts/verify-trusted-postmerge-ci-reuse.mjs: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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc5ad3ecab827c2c3b98b385c63ef07c754d5ec7307b4c2b8397bfad3d1c01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mydocs/pr/assets/semanticist21_20261105/validation-r5/api/claim-probe.mjs:53 \u00B7 mydocs/pr/assets/semanticist21_20261105/validation-r5/api/claim-probe.mjs:128 \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":"mydocs/pr/assets/semanticist21_20261105/validation-r5/api/claim-probe.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"07837e5bb4c930c82e4fd3377787a8eeea4f230667fc4312e08a099199170408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): mydocs/working/assets/issue6042-stage5-correction/summarize.mjs:35 \u00B7 mydocs/working/assets/issue6042/check-retained.mjs:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"mydocs/working/assets/issue6042-stage5-correction/summarize.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d269aa1bbc07bc67ef18750d4f1ac8c48410b358519471d7da0f73ba04f423"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-desk/ui/js/main.js:720 \u00B7 rhwp-studio/src/ui/compare-dialog.ts:77 \u00B7 rhwp-studio/src/ui/history-dialog.ts:87 \u2014 the 3 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. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e1ea3ae04005f6db3f0950ed99e7179476d705cd05a0499d72419342b019c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/read-tools.ts:280 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:825 \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":"rhwp-studio/src/ai/tools/read-tools.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f9f317f21107feff2b601981ff261e934f296c3c9edf68f63cec172ee54d00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:985 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1212 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3e4eaf346ef4bf4295ef9d19c4c9f411ff5c429a44664469029d683c173300"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1427 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1499 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9c1cebdee67bf1939134b2e20412986a40e03a83effba2c3ce7c128acfc560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/command/commands/page.ts:137 \u00B7 rhwp-studio/src/command/commands/page.ts:272 \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":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d018e4276f8cd38d25090a8d21b63383ce06de38938abac6916add6a38cd76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12 locations): rhwp-studio/src/command/commands/table.ts:198 \u00B7 rhwp-studio/src/command/commands/table.ts:413 \u00B7 rhwp-studio/src/command/commands/table.ts:490 \u00B7 rhwp-studio/src/command/commands/table.ts:510 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad917c54747030b57ae7770952fab7db60a64c0c31bd0e1066fea7262c8a67d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/compare/diff-engine.ts:3019 \u00B7 rhwp-studio/src/compare/diff-engine.ts:3025 \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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8261db9e822362e22f2ed2e45f00f2149281b5b368b2cf233a8e4a8a5f323bdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/document-font-status.ts:64 \u00B7 rhwp-studio/src/core/local-fonts.ts:188 \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":"rhwp-studio/src/core/document-font-status.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"10295a2e732c234b4d51b116f207b9892aae7d39eb715e4df5fb63001dac212e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): rhwp-studio/src/core/native-pua-font-session.ts:135 \u00B7 scripts/visual-sweep-font-registration.mjs:187 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a8139dc422d18c4a64592d086d946e9d4a90aeaf020dd4300e010ec566e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): rhwp-studio/src/core/pdf-open.ts:48 \u00B7 rhwp-studio/src/engine/input-handler-form-action.ts:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"rhwp-studio/src/core/pdf-open.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"762a2c0ac5e30bba51804818429728271a4834ff7090568bed529c885ca1024c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1186 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1225 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"199f8613b7b2ca5cef74de25fd2712b8f858d42c51fa7375ae62f0b59433bd5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1425 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1463 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d197a2d374b6832d380852b754bba468ad9a52338524bfbcec5df18245eed3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2124 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2189 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f20d52015dad0b0fe98b18dfda9c5504cbb443b78775cf6d151b99934015b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2280 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2997 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704a283aa12f93ba18351bfe8e56c23766b8fbdabbc8c77d5323885ff48fde2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:3734 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ec1c7116815e322348df7c72bc58373cd3e45ff2005b86bf27292263a9acc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:1968 \u00B7 rhwp-studio/src/engine/command.ts:2088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6d1c30c3e63b9504da0c55ce0e7f85b812aa47bed44a970654fb6e521c0aae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/engine/command.ts:2142 \u00B7 rhwp-studio/src/engine/command.ts:2229 \u00B7 rhwp-studio/src/engine/command.ts:2282 \u2014 all 3 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa0febb67176d5b61ca37bc743b9872abc15a54c5e90fdfa199e9eb3281f77d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/engine/command.ts:2150 \u00B7 rhwp-studio/src/engine/command.ts:2236 \u00B7 rhwp-studio/src/engine/command.ts:2289 \u2014 all 3 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceab0301bb90afe487585339aa3b19f3a68c7c1dc951b9d8acf205a450519ac2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:2334 \u00B7 rhwp-studio/src/engine/command.ts:2340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90553b52f157d1745ad02a27db09fc41f92321ebb0bf65cf61e8c31d8b85611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:1711 \u00B7 rhwp-studio/src/engine/cursor.ts:1718 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1873ad1761c962eafa6a0bbe4055b0c703b17223633adee5da6be6ce69d8ed5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-connector.ts:162 \u00B7 rhwp-studio/src/ui/page-border-dialog.ts:637 \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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2443744d91b0d0248f518bead2e1475f0640b276cdd4bbbbc981fe6d0b01d5e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:302 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:343 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:379 \u2014 all 3 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6064801715973e0abe2a4a630c42df4aa15b265ac151f974a009279f37579f2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14 locations): rhwp-studio/src/engine/input-handler-mouse.ts:317 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:425 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:488 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:686 \u00B7 \u002B10 more site(s) not listed \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"daedcd07e82000c6f143864678418267c1abc0cc42876eeb58505b1d543fef2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:953 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1014 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65435c6deab7b6abd56e54205398ee8314b24a022746a8cc23980e779744cde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1642 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1776 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1843 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1908 \u00B7 \u002B4 more site(s) not listed \u2014 the 3 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"6502b82ca1343dd6aaa9174b9027a1e3b0ffff0cddc44c2ec0f88edf3b7002dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1663 \u00B7 rhwp-studio/src/engine/input-handler.ts:1252 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0232f4291cc9e60eeb56a26f1dd5d4a09fa88e8d4cc0ed05993fdade9d76605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:541 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts: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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ae1e665bfcfd08c1a66d7507f1f27d33df8139010b5a1a5bc6ca59911b14c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-picture.ts:843 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f0bcabf45f6308387b3dbb5f53f8b35b909d5392be2a0b4ff7c442313c06b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-table.ts:570 \u00B7 rhwp-studio/src/engine/input-handler.ts:1371 \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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e307f8980a773e384f1c07d41023da8ee4f77294fa616fd8eb1b5e8a0575d2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler.ts:1156 \u00B7 rhwp-studio/src/engine/input-handler.ts:1421 \u00B7 rhwp-studio/src/engine/input-handler.ts:1547 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d669b9f5afca014ba2b07431f81a0d6fecce639e8bc4dbbf04dcfffc076965"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler.ts:1799 \u00B7 rhwp-studio/src/engine/input-handler.ts:4370 \u00B7 rhwp-studio/src/engine/object-selection-page.ts:33 \u2014 the 3 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32a0a553c09093d4db9764e3e3105c7b9d593c7a5ffb81a8b915d22ced87fb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:4110 \u00B7 rhwp-studio/src/engine/input-handler.ts:4348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab5f11dddf6c09c58107d433853a5f5aa937cf1790192afe0277b2b26f8ba7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): rhwp-studio/src/ui/char-shape-dialog.ts:696 \u00B7 rhwp-studio/src/ui/endnote-shape-dialog.ts:167 \u00B7 rhwp-studio/src/ui/para-shape-tab-builders.ts:193 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:727 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edab0fd715ccb59e62a38e3d1d7f43a0bc2291286b40be8672feadc26fdc6a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:700 \u00B7 rhwp-studio/src/ui/endnote-shape-dialog.ts:707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aefc92a716ca0bb67b87b391e4e52440e042677e80be950265defc15121738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-editor-dialog.ts:454 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts:157 \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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc695aee6c011f33b2fc2dae2bd705c6988d89e2108518d0ee8a01e9bff75d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/equation-props-dialog.ts:282 \u00B7 rhwp-studio/src/ui/equation-props-dialog.ts: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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"887d0d1bb94e2670e4e17491d7fcc7eb5397b7e27166ec634c678cc90657ae1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/find-dialog.ts:496 \u00B7 rhwp-studio/src/ui/find-dialog.ts:521 \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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"461c7aca329f84ec210d32849814b758b14ac83177df27e11c245099aaa3dbe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/font-set-dialog.ts:36 \u00B7 rhwp-studio/src/ui/font-set-dialog.ts:43 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/font-set-dialog.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7236011c910ee45d7e9540eccd8c4f1f11ad047aa0b51b89191567f59f8eac1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/ui/options-dialog.ts:112 \u00B7 rhwp-studio/src/ui/options-dialog.ts:276 \u00B7 rhwp-studio/src/ui/options-dialog.ts:295 \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":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"468f6561d81b6fcef678174828c6133ebe2d07d885823d9499ece95df5f8df18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:560 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts: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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f910723cc5f49b698a4d47ec8a895b300016053c4881dc4e183023a1073c98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): rhwp-studio/src/ui/para-shape-dialog.ts:746 \u00B7 rhwp-studio/src/ui/para-shape-dialog.ts:791 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8423c477e4f8227fe42397cb2413a8fbb326f34b696c394bdbf096893f707e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 13 locations): rhwp-studio/src/ui/picture-props-dialog.ts:621 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:657 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:709 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:851 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ac844da21b094a680b459f86963a20fd1f6f79ba7991a058d27e4d848cb714"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): rhwp-studio/src/ui/picture-props-dialog.ts:855 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1046 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1077 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1252 \u00B7 \u002B1 more site(s) not listed \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e95ae09cba7d1d50367beed3f1fe97627ea37ce490b1a63c7e3dd53bf2da77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): rhwp-studio/src/ui/picture-props-dialog.ts:953 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:989 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1214 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1495 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1284b5f2e8c37e60a5afe00d25977b0b8bbe48a15cfbe4c96be8f13fcb1006"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1085 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1168 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1183 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:513 \u00B7 \u002B1 more site(s) not listed \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4af3f092f0c9fac7b505e793d72968dd1502045b22bb17aca68e69e119e0ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1199 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1334 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1356 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e20ae23363d45527392416fbc587c672d8e126c4bb0b359f6979425391b2a14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1321 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d733baff53f39b3d6dfd44c32ccc11d43f28091086e54841f4a7140f91636"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:2400 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2407 \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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f989bc8d663447fb873e8c731ff119f22893b1387e2fb8bdc074c2bec6f7d587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/section-settings-dialog.ts:84 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/section-settings-dialog.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"248f10346174f413c12b97c93993debc7cc4f2f35db037598ff55f1af70278b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/symbols-dialog.ts:265 \u00B7 rhwp-studio/src/ui/symbols-dialog.ts:351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/symbols-dialog.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cc8969f9751bb81e8c9dc6c7b660e0ab1fe5a2bf571302aa8e23ce92c64633"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:528 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:547 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:736 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:743 \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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171325864979549f6912ac242ff13f069797a6f69e7820744edfd24a45b55b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/ui/table-cell-props-dialog.ts:1027 \u00B7 rhwp-studio/src/ui/table-cell-props-dialog.ts:1033 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da861a7ad316361f894aa9fb2054bbb8095cad004da6f8c3a200e24c18cdd2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/view/canvas-view.ts:1108 \u00B7 rhwp-studio/src/view/page-renderer.ts:667 \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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c633c0bcc88a03b16fbb1e4b9240493cfeaed58c4a0fc62a45bdb1bddd0f4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rhwp-studio/src/view/canvaskit-renderer.ts:2771 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:2782 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:2793 \u2014 all 3 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff58e9e8223f9d42218c9bd3e959f38c163b920a714ded3ea31cd5c6ce31406f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): rhwp-studio/src/view/canvaskit-renderer.ts:4117 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:4125 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:4179 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:4187 \u2014 all 4 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d622be3832196cd10d7ee74b54bebca164fb6b6fb5d35b80a00e5f392bcd9296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): rhwp-studio/src/view/canvaskit/css-color.ts:189 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:219 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:328 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:345 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"da75af7dfe124848e65034703e49ffc46e45bfae87efbe790bcfea51a6acae0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/image-reduction.ts:31 \u00B7 rhwp-studio/src/view/canvaskit/image-reduction.ts:49 \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":"rhwp-studio/src/view/canvaskit/image-reduction.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17172fffabdaeb81607c317282c5288410fcdd18af1b7e36716446ca309b218"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-studio/src/view/glyph-outline-payload-status.ts:536 \u00B7 rhwp-studio/src/view/glyph-outline-payload-status.ts:546 \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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae460dcf300a078b100fed253a8e9bd3ab413550d14123574bc3df2cef23d5a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rhwp-vscode/src/webview/viewer.ts:793 \u00B7 rhwp-vscode/src/webview/viewer.ts:803 \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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad7240de111f968ae90e52610cda604c3c71bc7fbe520d2d72797e1587b7239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/ci-impact-report.cjs:192 \u00B7 scripts/ci-impact-report.cjs:237 \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":"scripts/ci-impact-report.cjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0275deb66a94ace5e1de3d80ee2d7ff0412141357b500da03be08f28135c6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): scripts/font_metric_lineage.mjs:169 \u00B7 scripts/font_metric_lineage.mjs:188 \u00B7 scripts/font_metric_lineage.mjs:216 \u2014 all 3 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6c18861568db993b988e3f8b2ae5e18b88bdc254037457d7f79c4f55b7d51d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/font_metric_lineage.mjs:175 \u00B7 scripts/font_metric_lineage.mjs:206 \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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaffbbc969d407103eaa1fab22d01c9e380acbaea2e617750baae272c2497e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/font_rank1_runtime_boundary.mjs:52 \u00B7 scripts/font_rank7_runtime_boundary.mjs:166 \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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0012a2199470ccb9c015a5379fe7403c94c09278b95187442f75e3c023960f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/font_rule_ledger.mjs:674 \u00B7 scripts/font_rule_registry_v2.mjs:163 \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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83a0e5feb4299918b7ed1d31a08ba951f8c6628c4dafccde265f36dde5105e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/font_rule_ledger.mjs:683 \u00B7 scripts/kerning_q2_fixture_baseline.mjs:115 \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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a61d15056ba3e5c44e28590a3b399f7736fd211d7582b79304de5e5eb7f5012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/kerning_q2_fixture_baseline.mjs:71 \u00B7 scripts/kerning_r4e_runtime_parity.mjs:24 \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":"scripts/kerning_q2_fixture_baseline.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1005448fb558be538bdc31a1d4547367df3910d7197128518893a55f5195898"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs:14 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/performance.mjs:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a1f92c23ac7a1da263c05abfc35bfc4fd202d4ce0e20727e44c4f2b6a431bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs:8 \u00B7 mydocs/tech/investigations/issue-3587/probes/import-plan-recipe.mjs:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2b0b78c8319962711b60aace1853837b472e799645345cbc1c35a15df669ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8 locations): mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-forms.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-matrix.mjs:2 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-production.mjs:2 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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. There is one copy in each of 8 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2de33198a03e6ab2524e29c42ed409a6554ffbe5ec757dbb72c021703b84d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs:13 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-matrix.mjs:13 \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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e949ef9a133d6d19f568039840b653718633924fe587e5a9b9ad627297ea0c24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs:24 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-matrix.mjs:25 \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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d302925189751bd58a6c71600fd1c2559c83deb2921075ae60689b10bd0b48e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-distribution.mjs:4 \u00B7 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-svg.mjs:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-distribution.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fe52c2d8088973c7ecbfeb57fd8667be8deae69701d17a96e4b71fa3819caa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mydocs/pr/assets/semanticist21-20261005/browser-review.mjs:6 \u00B7 mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs:5 \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":"mydocs/pr/assets/semanticist21-20261005/browser-review.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d95ed6a47c7bf090704d40c307d2244e6359698f0647d917a1d748fd278759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs:27 \u00B7 mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"13115c5243e453e58f48e290ab81acf25b43d4d476c17d5f9d4112b442afe9db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 16 locations): rhwp-desk/ui/js/cards.js:209 \u00B7 rhwp-desk/ui/js/cards.js:229 \u00B7 rhwp-studio/src/ui/bookmark-dialog.ts:93 \u00B7 rhwp-studio/src/ui/bookmark-dialog.ts:114 \u00B7 \u002B12 more site(s) not listed \u2014 the 10 copies are spread across 3 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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea11447529b5453644f3ce6ca25ee0bbbfaa1feec0f22007ab15ee46120a0e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/read-tools.ts:25 \u00B7 rhwp-studio/src/document-agent/controller.ts:29 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/read-tools.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb49e0dc2262d2aa5087ccce5e680b77977c4a01963da7ca1295937f8ab943a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1320 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1994 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eeb6ca5c1bf64a05aa5254936fd87001705ae46d9a9f3b4af0584a02ee0a54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): rhwp-studio/src/ai/tools/write-tools.ts:1359 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1809 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1834 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1995 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc4dd6fa8d913559989b350dda69464b12b1bdd5cc01e3bb5445d35b68ba60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1554 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1685 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7e9ec705990e336a617ae299b27f7b4e44956ff1347c1ae8f456b3f55ff58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1564 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1720 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5e2d5296f8374ade36017062619c8e41a219315003c702711301e5f5271d46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/tools/write-tools.ts:1774 \u00B7 rhwp-studio/src/ai/tools/write-tools.ts:1808 \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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a658286f66d13c575606b90a3a5cfe18314751eabdac1c52c4c806da665612"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ai/ui/ai-panel.ts:172 \u00B7 rhwp-studio/src/ai/ui/ai-panel.ts:189 \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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01bcdd1558b82701cf1612598bf557395ab4fa5437c5fc7437a995bf161ea6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/host-font-requests.ts:33 \u00B7 rhwp-studio/src/core/host-font-requests.ts:132 \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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54bccdfc745a3574ab02c3d3fc13a6a5f4b61d92559089c95115f34d848c854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1490 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:1657 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7954817f1d73484170336c18ac78f6661d42a75467cba7a6cd78f5096be92c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1681 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2285 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bed155faf82385c835082c5ac67c2fdce4e1505ffc4e9f7fd6789e1f3915bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): rhwp-studio/src/core/wasm-bridge.ts:1699 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2073 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2098 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2114 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fbef3878c729fadab9e9212531768e9954e3ac6d656e432df20e5e38e4f592"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:1969 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3090 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3162 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f90186b673ac6c81788c7b6a0e47b3c503c22df257c8305e0e43236eb4c380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:1979 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3313 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db356f645c027ed1a82296c7cecc28bd93907fce8aefc79bef3200e4a4623ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:2009 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3095 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3147 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3580 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c1a3a35fb999f49b88a53acbcf69409d627302afac6eff1594ef3674bf413d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:2016 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3193 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3290 \u2014 all 3 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eee3886d3b151cc9f2978e869b10031dccfcf61b03a92e9e9ac7cebd785a537"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): rhwp-studio/src/core/wasm-bridge.ts:2092 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2109 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2401 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2730 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd647d65c187c8f1c1a932bd645d93d885f6a08d1b6d9c0a5553e0440c0b8048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:2256 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2297 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2629 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2778 \u2014 all 4 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3549547b694e4c9f4714b74875d5ee750a50ce7d654c02ab17d8858478a1782b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2391 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2413 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b6f0ab025008196a705d7ccb7ad9c153a0920eec85e581ec203e60a7947c2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:2625 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2775 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0610387231d40929ac9716a89f858739efb3db57e1d4710b9f680cf2ad3c3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): rhwp-studio/src/core/wasm-bridge.ts:2773 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2830 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2855 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2955 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba43d7dd3298426ca78a6f0e3e226299d05c87e84657bb3ffca1bf38afbc2061"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:2825 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:2872 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3063 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3444 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b58d51945854624bc653f346eaf606fa77a38d7615820da65cb440fd1de3723"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/core/wasm-bridge.ts:2937 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3075 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3211 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3331 \u2014 all 4 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09e25312a18c6c80288e8444ade77115daf6a073c9bfa081c41f870e5497969"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:3085 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3157 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3244 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32cd4b2947b61f06ecdf47e57c63cc877ec0a4c434ec13b3c4ef2030ae2453f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/core/wasm-bridge.ts:3426 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3734 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:3880 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f9375d800fe2e23ddb00a7cf8cd0311187dbef844b5fa272fcd8d28a9301b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/core/wasm-bridge.ts:4052 \u00B7 rhwp-studio/src/core/wasm-bridge.ts:4112 \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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb24d11d2c88a89a6768296f0b141a7a949bcfb3e1f840c99b287a1fb9e001"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): rhwp-studio/src/dev/page-scroll-probe.ts:551 \u00B7 rhwp-studio/src/dev/page-scroll-probe.ts:565 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa25eab17334a255005fbed0783659492ee45c95430612f24be884674f7552b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/command.ts:2395 \u00B7 rhwp-studio/src/engine/command.ts:2401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a2dbe784fa24f676c9a9e01526610ff594adb2bf2472d47b222865d7a7b856"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/cursor.ts:444 \u00B7 rhwp-studio/src/engine/cursor.ts:462 \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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f360614a600b713866c449572ad3288b3284f09bc04bbc8bdc2f1aee8d006462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/history.ts:140 \u00B7 rhwp-studio/src/engine/history.ts:259 \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":"rhwp-studio/src/engine/history.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8a4d795e5426cabd854997b8be776d45486c52966d9aa63f0880b8d77d82ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:64 \u00B7 rhwp-studio/src/engine/input-handler-keyboard.ts:108 \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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146c9591ff55e25940b12132a88aa8682fa7518592b86af4cb46b57a90bf860"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-keyboard.ts:1856 \u00B7 rhwp-studio/src/engine/input-handler.ts:5692 \u00B7 rhwp-studio/src/engine/input-handler.ts:5720 \u2014 the 3 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"f864f9c52de2aa50ac8cccbc757733d78ba3050dfca956a0abe7d6e9ed86e7e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:599 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:625 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76ee693b8914349f1344aa3ffc8ef057d7112fa3f9db8b681ed23e20948bc46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): rhwp-studio/src/engine/input-handler-mouse.ts:688 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:825 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1815 \u00B7 rhwp-studio/src/engine/input-handler-table.ts:604 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb16ae55d3684f5d5818ad8414c4fc78c909d675cb099b561470c7ab4daf6b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1527 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b03ee36051cc7e23d82901d9bfdda2113018e698059cca5f3495b272dbb37cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1658 \u00B7 rhwp-studio/src/engine/input-handler-mouse.ts:1676 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:869 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa9054d1bb35ac26c004606e6981b6c2cc282b455e133e011a578df2aad2771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): rhwp-studio/src/engine/input-handler-mouse.ts:1674 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:865 \u00B7 rhwp-studio/src/engine/input-handler-picture.ts:974 \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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce6a1538119ae53aa4e0d7621665c997765c96a35fc4e367e81ec3bcd2acfc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler-text.ts:405 \u00B7 rhwp-studio/src/engine/input-handler-text.ts:628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed92d5fc0bbb8c121703a623f1ec5536131d4d8a25466e9a380607ca311cf4ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:1826 \u00B7 rhwp-studio/src/engine/table-border-hit.ts:19 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8fa85f8f6891caddd906293cdc7e0463ebb7403676f4dbfe7dfb1d6b17d9b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:2377 \u00B7 rhwp-studio/src/engine/input-handler.ts:6267 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c36a0b63092c20f59562be453fc8b1b222b8f66355d0b32bf4ae9f1a999dea6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:5818 \u00B7 rhwp-studio/src/engine/input-handler.ts:5857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5818}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd084adc8f72b77881bdeba5dadfe3d38f3f6f394c6528a756d3eb90986d7df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:5935 \u00B7 rhwp-studio/src/engine/input-handler.ts:5940 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5935}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b9d36d268c033f0b28b0c88b16d783445bc6a5e1cdb056a1b54f87171698de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/engine/input-handler.ts:6616 \u00B7 rhwp-studio/src/ui/toolbar.ts:205 \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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6616}}}],"partialFingerprints":{"codehealthFindingId/v1":"de727cb141fe5421560751558868e93f123bd910cd7de5ead4bf5e38c46f0e55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/engine/input-handler.ts:694 \u00B7 rhwp-studio/src/engine/input-handler.ts:4705 \u00B7 rhwp-studio/src/ui/icon-toolbar-scroller.ts:362 \u00B7 rhwp-studio/src/ui/style-toolbar-overflow.ts:192 \u2014 the 3 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b1a77c5be2b12455b6f5073680b2bc11de626ed043e467e1bfa3c797f825dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/hwpctl/actions/navigate.ts:26 \u00B7 rhwp-studio/src/hwpctl/actions/navigate.ts:45 \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":"rhwp-studio/src/hwpctl/actions/navigate.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"254cf9cb5394bb7f8cb82cf5655a26ac7530ed52dbb87dc4b0b6f5772e3da61d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/cell-border-bg-dialog.ts:892 \u00B7 rhwp-studio/src/ui/cell-border-bg-dialog.ts:898 \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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285286f1bc78844c7754afc03980c2eda9a195bce26e02dfe7370850acdb8ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/endnote-shape-dialog.ts:714 \u00B7 rhwp-studio/src/ui/endnote-shape-dialog.ts:720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9521874edba70bf983b2edd244d2a53cd010c9d86ed3bb2395fd7e436f1b904"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/formula-dialog.ts:104 \u00B7 rhwp-studio/src/ui/formula-dialog.ts:123 \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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec25a0c0b2ea1dedbd40ae7fbbcfbae3ffde7ececad01641af50036833dcf14e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1225 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:2335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f38da87696041365df788f4f667019c2bb14f820a7fb0b7de3b27dd811729c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/picture-props-dialog.ts:1536 \u00B7 rhwp-studio/src/ui/picture-props-dialog.ts:1566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02aaf53837c6bdb51b16beb44395a53c57028b29222c522a59c1c1a40d51865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/ui/section-settings-dialog.ts:328 \u00B7 rhwp-studio/src/ui/section-settings-dialog.ts:361 \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":"rhwp-studio/src/ui/section-settings-dialog.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b704ac2621deb4d39c83ee5ba30fdd169445eaa5b6c4ac233ed5ff6b77a56a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit-renderer.ts:2362 \u00B7 rhwp-studio/src/view/canvaskit-renderer.ts:5889 \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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"997102ebae443aa5932c5c0d5aa15d9db6e358554943800b3f64c6671d0c04b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): rhwp-studio/src/view/canvaskit/anisotropic-image.ts:31 \u00B7 rhwp-studio/src/view/canvaskit/anisotropic-image.ts:67 \u00B7 rhwp-studio/src/view/canvaskit/metafile-print.ts:43 \u00B7 rhwp-studio/src/view/canvaskit/print-image-sampling.ts:47 \u2014 the 4 copies are spread across 3 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":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"48db3a2245e1b43b1f292088b402ab9dc515de9cbecd9082049a09490e9020df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/view/canvaskit/css-color.ts:440 \u00B7 rhwp-studio/src/view/canvaskit/css-color.ts:458 \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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec914b3f095b3cead90594e3343473fc6fd722f6670661be85356c13c817334"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): rhwp-studio/src/view/virtual-scroll.ts:439 \u00B7 rhwp-studio/src/view/virtual-scroll.ts:451 \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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"98096927ef2fea3f1a520826c83d48e5edd3d092a6456fc30565bd01ac2870d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/export-wasm-for-sweep.mjs:12 \u00B7 scripts/export-wasm-png-for-sweep.mjs:14 \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":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"94726b5f3e10b9199e82835bdfef4d0418154c1ccce75cb4fa70593d6c9aa8a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/font_metric_coverage_checkpoint_finalizer.mjs:182 \u00B7 scripts/font_metric_coverage_full_manifest.mjs:293 \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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdd9bebd0a8e9b33b33252f3c32e6c69bae7c9716499d0f8ddf82a1bdb0017d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/font_metric_coverage_contract.mjs:707 \u00B7 scripts/font_metric_coverage_contract.mjs:719 \u00B7 scripts/font_metric_coverage_contract.mjs:724 \u2014 all 3 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0470d2e3304444e861141b0d8aa9848d059882da578341210adf7aef543936e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/font_metric_coverage_full_manifest.mjs:42 \u00B7 scripts/kerning_q1_baseline.mjs:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8a94e754861342ae6eb10f32589cb4546e455ecb3f2adcd0cf3760ef8e99a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/visual-sweep-font-registration.mjs:164 \u00B7 scripts/visual-sweep-font-registration.mjs:248 \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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f7f6ad382957baa9b4094969abb60775106411d755f29c7b828220ca8bc45f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: mydocs/pr/assets/pr8300-maintainer-20261101/browser-review.mjs:5 reaches into another package with a relative path (../../../../rhwp-studio/e2e/helpers.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr8300-maintainer-20261101/browser-review.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b828f04da30b1660e9d9a5ce50455536ef5e0ef95f07f75b27728da814447d1c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: mydocs/pr/assets/pr8300-maintainer-20261101/browser-review.mjs:5 imports rhwp-studio/e2e/helpers.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr8300-maintainer-20261101/browser-review.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b18d8dc9e6b075061dfec8a3f490ae9a01394a8bcbf1486bf6a61e88f4be3a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: mydocs/pr/assets/pr_7487/reproduce-wasm.mjs:6 reaches into another package with a relative path (../../../../pkg/rhwp.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/pr_7487/reproduce-wasm.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20908ca97b8fc80a6d79b7143f9162eb97b9a31c546f0c73a1404b631b689ac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs:5 reaches into another package with a relative path (../../../../../rhwp-studio/e2e/helpers.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33e0ba8c9a3eae8a84f1278c5da28fb550e520d6785164bbb757febef4bc2b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs:5 imports rhwp-studio/e2e/helpers.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d091aaa3274674e513e0933f49cfd1e0484658239dd6248fedd4be1ee3033115"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-shared/pdf/import-worker.js:2 reaches into another package with a relative path (../../pkg/rhwp.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2bca748052ad2f6b19876b6c8fcb2583f0c0dd2cc21cba635062fe2d6507c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: rhwp-studio/src/ai/provider/claude.ts:18 imports @anthropic-ai/sdk/lib/transform-json-schema, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/provider/claude.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0294bfcb371d2f6f062857f66a3bf72f6b0f8620d3dadeda3d07b98acf10b51"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/core/pdf-open.ts:3 reaches into another package with a relative path (../../../rhwp-shared/pdf/import-session.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/pdf-open.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa6aecd8c43023eb5a87a6d8e03be3dd78c9119a91032397582c2b2fd006be3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/core/wasm-bridge.ts:4074 reaches into another package with a relative path (../../../rhwp-shared/forms/action-runtime) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":4074}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5fe7f2b8e46f3a7b5848a958b58213b2c957360f748a52cb557647c5bdcb67"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/core/wasm-bridge.ts:4078 reaches into another package with a relative path (../../../rhwp-shared/forms/action-runtime) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":4078}}}],"partialFingerprints":{"codehealthFindingId/v1":"69251546034d14a37f6cfa9a94137fbe5110dfa9b65a26785439ec98c4c8c73e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/engine/form-action-worker.ts:1 reaches into another package with a relative path (../../../rhwp-shared/forms/action-runtime.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/form-action-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f2682af95f30172524be2a1b51563aac18522d6fe9d315863eab94e3be79e7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/engine/input-handler-form-action.ts:1 reaches into another package with a relative path (../../../rhwp-shared/forms/action-runtime) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-form-action.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d6e735dbffd6b07c497dc984288bddef5449f44f643e416385d248865b5350"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/engine/input-handler.ts:3 reaches into another package with a relative path (../../../rhwp-shared/forms/action-runtime) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9939de82309de9734b63b6f20a1077961adcdc79add118c351b597664b02a7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-studio/src/ui/pdf-import-dialog.ts:4 reaches into another package with a relative path (../../../rhwp-shared/pdf/import-session.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/pdf-import-dialog.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa633b53282c49e0dbb40ea144be11ae8e391faccdd7ce53f16ae4ec86a83e86"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: rhwp-vscode/src/webview/canvaskit-wasm-url.ts:1 reaches into another package with a relative path (../../node_modules/canvaskit-wasm/bin/canvaskit.wasm?url) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/webview/canvaskit-wasm-url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438b37a9727c4ef38fa220a86a7dd304e921b5d09dcbf7f320faafc4bfae8026"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/font_rule_runtime_snapshot.mjs:8 reaches into another package with a relative path (../rhwp-studio/src/core/font-loader.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_runtime_snapshot.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f367af65fa6ad778e706545840b903105b0a9db5f583c02451fad1dfdd6d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/font_rule_runtime_snapshot.mjs:14 reaches into another package with a relative path (../rhwp-studio/src/core/font-substitution.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_runtime_snapshot.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f95eee17ec721cfe8cc6ee2a5aa3ef2e49625cb4d36c64132a4eeb5eedc29f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/visual-sweep-font-registration.mjs:1 reaches into another package with a relative path (../rhwp-studio/src/core/canvas-intrinsic-font.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bfc1ab744c9b7299333a5c2b19132ca0b4a3e5230415844e985ca37523278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 293, cognitive 481): onKeyDown has cyclomatic complexity 293 and cognitive complexity 481; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"241eaf279da16f35942d549d4694d5a49575feba584826f461c37a3e295c3ba2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClick (cyclomatic 251, cognitive 529): onClick has cyclomatic complexity 251 and cognitive complexity 529; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9dab3c31c07bbcba6a4339ce3378c36253de0435f5b4ad43a768a126fa164f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTextRun (cyclomatic 145, cognitive 163): renderTextRun has cyclomatic complexity 145 and cognitive complexity 163; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a181d7e5fc9ab60e4cbfdff41fe28ead821bc0181595560a540b6c428debe056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateFromProps (cyclomatic 143, cognitive 256): populateFromProps has cyclomatic complexity 143 and cognitive complexity 256; 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb5b4585484003011e86366e447bbbfc47f434c1f342fc347b98d97669107ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEquationBox (cyclomatic 134, cognitive 122): renderEquationBox has cyclomatic complexity 134 and cognitive complexity 122; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddbd4425efb92e7fa3e73cc0aa7ad27d6d12e21cf28064e6adfeadd833077ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectRun (cyclomatic 111, cognitive 161): inspectRun has cyclomatic complexity 111 and cognitive complexity 161; 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":"rhwp-chrome/e2e/report.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8664c973285ea752a4be24db34a38c4dc7c99aa8e3ee49be8bafa449a25f10f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePngBuffers (cyclomatic 104, cognitive 172): comparePngBuffers has cyclomatic complexity 104 and cognitive complexity 172; 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":"rhwp-studio/e2e/helpers.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a748466b319872081bd7f2e364d7b64ff9cc1acb8b47bd39ec80aef0bffef4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStaticSvgFragmentLayers (cyclomatic 97, cognitive 139): parseStaticSvgFragmentLayers has cyclomatic complexity 97 and cognitive complexity 139; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba0fb6b685c4c24a723e0df8d47b0d9cc88ec255bbdbc0d5d7512ccdc61468d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectMods (cyclomatic 95, cognitive 95): collectMods has cyclomatic complexity 95 and cognitive complexity 95; 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b335d0b6f42f56220f65949c0a3dfa900283b3c296c8a02d132888b6fb582a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateTrustedPostMergeReuse (cyclomatic 94, cognitive 96): evaluateTrustedPostMergeReuse has cyclomatic complexity 94 and cognitive complexity 96; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f1d28a7aa9b80be55bb376ae244befaba313600393a76d86af745f9a5cbe0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayStatus (cyclomatic 93, cognitive 86): replayStatus has cyclomatic complexity 93 and cognitive complexity 86; 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16ad4514ceae5bf211fb7a840e946091c6604e31b10d9b9b49e2d89df1a50c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTypesettingRiskContract (cyclomatic 92, cognitive 78): validateTypesettingRiskContract has cyclomatic complexity 92 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 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec13e1aad17f7b007eefbf7b566ed71b78f9d89430a928638813f3e1acf76ac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectMods (cyclomatic 85, cognitive 84): collectMods has cyclomatic complexity 85 and cognitive complexity 84; 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6ddd209bc36b5d8e8f5582fbd2bb7e910cc8bdf287c42160caddbfc1497569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillSnapshotFromWasm (cyclomatic 84, cognitive 117): fillSnapshotFromWasm has cyclomatic complexity 84 and cognitive complexity 117; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"720b8fcf96207019ffb4cbfa8a59cd28aa03d0d87c053f020422423b46829e91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGranularControlDiffs (cyclomatic 82, cognitive 62): buildGranularControlDiffs has cyclomatic complexity 82 and cognitive complexity 62; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e74d8a8317daa7aeaea3ed31bdb550ead244ef47670bb85ab82aede07adcdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRegistry (cyclomatic 77, cognitive 100): validateRegistry has cyclomatic complexity 77 and cognitive complexity 100; 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":"scripts/font_rule_registry.mjs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c3bb10f0bc75f8332dcdb579d9781cf9cb35b6b2280595e103aa035059085e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Run (cyclomatic 76, cognitive 118): Run has cyclomatic complexity 76 and cognitive complexity 118; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f7f13a6f7c4867db3f8ea752cd71d5f1d46423a86c1fcde84f1de82f328beb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMouseMove (cyclomatic 74, cognitive 140): onMouseMove has cyclomatic complexity 74 and cognitive complexity 140; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ef48f02518530fa0ff2544e4d2dba4779769cbf970ce54ebee212a11e957b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSupportedCssColor (cyclomatic 74, cognitive 102): parseSupportedCssColor has cyclomatic complexity 74 and cognitive complexity 102; 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":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"91af600ad73fd83fd78a1ea8b09575d0763d09fb25b859e5e46691abf745fceb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 73, cognitive 18): (anonymous) has cyclomatic complexity 73 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 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5632312c4008d33ec7589af3c43b1f7411da587402079901ccfa6fc29bd2b811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 68, cognitive 70): (anonymous) has cyclomatic complexity 68 and cognitive complexity 70; 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":"scripts/tests/pdf-import-wasm.test.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fbdb4cff6598c4b0d3bf559bf801ebea4a2238972aa2391ee5d8e0b969703f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOracleProfile (cyclomatic 66, cognitive 95): validateOracleProfile has cyclomatic complexity 66 and cognitive complexity 95; 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb306ed92efa0047a5e6fdc4f656023cb8970bbbf3c959c68ebb6be69ca1465e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCompletePng (cyclomatic 65, cognitive 80): isCompletePng has cyclomatic complexity 65 and cognitive complexity 80; 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":"rhwp-chrome/e2e/png-integrity.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadd1ecbc277a8a7b3f3dbc1728dee55d083d033638bfe4bf70a90d39133b48c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFontFaceData (cyclomatic 61, cognitive 66): normalizeFontFaceData has cyclomatic complexity 61 and cognitive complexity 66; 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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab12c720c11a177a1b926b7b7c8f65a4ad7e5d086338a693a0015c418db32c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawImage (cyclomatic 58, cognitive 59): drawImage has cyclomatic complexity 58 and cognitive complexity 59; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ec6ba174c6f3756b5634a10a5755244f4482b2ef6dccd4c531387de29f5a0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditReviewReuse (cyclomatic 58, cognitive 38): auditReviewReuse has cyclomatic complexity 58 and cognitive complexity 38; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4313684cb8c0ae816ed3f1c83d26a77684e82dd24eadb5d9e24a3bd5f9dfaf74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectLayerTextVariantsForLeaf (cyclomatic 56, cognitive 109): selectLayerTextVariantsForLeaf has cyclomatic complexity 56 and cognitive complexity 109; 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":"rhwp-studio/src/view/canvaskit/text-variant-selection.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe4246c30b5120b14ecaf495f41da747ac6e283d04e836e06397cdc6e8fcb7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCoverageContract (cyclomatic 56, cognitive 68): validateCoverageContract has cyclomatic complexity 56 and cognitive complexity 68; 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5871338541f56fae385e4ab9dc677c412d21ab2ca92f865cc83a5ea033c5d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeEmbedRequest (cyclomatic 55, cognitive 37): routeEmbedRequest has cyclomatic complexity 55 and cognitive complexity 37; 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":"rhwp-studio/src/embed/rpc-router.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a88b83257c05533a8315eba6c965c914430aa7fa3ec5e3fcecf68fcb572a606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLineageManifest (cyclomatic 54, cognitive 84): validateLineageManifest has cyclomatic complexity 54 and cognitive complexity 84; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39c10622b9fb6d0d8f18307cc2c7c5811b53dad294bcc025c0942c45614cc7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawStaticControlText (cyclomatic 54, cognitive 77): drawStaticControlText has cyclomatic complexity 54 and cognitive complexity 77; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a981a5b460d1b5cd630310607ad706fd72d63feebb926e451a7b29ca26ecff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MovePos (cyclomatic 54, cognitive 45): MovePos has cyclomatic complexity 54 and cognitive complexity 45; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe102620ba2ebf7383f26ad87be065b0c758e980ddba22d2c04c0419abcc4fe9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 53, cognitive 94): run has cyclomatic complexity 53 and cognitive complexity 94; 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":"rhwp-studio/e2e/responsive.test.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9283d638d69b0f25dcca1dfe6141fb9f61a0506a7c8cf9aba4ae725a9dc32add"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStaticSvgAttributeSupported (cyclomatic 53, cognitive 44): isStaticSvgAttributeSupported has cyclomatic complexity 53 and cognitive complexity 44; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de16e50aaed0d59b053d6ab65e4a9fd20c2612870fdd415f7606279e7f87c78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 52, cognitive 181): (anonymous) has cyclomatic complexity 52 and cognitive complexity 181; 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":"rhwp-studio/e2e/layer-export-issue536.test.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f5368577f062dd2fa1a5775f09a91e96959b5395e6ba48ec2a536abdbe345c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOracleProfileContract (cyclomatic 52, cognitive 41): validateOracleProfileContract has cyclomatic complexity 52 and cognitive complexity 41; 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6124e8e56b940ea210c0bdacdc2314d94b401a1a22a7d7f42540bcaf8e2a2906"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 52, cognitive 39): (anonymous) has cyclomatic complexity 52 and cognitive complexity 39; 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":"rhwp-studio/e2e/header-footer-selection-issue4121.test.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a438db6039e706baa59eedb6627b05e71a02afe14ffad71e93bcd23d8f8ed05f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imageForOp (cyclomatic 51, cognitive 59): imageForOp has cyclomatic complexity 51 and cognitive complexity 59; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5901}}}],"partialFingerprints":{"codehealthFindingId/v1":"0346aff4dc4cca57a7e7e82f12cbe7014fe1586fdad9f213f48beb3cf45ee959"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 51, cognitive 41): (anonymous) has cyclomatic complexity 51 and cognitive complexity 41; 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a010de911ad51f1f6eee7dd39889602a66881d4132dd14c867af798fdfb348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onInput (cyclomatic 50, cognitive 81): onInput has cyclomatic complexity 50 and cognitive complexity 81; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"10382923597eb9cefe780e7a85699eaf2da4dd6c49b0a3434dd6dd5e29fa53e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCharOverlap (cyclomatic 50, cognitive 49): renderCharOverlap has cyclomatic complexity 50 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 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3738}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e262a4bcca74e5b968ce1de809f8a4f3ca55efc99e0da68556cbf87a5f0fdaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCtrlKey (cyclomatic 49, cognitive 64): handleCtrlKey has cyclomatic complexity 49 and cognitive complexity 64; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4874af014f1de8dd4f4953ad41684736bbb797a78a13a7a1bc4a8e707e4df9c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPictureAtClick (cyclomatic 49, cognitive 54): findPictureAtClick has cyclomatic complexity 49 and cognitive complexity 54; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b519dfeffbe0fa08cd9967e8a7b2633d2bd8f69157204137977291c1d348ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 42): (anonymous) has cyclomatic complexity 49 and cognitive complexity 42; 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":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45e1148259097af149e5c3d56e3eebc991e0e27727fed030df25ff2d04b279e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 48, cognitive 107): prepare has cyclomatic complexity 48 and cognitive complexity 107; 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8469df5eb4bbb8ddfeaa770c3b8965c4ba6b00441b355f1533c0ef43ceef021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPass (cyclomatic 48, cognitive 96): drawPass has cyclomatic complexity 48 and cognitive complexity 96; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e9947529676c79a37cb13d9f2bc782dd26eab28c020a54786688ac094e95cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 48, cognitive 71): create has cyclomatic complexity 48 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"855b1352a8c8d3294f0eb3ea2a4b8296baee646314b91f965814b92411ce7a20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReport (cyclomatic 48, cognitive 70): createReport has cyclomatic complexity 48 and cognitive complexity 70; 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":"scripts/ci-impact-report.cjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4806f323bc06f2109d9573c99b4442c911907e4654436c35d27e8b1d3d65455b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateObservedShapes (cyclomatic 47, cognitive 76): validateObservedShapes has cyclomatic complexity 47 and cognitive complexity 76; 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721b4ee83950a367363f35c0f66d4252e27b2584223c656b840ded6fa50275d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStaticSvgStyleSupported (cyclomatic 47, cognitive 67): isStaticSvgStyleSupported has cyclomatic complexity 47 and cognitive complexity 67; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaf1744db7acffa817c4c5f7bdf3d749d69cc437e751640bdb30e588c3a9492"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerResources (cyclomatic 47, cognitive 56): registerResources has cyclomatic complexity 47 and cognitive complexity 56; 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cebb1ddec62007105360265ac2b65aa50e552e01fb89cec9f60c557358de30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 47, cognitive 50): draw has cyclomatic complexity 47 and cognitive complexity 50; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b0220945f743c137f77f247859939349cfbbb57fd69600f6527b78f541cb89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fontDecisionEvidence (cyclomatic 47, cognitive 43): fontDecisionEvidence has cyclomatic complexity 47 and cognitive complexity 43; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4896f26e3f54f40c15ac03f8a383f5882839e4bd117bf5de61a56bc333ba5d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditPolicyRuns (cyclomatic 47, cognitive 41): auditPolicyRuns has cyclomatic complexity 47 and cognitive complexity 41; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c125088fb0cede6003a3aa83b5cf01baf668fbef71967b3b0a22d338f533413"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rasterLineGeometry (cyclomatic 47, cognitive 35): rasterLineGeometry has cyclomatic complexity 47 and cognitive complexity 35; 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":"rhwp-studio/src/view/canvaskit/raster-stroke.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5869451bed30d9e0402560ebaa99190fe43c4a54c4c5052db65b05219e60ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 46, cognitive 39): (anonymous) has cyclomatic complexity 46 and cognitive complexity 39; 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":"rhwp-studio/e2e/ai-panel.test.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a72aa64fb0da1074701f83ab70034fd47651bc9b7541f5203bdd6e2132367"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 79): (anonymous) has cyclomatic complexity 45 and cognitive complexity 79; 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":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff6b272ab7343e012cfefbe3ee19cdde79bcaad5176e48345873e461165a221"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProjectionBaseline (cyclomatic 45, cognitive 51): validateProjectionBaseline has cyclomatic complexity 45 and cognitive complexity 51; 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":"scripts/font_rule_projection_baseline.mjs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc79bb2cda309bc066e7cf986a7c438e30e91a7b2f37fe1da92aa6034b77773"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateFromProps (cyclomatic 44, cognitive 47): populateFromProps has cyclomatic complexity 44 and cognitive complexity 47; 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":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c919aebbc86acf8a05057baa977d7900e09dc1113effa8ff812e522997bdb13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 44): (anonymous) has cyclomatic complexity 44 and cognitive complexity 44; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd0349a5c38a8b7d20e923652dea2e0ddf50487548a36730c94411c2644131"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 42): (anonymous) has cyclomatic complexity 44 and cognitive complexity 42; 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":"scripts/trusted-postmerge-duration-evidence.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0d6db3787f39190e32a52255e5553f00201bb9a073dfec1ab782596f4c9dfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 43, cognitive 48): onConfirm has cyclomatic complexity 43 and cognitive complexity 48; 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed99451fa603a36fc64f73fcaef11b1d2b32f51a97ad43baf5565ef5187ed7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 43): (anonymous) has cyclomatic complexity 43 and cognitive complexity 43; 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":"rhwp-shared/pdf/import-worker.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"054cf61da895a6ec0bc04965d5c786af49d2bdf96933d21bad038f2741dc0364"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectRepository (cyclomatic 42, cognitive 66): inspectRepository has cyclomatic complexity 42 and cognitive complexity 66; 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5b93f321f71213219082e19ccc9b99cd816c6948f77e87c27ccf8f035f277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshDurationPolicy (cyclomatic 42, cognitive 62): refreshDurationPolicy has cyclomatic complexity 42 and cognitive complexity 62; 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":"scripts/refresh-nextest-target-duration-policy.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfca948c1e5aeb6d1fe111a2a4531768bbe533e9bf34a434a6e0aa2a2bff3a50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSvgImageHeader (cyclomatic 42, cognitive 61): parseSvgImageHeader has cyclomatic complexity 42 and cognitive complexity 61; 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6152fe69327f58bcca02e0d7a827546273d7c9b74af922a5b9ccd28c21ed9705"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyChanges (cyclomatic 42, cognitive 59): classifyChanges has cyclomatic complexity 42 and cognitive complexity 59; 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e3b5bb1fce8c2c2750e2a462853ca748506a408189788f08e747435176ccda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glyphRunPaintIsSupported (cyclomatic 42, cognitive 39): glyphRunPaintIsSupported has cyclomatic complexity 42 and cognitive complexity 39; 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b985e5e5d8e7e27502eba7700c509f2af23ba59fbb46f62d3a6c670d981258"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvidenceLedger (cyclomatic 41, cognitive 78): validateEvidenceLedger has cyclomatic complexity 41 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521d153000db6191ec0c08efcc928524f7e06808e02fee04704bdfadcbc3aeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateToolInput (cyclomatic 41, cognitive 70): validateToolInput has cyclomatic complexity 41 and cognitive complexity 70; 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":"rhwp-studio/src/ai/tools/schema-validate.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5f597f47f3d9f9ade356400bc1b33db84978c3877956008c7bd5de79b7c63b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formDrawingReplayRejection (cyclomatic 41, cognitive 44): formDrawingReplayRejection has cyclomatic complexity 41 and cognitive complexity 44; 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":"rhwp-studio/src/view/canvaskit/form-replay.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c1078d1895dba603e6061b59139dfb90e26ce69121e61e92d0558f604d8b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textRequiresComplexShaping (cyclomatic 41, cognitive 41): textRequiresComplexShaping has cyclomatic complexity 41 and cognitive complexity 41; 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":"rhwp-studio/src/view/canvaskit/nominal-text-replay.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"846c76b50aa392359b06b8c50f845bbe428c49da003c3266d43986893ab1b5ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDblClick (cyclomatic 40, cognitive 60): onDblClick has cyclomatic complexity 40 and cognitive complexity 60; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"880b4b3c5876f5a27c70bad7880904dd6204d6ca8e47a99da13f821e4ca7d7f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDeclaredFontPrograms (cyclomatic 39, cognitive 87): prepareDeclaredFontPrograms has cyclomatic complexity 39 and cognitive complexity 87; 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af3a39888479f8f7a7f765e2f3c1e62d0e8425f51ce289199eec8c965acc4d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 39, cognitive 43): observe has cyclomatic complexity 39 and cognitive complexity 43; 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ad604d3ded98d66018388e0b25427667f15a7326efa54fbe309742c7bcbe9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 37): (anonymous) has cyclomatic complexity 39 and cognitive complexity 37; 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":"rhwp-studio/e2e/cell-block-delete-keys.test.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"54576554c8f934298bca71b4ee605b22e92dbdf7a4355a05cd7e64b37c44c73f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 38, cognitive 83): scan has cyclomatic complexity 38 and cognitive complexity 83; 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":"rhwp-studio/tests/helpers/rust-mutating-exports.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de68772456e752006494d03ea7ebcd35e89494bf632817b476c6fbbde05c6489"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateDiffSectionPages (cyclomatic 38, cognitive 65): annotateDiffSectionPages has cyclomatic complexity 38 and cognitive complexity 65; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a88cb9a20e9c6642c5b419b8bd16fd555fa19f445f967969285ffa74afdf6ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareLocalFonts (cyclomatic 38, cognitive 52): prepareLocalFonts has cyclomatic complexity 38 and cognitive complexity 52; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7d76bca391f33d392fd9cb09aedd155175edd7770ebbe7b9010f574064e748"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCoverageDecision (cyclomatic 38, cognitive 47): classifyCoverageDecision has cyclomatic complexity 38 and cognitive complexity 47; 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57311b57fe933f0bc2872c7020df81ed7545a6318edc716beb064d9ab2ca9b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareBundledFonts (cyclomatic 37, cognitive 63): prepareBundledFonts has cyclomatic complexity 37 and cognitive complexity 63; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a458671c158abcc51b676d9f69a74e0a23569748c901f861f8dc10fb2ccecc3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 45): (anonymous) has cyclomatic complexity 37 and cognitive complexity 45; 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":"scripts/tests/pdf-codec-wasm.test.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc86db62d2b5ea2cf61cd333aa09b449b421fcf8fd9e736999c8df91ee1f6e24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 31): (anonymous) has cyclomatic complexity 37 and cognitive complexity 31; 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":"rhwp-studio/e2e/selection-layout-issue8103.test.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b48ed9ea01ba42d8f43e1526ea5ee301ce6e88395f076a18f144666898965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPictureObjectSelection (cyclomatic 36, cognitive 77): renderPictureObjectSelection has cyclomatic complexity 36 and cognitive complexity 77; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a97d620c292175a97e14fe26394bb6974fb3c786243cf93798956d912a0232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleF11 (cyclomatic 36, cognitive 56): handleF11 has cyclomatic complexity 36 and cognitive complexity 56; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c305838b0df22db8102825caf7dc316388e6ab9dc33432529bda6e42fdb3e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 36, cognitive 51): resolve has cyclomatic complexity 36 and cognitive complexity 51; 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01787b1712eeae69329747ecd388f5c5332e5f7f8c442f25c4d8d4161ed0c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateVisiblePages (cyclomatic 36, cognitive 38): updateVisiblePages has cyclomatic complexity 36 and cognitive complexity 38; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"51583169ffed26cbba8f2bae996e3f2dbff58b18d96ad745b08323eb0ea38245"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 35, cognitive 62): prepare has cyclomatic complexity 35 and cognitive complexity 62; 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e508c705c4eeda2a568fc3fad7d5f73851af1bc699f430a1b95dc839037e6ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getParaFormatTargetsForRange (cyclomatic 35, cognitive 35): getParaFormatTargetsForRange has cyclomatic complexity 35 and cognitive complexity 35; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f79fab65a7bf646c85fd3eb3863f2778d709121907c34576d7a214dd9a7a20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 30): (anonymous) has cyclomatic complexity 35 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 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":"rhwp-studio/e2e/responsive.test.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a776056ee5eef601754785b24cef0012eb1340aa35fe76051cf08e9e302396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawHorizontal (cyclomatic 34, cognitive 52): drawHorizontal has cyclomatic complexity 34 and cognitive complexity 52; 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac027fdd4cf386655c01a85accd7a4d66a33c311bb61916faf859dc129908d37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 45): (anonymous) has cyclomatic complexity 34 and cognitive complexity 45; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d8b401a8faeaf4166427086d2b2c71aa80b39d45ae6069f92cf6fa8b422285"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 34, cognitive 34): onmessage has cyclomatic complexity 34 and cognitive complexity 34; 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e745b28ce09d31262565a6fee5bf2ed7c93d2c389490def97329c4b78d663ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMigration (cyclomatic 34, cognitive 26): validateMigration has cyclomatic complexity 34 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 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":"scripts/font_rule_registry.mjs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a1625eb0c6e0c99375aeaddd5da28e578a8bc8938f5c5122485cf40b80c07a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditCodeql (cyclomatic 33, cognitive 57): auditCodeql has cyclomatic complexity 33 and cognitive complexity 57; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"af85e422b23babc9852ff933f3b6116c86f38965444f11a24a504b1f5243cd12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTraceEnvelope (cyclomatic 33, cognitive 53): validateTraceEnvelope has cyclomatic complexity 33 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f200e2ff9e2c5701ddd9b0b783a8339431588e3a35747eb4aeb1d18162acbbc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRule (cyclomatic 33, cognitive 53): validateRule has cyclomatic complexity 33 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca4be7fe0c15563a273adb2edba76df3c6c483d99ef41db974e0112e2dc4e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showHoverCard (cyclomatic 33, cognitive 45): showHoverCard has cyclomatic complexity 33 and cognitive complexity 45; 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":"rhwp-firefox/content-script.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d16a263d47f3db1184c62e148a6d5f0e05222f3d31c1849a120c6db1ccf460"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderNodeContents (cyclomatic 32, cognitive 62): renderNodeContents has cyclomatic complexity 32 and cognitive complexity 62; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"21967935db2213627eb59f82c2b77d86e7df18d1141053b643d0a177bf665edd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCompositionEnd (cyclomatic 32, cognitive 56): onCompositionEnd has cyclomatic complexity 32 and cognitive complexity 56; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9952e8bf58dee49fea914afe6cfad5176fee146f6f85207f5bed528f49e1ae8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishPictureResizeDrag (cyclomatic 32, cognitive 47): finishPictureResizeDrag has cyclomatic complexity 32 and cognitive complexity 47; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"be78c6aafebd603e5e09e60c3e39bf3ced794155b3bd40ed4981d33279b49fad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showHoverCard (cyclomatic 32, cognitive 42): showHoverCard has cyclomatic complexity 32 and cognitive complexity 42; 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":"rhwp-chrome/content-script.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b564e9cab1357a00a2e3a40185e4f29fd065e441a0c4af4c1819b67b21e9c4c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshRenderSurfacePlan (cyclomatic 32, cognitive 40): refreshRenderSurfacePlan has cyclomatic complexity 32 and cognitive complexity 40; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c19e031f4144cb276d1c48867ff703404d42efa00e37360eb34a0a19a711bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPostmergeDurations (cyclomatic 32, cognitive 37): collectPostmergeDurations has cyclomatic complexity 32 and cognitive complexity 37; 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":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d950ada67882d7faa490b5584d3e526bda858ce94e1ffe4725c9f98adde36bb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadManifest (cyclomatic 32, cognitive 37): loadManifest has cyclomatic complexity 32 and cognitive complexity 37; 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"078823316fcef514489b7d5e2632df9377965db8ade96154a78b14d05fe7f3c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCanvas (cyclomatic 32, cognitive 35): renderCanvas has cyclomatic complexity 32 and cognitive complexity 35; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"697deeff466f412e183cca9c72465dd7cd110471d75bdf7a42bc5d137f938e84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateFields (cyclomatic 32, cognitive 34): populateFields has cyclomatic complexity 32 and cognitive complexity 34; 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":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"605cbf933d2a3679148408f13e96ead1a91f2a2e6409a469e2a2b7fc8daa3fa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 31, cognitive 53): render has cyclomatic complexity 31 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":"scripts/ci-impact-report.cjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cae9a84099207602b3c2264511d182f6cb8f7790ed93b08ac001c762ee5e005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policyFor (cyclomatic 31, cognitive 43): policyFor has cyclomatic complexity 31 and cognitive complexity 43; 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8cd8a408501ffe7bfeceb26fbf7f8be640b6fba5f5760028d3e617ec745bb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStaticSvgTransform (cyclomatic 31, cognitive 39): parseStaticSvgTransform has cyclomatic complexity 31 and cognitive complexity 39; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f560066d2f06a5866f888ae3ac411d481b4c5b0535ca3f60174a7d3d4033e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishImagePlacement (cyclomatic 31, cognitive 38): finishImagePlacement has cyclomatic complexity 31 and cognitive complexity 38; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5ea13cc52a699ed37c86803ca9509c43ff6df16493b59a1600cee58e2f3e7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseRun (cyclomatic 31, cognitive 36): diagnoseRun has cyclomatic complexity 31 and cognitive complexity 36; 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":"scripts/ci-impact-report.cjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd934f4efa92509a0b2dd9eff99d1c84b0a289c9d0f7b5c6c045d7278d316ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fontFamilyCandidatesForDisplayWithRules (cyclomatic 31, cognitive 32): fontFamilyCandidatesForDisplayWithRules has cyclomatic complexity 31 and cognitive complexity 32; 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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8685743345c2ec727402c3d558d59d5fede37b0b05ceb43f3a6adc46a0a03e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawImageOp (cyclomatic 31, cognitive 26): drawImageOp has cyclomatic complexity 31 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 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ddb7af46a249cc77df55ffe482750cf8e72085f64e18ee5163651a3efaa30d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 23): (anonymous) has cyclomatic complexity 31 and cognitive complexity 23; 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":"rhwp-studio/e2e/select-all-cmd-a.test.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0883546464c295fd4377142e8cf47b70d8da27721649eb88c4f3f2920597b43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 9): (anonymous) has cyclomatic complexity 31 and cognitive complexity 9; 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":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ca6a613258349101bbd9cb7f1adcff45d9484e8f861278eafaf43983c41443"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statement (cyclomatic 30, cognitive 51): statement has cyclomatic complexity 30 and cognitive complexity 51; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1adec1580150dc1a71ea5983253d7493820b9707d98ab8f03670afeb49741f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchSegmentDp (cyclomatic 30, cognitive 49): matchSegmentDp has cyclomatic complexity 30 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe7f9907f858f23025cd55e666538f8643e151ef3b0f2224d3c6e277b69b483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRuleSemanticContract (cyclomatic 30, cognitive 38): validateRuleSemanticContract has cyclomatic complexity 30 and cognitive complexity 38; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2941f8ccdea7febce6c27fc353c4358e9dcbd2f2383841026ce52108b25f4bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPaste (cyclomatic 30, cognitive 37): onPaste has cyclomatic complexity 30 and cognitive complexity 37; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf141b8744a325e54a986de60f3a3687208a2def420cd9e706b9421118941b63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proposal (cyclomatic 30, cognitive 32): proposal has cyclomatic complexity 30 and cognitive complexity 32; 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0244ec6f192b110466e5a77bb079cace98899259eb5d0bbffc4486e6c762c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderColorPaintGraphNode (cyclomatic 30, cognitive 31): renderColorPaintGraphNode has cyclomatic complexity 30 and cognitive complexity 31; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"545ee557594f0fbd145bfe88e5ddf60c3e0808bf10117c157bd12802e1b5244b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicy (cyclomatic 30, cognitive 22): validatePolicy has cyclomatic complexity 30 and cognitive complexity 22; 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":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c352826402c35e67363c36dd9e1193bbc03f09022e2cb5f3011b450e9414dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePositions (cyclomatic 29, cognitive 63): comparePositions has cyclomatic complexity 29 and cognitive complexity 63; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a89a5a2d4a3b28561024d15678dbc64ae2e3ed66d62180020d40329f0b60fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupParagraphAlignStepsToDiffItems (cyclomatic 29, cognitive 46): cleanupParagraphAlignStepsToDiffItems has cyclomatic complexity 29 and cognitive complexity 46; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c499dfd3c2796e4e866440cae91d6a9199282ae61bdd1aa303985584558f9f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeSurface (cyclomatic 29, cognitive 43): makeSurface has cyclomatic complexity 29 and cognitive complexity 43; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bde59283b1bb6cc8e7f4a830e07b9f70d5623eb98031ecc71bfa679b947063f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCandidateSnapshot (cyclomatic 29, cognitive 40): validateCandidateSnapshot has cyclomatic complexity 29 and cognitive complexity 40; 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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b4bdf96df5e0b45561e1023ab2b7a6a27ddd4299edb01512f41214b167c1f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePictureResizeDrag (cyclomatic 29, cognitive 37): updatePictureResizeDrag has cyclomatic complexity 29 and cognitive complexity 37; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1741255971db3e63e74aed2d372ac6d622ae7ad2d7f4a4754bf7d5df0add9640"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createOrReuseFlowImageLayer (cyclomatic 29, cognitive 37): createOrReuseFlowImageLayer has cyclomatic complexity 29 and cognitive complexity 37; 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"3331eb42dce2e36ffd0adbb76af8b37583f40fe089ef3950779167a97d704007"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 33): (anonymous) has cyclomatic complexity 29 and cognitive complexity 33; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae295954729f7714cbb13d2b469766f6bb5a8608badec5defd627f3f87c69b20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 30): (anonymous) has cyclomatic complexity 29 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":"rhwp-studio/e2e/chart-data-structure-issue6053.test.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"051e909ac3513595a1c93a556b0f47ded02bc327a041436276ca2285cba6b22d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPage (cyclomatic 29, cognitive 30): renderPage has cyclomatic complexity 29 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b9fc9c857f6ba96b4c3acf54b35d6759bf765016d3bc71772444beaa02c7d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _decode (cyclomatic 29, cognitive 29): _decode has cyclomatic complexity 29 and cognitive complexity 29; 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037b62ddf554ec88f2b9c01052ba5dafccd1a10c9d79405845f0d94402c3c57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairTerminalFontCmap (cyclomatic 29, cognitive 26): repairTerminalFontCmap has cyclomatic complexity 29 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 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":"rhwp-studio/src/core/browser-font-cmap.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"951144b3ee3afe642936dcb0ce648180d9091b8ce26305d8e5a6bc148bd22c24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 22): (anonymous) has cyclomatic complexity 29 and cognitive complexity 22; 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":"rhwp-studio/e2e/table-picture-resize-1282.test.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d9da5b5b2552130361a407236a36faa2313236cb8a8ff1356938752fa5f543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderOp (cyclomatic 29, cognitive 11): renderOp has cyclomatic complexity 29 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3978bac9fd382480db50085855e4f4ff0ee48e985d5d25b6b8beb615b86cee2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatSummary (cyclomatic 29, cognitive 9): formatSummary has cyclomatic complexity 29 and cognitive complexity 9; 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abff83703fcfcc23d2b3e2d91364f7473d89016e66ff3f813e818bc57924182"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 49): (anonymous) has cyclomatic complexity 28 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6865c4f9deae32cf90a6ceafdb42308eeff50befc3b45f8cf548dde89a90ea08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawCell (cyclomatic 28, cognitive 42): drawCell has cyclomatic complexity 28 and cognitive complexity 42; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06f4b30b11fee3494a712fd58fb248f9ada7f68c076cd4dfb5fdcf58f12bb43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hancomEquationFamilies (cyclomatic 28, cognitive 28): hancomEquationFamilies has cyclomatic complexity 28 and cognitive complexity 28; 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0744427d7da3332968e9770c23f58ed44b3b3d1382c50de991178ce6baf0a15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertScenarioContract (cyclomatic 28, cognitive 22): assertScenarioContract has cyclomatic complexity 28 and cognitive complexity 22; 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":"scripts/font_rule_mutation_rehearsal.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98885556be1c0598e25f2bfe9c2b9fa844000e784870fec860eea3d76996fe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeClassification (cyclomatic 28, cognitive 17): normalizeClassification has cyclomatic complexity 28 and cognitive complexity 17; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb958fdde979fcc4f98bac5e1d25a0f26fc3fddcc095ef0d65555449d5bb17a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectLayerPlaneSummary (cyclomatic 27, cognitive 63): collectLayerPlaneSummary has cyclomatic complexity 27 and cognitive complexity 63; 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cf9f94633ed2f2ad10b0fb7eb4349e2c00362958cff7524518eb2f83e8db6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleShiftF11 (cyclomatic 27, cognitive 46): handleShiftF11 has cyclomatic complexity 27 and cognitive complexity 46; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d803c10de384c44680c9dd037d627e7add22d369467f67fb761ccc62b6d38e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImageFromZip (cyclomatic 27, cognitive 44): extractPrvImageFromZip has cyclomatic complexity 27 and cognitive complexity 44; 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":"rhwp-safari/src/background.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d83549c9a6491d6cfd7332fa7a9a65705e16bb0e4584f0dd2d29099a77d912"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImageFromZipAsync (cyclomatic 27, cognitive 42): extractPrvImageFromZipAsync has cyclomatic complexity 27 and cognitive complexity 42; 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cae792997e1f6ad6c31ca5476cdcc64e2cf06c2c742645484bafd39021643d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImageFromZipAsync (cyclomatic 27, cognitive 42): extractPrvImageFromZipAsync has cyclomatic complexity 27 and cognitive complexity 42; 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5540133730005758d24cf03e3b0a022a3d911093c370eac143b74a183c25f3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showHoverCard (cyclomatic 27, cognitive 42): showHoverCard has cyclomatic complexity 27 and cognitive complexity 42; 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":"rhwp-safari/src/content-script.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a99f6dcfe79f81b0f6dedec0e195a21aaf36b8bbcf54496831f10343271384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLocalFontRecords (cyclomatic 27, cognitive 37): normalizeLocalFontRecords has cyclomatic complexity 27 and cognitive complexity 37; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3498556e1bba46187213071312962e9b9fbb509fd05a48dfd7915f5530a674b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceTextAtRaw (cyclomatic 27, cognitive 31): replaceTextAtRaw has cyclomatic complexity 27 and cognitive complexity 31; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28267281ccad1fa83df4fa3ef592854e202958144a9241709bfcee59475b854"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPath (cyclomatic 27, cognitive 29): renderPath has cyclomatic complexity 27 and cognitive complexity 29; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ff1005fbb5e5315626abee88cdebcf2abc8b65823a68e7a501343d2b5b74b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imagePixelSize (cyclomatic 27, cognitive 27): imagePixelSize has cyclomatic complexity 27 and cognitive complexity 27; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2dbdcf77f90d3c16f835a71c6d00558728d7e116855c7817b389a75f7283d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMigrationV1ToV2 (cyclomatic 27, cognitive 22): validateMigrationV1ToV2 has cyclomatic complexity 27 and cognitive complexity 22; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9932b49ec9a08dfcf4b1c38d7eeb70b977db976d25a2dacab49f2d036cdb04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFixture (cyclomatic 27, cognitive 20): normalizeFixture has cyclomatic complexity 27 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 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":"rhwp-studio/e2e/canvas-render-diff.test.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a2327e3e3b32398d08a8719ad6fcee7402a227897cc5e72767b49c041ecfbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFixture (cyclomatic 27, cognitive 20): normalizeFixture has cyclomatic complexity 27 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 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":"rhwp-studio/e2e/pdf-render-diff-report.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b58bc22b582b3e3ab48bb9ea32e7e396a9fae11999573ea1641c413035da1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImageFromCFB (cyclomatic 26, cognitive 46): extractPrvImageFromCFB has cyclomatic complexity 26 and cognitive complexity 46; 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":"rhwp-safari/src/background.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db1af8f226b4f02bd5a7a2a5555d672c813cda681441b6a917ac9a108afa31f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokens (cyclomatic 26, cognitive 43): tokens has cyclomatic complexity 26 and cognitive complexity 43; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"75312dbb15b43c0a3752b17df48a8ea74c81918b102312703bd9da9640f8de83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectReviewOnlyCandidate (cyclomatic 26, cognitive 41): selectReviewOnlyCandidate has cyclomatic complexity 26 and cognitive complexity 41; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc74fba19c0c6b6ae65e75469fe93500b17f04f99c2d8245843ad1d780e6d3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJpegHeader (cyclomatic 26, cognitive 38): parseJpegHeader has cyclomatic complexity 26 and cognitive complexity 38; 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d034c8fb535f6214a87c2e8ef98d36e6eab849f91460ceb902d196833749c222"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 34): (anonymous) has cyclomatic complexity 26 and cognitive complexity 34; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e6bdf8c3aecbe11ddd5c52f3264f72072908729eb06348d4f83237027f8a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairMinimalFormat4Length (cyclomatic 26, cognitive 33): repairMinimalFormat4Length has cyclomatic complexity 26 and cognitive complexity 33; 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":"rhwp-studio/src/core/sfnt-face.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff38c7f9aaf13b8b924792db97cf37b39dd9c5f4b28cdb24f081539e3869347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySweepFontEnvironment (cyclomatic 26, cognitive 31): applySweepFontEnvironment has cyclomatic complexity 26 and cognitive complexity 31; 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":"scripts/visual-sweep-font-environment.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8410aaff698f0cc8c980519228818025d86e638d24eec815a4c012cb8f8a43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateFromProps (cyclomatic 26, cognitive 27): populateFromProps has cyclomatic complexity 26 and cognitive complexity 27; 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38c4b8d450cda489c2d69d1bef2648541b815bf8563616e4a49df71482a6e06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highlightPreview (cyclomatic 26, cognitive 27): highlightPreview has cyclomatic complexity 26 and cognitive complexity 27; 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac99be9a56edcd4e209935dab43bd24f1cb01084f8627ddd70df6b24efd4acb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRule (cyclomatic 26, cognitive 26): validateRule has cyclomatic complexity 26 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9bfd158f36c00d1fe4fd6bf1fbe0b317a0eddf5615e7c8b147c5f01986708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 24): (anonymous) has cyclomatic complexity 26 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 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":"rhwp-studio/public/theme-init.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f747abd52037943f9f7a2d6f034cd99b024e4b5ea0e4489c8a91a1d44106552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldPromoteEmptyTextEdit (cyclomatic 26, cognitive 21): shouldPromoteEmptyTextEdit has cyclomatic complexity 26 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 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbab49f64ff14619ae2b33d7697dc151616caef4fe13d10b6515b177eebcf789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawAnisotropicPrintImage (cyclomatic 26, cognitive 13): drawAnisotropicPrintImage has cyclomatic complexity 26 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04f78ae6aa03cd35663650348fd0fe443dab76e20ea015c7c8e755253bff420"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyChangeSet (cyclomatic 25, cognitive 47): applyChangeSet has cyclomatic complexity 25 and cognitive complexity 47; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc39ef42e1149c106b015434e186e224d925f23998cdd32dcdd8372836cdb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertSourceBoundary (cyclomatic 25, cognitive 43): assertSourceBoundary has cyclomatic complexity 25 and cognitive complexity 43; 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"512bec2d03dd352d5ea0fc27a720407f343bd04911b1220876f46fd353640cf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCopy (cyclomatic 25, cognitive 42): onCopy has cyclomatic complexity 25 and cognitive complexity 42; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"642c3bb48dbadaa67cd8f32e60b6bf63a2e3552c63ada80a1e6f4082df8ae49b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePreparedTypeface (cyclomatic 25, cognitive 42): resolvePreparedTypeface has cyclomatic complexity 25 and cognitive complexity 42; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf2d59f3b061f2724e94b87e9bb847616fb1458d7efb34890ba2f35a642b0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 40): (anonymous) has cyclomatic complexity 25 and cognitive complexity 40; 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":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed7c5270c5c3249e987c806a18b502de3f1bf69c7165564eecf9c02f0ac9a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overwrittenTextAt (cyclomatic 25, cognitive 35): overwrittenTextAt has cyclomatic complexity 25 and cognitive complexity 35; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ac4333884aa7bef88ca55c74d070a3e0a81b16c0e2ca276e7a36a1e608b20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #runTableAction (cyclomatic 25, cognitive 32): #runTableAction has cyclomatic complexity 25 and cognitive complexity 32; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3074}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1810b9c48d5a2a485343eeaf4910415668fccfe3901bb3e011ccece2d7b079"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRegistryV2 (cyclomatic 25, cognitive 30): validateRegistryV2 has cyclomatic complexity 25 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7086d178f7cc7cee9aa667b94f13c4e8ff0186db7aec7770f1bb03e9306e04d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function browserParityThresholdsForSample (cyclomatic 25, cognitive 29): browserParityThresholdsForSample has cyclomatic complexity 25 and cognitive complexity 29; 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"23577e1811a7547457da9398f19fa5e5502d09285a69e0eb2b41495f9a57d5b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePublicFixtures (cyclomatic 25, cognitive 28): validatePublicFixtures has cyclomatic complexity 25 and cognitive complexity 28; 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b529990ab5dbd72fa1b2d5d481b3e1a3453b590046cdeee575871da98f97f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreControlFallback (cyclomatic 25, cognitive 26): scoreControlFallback has cyclomatic complexity 25 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"016794b695c68c74d856154b4233bb63b189735a87c5c664049f95ddf478cec4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChangeSet (cyclomatic 25, cognitive 26): validateChangeSet has cyclomatic complexity 25 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"910ab8773091ffd3d68c21ca21a9fc3e5312386b5b4979d7731187e116b56db7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotOptions (cyclomatic 25, cognitive 25): snapshotOptions has cyclomatic complexity 25 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"46844a7d1b79d597c2b79d8449a218f24e9d52a719414df9cb84257cbc9d5958"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPageLayerTreeObject (cyclomatic 25, cognitive 25): getPageLayerTreeObject has cyclomatic complexity 25 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eab453ffefc76c799db6cb6477b96e20d252c0805fce426f15c162d6546e1f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareDeclaredFontEnvironment (cyclomatic 25, cognitive 23): prepareDeclaredFontEnvironment has cyclomatic complexity 25 and cognitive complexity 23; 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62f80387762b4281b3a83d7e88afc87bdbe00f2e9eac5abaa5a1c0f5992b510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesOne (cyclomatic 25, cognitive 19): matchesOne has cyclomatic complexity 25 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 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2702193bc28444675ac07226037c57ad4de0c17c677b4eeb4483d405fdbad7dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasSvgGlyphContract (cyclomatic 25, cognitive 13): hasSvgGlyphContract has cyclomatic complexity 25 and cognitive complexity 13; 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2471fd0a6b2c7631ffa4f0f9a6f005795e458fb13ab5c9af8e62a15b303254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPrintFrameImage (cyclomatic 25, cognitive 11): drawPrintFrameImage has cyclomatic complexity 25 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit/anisotropic-image.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f322107a4c8c5803b9bc7feff440fe1933defdb6434a04520d48d480f35e9243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 52): (anonymous) has cyclomatic complexity 24 and cognitive complexity 52; 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":"rhwp-studio/e2e/pdf-render-diff-report.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ef45c31c93e94bdf36f5ef72afd24e9d304ad53f98849b42ee85b1d0c55a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishResizeDrag (cyclomatic 24, cognitive 46): finishResizeDrag has cyclomatic complexity 24 and cognitive complexity 46; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bd8b93aaba16cbfdc5cdffaae67fa85eca2f7193a520bda0e0f22cf81676d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runScenario (cyclomatic 24, cognitive 41): runScenario has cyclomatic complexity 24 and cognitive complexity 41; 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":"rhwp-chrome/e2e/extension-lifecycle.test.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31ba4b22e9badb0e2c911b33af45f6e3c3153f77354b686efa9161fb8d2ca8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleDelete (cyclomatic 24, cognitive 41): handleDelete has cyclomatic complexity 24 and cognitive complexity 41; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c37f302daa96f2bbcb2f01907513b670d1188063fa5c176b391742ccde304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 24, cognitive 35): prepare has cyclomatic complexity 24 and cognitive complexity 35; 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caeed0e6d5ccc2a3971e95f9cb9f076ab30e8ccbe391259bc7d2ab2dd439158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleResizeHover (cyclomatic 24, cognitive 35): handleResizeHover has cyclomatic complexity 24 and cognitive complexity 35; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"e136d31f697dc756b3002094d1ab51fdc936696ea405b582f66bdb0ac654dc33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNavigationAction (cyclomatic 24, cognitive 35): getNavigationAction has cyclomatic complexity 24 and cognitive complexity 35; 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":"rhwp-studio/src/engine/navigation-keymap.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4538b8e9f96275e83977e8cfce490f2c17e4f229bc2d3be39849ae8350de57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderValueDiff (cyclomatic 24, cognitive 35): renderValueDiff has cyclomatic complexity 24 and cognitive complexity 35; 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b9ca9d30f10a6c4009148018ba9a8d5c8b427bb9254b231da1a82fae95991b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderValueDiff (cyclomatic 24, cognitive 35): renderValueDiff has cyclomatic complexity 24 and cognitive complexity 35; 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee27821c064502d07e967e4a3ec4ccdb38b593646cd8d247bcaa4a45efb5c22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildControlDiffs (cyclomatic 24, cognitive 34): buildControlDiffs has cyclomatic complexity 24 and cognitive complexity 34; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c277839cf2b03c34ed9162b570f22589b0986a0ebedf3dbb039fdb14b870c80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawImageRect (cyclomatic 24, cognitive 32): drawImageRect has cyclomatic complexity 24 and cognitive complexity 32; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a11de0d79683c75b791e65354333442004b7495a75a3ac30e9f91a0cc1dbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #runPageAction (cyclomatic 24, cognitive 28): #runPageAction has cyclomatic complexity 24 and cognitive complexity 28; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4850e21c182e80b747f0c97678cb6473d5a64c9f4fbc7d8e485fb4117f6228"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderImage (cyclomatic 24, cognitive 24): renderImage has cyclomatic complexity 24 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1d5fd4f295e1557afd772c9fd1980cb1dcb1d3313b2483acc90fda25686e4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glyphOutlinePaintIsSupported (cyclomatic 24, cognitive 19): glyphOutlinePaintIsSupported has cyclomatic complexity 24 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 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"409b3861e549bdcdc72417be1cdedf4376fb4a4ad401afe6a877d4734d92846e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 16): (anonymous) has cyclomatic complexity 24 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":"rhwp-studio/e2e/zoom-dialog-transaction.test.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a07fd4276cf9c7c8309454c104f7a18cd0a4dd359de98fa89f3631e5134ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectCanvasKitFontFallback (cyclomatic 24, cognitive 12): inspectCanvasKitFontFallback has cyclomatic complexity 24 and cognitive complexity 12; 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":"rhwp-studio/e2e/renderer-baseline-contract.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec958c92ca339d4b7cef6669a54f96210d4ab6b74539147bcaf25d052e635904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDurationReports (cyclomatic 24, cognitive 10): validateDurationReports has cyclomatic complexity 24 and cognitive complexity 10; 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":"scripts/trusted-postmerge-duration-evidence.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b58e0894829846058047b236a06ca92eddf256dbc42294e0fbca735fc692f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectHostFontRequests (cyclomatic 23, cognitive 66): collectHostFontRequests has cyclomatic complexity 23 and cognitive complexity 66; 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a90b098b3e975a4987cadae5a9c0a1ec267c4a80b2b508faf9b52543b1de4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 23, cognitive 38): run has cyclomatic complexity 23 and cognitive complexity 38; 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":"rhwp-studio/e2e/edit-pipeline.test.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d21ec42c35847787506af40c5525782195e2d73c1d283886fd121d2df95e9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelObjects (cyclomatic 23, cognitive 38): topLevelObjects has cyclomatic complexity 23 and cognitive complexity 38; 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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"935701e269d8e1783a5935d69048198d88b7a0b5119bd4c164e9a78616481ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMarkdownSummary (cyclomatic 23, cognitive 34): renderMarkdownSummary has cyclomatic complexity 23 and cognitive complexity 34; 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":"rhwp-studio/e2e/pdf-render-diff-report.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"46369df57c1a65faa78ebe27effe8bd81be2192da5d92b9f81f3c7bbdc9f245a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseSecurity (cyclomatic 23, cognitive 32): diagnoseSecurity has cyclomatic complexity 23 and cognitive complexity 32; 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":"scripts/ci-impact-report.cjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ef06bdd8f0c7a58703b5aa47c4dfdef4ea27114bb977343edaf67f96b5c47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getVisibilitySnapshot (cyclomatic 23, cognitive 31): getVisibilitySnapshot has cyclomatic complexity 23 and cognitive complexity 31; 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8975c0713520c3f72d2ac03b7306989913ecd90d8c3c2068634dc3220a14753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 30): (anonymous) 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":"rhwp-safari/src/background.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce52648a93392c12ee14f42c190bf228eb0ce070a7ddedbb7d722a602e030455"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSfntFontNames (cyclomatic 23, cognitive 30): readSfntFontNames 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61b5c5637b7e28d8019b3c50945db18aa47a6ee9d5ccd2697b3ceb0316f89b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runChecks (cyclomatic 23, cognitive 29): runChecks has cyclomatic complexity 23 and cognitive complexity 29; 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":"rhwp-chrome/e2e/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80687e75ab5b1e5a19c96af7a19789529f000ace08e69e135fb980d93c94bed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleBackspace (cyclomatic 23, cognitive 29): handleBackspace has cyclomatic complexity 23 and cognitive complexity 29; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c404e962f2ffca6ed09d1c76fc2c5f65a277f1573667e70c9077e52de7d2a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedResponseArrayBuffer (cyclomatic 23, cognitive 29): readBoundedResponseArrayBuffer has cyclomatic complexity 23 and cognitive complexity 29; 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":"rhwp-studio/src/view/canvaskit/bounded-response.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9c2cd39b656958b6316954530393a99ec9cad08e354ed1b51e2564ad855e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPreferredLocalFontBytes (cyclomatic 23, cognitive 27): loadPreferredLocalFontBytes has cyclomatic complexity 23 and cognitive complexity 27; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83b65cd29751dfc01bf2b5d277dc08bdd4405ab6aa9f79f3e47e959c81f2054"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCompositionStart (cyclomatic 23, cognitive 23): onCompositionStart has cyclomatic complexity 23 and cognitive complexity 23; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"054cf586d0ea2fe295dbcb189e62daecd76d609aa49fc80c70f3706475e79528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishMouseUp (cyclomatic 23, cognitive 22): finishMouseUp has cyclomatic complexity 23 and cognitive complexity 22; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf97d2717f6131d0d35e5bf5e4b176ee1d625ad8f605941bbf5f2e6a7c10413"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureApplyForm (cyclomatic 23, cognitive 22): captureApplyForm has cyclomatic complexity 23 and cognitive complexity 22; 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":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa58485638af024a861d7adbed8590fa96af8e76495aae732baa2f9b33c09996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureHandler (cyclomatic 23, cognitive 19): captureHandler has cyclomatic complexity 23 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 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":"rhwp-studio/src/ui/dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fa34a4a9673d15dbe369233a99d3a92d11bd73530adbfd34ca16019b40fc75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatNumber (cyclomatic 23, cognitive 19): formatNumber has cyclomatic complexity 23 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 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":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c854021c431713ed40874418e08e081346c55dbebad1ddbd844c4b4f00f2b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPostMergeTree (cyclomatic 23, cognitive 17): verifyPostMergeTree has cyclomatic complexity 23 and cognitive complexity 17; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e46889be75de5711ad5266304634eef388e998b5598bae2e0dfb4d303a289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPage (cyclomatic 23, cognitive 16): renderPage has cyclomatic complexity 23 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd264cfaea22d412b97968b22e0b20cb10cbfcc35454801239e7a95b3177f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTextEffectFontFaces (cyclomatic 22, cognitive 59): selectTextEffectFontFaces has cyclomatic complexity 22 and cognitive complexity 59; 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba810319926886bf7459cd651f0460de0fececb034b692fb35591f268964f326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 40): (anonymous) has cyclomatic complexity 22 and cognitive complexity 40; 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":"scripts/rasterize-svg-webfonts.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bf3b3472652a8c06c59c0fc2569c9c441db17a829bf0056ab4068bf5a686e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractEmfDibs (cyclomatic 22, cognitive 39): extractEmfDibs has cyclomatic complexity 22 and cognitive complexity 39; 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e78a52cc49eb9bc2645d626848a044046c735b6ba3ebbf903277c107565cc66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAgent (cyclomatic 22, cognitive 36): runAgent has cyclomatic complexity 22 and cognitive complexity 36; 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":"rhwp-studio/src/ai/agent/agent-loop.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeb1e3deca851c7f7a53aa45fb7d3251efd892e3b924368b1ebb8145e446b9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBalanced (cyclomatic 22, cognitive 36): extractBalanced has cyclomatic complexity 22 and cognitive complexity 36; 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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd759fd0c911f1b831a395ed0b0cbbf874addc85e9ad6be231644ff8c9d1a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeStaticSvgXmlEntities (cyclomatic 22, cognitive 30): decodeStaticSvgXmlEntities has cyclomatic complexity 22 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e224b508bf1b6fa7dbd51c39ba8c20903d44218e2087a9c6a1375974bf4190f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fontProgramOwnsFamily (cyclomatic 22, cognitive 29): fontProgramOwnsFamily has cyclomatic complexity 22 and cognitive complexity 29; 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":"rhwp-studio/src/core/canvas-intrinsic-font.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f58c1f78f9bbed3a11f06b807bbd21106f3a569b0f42d03051dd468f3ece87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvas2dDecision (cyclomatic 22, cognitive 25): canvas2dDecision has cyclomatic complexity 22 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":"rhwp-studio/src/core/font-decision-trace.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"29500341e5c38b9763605c8c8f85594681429a09ad509bcc8de1adc54e369fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyNodeError (cyclomatic 22, cognitive 23): classifyNodeError has cyclomatic complexity 22 and cognitive complexity 23; 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab3f3fdc0d3fd33142a6374c1f90c478e8a98aaa7c7a8fd6b2a5efbbc135356"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLongestEqualSignatureRun (cyclomatic 22, cognitive 23): findLongestEqualSignatureRun has cyclomatic complexity 22 and cognitive complexity 23; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50e6aa7516ed5c5ffd1b632ff0cd3e9130d27d643813b5fd18bed6699b56e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPageViewSettings (cyclomatic 22, cognitive 21): setPageViewSettings has cyclomatic complexity 22 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 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec148ea6dfb0993655c4bfc1610f1caff7f308a9beeccc22303603c5722b7f88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 16): main has cyclomatic complexity 22 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":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01725a8ad44a3d6254cabdf4a4f01b7c0799d86188f577735b07fc232662b96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectDurationArtifacts (cyclomatic 22, cognitive 9): selectDurationArtifacts has cyclomatic complexity 22 and cognitive complexity 9; 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":"scripts/trusted-postmerge-duration-evidence.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"948d29678a7cd361b33bf7d75a5b7d3ced44b41e913abd933ba2f5fb3afd94ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copySelectedObject (cyclomatic 21, cognitive 49): copySelectedObject has cyclomatic complexity 21 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5685}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bc8a91f9b854e1cb3dbe2fdc8c5c5a23d66831b6fedaf8fc393a947536dc34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBalanced (cyclomatic 21, cognitive 36): extractBalanced has cyclomatic complexity 21 and cognitive complexity 36; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4483e57955bf09e886726cb8d9496280d257a987e7cb9c1ceb2557faea0dc1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractBalanced (cyclomatic 21, cognitive 36): extractBalanced has cyclomatic complexity 21 and cognitive complexity 36; 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6848e9b6699335ceb0c51f0dcf4504c78fdb4ac21dff7f47cea67907b54cd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowImageOpsFromNarrowQuery (cyclomatic 21, cognitive 31): flowImageOpsFromNarrowQuery has cyclomatic complexity 21 and cognitive complexity 31; 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a530cc07f23e6a59964fe13c5df63cda135dcb1b6ec2ae7240f39dcd8554e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 21, cognitive 30): inspect has cyclomatic complexity 21 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"641cbca28d32e5ef48d08c9091be49aff0dbd9eeb28c1cc04c904abe834c78b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 21, cognitive 30): inspect has cyclomatic complexity 21 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":"rhwp-firefox/dev-tools-inject.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dedfc1bc7642261810acc81a1766e344b9d5c3e34501ed96b9db8d69e9f19d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gifHasSingleFrame (cyclomatic 21, cognitive 30): gifHasSingleFrame has cyclomatic complexity 21 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"789632754e8d80e743d4a41232e78caa07635a9357a1caf21f1c02388830501a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishTextboxPlacement (cyclomatic 21, cognitive 29): finishTextboxPlacement has cyclomatic complexity 21 and cognitive complexity 29; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b57da8e4af0427b4c3863b2ebb11b25c6cfdac431f900513870a183ca34c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGlyphOutline (cyclomatic 21, cognitive 25): renderGlyphOutline has cyclomatic complexity 21 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d095a7193242c7649d991368531e2c32a57075f120220d35453b991938a2c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onWheel (cyclomatic 21, cognitive 24): onWheel has cyclomatic complexity 21 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":"rhwp-studio/src/view/viewport-manager.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08025fc054aa69324d4dbc8eda799b9d8cef4f605c36ca8d62807f9612748e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSettings (cyclomatic 21, cognitive 22): resolveSettings has cyclomatic complexity 21 and cognitive complexity 22; 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":"rhwp-chrome/sw/settings-store.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c0e588b9679a25ad4c39b6a7306cab40b2f0e9e1ef713f6da6fbf2b1e42c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishNextestDurationData (cyclomatic 21, cognitive 22): publishNextestDurationData has cyclomatic complexity 21 and cognitive complexity 22; 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":"scripts/publish-nextest-duration-data.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d663ff6ed644681dea3a8cb2f9b5307ab722809c9ca87ee312f91d7208f11b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateTextSelectionDragFromPointer (cyclomatic 21, cognitive 21): updateTextSelectionDragFromPointer has cyclomatic complexity 21 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"46203d7e3d0263c6eb4c9f421181fd36e5817814190dc320549e248b44ba6c3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareNativePuaFonts (cyclomatic 20, cognitive 60): prepareNativePuaFonts has cyclomatic complexity 20 and cognitive complexity 60; 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a83c401521c72e69a4dfe80e5236b9d348c77ecc9f51e6a735ab22c7a3cd67c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskRustNonCode (cyclomatic 20, cognitive 48): maskRustNonCode has cyclomatic complexity 20 and cognitive complexity 48; 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":"scripts/rust-unit-test-tiers.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7a58d12523e80a93933f845d73d3361e358bbfd5b74f90ddded654dbf25855"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 44): (anonymous) has cyclomatic complexity 20 and cognitive complexity 44; 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":"scripts/tests/font_decision_trace_e2e.test.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a80f0e53171320dd6f79f5f19ca1f62b3a3306ed881ef3a85004f877d540a17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expression (cyclomatic 20, cognitive 37): expression has cyclomatic complexity 20 and cognitive complexity 37; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"329e8c5c1704a590eed7e9340e7a5ec77918eb193fac112a29d9f9b843e78a09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeFormat (cyclomatic 20, cognitive 35): executeFormat has cyclomatic complexity 20 and cognitive complexity 35; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2716b588627ad0ab4a55011028f1fcb993565038e52975ff8641c7cd79ec914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToParagraphBoundary (cyclomatic 20, cognitive 35): moveToParagraphBoundary has cyclomatic complexity 20 and cognitive complexity 35; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605e92f69c574bbfa47101cb1429b21c1b3acda9d4ebafd88b33b45525a4768"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderHeaderFooterEditOverlays (cyclomatic 20, cognitive 33): renderHeaderFooterEditOverlays has cyclomatic complexity 20 and cognitive complexity 33; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d36728d142cda84e48222decbe48f43e99b6fd34377e56a381e2514e73347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 32): (anonymous) has cyclomatic complexity 20 and cognitive complexity 32; 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":"rhwp-studio/src/core/layer-resource-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407ff73d06eba1b6333233ce8c2e3ea7711324869d11454164e039feff5c21a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProjectedCanvasKitFontPlan (cyclomatic 20, cognitive 31): resolveProjectedCanvasKitFontPlan has cyclomatic complexity 20 and cognitive complexity 31; 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":"rhwp-studio/src/core/font-rule-runtime.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc281be2df11ddb57543dce3db513ac423d78880216657ea758f97c65c9001b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPictureBbox (cyclomatic 20, cognitive 31): findPictureBbox has cyclomatic complexity 20 and cognitive complexity 31; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd65aff9314948f75ba543c3ad8522d0459a0cb9215c7e27f2bd4607d6e339b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawStaticSvgTextLayer (cyclomatic 20, cognitive 31): drawStaticSvgTextLayer has cyclomatic complexity 20 and cognitive complexity 31; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"54529138fdd3be895e07b8191d81dfcff44b8372ef821bf60e30ae6608d3067f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPageLocalTextEditCommand (cyclomatic 20, cognitive 28): isPageLocalTextEditCommand has cyclomatic complexity 20 and cognitive complexity 28; 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":"rhwp-studio/src/engine/input-edit-invalidation.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"376b6d502f20f41df43cc728be96e588d958eed69792c1c7198c4434de8033f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyClaudeError (cyclomatic 20, cognitive 26): classifyClaudeError has cyclomatic complexity 20 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":"rhwp-studio/src/ai/provider/claude.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f736fa5a542789fa5ba14250b636c2cdf10d804d220aaa4d75608a958160d7b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSelectionText (cyclomatic 20, cognitive 26): readSelectionText has cyclomatic complexity 20 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":"rhwp-studio/src/plugin/selection-text.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc4457f0d55ad79d07c07fd4e8e5f3a98ff5b0cb09faaee5cdd1369b535068a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOnce (cyclomatic 20, cognitive 24): runOnce has cyclomatic complexity 20 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":"rhwp-chrome/e2e/extension-smoke.test.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"651837157da27e5228d5b55c8bfa47e8e3504cd7610da4b4d998667ce4d6774a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 22): (anonymous) has cyclomatic complexity 20 and cognitive complexity 22; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e7a75eccab23be8f38f879ebcdd033e4f6f87f450234fef5e56bf8a573acc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addToolCard (cyclomatic 20, cognitive 21): addToolCard has cyclomatic complexity 20 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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80446813120a45ff1c2846d28eb4b3757ee23ade834f48da7437ac8d6238b628"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareComplexity (cyclomatic 20, cognitive 21): compareComplexity has cyclomatic complexity 20 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b4cde4cba899d6c2d4b8bab910c83ea15d81bb76204955ac39688768be91c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _handlePortMessage (cyclomatic 20, cognitive 20): _handlePortMessage has cyclomatic complexity 20 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":"npm/editor/transport.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae448c7564bce7200cd8ea86785add9097bfc7db78f06321649acdb50c3f8de6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertDroppedImageAtClientPoint (cyclomatic 20, cognitive 20): insertDroppedImageAtClientPoint has cyclomatic complexity 20 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f3e901837ad46cd09f4aba20866cc5ae8959440855d423216b2d4a79afd87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeShapeGradientShader (cyclomatic 20, cognitive 20): makeShapeGradientShader has cyclomatic complexity 20 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf74587263be5aac14a007395fba933473654694e9a87a3ff09b24e000867a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticSvgPaintStateFromMap (cyclomatic 20, cognitive 19): staticSvgPaintStateFromMap has cyclomatic complexity 20 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 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e68c8e059a85ec8d8218f3dcd4461c710a9f46b9e819203e0ae2c9593f2a44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStructuralCase (cyclomatic 20, cognitive 18): runStructuralCase has cyclomatic complexity 20 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 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":"rhwp-studio/e2e/probe-flow-input-latency-issue3794.mjs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"848e5c414aaa8bc1c92f8a221f859b1a50849aca84ea964c1215d470c99500a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 20, cognitive 18): draw has cyclomatic complexity 20 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 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b558f98da5f098ee7b4098611a70fa720d133f89eb3c80740ff5ca9434358"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordImageFailure (cyclomatic 20, cognitive 17): recordImageFailure has cyclomatic complexity 20 and cognitive complexity 17; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6100}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cdcab29e11f8c34a8c7c13e3415d54ba61394391a3933310b838bd6ed1752b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWebpHeader (cyclomatic 20, cognitive 14): parseWebpHeader has cyclomatic complexity 20 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"403c3dfde86beb555b9d1b5c5b1788bc96d8dc984b20a8360d074d3e8ce92dce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPrintAreaImage (cyclomatic 20, cognitive 14): drawPrintAreaImage has cyclomatic complexity 20 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit/print-image-sampling.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dbe3ae24eaf1adc9eb83022fa886ea02b98e927a02cb4561f7d3b649cd0d19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCanvasKitDocumentPreflight (cyclomatic 20, cognitive 10): parseCanvasKitDocumentPreflight has cyclomatic complexity 20 and cognitive complexity 10; 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":"rhwp-studio/src/core/canvaskit-document-preflight.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d31246472a060a3b0fb8f528e9ec07fa44265c998bd5834c83a90e9aa6789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPrintMetafile (cyclomatic 20, cognitive 10): drawPrintMetafile has cyclomatic complexity 20 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvaskit/metafile-print.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea68b4514af8210b05cf377756e8fd448e663ac0626f44530d7e4ef0128e19b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvidenceRanking (cyclomatic 20, cognitive 9): validateEvidenceRanking has cyclomatic complexity 20 and cognitive complexity 9; 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":"scripts/font_typesetting_risk_publish.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d867167cd00ae0d33c49cc8f60741de70b73b255727e651257aee177c814b49f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupProjection (cyclomatic 19, cognitive 36): lookupProjection has cyclomatic complexity 19 and cognitive complexity 36; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87e39e64ef38aecc4f77cbe9ff6162f51ed9ca4b8d277549c65201d5b726aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function svgCommentScanSource (cyclomatic 19, cognitive 35): svgCommentScanSource has cyclomatic complexity 19 and cognitive complexity 35; 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"275c1b91b2d368f84bbc3bce61f5f62284d15a2afa4bd00d6a7c3f06ec1e0766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeDecisionText (cyclomatic 19, cognitive 32): consumeDecisionText has cyclomatic complexity 19 and cognitive complexity 32; 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd600950e59a46207399f66396cae5f2a901aedebc119e1668261013d7bd8957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchWindowedGreedy (cyclomatic 19, cognitive 29): matchWindowedGreedy has cyclomatic complexity 19 and cognitive complexity 29; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12e447c0ca8ee43ee2656cb4bd3b37c96ddcd3470d60592b761ead6ad12604"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOverlays (cyclomatic 19, cognitive 28): applyOverlays has cyclomatic complexity 19 and cognitive complexity 28; 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57eb49e4bb8c863262c477b8fefc9ab4318cb41a4ca35eac4b053521662b38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteSelectedCellBlock (cyclomatic 19, cognitive 27): deleteSelectedCellBlock has cyclomatic complexity 19 and cognitive complexity 27; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5876}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fda221f4025d5879cbe568fe09f4fe58cbaa9d6cc605f14d84bed496e3279d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLayerTreeTransport (cyclomatic 19, cognitive 26): readLayerTreeTransport has cyclomatic complexity 19 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":"rhwp-studio/src/core/layer-tree-transport.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a05796945902c38bad3ded7740387c97e5b8762e418ca69bf5da7e7c12a039b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFocusedMain (cyclomatic 19, cognitive 25): runFocusedMain has cyclomatic complexity 19 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":"rhwp-studio/e2e/issue-2214-page-local-repaint.test.mjs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499169c462a547c4d677a057b85c2946632e1a04781b937502644640728dcf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFont (cyclomatic 19, cognitive 25): resolveFont has cyclomatic complexity 19 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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e0cbc3f62631dba6211482d63cb1c482028df23cf98edbcf383e2aeb70823c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 24): (anonymous) 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"36183f0f480710be25b14267de7d6a44ba2fd00ce312de1f53cb88be6a24ada6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 19, cognitive 24): onMessage 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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"898681dc26527565493d687c107fe88e3db12bc25b4114da3a0a5dbad9b55605"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 23): (anonymous) has cyclomatic complexity 19 and cognitive complexity 23; 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":"rhwp-studio/e2e/merged-cell-boundary-drag.test.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c0690a8249da2ac208c8821bbb61a5646d6339b184a2255e5c04beffca1b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveVertical (cyclomatic 19, cognitive 22): moveVertical has cyclomatic complexity 19 and cognitive complexity 22; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e69cd9c241eefe514181e76b008a58c83a225c24fb2a4bf78a873df610e3d80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) has cyclomatic complexity 19 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":"rhwp-studio/e2e/topmost-hittest.test.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae33b08f5d34fb5eb4a933c1dcfa2d2f6a3842843002d61e38af9dbc6077315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyHistoricalSourceCandidates (cyclomatic 19, cognitive 21): verifyHistoricalSourceCandidates has cyclomatic complexity 19 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"2631921b373863d6486830d744bd2439ef6e3a8e5a360846d9e39958dcce0dce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatusDescription (cyclomatic 19, cognitive 20): parseStatusDescription has cyclomatic complexity 19 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda22553cbac60d528fd4b490bcde12e02b31efd1ddeb33c032953db740a8368"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function worker (cyclomatic 19, cognitive 20): worker has cyclomatic complexity 19 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":"scripts/export-wasm-png-for-sweep.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"31982ac65ec67ef493d42f70506e9afd8507e905552ef4e3de3ed981b693fb31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawStyledShape (cyclomatic 19, cognitive 19): drawStyledShape has cyclomatic complexity 19 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5551}}}],"partialFingerprints":{"codehealthFindingId/v1":"627c3d5b5dcd2be5f8c60db94fae32fdee2f411da4bcd7c0413c60bc6adb0f91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glyphOutlinePayloadStatus (cyclomatic 19, cognitive 19): glyphOutlinePayloadStatus has cyclomatic complexity 19 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff02ea0283c6d9c33ba181331fcc2bbe22e4599723fa4de2809698552ec5c5be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function determinePolicy (cyclomatic 19, cognitive 19): determinePolicy has cyclomatic complexity 19 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c664d7a3f6b17ec38db2fd917bb8f68c5f6a37b20e6351a60bf4f9bf4512874d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvaskitReadinessExpectationsForSample (cyclomatic 19, cognitive 18): canvaskitReadinessExpectationsForSample has cyclomatic complexity 19 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 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ed7f3a8d238309ea315fb3c6ad5a1287d60b21819686711979c003c89fd23a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshInvalidatedPage (cyclomatic 19, cognitive 18): refreshInvalidatedPage has cyclomatic complexity 19 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 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"da94ecbc820564833d26d93136578a6abff0339519a0ce3c19031fa1f076281e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) has cyclomatic complexity 19 and cognitive complexity 17; 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":"rhwp-studio/e2e/ai-providers.test.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72857a92fe4cb777a02484906b47590f90a3cded4e5ab71ff19c1c3ed3d449c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFrozenOracleInputs (cyclomatic 19, cognitive 17): validateFrozenOracleInputs has cyclomatic complexity 19 and cognitive complexity 17; 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bad9315b6eff6c2d9c600884a0ca5e0673f6354775ca0727af5a39b6f577a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicy (cyclomatic 19, cognitive 14): validatePolicy has cyclomatic complexity 19 and cognitive complexity 14; 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"770e14fffb6ebf32143c68cc717411d5cecd23ba232cd72cc642975c9c3da2d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 11): (anonymous) has cyclomatic complexity 19 and cognitive complexity 11; 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":"rhwp-studio/src/core/host-font-provider.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f8a3d89e70594ec3a3575f4ff1d1870ef0c4db911af9acc203bcead404827d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 34): (anonymous) has cyclomatic complexity 18 and cognitive complexity 34; 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":"rhwp-studio/e2e/theme-mode.test.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"07161ca83b456415bd6f7260a46451987dac5f8b24d75cc0ee74a4347d612a92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateCaret (cyclomatic 18, cognitive 34): updateCaret has cyclomatic complexity 18 and cognitive complexity 34; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dd2e07638a70826b168d723de64807a60b3d2361b46c8db7f59e80ca8defb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 31): (anonymous) has cyclomatic complexity 18 and cognitive complexity 31; 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":"rhwp-studio/e2e/find-first-click-ime.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf55b3fb83e8e2e51d60abc52309251065e65447a2836c34ee7ac31695a6b06f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storedCells (cyclomatic 18, cognitive 31): storedCells has cyclomatic complexity 18 and cognitive complexity 31; 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":"scripts/cell-lineseg-agreement.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3593f8474061408119ffae03781ce6ac3562a0ed46534a585b2e9d6437fd05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImage (cyclomatic 18, cognitive 30): extractPrvImage has cyclomatic complexity 18 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697baae4f6ccac2bcf38945a00538d71315b3f979c2733ae8774e6b163a02f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPrvImage (cyclomatic 18, cognitive 30): extractPrvImage has cyclomatic complexity 18 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2809aa51d0575ff226e23851c8c742bad1d9d946f757e826240b0b2af9cfab0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeWrite (cyclomatic 18, cognitive 28): executeWrite has cyclomatic complexity 18 and cognitive complexity 28; 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":"rhwp-studio/src/ai/agent/chat-controller.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c29f9b240eac4ee91143c6a0e4841f04e1600978aeaf838f0e6cbdfe8344ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchingCollectionFace (cyclomatic 18, cognitive 28): matchingCollectionFace has cyclomatic complexity 18 and cognitive complexity 28; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ae0cbc62c94839c0e4a5b295057f87a18275be460c6e6323ea7956e70d9be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildIdentityTextDiffs (cyclomatic 18, cognitive 26): buildIdentityTextDiffs 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ee543f7e307deb99594ac13c7135abd5501855433476f25573f06a5e1dd390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreEditContextAfterHistory (cyclomatic 18, cognitive 26): restoreEditContextAfterHistory 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3093}}}],"partialFingerprints":{"codehealthFindingId/v1":"c249023af33759b4b0e50560c8b0d6225884c37af6f1d45c27fecd79ff5f80b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatFieldValue (cyclomatic 18, cognitive 25): formatFieldValue has cyclomatic complexity 18 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fef6b5531f44ac62f08dc2346fd5d3de7c3663792488ce43d3381ce3eca677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatFieldValue (cyclomatic 18, cognitive 25): formatFieldValue has cyclomatic complexity 18 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be834f05670b7a7374263959921d7f4a23af31d56ec50ec4446c756cc2e6f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareHostFonts (cyclomatic 18, cognitive 25): prepareHostFonts has cyclomatic complexity 18 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84bf9d53efd4f7e6082e81c3dd39e5f030430adc0b861c2348f03198d1551ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operation (cyclomatic 18, cognitive 24): operation has cyclomatic complexity 18 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3c56bbeed47d9c5a277ecb363d9eb0679886e088f14b33bec9184017c6793f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function menuItems (cyclomatic 18, cognitive 24): menuItems has cyclomatic complexity 18 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6670f778ae9df5f83453a35fc6d83dcbefb2f4c0096616b537e1e689e3d1b29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 22): main has cyclomatic complexity 18 and cognitive complexity 22; 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":"rhwp-chrome/e2e/download-interceptor.test.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"538daa48266b7499033a73bc8ad9b9f22beac55d22aaa8fbfadad86656eee3f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawCachedGlyphs (cyclomatic 18, cognitive 22): drawCachedGlyphs has cyclomatic complexity 18 and cognitive complexity 22; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6465168e87de5d8def8b905da257cf7dd3dd4401ea36c46a8db6b76146819f04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function webpHasSingleFrame (cyclomatic 18, cognitive 22): webpHasSingleFrame has cyclomatic complexity 18 and cognitive complexity 22; 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e98bc10dd58eab8429c826b0b4bd51da2c2c19bf1ac678ea4b4f209de1fb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function charEditOpsFullDp (cyclomatic 18, cognitive 21): charEditOpsFullDp has cyclomatic complexity 18 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"222dd385f7da68a0eaa6c4f79930eb41303d8c096d9f76c7ec36cc2100c9aadd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeWith (cyclomatic 18, cognitive 21): mergeWith has cyclomatic complexity 18 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e293e56964909df48cce77665b78e113df0182984bb7353ea6ebda397f95fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveCellSelection (cyclomatic 18, cognitive 21): moveCellSelection has cyclomatic complexity 18 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"80838c2f281ab8b02e84925b9023a7b7f0c414a951deee7240057ccd673889ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) has cyclomatic complexity 18 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":"rhwp-studio/e2e/issue-536-boxed-pua-canvas2d.test.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"42728955099d76337e77744eb8deb012d0deae9776cb54ab1dec83b9057717e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 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":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc980a1d4579109bd34a30076ead5f17ede2da63e8811fd0beb9b05d31840b98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calcResizedBboxRotated (cyclomatic 18, cognitive 19): calcResizedBboxRotated has cyclomatic complexity 18 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca5af12819f62291829722cb532e972260c04f156581386358eafa5973f98d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sampleRenderedRightLeak (cyclomatic 18, cognitive 18): sampleRenderedRightLeak has cyclomatic complexity 18 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":"rhwp-studio/e2e/table-picture-resize-1282.test.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2ff7e4dfe6e69d9c4e230c435d90f00a039b1b1f62a01e20fc4a45d9cee74c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planBlockCalculation (cyclomatic 18, cognitive 18): planBlockCalculation has cyclomatic complexity 18 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":"rhwp-studio/src/command/block-calculation-plan.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba37abcffe3ba67c94a4f8deefed70550274a509d8fe4e44ac51818e5ca593b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cutSelectedObject (cyclomatic 18, cognitive 18): cutSelectedObject has cyclomatic complexity 18 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ef3646793d5964476bd40dc7750c62927aee02fa22fc75bef1bdc3269b8b93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 and cognitive complexity 17; 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":"rhwp-studio/e2e/issue-3682-chart-object-probe.test.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55a6db06cbcfa5754801c7e3c4bcfac96e352e2184b0b618e3345faa6752166"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; 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":"rhwp-studio/e2e/overwrite-mode-issue7489.test.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b150a6721a1ced4c7c1d6d871e4e13ed67ed0058b9ab1b8f7ea4b3e202d414"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCurrent (cyclomatic 18, cognitive 15): isCurrent has cyclomatic complexity 18 and cognitive complexity 15; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5792}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dc44690427040880b1ed4eefacbd0e68efda1399b62dedeb277610259a01ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectMilestones (cyclomatic 18, cognitive 14): inspectMilestones has cyclomatic complexity 18 and cognitive complexity 14; 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac670210aa0b7723493ee4fcdc8559403f0c04d16b40581ba97d0be1052bf396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyChar (cyclomatic 18, cognitive 14): classifyChar has cyclomatic complexity 18 and cognitive complexity 14; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f683cbe8124c843387817ccbf43601281ef682b977affc466fcdf781b2de8f44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadMetricContract (cyclomatic 18, cognitive 14): loadMetricContract has cyclomatic complexity 18 and cognitive complexity 14; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9029773755b67563f7a9a24d9ce62892c46d3b2ebbda3e9d86d3f64a2db1bbd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 12): (anonymous) has cyclomatic complexity 18 and cognitive complexity 12; 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e83380a94c4d5a9cb5905b492b77e3814c6c2db693546657f04386633bda21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTextDecoration (cyclomatic 18, cognitive 9): renderTextDecoration has cyclomatic complexity 18 and cognitive complexity 9; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5ae3dafcc4c658e01ffe08af6dca6b71a92ee6180203b86d06d3e6f228462a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imageCropSourceRect (cyclomatic 18, cognitive 9): imageCropSourceRect has cyclomatic complexity 18 and cognitive complexity 9; 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":"rhwp-studio/src/view/image-crop-scale.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a458218e2009e237fb1cb47d1e7a398f1298d9011f87fc862d4bf361158c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareHftOtfFonts (cyclomatic 17, cognitive 39): prepareHftOtfFonts has cyclomatic complexity 17 and cognitive complexity 39; 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7f8cc2bba55a699c77cafab1bf6e9518cc22835e0eb95330c339768f605eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawPatternFill (cyclomatic 17, cognitive 31): drawPatternFill has cyclomatic complexity 17 and cognitive complexity 31; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52f69edebaa1be96423aad984876adfbee812837f0d3dd072013309cccf4e39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTableByOuterClick (cyclomatic 17, cognitive 30): findTableByOuterClick has cyclomatic complexity 17 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6011ddb3d738c2f345178088dde7faee3b597524019797d3a870746e68f8e0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertTaskIdAvailable (cyclomatic 17, cognitive 28): assertTaskIdAvailable has cyclomatic complexity 17 and cognitive complexity 28; 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d323e0a8760165b9152993f213baa838138e5b9d4de61c28afe87ddc025ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTableSummary (cyclomatic 17, cognitive 27): buildTableSummary has cyclomatic complexity 17 and cognitive complexity 27; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6681308c996939791dce1698c62e871ee7d9cdba42c3f1891772b1e28a82a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function source (cyclomatic 17, cognitive 27): source has cyclomatic complexity 17 and cognitive complexity 27; 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":"rhwp-studio/src/view/canvaskit/paragraph-fonts.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0068a74dacd7e1a9f2accf11fa554060208b7cc017155d66562819c0a0bcb9ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateRect (cyclomatic 17, cognitive 25): updateRect 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d035a741dd1089862cd0b8b9a2b59c55b60dd165a70ba6c01048dcc94f1376b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metricProjection (cyclomatic 17, cognitive 25): metricProjection 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fd42599fb4e113388c190ec6d1a76f69f72b6b7431cd87622b23e116efb7dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLocalProgram (cyclomatic 17, cognitive 24): loadLocalProgram has cyclomatic complexity 17 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f285017e557b6556769fcee857318f26dd834aa4cce7a6838ad7cf68bf262e77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveUncached (cyclomatic 17, cognitive 24): resolveUncached has cyclomatic complexity 17 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":"rhwp-studio/src/view/renderer-session.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"70941ffb02d4b0a0e96c23f4a42372b343993f614749c419ab80b17bb62053dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTierManifestAgainstBase (cyclomatic 17, cognitive 24): validateTierManifestAgainstBase has cyclomatic complexity 17 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":"scripts/rust-unit-test-tiers.mjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2396c87cbc625a3855522c6b34a299e1f8b18faedc197f08f215d109aa61f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 17, cognitive 23): run has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c8019bf65517051c932b2df6a461fd56b2bec3bd13df9478fd62a4e2c1f2ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f6fcba4a2333aaa0f69d801d65659a439456e6658f4f2b7acc88a8f5657a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchShortcut (cyclomatic 17, cognitive 23): matchShortcut has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-studio/src/command/shortcut-map.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d240a9bbd71c9f177adb13bfa6efb3fe08f8e00eb74f07d089d96b936ba032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildUniqueSigPairsInSlices (cyclomatic 17, cognitive 23): buildUniqueSigPairsInSlices has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d89a0074ff0fb491ce359f4a8c4ab808805dfb9120f23c731ae0ca1ad19a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeWith (cyclomatic 17, cognitive 23): mergeWith has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1775788a2b54db69bfa2e06cdf6a15020f57fd5b64846cba4dc7149a5807b320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRenderSurfaceBudget (cyclomatic 17, cognitive 23): planRenderSurfaceBudget has cyclomatic complexity 17 and cognitive complexity 23; 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":"rhwp-studio/src/view/render-surface-budget.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ffacb1bd8d3f8ca3edd70577e542f9c08806796deddf5c63425b6a4df16a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectWorkflowEvidence (cyclomatic 17, cognitive 23): collectWorkflowEvidence has cyclomatic complexity 17 and cognitive complexity 23; 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":"scripts/ci-workflow-evidence.cjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cd57fb116489ebe8eba7522aaa4c994a068d58546a253ccd77c3f26aec9449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hitTestBorder (cyclomatic 17, cognitive 22): hitTestBorder has cyclomatic complexity 17 and cognitive complexity 22; 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":"rhwp-studio/src/engine/table-resize-renderer.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"36250f21f890a1f1fa6eeb34c2bd3010de6d4542f5eb441144ab3d3efc251150"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 21): main has cyclomatic complexity 17 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":"rhwp-studio/e2e/probe-input-perf-issue3137.mjs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbde1cc32eb2da3c1a0aed8e609bae384b316a332d03ba781253fb379d3585f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) has cyclomatic complexity 17 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":"rhwp-studio/e2e/table-picture-resize-1282.test.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd81573da1c0d56847d5d7ac5641b60e409f9551b02826b73d2fd3507e2c82a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pageTextFromLayout (cyclomatic 17, cognitive 21): pageTextFromLayout has cyclomatic complexity 17 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":"rhwp-studio/src/ai/tools/read-tools.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae0bb6eb8c4fbb3236ea29baf9bd3d54a57dd19b2a6eae6b19736c59a07381a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPdfPrint (cyclomatic 17, cognitive 21): runPdfPrint has cyclomatic complexity 17 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"284930760df3a41d19d455eefeb0bc975269f0700a723e91614ae399ab730fbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLeaf (cyclomatic 17, cognitive 20): renderLeaf has cyclomatic complexity 17 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9258cb1ee7a4a1c697b2024c4a4479d9472b845fd483080c2d55841f436e884"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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":"rhwp-studio/e2e/textbox-picture-ops-1273.test.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"044ad9ca4de4dc778eb3db6f454e00c0a9d72bfcf4bea313200a9c7d6d93999e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContract (cyclomatic 17, cognitive 18): validateContract has cyclomatic complexity 17 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"281bb88db8f834075cc4b49cfd82d7ad6e428c2dae59540802dda310ae1e60e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveChromePath (cyclomatic 17, cognitive 18): resolveChromePath has cyclomatic complexity 17 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":"rhwp-studio/e2e/helpers.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"005b6497ba38840f1e8960de5e929b6dccbeed93c3057ecf97f783dc62ac7e58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) has cyclomatic complexity 17 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075d9d03b7e2ff8bc3da697675a8ad600116a2145afab8e3bef303de2c6d6e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDecisionRow (cyclomatic 17, cognitive 18): validateDecisionRow has cyclomatic complexity 17 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b143928441992216f4f69526bc968e746a249e49f79c8ca207a9a8c898b9b97a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAutoPageColumns (cyclomatic 17, cognitive 17): resolveAutoPageColumns has cyclomatic complexity 17 and cognitive complexity 17; 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":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3568ad86193c0e367de50447061243c12124b060a40f38b62bb1122b8605015"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; 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":"scripts/font_rule_lifecycle_audit.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3989c526f739577841bb3015a7e4000d220243501329479be80cc1d9def1e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDownload (cyclomatic 17, cognitive 16): classifyDownload 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b590e4eb28269022daf11ab41226d4a8c6a925a1ab7aaf34df4bff066a058d43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDownload (cyclomatic 17, cognitive 16): classifyDownload 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":"rhwp-firefox/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6437d35a66cb0cac978f042abadeaa91794165c88f56f5e26f94290cc1c0d54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDownload (cyclomatic 17, cognitive 16): classifyDownload 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":"rhwp-shared/sw/download-interceptor-common.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a6b591e1ad202862bdbabf3775e51f3bbf4a2b8ac4394582e042b97ef18497"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hyperlinkAtPointer (cyclomatic 17, cognitive 16): hyperlinkAtPointer 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b951d6f0f33a19f679ccf1a7c0bca55a70890b55d0f064f87c75e2b99f80bb3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compatibilityGlyphView (cyclomatic 17, cognitive 16): compatibilityGlyphView 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":"rhwp-studio/src/view/canvaskit/compatibility-glyph-view.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4b854ac98717f26ed5ee51141b28d1c757a1c35dbb91c13ea6ee6916dd31ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvasKitSfntGlyphCount (cyclomatic 17, cognitive 16): canvasKitSfntGlyphCount 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":"rhwp-studio/src/view/canvaskit/sfnt-face.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fb846b265f9b7109b665c0a7cd3458fda1f07f898eeb7f54c7a88481b818dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLayerPlaneSummaryFromOverlayImages (cyclomatic 17, cognitive 16): getLayerPlaneSummaryFromOverlayImages 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fc7167ecf93618232cfda8e27264bb7adacc7d3da132a0d6b3918b95b3a29b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileCoverageAggregate (cyclomatic 17, cognitive 16): reconcileCoverageAggregate 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe739d4da0a0a87e4ee03b2223f4963d844daaa26769219d5bbd1acb653c00b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRuleShape (cyclomatic 17, cognitive 16): validateRuleShape 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":"scripts/font_rule_registry.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc8eace67debfa9cc1870502698e97a71328e4161719ce069b25063f5c3352b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revertTextCommand (cyclomatic 17, cognitive 15): revertTextCommand has cyclomatic complexity 17 and cognitive complexity 15; 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b4af4b9b188741156de093d10bc64b7c4f97532edef6440a12f0499783db3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function imagePixelSize (cyclomatic 17, cognitive 15): imagePixelSize has cyclomatic complexity 17 and cognitive complexity 15; 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3b3906d8a15377eee9bd5d351e7a233bcfb68c05d085713d1774fc380c8d38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 17, cognitive 15): onConfirm has cyclomatic complexity 17 and cognitive complexity 15; 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":"rhwp-studio/src/ui/formula-dialog.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"33851739f86c916fc1b8df20892328610da677d10340987e302fde4507374c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseImageData (cyclomatic 17, cognitive 14): parseImageData has cyclomatic complexity 17 and cognitive complexity 14; 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a21d08007f7d5182842519588392c050b043bfe13e6489d0d102ff6f4cca282"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseImageData (cyclomatic 17, cognitive 14): parseImageData has cyclomatic complexity 17 and cognitive complexity 14; 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":"rhwp-firefox/sw/thumbnail-extractor.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c0b8349470d92e52f75879b5f279b89c7de9ad65f2066609b12728cb43684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fontBlobPayloadBytes (cyclomatic 17, cognitive 14): fontBlobPayloadBytes has cyclomatic complexity 17 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"291f592ad9632fcc93b0387e4f02be6d7ec6d162847f11e611d6ffcbd59595b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTextV2Tree (cyclomatic 17, cognitive 13): normalizeTextV2Tree has cyclomatic complexity 17 and cognitive complexity 13; 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":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac6639a09dadc0c0069ca5a7e89e963ceec88df200cc2817af420674a4bfd58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEdit (cyclomatic 17, cognitive 12): applyEdit has cyclomatic complexity 17 and cognitive complexity 12; 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":"rhwp-studio/src/command/commands/hyperlink.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e9446b37077bff20a9a426f8770945c93bf78ee5cf106024f355ecc60dce4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawEquationDecoration (cyclomatic 17, cognitive 11): drawEquationDecoration has cyclomatic complexity 17 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5385}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ea1c314c721bf9c5ac01413d5407b785b0d140aebd2160af55be98dc49bc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 10): constructor has cyclomatic complexity 17 and cognitive complexity 10; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fc02defa6f372a42e36c10f775fcbd0df6f9f0b7e6d10ad5985f906554f2ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAgentTask (cyclomatic 16, cognitive 41): runAgentTask has cyclomatic complexity 16 and cognitive complexity 41; 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":"rhwp-desk/ui/js/agent.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9cac9d461599de60e9ef340d729c3f49c7c55ac921d198136fc7be7dbb00e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokens (cyclomatic 16, cognitive 35): tokens has cyclomatic complexity 16 and cognitive complexity 35; 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":"rhwp-studio/tests/helpers/rust-mutating-exports.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0a18a08a1eaec99ead2073433363ca6debff21a2ce6e0451a222138e88b922"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractErrors (cyclomatic 16, cognitive 33): extractErrors has cyclomatic complexity 16 and cognitive complexity 33; 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":"scripts/ci-impact-report.cjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b7b9e2593db80a51d066a5782a4d66077e5a10e79298a89fa769ab959b92f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportedSurface (cyclomatic 16, cognitive 33): exportedSurface has cyclomatic complexity 16 and cognitive complexity 33; 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f4f68d9d37191f98e4756dd1088497b92cf52bee861afcc7875608662d39a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOperation (cyclomatic 16, cognitive 30): validateOperation has cyclomatic complexity 16 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd18597aae814b82d032c66022137c656b7e7f298407baa3931f91066ad9d4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLayerImageEffectPixels (cyclomatic 16, cognitive 26): applyLayerImageEffectPixels has cyclomatic complexity 16 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":"rhwp-studio/src/view/image-effect-pixels.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9faf6b56a4e768e2a2f4659bb1167e7813d1d137934a4f3a166076f06f2d644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function linearPageAtPoint (cyclomatic 16, cognitive 26): linearPageAtPoint has cyclomatic complexity 16 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":"rhwp-studio/tests/virtual-scroll-visibility-snapshot.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"188a85b9299d550490097b8a3643754c068780cdb15ca71a211f2e3ae42ad8b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 26): main has cyclomatic complexity 16 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":"tools/hwpctrl_compat/runner_rhwp.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc167a2f40a89aee18d1a0debe8c2a9ac78e14943c53633cc732e1105a5afb30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 25): (anonymous) has cyclomatic complexity 16 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdf4f561cf52b8f3d189caf91631ad454bef6f1be951530f8f2a20abc4e73bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tallyDocument (cyclomatic 16, cognitive 24): tallyDocument has cyclomatic complexity 16 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":"scripts/cell-lineseg-agreement.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e2c79863e376ca2e4ca9e2ce076461dda7f9ae28b056dc1d57240296c71f3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function needsStructure (cyclomatic 16, cognitive 23): needsStructure has cyclomatic complexity 16 and cognitive complexity 23; 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"517290c743400436ec92cfe03c3ac8dded510745e263a8087f8031912cb4d54d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGlyphRun (cyclomatic 16, cognitive 23): renderGlyphRun has cyclomatic complexity 16 and cognitive complexity 23; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab5561b07aeec456e3d01df16ddc08e8e4d8a33a285c38b20282c974456f333"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 and cognitive complexity 22; 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":"rhwp-studio/src/view/canvaskit/replay-fingerprint.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee18b871cf3ef6d3016560a59a05929fd7b2973f130595fea95b089f51a5f48e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function propertyExpression (cyclomatic 16, cognitive 21): propertyExpression has cyclomatic complexity 16 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":"scripts/font_rule_candidates.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"755dbb4459c678e2cc8209c33ec15f4837edba47eb27662731b5d5d2e665e0a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawVertical (cyclomatic 16, cognitive 20): drawVertical 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":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14e94360a1d799f35f3a130cfca3ecd98c45975066557af47d92a835a931760"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toGeminiSchema (cyclomatic 16, cognitive 19): toGeminiSchema has cyclomatic complexity 16 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba48153e55e492796b40f2f5870741985debbedaaf98f361b24de685f8c5c416"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectVectorRawSvgDataUrls (cyclomatic 16, cognitive 19): collectVectorRawSvgDataUrls has cyclomatic complexity 16 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":"rhwp-studio/src/view/raw-svg-prefetch.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8c62720282a4b581cc51b735827ca74d731f0e4580f6a0e2c16321e2a0047"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 16, cognitive 18): onmessage has cyclomatic complexity 16 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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9330e0f0f1138d5d0d393d684e93e236847f9a416f90fbe29d141b9374920fc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 and cognitive complexity 17; 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6cfd33c1f15b13d11ea348fa83a9e43b182d8b43b25c4e7d2701f91afe024a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEquation (cyclomatic 16, cognitive 17): renderEquation has cyclomatic complexity 16 and cognitive complexity 17; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4716}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd32a27180dd99ff7f08a1040c4261df533b28f4870593c41a8f8caf9751b5c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMonochromeGlyphOutline (cyclomatic 16, cognitive 16): renderMonochromeGlyphOutline has cyclomatic complexity 16 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 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5346b2f4062e01c95efb4226c85c274f0a79306c033b3d6f873e74e85f8da3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; 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":"rhwp-studio/src/core/document-font-status.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d705ebc3bc487b9336829332b20521a73cec706f4f69ec050d5f55f5e556d3e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populate (cyclomatic 16, cognitive 15): populate has cyclomatic complexity 16 and cognitive complexity 15; 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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc63efa3f7511302b2b9834881543ac89655b0eb10faf6a53e834d92fe8d91e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateIdentity (cyclomatic 16, cognitive 15): validateIdentity has cyclomatic complexity 16 and cognitive complexity 15; 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f8981189911e8fc380db68116406a27507d890907d2a3f24dd2042b6822599"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isExcluded (cyclomatic 16, cognitive 15): isExcluded has cyclomatic complexity 16 and cognitive complexity 15; 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f89c6853878fdfa4b7275fd6d4f41439f03fb82489b704348edc906334d0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; 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":"rhwp-studio/e2e/issue_8160_password_open.test.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e80ed5ed3afa835055858d3b8a524aab5568450e124de77f981dbcb34b9911f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSnapshot (cyclomatic 16, cognitive 14): normalizeSnapshot has cyclomatic complexity 16 and cognitive complexity 14; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d0f6f534a0d1c609bc87f51c873d7ae28642286de9ebdd2b27fe79f2fe3ab5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 16, cognitive 14): add has cyclomatic complexity 16 and cognitive complexity 14; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8615de762acc66b2d0775155931400cdee32b22a40f8d4220e923b6e6ac7cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 14): main has cyclomatic complexity 16 and cognitive complexity 14; 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":"scripts/collect-nextest-target-durations.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada124936e73f5c12fe08e14cd2080f6bfe026d199f55e60d84e65eb2d2dc544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFormat (cyclomatic 16, cognitive 13): classifyFormat has cyclomatic complexity 16 and cognitive complexity 13; 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":"rhwp-studio/e2e/issue-2214-page-local-repaint.test.mjs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"805240d06815e8243d3028567e0d49de49a9b79342042a8fe89d896819102b2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectCommandError (cyclomatic 16, cognitive 13): inspectCommandError has cyclomatic complexity 16 and cognitive complexity 13; 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":"rhwp-studio/src/core/command-error.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915ecb7a41c426520887bb0c2056154a348f6f344eb67b8a4f53c6981a8412f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleHeaderFooterNavigationShortcut (cyclomatic 16, cognitive 13): handleHeaderFooterNavigationShortcut has cyclomatic complexity 16 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b1f10c6b840f0d2c844a794a6b245c88dc7e51c5c853b748976e221bc56e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawStrokeWithDash (cyclomatic 16, cognitive 13): drawStrokeWithDash has cyclomatic complexity 16 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5833}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3daccf3daf7a9b2df76ffadcba5f47d0b08d2bda1aad91aa6d2b35e1afd1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv4 (cyclomatic 16, cognitive 11): isPrivateIPv4 has cyclomatic complexity 16 and cognitive complexity 11; 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d4227534c653c232027dc48c1af81bbaf4a6886588aefacdfbb310b772aff5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv4 (cyclomatic 16, cognitive 11): isPrivateIPv4 has cyclomatic complexity 16 and cognitive complexity 11; 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":"rhwp-firefox/sw/fetch-security.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a76d4e23e15619a3bc2ea268501b3a927981b2507dd6a07e6085cb92e6f743e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv4 (cyclomatic 16, cognitive 11): isPrivateIPv4 has cyclomatic complexity 16 and cognitive complexity 11; 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":"rhwp-safari/src/background.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbbf74b6f1d577169093d2bf0e29e3ba0ff005c1e3a24f4ea56078f9ee5ba1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv4 (cyclomatic 16, cognitive 11): isPrivateIPv4 has cyclomatic complexity 16 and cognitive complexity 11; 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":"rhwp-shared/security/url-validator.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1fa4b51be6efaab9dac2996711983c65d0186a8413cc71d2e3d08ad42d6cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 11): (anonymous) has cyclomatic complexity 16 and cognitive complexity 11; 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":"rhwp-studio/e2e/toolbox-visibility.test.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"995b4b3a2fab85219d4d4b9fa0b8ec94a81d41d13548c112436e46077389608b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSweepFontPrograms (cyclomatic 15, cognitive 29): loadSweepFontPrograms has cyclomatic complexity 15 and cognitive complexity 29; 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":"scripts/visual-sweep-font-environment.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eba090dbd6af443206e8c704434eb466148d87c18d9d59725fa66fadc8a091"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSingleCellResizeTarget (cyclomatic 15, cognitive 28): findSingleCellResizeTarget has cyclomatic complexity 15 and cognitive complexity 28; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1693109e7fb778491a7c2cef7b395375707727854348e279f72e105fa6cd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) has cyclomatic complexity 15 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":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ec67d165f0368124ac222a5690e85c40069ab41d14d6300a09885a3cbd264"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupTotals (cyclomatic 15, cognitive 24): groupTotals has cyclomatic complexity 15 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b846d73a3a42b8eac48162f17795399be4ea597cd8aaacf89f41a9c7d7065a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 24): main has cyclomatic complexity 15 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":"scripts/gate_bridge.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9e5d8633e0585d75147955c749827ab1071ffda67a788365288ab19a271c4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; 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":"mydocs/pr/assets/pr8296-maintainer-20261101/canvaskit-probe.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2596e604bc965bf8c950ed6551df0408e31faf6a8a8ececa29fa068cf2419bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareSnapshots (cyclomatic 15, cognitive 22): compareSnapshots has cyclomatic complexity 15 and cognitive complexity 22; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3f772491e9340555e97b6ecb91424e06ca1b34eb9aed66db1051b54077283"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawTiledImage (cyclomatic 15, cognitive 22): drawTiledImage has cyclomatic complexity 15 and cognitive complexity 22; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a13529f6089a93756a3f7345364b706e78c1d2a6113bb48b4df65f518b1f4d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 15, cognitive 22): parseArgs has cyclomatic complexity 15 and cognitive complexity 22; 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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0529354c24510c5121bb528ba3970ba50e213985c80ef8866ee60d97d03aeb45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 15, cognitive 21): prepare 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":"rhwp-studio/src/core/supplemental-text-metrics.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94bafcf2f916767b79d639bc1a269667772f8294a0434638a7441c30f56995c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 15, cognitive 20): send has cyclomatic complexity 15 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2322acb1b30f48f378248fd82f06e4ee46d0ff552bef62a56f200443e45245c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditCi (cyclomatic 15, cognitive 20): auditCi has cyclomatic complexity 15 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":"scripts/ci-impact-policy.cjs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5838bd1c7fa124de80eecb4b3f92acad6216921dc8c7aeb4c3c3522cbd3a40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSelection (cyclomatic 15, cognitive 19): updateSelection 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6680d8c0d508c22cd91b2ed60a4ce201a522c8ef3c44ec0cd1fefc825d02d2da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawCachedText (cyclomatic 15, cognitive 19): drawCachedText 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4565}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa545aee0eac6c51ddd42604342dab2e2727f2e2e9c6712cc1cb7ead9e99bbee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleAutosaveStatus (cyclomatic 15, cognitive 18): handleAutosaveStatus 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":"rhwp-studio/src/main.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf388f5ddf92db442128a2227f52b1f2c0d4347064eada12ee19c18b27b898e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestDocuments (cyclomatic 15, cognitive 18): manifestDocuments 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":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fe342162e7737fb5a80dd06b5b10048a0153c512c38b95b75a7ee620aa3f56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDurationPolicy (cyclomatic 15, cognitive 18): parseDurationPolicy 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":"scripts/select-nextest-archive-targets.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc04b58ea231a476178353e27fe5bae59dbc5fdb496d615619d804b0ef17068"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #runObjectAction (cyclomatic 15, cognitive 17): #runObjectAction has cyclomatic complexity 15 and cognitive complexity 17; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2ef56a58d59351dcf2a8299c4de8f3cee67cd5b8242e9abf4fc10ff8826fb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSfntNameTable (cyclomatic 15, cognitive 17): parseSfntNameTable has cyclomatic complexity 15 and cognitive complexity 17; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"461b5abe07ca0212a3801aad5b1cc4163ff7bc104d7441005270e409daa7d71c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 15, cognitive 17): render has cyclomatic complexity 15 and cognitive complexity 17; 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":"rhwp-studio/src/engine/cell-selection-renderer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d126a8cb985a3f7d86019c36ef7b82e1d6ed923076588459a4f59af2da29c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showTextboxPlacementOverlay (cyclomatic 15, cognitive 17): showTextboxPlacementOverlay has cyclomatic complexity 15 and cognitive complexity 17; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"994dfba4cfa04c251090378d309de79fadc873150b04c6e6a76b0f500833a54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 15, cognitive 17): initialize has cyclomatic complexity 15 and cognitive complexity 17; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ec69b65999b83cc920630756cd5ba01475315df01efb0b801ed4f4ad47b3e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _handleResponse (cyclomatic 15, cognitive 16): _handleResponse has cyclomatic complexity 15 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 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":"npm/editor/transport.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d82045fcec64b37f8786fd226645015cff995910ff691983544c1f0bc274630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #deleteRange (cyclomatic 15, cognitive 16): #deleteRange has cyclomatic complexity 15 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 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"754c19380376f0304590f2a6d8c4f397ef58f5e46ea69f216fcbffb03eb1c0bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGithubDocumentUrl (cyclomatic 15, cognitive 16): classifyGithubDocumentUrl has cyclomatic complexity 15 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 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":"rhwp-chrome/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb61530564035dccc3c8b92c41d6d1b964e79e10c42951e60758878ffab3a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGithubDocumentUrl (cyclomatic 15, cognitive 16): classifyGithubDocumentUrl has cyclomatic complexity 15 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 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":"rhwp-firefox/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6733cceaec0e9a61088cc2d19e41bd302fd6db4900513dbf5825790513a6bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGithubDocumentUrl (cyclomatic 15, cognitive 16): classifyGithubDocumentUrl has cyclomatic complexity 15 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 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":"rhwp-shared/sw/document-url-resolver.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"df286d3230cabcd12b67bf31a7c7c9223dc34b511329df255e5448b53195d606"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTarget (cyclomatic 15, cognitive 16): findTarget has cyclomatic complexity 15 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 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":"rhwp-studio/e2e/table-picture-resize-1282.test.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c635a19ac0abb13656bab08e7a97bf199ad6cca68628154d0e5c4552f5da313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveCurrentDocument (cyclomatic 15, cognitive 16): saveCurrentDocument has cyclomatic complexity 15 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 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0dc9139f7a55b04a004095011cb1c561aff69cddc9e6b3eb9a66b6759b584e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNearestConnectionPoint (cyclomatic 15, cognitive 16): findNearestConnectionPoint has cyclomatic complexity 15 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 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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c756e24ba5ea63e72367f0f0f93d1635e540dab53eb7adbbab6be8159cad44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyHangingIndentAtCursor (cyclomatic 15, cognitive 16): applyHangingIndentAtCursor has cyclomatic complexity 15 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 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b3afcb2cd5a4828cc46c1f4bb32ba8894eaffe5d29827a134767c211f972b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liftImagesToBlockLevel (cyclomatic 15, cognitive 16): liftImagesToBlockLevel has cyclomatic complexity 15 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 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d916c592ca0ee3eecd69109d1b80278927bae14bd9caecf23d014ee43c36fc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSaveTarget (cyclomatic 15, cognitive 15): resolveSaveTarget has cyclomatic complexity 15 and cognitive complexity 15; 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":"rhwp-studio/src/command/save-target.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f97d782d4144baddf905090e547a9b5d6ef63153f5b6c749e19a9ad61b566"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRequests (cyclomatic 15, cognitive 15): validateRequests has cyclomatic complexity 15 and cognitive complexity 15; 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":"rhwp-studio/src/core/supplemental-text-metrics.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf7f35a98848fd63ab7ed6ce1751c6c68d415db7abb982b96434404ff14552c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isResponseEnvelope (cyclomatic 15, cognitive 14): isResponseEnvelope has cyclomatic complexity 15 and cognitive complexity 14; 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":"npm/editor/transport.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e18a28827dfd7c0206b51ba31a61194db835b6587c97a57a4424d7ba6942b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 15, cognitive 14): render has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-chrome/e2e/report.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"664a07cca0e1b30cf5d3fbdd09e6f2d6c8ffc66c6399d921b594c98f5b417714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/e2e/dialog-theme.test.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f82bd612e4e0aa098b8ceffc1bc6f6d7af86084d86570bb5f1e038d46686ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectText (cyclomatic 15, cognitive 14): selectText has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/ai/tools/command-tools.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d36f3598b1207ba16f358999428b8b04817cdc3d5b77288dc77115601e4ce1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeFormButton (cyclomatic 15, cognitive 14): executeFormButton has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler-form-action.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341bf5c998d80ad17a14f9dec18696c6c79ea90508b28ed5cb76e1c4467b025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getContext (cyclomatic 15, cognitive 14): getContext has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e250c3ca1f2970dbcc52fb044a30afb8d36033cf955a54ab6201b8b754dedbc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 15, cognitive 14): onConfirm has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cb6bd57e8144730d14ec081e873fdd3d81894a9e4fa0081cfea0ef9978b3b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawEquationTextWithFonts (cyclomatic 15, cognitive 14): drawEquationTextWithFonts has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit/equation-text-replay.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc1910c0d383db2560fec79482ec9cd564342e961d3d9c5784e9cbc88054ad0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticSvgStrokeLayer (cyclomatic 15, cognitive 14): staticSvgStrokeLayer has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb92f36a73714e2bd827f9dc65075762331be9d3d7905307045d236d28b48824"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocument (cyclomatic 15, cognitive 14): loadDocument has cyclomatic complexity 15 and cognitive complexity 14; 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2547e952d3a44a4fb3d611ab7ce40f619b52ff3f35cf5a92d2c851cec779ea94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relocatePictureToDropPage (cyclomatic 15, cognitive 13): relocatePictureToDropPage has cyclomatic complexity 15 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"606fdb27598328c4920ccf20ec78956a05767762e3647da9968f1608131b3dea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onViewportResize (cyclomatic 15, cognitive 13): onViewportResize has cyclomatic complexity 15 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ba3b0a8dc9ff4a6cc5d0aee765ff42e1434d89f249529b666908be28d15ff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printMetafileBytes (cyclomatic 15, cognitive 13): printMetafileBytes has cyclomatic complexity 15 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98fb3aaa14d63d149bb74ec292506d1e25596c489e65cc725ffd20572f5f8ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticSvgSupportedAttributes (cyclomatic 15, cognitive 13): staticSvgSupportedAttributes has cyclomatic complexity 15 and cognitive complexity 13; 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2756699daafba1293be762a1fa77e79aa31cbf282319219ae72f211c11a4e73f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runResizeSnapshots (cyclomatic 15, cognitive 12): runResizeSnapshots has cyclomatic complexity 15 and cognitive complexity 12; 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":"rhwp-studio/e2e/ruler-resize-support.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f5df6f7d813b196ad61135364a3dfa2a3c42ec60846e50f5f71cfa6b9b4c48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 15, cognitive 12): execute has cyclomatic complexity 15 and cognitive complexity 12; 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18c177239f0dd602846a0ad98e6e37772f2fda1374bf58c4324881e8115017"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SaveAs (cyclomatic 15, cognitive 12): SaveAs has cyclomatic complexity 15 and cognitive complexity 12; 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":"rhwp-studio/src/hwpctl/index.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afd4704db32d9def7feb5df36a833c0a08826cf75b1aa26c32ffa889811266a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 15, cognitive 11): execute has cyclomatic complexity 15 and cognitive complexity 11; 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b006818f72e16d5323da64245ce326adbc2357367d2e3e90668c872d80682dd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticSvgGlyphRaster (cyclomatic 15, cognitive 11): staticSvgGlyphRaster has cyclomatic complexity 15 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f737e566e44b569f9b164f7a29e562a915667b509dae2901c1f617fd591ac7a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCommittedCellEnterSplit (cyclomatic 15, cognitive 10): isCommittedCellEnterSplit has cyclomatic complexity 15 and cognitive complexity 10; 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce6e380e542ded67955c7b5b8113320c0fcf138fdfda0d5aa2ed56475555904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 10): (anonymous) has cyclomatic complexity 15 and cognitive complexity 10; 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"483b13e121e522bb96160efec7b2195009c650fa907dadc9ff9a0d9fe3d5770f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 10): (anonymous) has cyclomatic complexity 15 and cognitive complexity 10; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2734f06f7d083d446b08ac192959e0debff1bb331eafb5fc4a1fad7981d1bd9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 26): (anonymous) has cyclomatic complexity 14 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":"rhwp-studio/e2e/issue-6117-cell-underline-canvas2d.test.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"be785e5479faa135d053781d97f3f2ed7633f68069306db59914278988b348d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 26): main has cyclomatic complexity 14 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":"rhwp-studio/e2e/probe-flow-input-latency-issue3794.mjs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad8edb0c6c0bbb3ef655c8f7c9a7403558770781a0a7b8ac8e6b8c945188cc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdown (cyclomatic 14, cognitive 24): parseMarkdown has cyclomatic complexity 14 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":"rhwp-studio/src/ai/ui/message-render.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6f7a6784d32093f7ac5cf9875a592b67fbcaa5a2d1d02ea07bc1ef6b00a3fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairAlignmentSlotControls (cyclomatic 14, cognitive 24): pairAlignmentSlotControls has cyclomatic complexity 14 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8023cf80a29406f6716bd95d76a121ca8ff278bdecfded4cfa0cd528741d616"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startResizeDrag (cyclomatic 14, cognitive 22): startResizeDrag has cyclomatic complexity 14 and cognitive complexity 22; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e47d8030c7f8767cfd1396b0b4129fa6d0e35dc73f92b6130f5c96e6ead120f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7553bbba1a9565950bc1964e6342d39674485a59c820ecc9cf542ee22be8d517"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 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":"rhwp-studio/src/ui/menu-bar.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff59976e4d87cf8895fbf4061936a15f9a40cec2c896c3f643d7f10a070e236"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 14, cognitive 20): parseArgs has cyclomatic complexity 14 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef94bed7ece52fc586a7102dcb84269231e9415a23c354e5d1704cbf53962d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFromUrlParam (cyclomatic 14, cognitive 20): loadFromUrlParam has cyclomatic complexity 14 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":"rhwp-studio/src/main.ts"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2dd1cbb513afdbbe6b4f793e082ca64aecb029fe034cfdba31406acb5c09e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 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":"rhwp-studio/e2e/middle-dot-canvas-paint.test.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69f7fd3c66addbdce9dd7e3bfe1babf410e61bd8138ee8d4e920a554d3eea86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeScenario (cyclomatic 14, cognitive 19): executeScenario has cyclomatic complexity 14 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":"rhwp-studio/e2e/scenario-runner.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a8acf5fcff39dab568ecb3a0df281e6ee6683abd8b6725af88668fb6ce8751"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasAnyEdit (cyclomatic 14, cognitive 19): hasAnyEdit has cyclomatic complexity 14 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":"rhwp-studio/src/core/chart-data-target.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84595957a3a0f75fae472f8f7f112bf0451df04d4aefe588a58bf187d7a70d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyToggleFormat (cyclomatic 14, cognitive 19): applyToggleFormat has cyclomatic complexity 14 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9609a0ec1747d2b0349233c11b5994dd1ee7c9128b1b775ab2be10bc077181"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitCursorFormatState (cyclomatic 14, cognitive 19): emitCursorFormatState has cyclomatic complexity 14 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd94a01040fc79a446cbd5d7cdc928ce8c28d8dfc18ed91b1560211646a34fa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 14, cognitive 18): generate has cyclomatic complexity 14 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":"rhwp-studio/e2e/report-generator.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53991544de0dff8db386d69cebd4dc6d3dcf94b188d14bbb87ffabe1d2d4f0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFontWithRules (cyclomatic 14, cognitive 18): resolveFontWithRules has cyclomatic complexity 14 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":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97ce52e2dbce6162c5f739f8f2f3397f98f3af028eb56e44972860711bf1cd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectLocalFonts (cyclomatic 14, cognitive 18): detectLocalFonts has cyclomatic complexity 14 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9691adbf2c68f72f5d59fe3d7d288c31c62b14a81aced5df3ecb8a5d307f3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showAllIds (cyclomatic 14, cognitive 18): showAllIds has cyclomatic complexity 14 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efd2998516f5e95eac3abde08a5a7eed32ac64af6cfe51b64a811def45dc058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 14, cognitive 18): execute has cyclomatic complexity 14 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1350eeacaa1305975cdd10404fe623fbcf6bf3f8757be87927e98c574516e239"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateFieldMarkers (cyclomatic 14, cognitive 18): updateFieldMarkers has cyclomatic complexity 14 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a150d77f2ec228b7e95b5f37577097bf7f12f221ea8416255336ed340c27a43a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeFormActionPlan (cyclomatic 14, cognitive 18): executeFormActionPlan has cyclomatic complexity 14 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f8569082ab2ab951cbf94facd39d4bc78f20e6ddadd7bede01bbaa8e9240a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasStaticSvgUnsupportedMarkup (cyclomatic 14, cognitive 18): hasStaticSvgUnsupportedMarkup has cyclomatic complexity 14 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":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c37d98bd4d23b019487691ec476f97d3fee2ecb860194a81061bded1531b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cycleAudit (cyclomatic 14, cognitive 18): cycleAudit has cyclomatic complexity 14 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4627761a3b0b1757b9d92a48da73a2afce92aec29728757f8cfb5ed779ba58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrintPreview (cyclomatic 14, cognitive 17): runPrintPreview has cyclomatic complexity 14 and cognitive complexity 17; 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a34c08c032bf7a87776404d4e5571406db17dc2d8e69cf97c1582117337e06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishPictureMoveDrag (cyclomatic 14, cognitive 17): finishPictureMoveDrag has cyclomatic complexity 14 and cognitive complexity 17; 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":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8744b6f01448f777fec4ebc0dcd7089b2568d7f791dce415b0e5ef67f69b433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d9443987433b5d3c8f51c986b30059f2bcf97055e4ad0e4d37869b0a94aba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStatusValue (cyclomatic 14, cognitive 17): validateStatusValue has cyclomatic complexity 14 and cognitive complexity 17; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d3bea171176751bdfb1eebe2b0e84864334d6e626cc618f274715cb7f2900e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareObservedFontFallbacks (cyclomatic 14, cognitive 17): prepareObservedFontFallbacks has cyclomatic complexity 14 and cognitive complexity 17; 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acaf4affd875a9c6d92a81fb7a9e0441de47d15c273cb91ce6cc1fcb216007b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveChromePath (cyclomatic 14, cognitive 17): resolveChromePath has cyclomatic complexity 14 and cognitive complexity 17; 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":"tools/hwpctrl_compat/runner_webhwp.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be980f3333f7049700d0b1e73f53d0645df309453df8970554ff05d7a610f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paragraphBottom (cyclomatic 14, cognitive 16): paragraphBottom has cyclomatic complexity 14 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 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"7737420118e43fda5999c917ff846e6bbfa464255cfe217893f7f135d585f242"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRendererLocalFont (cyclomatic 14, cognitive 16): resolveRendererLocalFont has cyclomatic complexity 14 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 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"360fe69a4ede787cba189791b007c366dc89a2751bca0b96beb0009f92bf6e3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeDocument (cyclomatic 14, cognitive 16): initializeDocument has cyclomatic complexity 14 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 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f86c42d31bbec8c76ef06832a552fc8a55e5ded27d44863127169edc57fa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvasKitImageCacheKey (cyclomatic 14, cognitive 15): canvasKitImageCacheKey has cyclomatic complexity 14 and cognitive complexity 15; 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":"rhwp-studio/src/view/canvaskit/image-replay.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6980266f0a9796bc04b600d97789bcf7a30d92f70f08d985041ec5ac934c657d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseImage (cyclomatic 14, cognitive 14): _parseImage has cyclomatic complexity 14 and cognitive complexity 14; 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":"rhwp-safari/src/background.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3cf0f6457328a841cc44896aa3caff74eb30a8e5526b32317a4e65b5aa16a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importPdf (cyclomatic 14, cognitive 14): importPdf has cyclomatic complexity 14 and cognitive complexity 14; 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e435674525435eb0815106bc870f24b7a4e245bdc0fa88ba13d73125448bb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; 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":"rhwp-studio/e2e/topmost-lifecycle.test.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf49722c3d9d48978e1245831c64be1c30a1766d88fc0fa94e6765b776d89a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureCompareDocumentsLoaded (cyclomatic 14, cognitive 14): ensureCompareDocumentsLoaded has cyclomatic complexity 14 and cognitive complexity 14; 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e161f173dcf2e9c5f119b67101aaebdf706a251267645b47a703632985ee03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSvgDimensions (cyclomatic 14, cognitive 14): resolveSvgDimensions has cyclomatic complexity 14 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"77969a2e084006bea5b364ca9c3f6fba2cfa5c4bb26d9764b603411f69831a34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractChartCsvFromEnvelope (cyclomatic 14, cognitive 13): extractChartCsvFromEnvelope has cyclomatic complexity 14 and cognitive complexity 13; 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e7decd9bdd37e2d8c3e003311244249ce34c3e16fed3d6880c6f8225345a02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryConfirmRemoveClickHereAtBoundary (cyclomatic 14, cognitive 13): tryConfirmRemoveClickHereAtBoundary has cyclomatic complexity 14 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5159ca1906d6e258b35e3538a6bb192cf5de122397d31dfa713a7e9e692aba85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendShapeLine (cyclomatic 14, cognitive 13): appendShapeLine has cyclomatic complexity 14 and cognitive complexity 13; 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":"rhwp-studio/src/ui/picture-props-apply-model.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b48320c57d4cee25024c4dfe22f670fcb2eeacab0d2235b96816012c4d1498"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ea06498651d0d943279ba70109eb2fb529de6400af71bd566a1acb5d65ce53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEquationSvg (cyclomatic 14, cognitive 13): renderEquationSvg has cyclomatic complexity 14 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4782}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce37658e5427115436fa7b0d6ff666f12c9232a42a1daeccb5d9855ebcb462a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isValidColorGradientStops (cyclomatic 14, cognitive 13): isValidColorGradientStops has cyclomatic complexity 14 and cognitive complexity 13; 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0a24bf3faff33a1cc0089557eba45c138599a92d165a41b6a615f10243006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2445dbf107b60dc9af58c7b73fae22f05cd56af61a4e1407288b0b48526b66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeRiskAccumulator (cyclomatic 14, cognitive 13): finalizeRiskAccumulator has cyclomatic complexity 14 and cognitive complexity 13; 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fb2aa834fa38e737ca6bf9724281d2c5c794a0b5832d937e7ccf0840a1ad3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function allowedReviewOnlyFile (cyclomatic 14, cognitive 13): allowedReviewOnlyFile has cyclomatic complexity 14 and cognitive complexity 13; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8344df314d34b370f4e387aebab8c20b09b74bfdd40d6cdf3ccb66fc2e1dbbc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installCanvasFont (cyclomatic 14, cognitive 13): installCanvasFont has cyclomatic complexity 14 and cognitive complexity 13; 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b28ec3b291810ad811b24831e60c281557816469a1acb0b35a8e190c42df1e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InsertPicture (cyclomatic 14, cognitive 12): InsertPicture has cyclomatic complexity 14 and cognitive complexity 12; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"63760e787fbea9a1acea07da788c52970a0380bee01ca997c0e6ca91c4f9e515"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function staticSvgGlyphSource (cyclomatic 14, cognitive 12): staticSvgGlyphSource has cyclomatic complexity 14 and cognitive complexity 12; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"593d08a4ea77a834e74da229f6a5ac3a7bb09909817588de40e1a3d1bd47aad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function opaqueFlowFillBbox (cyclomatic 14, cognitive 12): opaqueFlowFillBbox has cyclomatic complexity 14 and cognitive complexity 12; 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5a171067bde21ae746f90b8798bf168498a4f2c1cde1ddfdde39e97c313ac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveSelectedPicture (cyclomatic 14, cognitive 11): moveSelectedPicture has cyclomatic complexity 14 and cognitive complexity 11; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ea6cf2e68235bafcfebe1e1815983658d30d419c6571a815441533cd1c389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureTableCellBboxCache (cyclomatic 14, cognitive 11): ensureTableCellBboxCache has cyclomatic complexity 14 and cognitive complexity 11; 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":"rhwp-studio/src/engine/table-bbox-cache.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aea0e5d98dd4e3be3554e5ea69d94dac125696ca19082fbd579c0f1d0a3d0d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildParaInfo (cyclomatic 14, cognitive 11): buildParaInfo has cyclomatic complexity 14 and cognitive complexity 11; 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":"rhwp-studio/src/ui/style-dialog.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e227eec987448e3489d7590a17b0055d153b93e310c241d301230948b6518219"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordTextRunCoverageGaps (cyclomatic 14, cognitive 11): recordTextRunCoverageGaps has cyclomatic complexity 14 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"122cd6b83043ed606f4b9b7ef1c29857f96d35778693cacee199ee487dc955bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failClosedPathReason (cyclomatic 14, cognitive 11): failClosedPathReason has cyclomatic complexity 14 and cognitive complexity 11; 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e5c04f19d3f6e53702e4a01aad9db73900348ecc5312a3f5640aaa348a7615"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicy (cyclomatic 14, cognitive 11): validatePolicy has cyclomatic complexity 14 and cognitive complexity 11; 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":"scripts/font_metric_coverage_pilot_selector.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c238271b5e46c42774032da07ab9dfc83355a039d134f5eda809e0ab7273f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableControlPairContentSimilarity (cyclomatic 14, cognitive 10): tableControlPairContentSimilarity has cyclomatic complexity 14 and cognitive complexity 10; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2814}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105ec4e5175448e31f3b08550afe40734344c11f80c7ee238eaaa4da068c099"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followHyperlinkClick (cyclomatic 14, cognitive 10): followHyperlinkClick has cyclomatic complexity 14 and cognitive complexity 10; 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":"rhwp-studio/src/engine/input-handler-hyperlink.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dffee1e32c03d4f535a113693265775814d4130f924bdf2f5a6fff913a1b1c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function frontendOnlyCiRunIsReusable (cyclomatic 14, cognitive 10): frontendOnlyCiRunIsReusable has cyclomatic complexity 14 and cognitive complexity 10; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af063b33e733ba4c4f6961787c174de40c5a8a19ed9f2bed60cca4250cb41f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePngHeader (cyclomatic 14, cognitive 9): parsePngHeader has cyclomatic complexity 14 and cognitive complexity 9; 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":"rhwp-studio/src/view/canvaskit/image-header.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"76959f84645823aba8913225dc7a3292e06a064145302d06ea9e85cc1b3060eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillMissingParaAnchorsFromNeighbors (cyclomatic 13, cognitive 30): fillMissingParaAnchorsFromNeighbors has cyclomatic complexity 13 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a7a8cabc8e1bcae790ffead8c03f211d083e302d9b389983464846f8fcb1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 29): (anonymous) has cyclomatic complexity 13 and cognitive complexity 29; 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":"rhwp-studio/e2e/canvaskit-font-preparation-issue7688.test.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af85f2580bd095722b3f0629ada0fa56b242baa45e22de2af128cbaf409e11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyExpectations (cyclomatic 13, cognitive 26): verifyExpectations has cyclomatic complexity 13 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":"rhwp-studio/e2e/scenario-runner.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f923b7d3e44e75db55a4d5ec514c71f8453a1303521e8e8870275be7b704930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEvidenceLedger (cyclomatic 13, cognitive 26): buildEvidenceLedger has cyclomatic complexity 13 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1957823322e662217ad07686b4a8007b31828d3041d33ca7732b67d01d1621e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 24): (anonymous) has cyclomatic complexity 13 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":"rhwp-studio/e2e/canvas-metric-recovery.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b8b4be7f2e07792f5b3c40db9a0997b359e3769c27ebffb152178472aa3022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectMetafileFontFaces (cyclomatic 13, cognitive 24): selectMetafileFontFaces has cyclomatic complexity 13 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":"scripts/visual-sweep-font-registration.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"22999c016c9f74f9e3ad71d2e2534bca3ea3846406cee1ee2792a372d633cfbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 23): (anonymous) has cyclomatic complexity 13 and cognitive complexity 23; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b5b1849b1a8841869a01287842ce2d3714f5acc268d71b3e9cdf82a8b29347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unmatched (cyclomatic 13, cognitive 23): unmatched has cyclomatic complexity 13 and cognitive complexity 23; 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":"scripts/tests/issue_8160_print_jpeg_frame.browser.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"671019f222b70a7a519ebde73f35299db116953efff60054d24145b4a1ff6d80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderQueue (cyclomatic 13, cognitive 22): renderQueue has cyclomatic complexity 13 and cognitive complexity 22; 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaba007761ce7b03ccfa0f6d7efc4c8681f71cc57b3d562dd9e55fef29f2e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 13, cognitive 22): execute has cyclomatic complexity 13 and cognitive complexity 22; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbf3bfa02b9f6bb3aa3d21c9575439818b0f02374236b630d1c68358d0b7818"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 22): (anonymous) has cyclomatic complexity 13 and cognitive complexity 22; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d34711aec34be04bbb9ce391cd021160bcbb05c0c2e4204aaffef31691090c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeSourceFile (cyclomatic 13, cognitive 22): analyzeSourceFile has cyclomatic complexity 13 and cognitive complexity 22; 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":"scripts/rust-unit-test-tiers.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b892dba0a2f3f226c565131c93c26c3df0aa110f4b2e3267d013253a8c54d7b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDocumentHref (cyclomatic 13, cognitive 21): classifyDocumentHref has cyclomatic complexity 13 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":"rhwp-chrome/content-script.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c52a9b2e6cf9331f373092486e2959537676f908ce380ad30e66298ee5dd26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDocumentHref (cyclomatic 13, cognitive 21): classifyDocumentHref has cyclomatic complexity 13 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":"rhwp-firefox/content-script.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"43065cefd33e77de5b3d51f7f830f74ec33607a3e3e4a630ec1cf379c48ce4e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDocumentHref (cyclomatic 13, cognitive 21): classifyDocumentHref has cyclomatic complexity 13 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":"rhwp-safari/src/content-script.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d195f65661ff5a43ff0170e555c8c5898a5f758b4014738e55efe6e4f2113b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pick (cyclomatic 13, cognitive 20): pick has cyclomatic complexity 13 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":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e27b5bf212cb24c6c19f7910e2bb11997e279c93c918d0adf6d9bde5a3aaa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampCompensatedResizeDelta (cyclomatic 13, cognitive 20): clampCompensatedResizeDelta has cyclomatic complexity 13 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3ccbb130c555fa306466cae75fbc262d9d31bd0c95200a0f76f49499b782aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasHwpmlRoot (cyclomatic 13, cognitive 19): hasHwpmlRoot has cyclomatic complexity 13 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":"rhwp-shared/security/file-signature.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"212d49e3007ac53c614e93bd0653c41b32d62b9bc3414f7854c661cb532d199e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillMissingParaAnchorsFromPageLayout (cyclomatic 13, cognitive 19): fillMissingParaAnchorsFromPageLayout has cyclomatic complexity 13 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b883470fc7f56483a904e697055adf1229a848afc593f885308d231ef67997"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePageResources (cyclomatic 13, cognitive 19): preparePageResources has cyclomatic complexity 13 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"060bde8c93c17c848c1608adb1281c9795c7faa8b6f641b4d5550047927d1614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function caretToCursor (cyclomatic 13, cognitive 18): caretToCursor has cyclomatic complexity 13 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":"npm/hwpctrl-ocx/src/cursor-map.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79606a9fc979f1b2bf404f225bbd0f7c829076efc9db059a46324f2340476a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 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":"rhwp-studio/tests/mutation-routing-guard.test.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"75731d0c1d0f71a4929aedee72cfbabd779b8f867d3e83ded12d63c69e0d1e45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipNonCode (cyclomatic 13, cognitive 18): skipNonCode has cyclomatic complexity 13 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":"rhwp-studio/tests/support/source-guard.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1d630742a27f63eaa4a0b4e957052edadc4cedb136be002f34c87cba1255a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMeasuredJobs (cyclomatic 13, cognitive 18): resolveMeasuredJobs has cyclomatic complexity 13 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":"scripts/collect-postmerge-duration-data.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d260144e982271cc37e88fb4f681d260511b324ae79b0af17a18e51b5f408974"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertContinuousFlowGeometry (cyclomatic 13, cognitive 17): assertContinuousFlowGeometry has cyclomatic complexity 13 and cognitive complexity 17; 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":"rhwp-studio/e2e/issue-2214-page-local-repaint.test.mjs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd62055049e98992c44532a97c1fd0a589fddbc0dc8191ddb532223d76e9c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findWordAt (cyclomatic 13, cognitive 17): findWordAt has cyclomatic complexity 13 and cognitive complexity 17; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d834105148213802aeaa92b5cf92f96e4df3529b7ce86487ba8e6cbb26281c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5994}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8002e0304f3b697b4313821c645df7e3b11817a1c73d8bdbb54eda9b9ad5140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function colorLayersStatus (cyclomatic 13, cognitive 17): colorLayersStatus has cyclomatic complexity 13 and cognitive complexity 17; 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0183ab2d676f1c29d034195530c0d139090b7cf7adb5e831f3f6acf29f7ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runVisibleSlice (cyclomatic 13, cognitive 17): runVisibleSlice has cyclomatic complexity 13 and cognitive complexity 17; 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":"rhwp-studio/src/view/page-render-scheduler.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"603863342fd6eefcbb8996b7b17a0cfc2b71c4d163c0ca9bfb51c412859d4dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evidenceGateCounts (cyclomatic 13, cognitive 17): evidenceGateCounts has cyclomatic complexity 13 and cognitive complexity 17; 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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87749529f556144aaa65a92c85aa205f3afbe9b3044a7d4308ee09f0e2e9faa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCut (cyclomatic 13, cognitive 16): onCut has cyclomatic complexity 13 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 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab035aef9c42b40ef48c723a5f62d55a869397f9755d7ea206884fbb68aca98b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateFields (cyclomatic 13, cognitive 16): populateFields has cyclomatic complexity 13 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 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63a4ad9cf68fb49e843ae7cf16660ba141c958d6e282275bda382b0a0cb935c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcilePageSurfaceBudget (cyclomatic 13, cognitive 16): reconcilePageSurfaceBudget has cyclomatic complexity 13 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 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57c65a998be61060ad384c52687e65f7690042d287fef82e0bd86efa3505668"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRecord (cyclomatic 13, cognitive 16): validateRecord has cyclomatic complexity 13 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 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a00e4950180af4f5c687853c0a19016525e2e29253a3dfe2d40233f97eedcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/e2e/issue-2214-page-local-repaint.test.mjs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d73c362b30308826622d1cfa0a1e210ab6b0d63ba2f40901a3711c849c52067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparisonIdentityMismatches (cyclomatic 13, cognitive 15): comparisonIdentityMismatches has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/e2e/renderer-baseline-native-diff.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccfd45bf2b7ccb09b32c691b6cda330172ae371c38f8b1d30806ce05601d283"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/e2e/textbox-picture-1171.test.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"41152c404be38627dcd1b3d2d5550d10347b9d4d99f820d22a5097e956e77473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatParagraphLocationForSide (cyclomatic 13, cognitive 15): formatParagraphLocationForSide has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/src/compare/diff-location-label.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"668b5ee3f32d1eae5749e87686e8ed7a9938ab48c9267a29799cce5dd0d7f1a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTableObjectSelection (cyclomatic 13, cognitive 15): renderTableObjectSelection has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7d1e05d94e505202ae0fb1b874aab8653d0c677c67b98382b0df591c0a0c7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 13, cognitive 15): onConfirm has cyclomatic complexity 13 and cognitive complexity 15; 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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"244eac00fe3a789df494f18cf7a38ba7d2744ba2cbb896fb6c4fa0bea225f4b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; 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":"rhwp-studio/e2e/issue-4694-chart-data-edit.test.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2c3096d4b91a53f5454ec33f8d4d869df4c0a7dc3e2a7459c940d226050ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1f0993c22ff63b11456bb99fa393028b73a0f1c1ec5054fb8708b8da74a38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayComposedCharOverlap (cyclomatic 13, cognitive 14): replayComposedCharOverlap has cyclomatic complexity 13 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit-char-overlap.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9060a88b70ba716a05832a2ff905d987d8a845d3bd6b5002f0dd95fba95575ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withImageTransform (cyclomatic 13, cognitive 14): withImageTransform has cyclomatic complexity 13 and cognitive complexity 14; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3073}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa03b5c2597ac97ed37a234f1bc1dec4c39568c7ff3241a6d40098cc1da4b5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeFitZoom (cyclomatic 13, cognitive 14): computeFitZoom has cyclomatic complexity 13 and cognitive complexity 14; 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e6d7a90454c336fc52f137909f3548211b2c5ab71dcf42ae1531fccdbdf064"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePocFormatAdditivity (cyclomatic 13, cognitive 14): validatePocFormatAdditivity has cyclomatic complexity 13 and cognitive complexity 14; 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ada5faad3bf8cfb9cfc194b9f504ec761085700fe083f3ead09ad22197f8011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCheck (cyclomatic 13, cognitive 14): runCheck has cyclomatic complexity 13 and cognitive complexity 14; 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"5781a17e7398dfb038bdbffaee960fb12458747e6c84f341c06861109f21552d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 13, cognitive 13): save has cyclomatic complexity 13 and cognitive complexity 13; 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":"rhwp-studio/src/ai/ui/ai-settings-dialog.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2039200696aac4dd983eef8ac0bfc8abe862003f3ead4e6d23a743a62a7e958c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSelectionContext (cyclomatic 13, cognitive 13): getSelectionContext has cyclomatic complexity 13 and cognitive complexity 13; 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"053dde2d02666dcbfa8d5fa58cc9dafeeda7918313a6b880f601e5679b21f75b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveVerticalInHf (cyclomatic 13, cognitive 13): moveVerticalInHf has cyclomatic complexity 13 and cognitive complexity 13; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd78107798594f65f29403ca7c975de1b50d14a3a9649f25c58ea4bdb6634fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawLineShape (cyclomatic 13, cognitive 13): drawLineShape has cyclomatic complexity 13 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b5813f1f18a981da7cfaa881c305f833ee7bf8e00677398a2e70cd2e1cb88d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeCanvasKitEffectImage (cyclomatic 13, cognitive 13): makeCanvasKitEffectImage has cyclomatic complexity 13 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvaskit/image-effects.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f65c4a2738e3b2befbb1ab193661426c05e1ce3fb951c7e7d6dbf295dc43e62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExactStreamLimited (cyclomatic 13, cognitive 12): readExactStreamLimited has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-chrome/sw/thumbnail-decompression.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0b1432e28653c3cf201b3aea4e552c7f3cbbaa82e95de69ea68d9db8bd1f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExactStreamLimited (cyclomatic 13, cognitive 12): readExactStreamLimited has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-firefox/sw/thumbnail-decompression.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d06939eebe159afa20d53197be2c1dd68465484c2b6880e580d5f3fa4340942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExactStreamLimited (cyclomatic 13, cognitive 12): readExactStreamLimited has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-shared/sw/thumbnail-decompression.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"543819c330d0f8d0d1aa6357c7b40ce873fe5549f9b5f248d493e34a3518804b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runScenario (cyclomatic 13, cognitive 12): runScenario has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/e2e/probe-input-perf-issue3137.mjs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"113bc8089a56df7523399a4f6a2d19dca8034df027bda994bbba345fe96bf9a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toGeminiTurnResult (cyclomatic 13, cognitive 12): toGeminiTurnResult has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30fb4f23fe34cd6486858299557dc6977b4ce0f5634bcc170db6a22fa10b1b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canvaskitDecision (cyclomatic 13, cognitive 12): canvaskitDecision has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/core/font-decision-trace.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92dbfc677cb9097c75c8cea872b2c697ce67f75ca1cf15f627eca7a2ae46e67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectSubsecondDevtools (cyclomatic 13, cognitive 12): connectSubsecondDevtools has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/core/subsecond-runtime.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2770e9b58bc121053cfea27655c546926d2b7f7b762c71dd4a48626155619de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDeleteSelectionInFormMode (cyclomatic 13, cognitive 12): canDeleteSelectionInFormMode has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4800}}}],"partialFingerprints":{"codehealthFindingId/v1":"200cffec1fe19c9390f4cade84bc9d7f89e5e37df41796373376e05a65710a66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDiagonalPreview (cyclomatic 13, cognitive 12): updateDiagonalPreview has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab830fafb14a723543995944e5a774e7076b789eb6972771b5d4de21fb5ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 13, cognitive 12): onConfirm has cyclomatic complexity 13 and cognitive complexity 12; 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":"rhwp-studio/src/ui/page-setup-dialog.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46340ec82ab47d9afa41676d72046bcfd4d551a2393279066b03ec7037d06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv6 (cyclomatic 13, cognitive 11): isPrivateIPv6 has cyclomatic complexity 13 and cognitive complexity 11; 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9008ba40a7c58e4d44c8d113c251728c717460abf539d971b1602705edfd534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv6 (cyclomatic 13, cognitive 11): isPrivateIPv6 has cyclomatic complexity 13 and cognitive complexity 11; 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":"rhwp-firefox/sw/fetch-security.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3562d2e994eff832c240383522894b09e3811cb55f39513e738973a678a72c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv6 (cyclomatic 13, cognitive 11): isPrivateIPv6 has cyclomatic complexity 13 and cognitive complexity 11; 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":"rhwp-safari/src/background.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f77664a6ea93bfed58791c251aaa468563924682661b92c1537a50a8a752e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIPv6 (cyclomatic 13, cognitive 11): isPrivateIPv6 has cyclomatic complexity 13 and cognitive complexity 11; 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":"rhwp-shared/security/url-validator.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c328888274299e22b9f8678296ebfa7a1bf01a7b5ddd2ebe162fad63c132a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bitmapGlyphImageOp (cyclomatic 13, cognitive 11): bitmapGlyphImageOp has cyclomatic complexity 13 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"624cece1d9705094fa71c5b1a9e0e3c32a900bfb250aaba9c2c6ea2e9bdfbfe1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeEvidenceRanking (cyclomatic 13, cognitive 11): finalizeEvidenceRanking has cyclomatic complexity 13 and cognitive complexity 11; 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":"scripts/font_typesetting_risk_evidence.mjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d96e7fe9215b4f7ecfa6d0690c65b990b0e08a4215b6ed8cf4fd0d772100b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeTrace (cyclomatic 13, cognitive 10): summarizeTrace has cyclomatic complexity 13 and cognitive complexity 10; 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":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b0a907cd0da5f5446b33b2bee6f947f8499fa5fca244bf87bc0bf5f8e4aa4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function functionName (cyclomatic 13, cognitive 10): functionName has cyclomatic complexity 13 and cognitive complexity 10; 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b454fd64fab012a54d31b695e9ae070f0f6912ac542b7584c50cc62688185"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sampleFetchPath (cyclomatic 13, cognitive 9): sampleFetchPath has cyclomatic complexity 13 and cognitive complexity 9; 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":"rhwp-studio/e2e/helpers.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6452c61b68a32fa33ede2335c839e15566ba7785f58a788b7d891c1a5d0ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeOrResume (cyclomatic 13, cognitive 9): initializeOrResume has cyclomatic complexity 13 and cognitive complexity 9; 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":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"66867ed8eeb91c8ca1d948d1b7807b4a0ee124aada78e912306eed9c1c2d784b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyReviewOnlyBaseAdvance (cyclomatic 13, cognitive 9): verifyReviewOnlyBaseAdvance has cyclomatic complexity 13 and cognitive complexity 9; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a0cab5145b69a99fd5407eb702b68a18dc028b9872ed28a50acaf9ad3786d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 31): (anonymous) has cyclomatic complexity 12 and cognitive complexity 31; 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":"rhwp-studio/e2e/glyph-outline-portable-geometry.test.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"000cd527e199a81b33150d9f4be1568311f4465b9be27c4b7a17b0317dab42c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDocumentCanvasKitFontUsage (cyclomatic 12, cognitive 29): collectDocumentCanvasKitFontUsage has cyclomatic complexity 12 and cognitive complexity 29; 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e8a6a28d6285d7f28b7eaf2b49e0976cc1d79cb22ce3c012fbfc424690ff26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawStaticSvgPathLayers (cyclomatic 12, cognitive 27): drawStaticSvgPathLayers has cyclomatic complexity 12 and cognitive complexity 27; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"827d17b06b5735e465e153feb1eb76aac4b8a3116ad686a16612e8238198d451"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverCorpus (cyclomatic 12, cognitive 27): discoverCorpus has cyclomatic complexity 12 and cognitive complexity 27; 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":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba28d19717fc05a82b1388866d2bb87391082ad487fce464520ddae1795e7c3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function widthProjectionHash (cyclomatic 12, cognitive 24): widthProjectionHash has cyclomatic complexity 12 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"31de33bcca0711f362c3d354a91d119064d3bc7d81c51b95e106281bec6a2d96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 22): (anonymous) has cyclomatic complexity 12 and cognitive complexity 22; 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":"rhwp-studio/src/ui/style-edit-dialog.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"58982153a597dfca77f2b55f347bfd4f61a5d72fad27b4a6d53ec7d9f9b4eaa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openViewer (cyclomatic 12, cognitive 19): openViewer has cyclomatic complexity 12 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":"rhwp-safari/src/background.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cbab85cb613486591585cac75fa917dd5b265e24945c42da98bdb266dd22f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operation (cyclomatic 12, cognitive 19): operation has cyclomatic complexity 12 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":"rhwp-studio/src/command/commands/hyperlink.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e7497ca3b3f6f7aaf6285aa20ad2c4825dad6ff39a5ed6299b7d329754a503"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doSearch (cyclomatic 12, cognitive 19): doSearch has cyclomatic complexity 12 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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c95341608e3c713ba4f5b54c0b7068de89cc80e3e3ef6f068be8dd205937a6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 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":"rhwp-studio/e2e/toolbar-color-activation-issue6635.test.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3251c8546b60570d7f1502d56ae7927703bacd7f7edc85c37e8fe42c471d15d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) has cyclomatic complexity 12 and cognitive complexity 17; 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":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb26bf285ea5b740bef4abe8e2bd2beb554ff520a35488aa08e4fabb7f1b471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cognitiveComplexity (cyclomatic 12, cognitive 17): cognitiveComplexity has cyclomatic complexity 12 and cognitive complexity 17; 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":"scripts/frontend-metrics.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5751f5a8478106577395225cbb1335e19b038021b24181c8d580089ca666819"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 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 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b62f7f83119f5218d2ddf7811fd0c8ef5ca4687b3a085d4e6ee521ae979b16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCanvasMetrics (cyclomatic 12, cognitive 16): prepareCanvasMetrics has cyclomatic complexity 12 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 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"921d48e363b6fe2d0c1b502e488358c17618ddc868d03de91010dfe507fd9ea9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveLangFields (cyclomatic 12, cognitive 16): saveLangFields has cyclomatic complexity 12 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 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"9347618b5c8b078fb736c5fd60717fbe23fa38e7119b578d873b5d3d1e73a9e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 16): main has cyclomatic complexity 12 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 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":"tools/hwpctrl_compat/runner_webhwp.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eae0a6fe7401a0af93b83cff702a914b18a4802254bad163f23fc6fcef5d0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redactForLlm (cyclomatic 12, cognitive 15): redactForLlm has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-desk/ui/js/agent.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1857d278d7761f4c1cb0ddad9b24d2b178793c451b6d8d1965d24be7c356c426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-safari/src/background.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"902bf5ff0c32e8242f86bf75425e5598a6e249bac57a5bcb5064050332960b95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toOpenAiTurnResult (cyclomatic 12, cognitive 15): toOpenAiTurnResult has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-studio/src/ai/provider/openai.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca8e638f032860641617ad74383a9e9f4aa782c004b0936969a15b0d2b8786b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 12, cognitive 15): consume has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-studio/src/command/contextual-shortcut.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"36573ce8765fe7c29a9d0d7bf4a4d80b0b274a5b2fba5cccc4e11d40dda469fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineOfficeClipboardImages (cyclomatic 12, cognitive 15): inlineOfficeClipboardImages has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1449ff1f644dbf28a1a902fa1e3e4762a1cebdc3a5a7e7b2e185d572ebfced4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFormObject (cyclomatic 12, cognitive 15): renderFormObject has cyclomatic complexity 12 and cognitive complexity 15; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c16886f13a5ef3c00595651e06eb0b1b1c36562acec734f35a7d1a2fec3338"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 12, cognitive 15): visit has cyclomatic complexity 12 and cognitive complexity 15; 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":"scripts/font_rule_ledger_evidence.mjs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0c0227bcf062182522f43cf331b6fa9a6281ec79943d548f57867dba00e825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onEntry (cyclomatic 12, cognitive 14): onEntry has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b381e090f6a2a883f52e1e32811265d13db84d64dd2c3a0f520bd2f67ddc6af4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 12, cognitive 14): execute has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/command/commands/hyperlink.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdb76fccce39170fb8d970b6c78a0b869c24d332c5d9c9cc0e82f1bd4692a13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function documentFontPreferences (cyclomatic 12, cognitive 14): documentFontPreferences has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/core/document-font-preferences.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721a1ccf17f98f291c431e66db06cc750caae78eabcee1cd3fee3b73bcdeb47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operation (cyclomatic 12, cognitive 14): operation has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf26ae9dcbb48b06794d2d6c59b429f3e20a5fc1df7547a018803739e7aa5c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operation (cyclomatic 12, cognitive 14): operation has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f420c94d0267411f2e349226ccb48b508cab02c775a9ab2398073bfcb4e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resizeTableProportional (cyclomatic 12, cognitive 14): resizeTableProportional has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c62f8ab3795976c3860f5bbe34050ca230f9b8ab10ec9450ba05d83f79342cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleOk (cyclomatic 12, cognitive 14): handleOk has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb69f609b928789b47887132f93b5f9db914725743bbd2aad7003c5efac90fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPageCanvasKit (cyclomatic 12, cognitive 14): renderPageCanvasKit has cyclomatic complexity 12 and cognitive complexity 14; 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":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"55feff26b1923fde3fb4f90369f1ed3d1a1930e5ae06a6b9176529b3450c4fd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTierManifest (cyclomatic 12, cognitive 14): buildTierManifest has cyclomatic complexity 12 and cognitive complexity 14; 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":"scripts/rust-unit-test-tiers.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed05cd56159eb1c802717c34255477a7c7795d395a065edbe9da8c7b20ca38c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; 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":"rhwp-studio/e2e/canvas-render-diff.test.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f7c80f4bd2bda6754cba00326deb527c1bef7709c5a4b28000bcf5b73fb9c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; 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":"rhwp-studio/e2e/textbox-picture-insert-1171.test.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e7b3abd6355567c50985fa329c3dd1e3b1c1a82cf0b3cea5779f776b2580c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNearest (cyclomatic 12, cognitive 13): findNearest has cyclomatic complexity 12 and cognitive complexity 13; 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":"rhwp-studio/src/core/rhwp-dev.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e736c1b737765630813d71bf7b27de62b967cc91236c28f2eb1d020f363f59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showConnectionPointOverlay (cyclomatic 12, cognitive 13): showConnectionPointOverlay has cyclomatic complexity 12 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c9a70167e9eb27dcdbdd59e3a60888c8b4657e78d1d473bda4c60a67328924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocument (cyclomatic 12, cognitive 13): loadDocument has cyclomatic complexity 12 and cognitive complexity 13; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f7f8c32b9f91ff2e56d26b53bc0140866fbb4e552243fd3ac1719aedde6383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSfntNamingRecords (cyclomatic 12, cognitive 13): parseSfntNamingRecords has cyclomatic complexity 12 and cognitive complexity 13; 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"77616b2930c659258b170e0b4718b30eb5aa9ffa3a1866c3e784eda0da7efa1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLedger (cyclomatic 12, cognitive 13): validateLedger has cyclomatic complexity 12 and cognitive complexity 13; 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":"scripts/font_rule_ledger.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5a684b189ef9810748dd183fdb994a502e021874cda89f814b4721115c0372"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTargetProfile (cyclomatic 12, cognitive 13): normalizeTargetProfile has cyclomatic complexity 12 and cognitive complexity 13; 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":"scripts/select-nextest-archive-targets.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fc4012aa6ee88a8fc6b391b4f18e2322cbae85caa09d515cfff864f25e06d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exceptionReport (cyclomatic 12, cognitive 12): exceptionReport has cyclomatic complexity 12 and cognitive complexity 12; 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abcec858b1d77a303230b0878569e326656e6698ab4fa59fa0a205dc733ffde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MoveToField (cyclomatic 12, cognitive 12): MoveToField has cyclomatic complexity 12 and cognitive complexity 12; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5307941f58efdf82c1db46149ea1138ae67e3ad9b791478911fb14b2b014acb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparePngPaths (cyclomatic 12, cognitive 12): comparePngPaths has cyclomatic complexity 12 and cognitive complexity 12; 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":"rhwp-studio/e2e/pdf-render-diff-report.mjs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f061eed28d59230343114d283779b71231a4590baca71ff63e77808bbfeb5f1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyOpenAiError (cyclomatic 12, cognitive 12): classifyOpenAiError has cyclomatic complexity 12 and cognitive complexity 12; 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":"rhwp-studio/src/ai/provider/openai.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecccf531e1d3b41e20beef953d9398239e3923b27b5e85b20b4a124b62329fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceHeaderFooterSelection (cyclomatic 12, cognitive 12): replaceHeaderFooterSelection has cyclomatic complexity 12 and cognitive complexity 12; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4bfa4f6a6f785406664a1017da8b461e9650e0c306609af54515271d90d659"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareClickHerePointerEntry (cyclomatic 12, cognitive 12): prepareClickHerePointerEntry has cyclomatic complexity 12 and cognitive complexity 12; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"783725232308e3b8af10b39fa1a3125d5716cee23509da05264a163f06bfa196"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function glyphOutlinePayloadResourceKey (cyclomatic 12, cognitive 12): glyphOutlinePayloadResourceKey has cyclomatic complexity 12 and cognitive complexity 12; 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":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a7e84fb34e1758492bb621561c8a359e5bc826b7d1b8454b7c7deeac14c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePocV2Baseline (cyclomatic 12, cognitive 12): validatePocV2Baseline has cyclomatic complexity 12 and cognitive complexity 12; 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5427f0860e9e604b84ed3908e7a6753af1a52358cf6f28e711792d14202b229b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 12, cognitive 12): normalize has cyclomatic complexity 12 and cognitive complexity 12; 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":"tools/hwpctrl_compat/runner_rhwp.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"40adeed3870b2918e51197f76e97a1c46e6a723cbac44528553c4897ef76ecbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractThumbnailFromUrl (cyclomatic 12, cognitive 11): extractThumbnailFromUrl has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-safari/src/background.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4baa9be29d9dcfc09ff4494d234423325c225703c611aef60e73cfc33c9bc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withinUtf8Limit (cyclomatic 12, cognitive 11): withinUtf8Limit has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea18c59022f5e487dd09b3c97df3fd7f6b03def0621a54585eef88044ab8c90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/e2e/dialog-theme.test.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa0de5d67ea146ab80c719cfdbf38dec68f7cacbdd208064225f3f1f619b1b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/e2e/responsive.test.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b2503a81a97492f85b9c85a15789057af0632523339e289e5f18bf3cd5b2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveAsFormat (cyclomatic 12, cognitive 11): saveAsFormat has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a982ca23ffd74d613f6d276071977ccbb13d0a3be5a65cc207fda075803213e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 12, cognitive 11): execute has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"2042e41a597137073fbc652943b74c6b7aee3cc3d2d85b8c6027b051314b9f58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textSimilarity (cyclomatic 12, cognitive 11): textSimilarity has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c72f4748747aa1f5214b687b6adad6fe7ac0fc343b768145f08d6cb3f03e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hyperlinkTarget (cyclomatic 12, cognitive 11): hyperlinkTarget has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/core/hyperlink.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e02cf4ca453a1481a4f275dbf4fad9816e483cc5157f0a2cab78a347cd7eab5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onContextMenu (cyclomatic 12, cognitive 11): onContextMenu has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"70daf785a46e6ad970d3179c01efa3d1270cebcd5d76dfc81ccd76b0b6209449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbab528ac720580e1d00e1877e10f830d5e3616cd6ed8b6b200e757232450fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textRunHasPaintEffects (cyclomatic 12, cognitive 11): textRunHasPaintEffects has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"452638324d539f913bf8cfa427c79a7a10464462161250a6eb745b91c9649b2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSvgGlyphOutline (cyclomatic 12, cognitive 11): renderSvgGlyphOutline has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7496b18d7564f54e7c74bff61ccaf899d39904a01a08a2baf76b26425bebd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSvgLength (cyclomatic 12, cognitive 11): parseSvgLength has cyclomatic complexity 12 and cognitive complexity 11; 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":"rhwp-studio/src/view/canvaskit/svg-image-header.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53bff6af5a34ed59e894524ea0c0bfe90fe22cf8f87bdc9cd97b1abb400a9c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 11): main has cyclomatic complexity 12 and cognitive complexity 11; 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":"scripts/export-wasm-for-sweep.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97bc4c35895fb2735084d10185bea083f3de7363c46099772c9b8483d48d17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e952cbef9bcbf5dc6f08b27b52877b5cf722fdbf15f35f919702b10a605ccf8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runIdentity (cyclomatic 12, cognitive 11): runIdentity has cyclomatic complexity 12 and cognitive complexity 11; 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":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b7ef2805a8e6e89e70fc006ec93066c05743167f8c714185edc27f7b5eb0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeReport (cyclomatic 12, cognitive 11): writeReport has cyclomatic complexity 12 and cognitive complexity 11; 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":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a18e098293763938d48298072547c6a8bf3f98776a60bbd85b2f630f01f82b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lunarToSolar (cyclomatic 12, cognitive 10): lunarToSolar has cyclomatic complexity 12 and cognitive complexity 10; 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":"npm/hwpctrl-ocx/src/lunar.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc73de48d551855bdff412ddf8c2f1386e2c348e641f751fb388df4ee060d39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDocumentFetchUrl (cyclomatic 12, cognitive 10): validateDocumentFetchUrl has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71c8eae9b7dd209691d5c0f535101c8f21f52db53e8e0172c4553ad29c81f31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDocumentFetchUrl (cyclomatic 12, cognitive 10): validateDocumentFetchUrl has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-firefox/sw/fetch-security.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebb1631139574fd54c8c312cff5b97bc157b93210019a926d859c3907c027b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 12, cognitive 10): render has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"14710ff6a0c17a4392b8f1395bf1e50a9f4174e3e24622e9b9861e4e9c437285"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 12, cognitive 10): execute has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff707406599cfff7206bb85593893240100e3950879a1cad413b3af24350e1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 12, cognitive 10): execute has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9943ccd55010fb0abe46c98c60d8e65d04f335ac7de0ba1ceffd74e80995422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareTextMutationBeforeCursor (cyclomatic 12, cognitive 10): prepareTextMutationBeforeCursor has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3647}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ee5171c0d5ef9cda45698b2d6f4124124dd2fe09abcb072730e15e958bbef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSameTextContainer (cyclomatic 12, cognitive 10): isSameTextContainer has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6c943f4918b739e1d60e19bb91649ed4c65b3752f34dce2c56e1f12d15de92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9cb938d38df428f33b5e43c72e2301bf8837305d7fa6346117d8d4b5372ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textReplayDiagnostic (cyclomatic 12, cognitive 10): textReplayDiagnostic has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd0acdd448383d91a4af8c1b12874c1990a3fb1243a41f76b77e4e251107bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valid (cyclomatic 12, cognitive 10): valid has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvaskit/compatibility-glyph-view.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"602cdbf728e111fec4c4c6a6b1104a75dfd7458c434a9419d04dc35ed5c23def"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; 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":"rhwp-studio/tests/support/overwrite-mode.runner.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058c2f218231610d32b49e394541d9c1d01a82f28db4f41b2dde86b88b31f38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; 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":"rhwp-studio/e2e/crlf-insert-history.test.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d5eae9c2c64cacd6f519a74e8f78c1728195c5a2df7df029a40e3944c71969"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; 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":"rhwp-studio/src/ai/provider/openai.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ca8a911b4283339e4d83905f4c8ce7fb7ad6e5d39aae12b4643d03ee4e257"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawEquationGlyphOutline (cyclomatic 12, cognitive 9): drawEquationGlyphOutline has cyclomatic complexity 12 and cognitive complexity 9; 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":"rhwp-studio/src/view/canvaskit/equation-glyph-outline.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e127a69eca8630821e4f6191508f98e83089e2a4d95a799ef36043712fbc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 21): (anonymous) has cyclomatic complexity 11 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":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b1abfcef31f6a891090d314f24bc3e231fd3209d35ff01363583481b4011d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trimOffscreenZoomSurfaces (cyclomatic 11, cognitive 21): trimOffscreenZoomSurfaces has cyclomatic complexity 11 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ea86fa8aeeffd0770834874d7192ab5e9a68eb1a9435f780e17b23bea4cdda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDerivedArtifactChanges (cyclomatic 11, cognitive 21): validateDerivedArtifactChanges has cyclomatic complexity 11 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e3b95f70dfe978e7d0f15db56c0cefb9028ecceeb9e6524f7bb62c5987ed5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 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":"rhwp-studio/e2e/issue-8125-hairline-canvas2d.test.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b625dfa7212e98ba8bf0a3aefd1eb2c6fe4701f1696f56f18ae9f723740c397"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 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":"rhwp-studio/tests/selection-layout-refresh.test.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2cca1e929614c3a184c53fa834f3b471fafdfc4222973f48ab497272e8c08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tallySweep (cyclomatic 11, cognitive 20): tallySweep has cyclomatic complexity 11 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":"scripts/layout-coverage-sweep.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002b242ea47467653914f671e2819c567256f77d3c5ebefbef8584df72ac620"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOutputBarriersOnly (cyclomatic 11, cognitive 19): runOutputBarriersOnly has cyclomatic complexity 11 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":"rhwp-studio/e2e/issue-2214-page-local-repaint.test.mjs"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"603f4bec246da108952d3ef0aa293da9b259034f40bfb020e62127c3fe731628"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function records (cyclomatic 11, cognitive 19): records has cyclomatic complexity 11 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":"rhwp-studio/src/core/native-pua-font-session.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b891503b6fb34dfdea1ff2984fad5e8d8a1ec54ef0ffb97ad01d5befe8d647"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToCellByIndex (cyclomatic 11, cognitive 19): moveToCellByIndex has cyclomatic complexity 11 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68ea35d790620054068fdedc7d325080af1590c888d2aeababaeccf503867a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeFixedGeometry (cyclomatic 11, cognitive 18): summarizeFixedGeometry has cyclomatic complexity 11 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":"scripts/font_rank8_trace_baseline.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a7250ecd7a8dbae42f91fca5c224865928ed7bba6e40f8bea0e654163e06cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSuccessorGraph (cyclomatic 11, cognitive 17): validateSuccessorGraph has cyclomatic complexity 11 and cognitive complexity 17; 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":"scripts/font_rule_registry_v2.mjs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cddf6d392bef8aa508ec70775b6982f36edbd007655321d9ae12952dd8ce7d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTrustedPostMergeCandidate (cyclomatic 11, cognitive 17): selectTrustedPostMergeCandidate has cyclomatic complexity 11 and cognitive complexity 17; 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":"scripts/verify-trusted-postmerge-ci-reuse.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4844b5fa0bf75c5a7b13dd529032969ab0e3984a8401bc81066af859980de4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAnchorPairs (cyclomatic 11, cognitive 16): buildAnchorPairs has cyclomatic complexity 11 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 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"36acdec76c3d5da16207f7d4980369571a8b5bd78d79a385092895dd19a9fa67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatInspectorText (cyclomatic 11, cognitive 16): formatInspectorText has cyclomatic complexity 11 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 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":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bc0294721a070593a3bd57af5149d477624bb5d0398be86c3161aead5c579c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 11, cognitive 15): parseArgs has cyclomatic complexity 11 and cognitive complexity 15; 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":"rhwp-studio/e2e/renderer-baseline-native-diff.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"696aa625a199d119d80ef6f871fe0bcb40dd785c4cb5e49a53be892d167cf979"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 11, cognitive 15): execute has cyclomatic complexity 11 and cognitive complexity 15; 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f132d647dce603a8641826af76794296a847b9bcb01ebfe7dca139f58281b61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToWordBoundaryInCell (cyclomatic 11, cognitive 15): moveToWordBoundaryInCell has cyclomatic complexity 11 and cognitive complexity 15; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d10af57b14dae909c85a16535d0113ddb97498d1ad9cb22f3f546d11ffff38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCellPreviewMap (cyclomatic 11, cognitive 15): parseCellPreviewMap has cyclomatic complexity 11 and cognitive complexity 15; 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c367c9b90f9a197e1c1821ce93c1cfff9ed30a7d70b4c25aa5872c022576fa7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCellPreviewMap (cyclomatic 11, cognitive 15): parseCellPreviewMap has cyclomatic complexity 11 and cognitive complexity 15; 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea8fa00f435fdc9912eb1a48222f1ae9731297797b553ecbfa59a010d580739"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTablePatiencePins (cyclomatic 11, cognitive 14): extractTablePatiencePins has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f8f481ac56f8e1fc02501a1da8f3086c40191dcba09269035aa4fdbc9aa7c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectedSubstituteTargets (cyclomatic 11, cognitive 14): projectedSubstituteTargets has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/core/font-rule-runtime.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5e1db681ed7286be72e1546e08b1ad826eec5d619ad81b02ff7ea8e98a9c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceTextInCellDeferredPagination (cyclomatic 11, cognitive 14): replaceTextInCellDeferredPagination has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"843581179947553619cb8d720ab727697d1d796024b8c0cb06c59b581c6b1e54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyFormActionPlan (cyclomatic 11, cognitive 14): applyFormActionPlan has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler-form-action.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8377e8ae4c6815c41ada3824d964215eb62b4f3b38f26263580fb1c017b0350c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishLineEndpointDrag (cyclomatic 11, cognitive 14): finishLineEndpointDrag has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12826876ca3cb40075217e205275dc7c12aa579545b3928ff489b169e22bc5ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3982}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fd44b5fc8d2a14d11dd02c7af073bfd8d34fb7e148444cbd04d5a3533f376c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performDelete (cyclomatic 11, cognitive 14): performDelete has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5832}}}],"partialFingerprints":{"codehealthFindingId/v1":"4712ce93be2393eec0d4671b7914f18db225fbcbbecd4ff1b2134a6026ef393f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 11, cognitive 14): show has cyclomatic complexity 11 and cognitive complexity 14; 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":"rhwp-studio/src/ui/context-menu.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0511d2dbcef0ecbde71f1696931b8e29b869de12070dd62e0c379425435f5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; 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":"scripts/tests/print-text-geometry.browser.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e5be8d7c0c7c5e31a949973ea8565323874d3bf49e8f030cc6f5a628146dff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/e2e/issue-4159-terminal-nested-bottom-border-canvas2d.test.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550f8c33de15ab20fd07a5ef6dcae94dcc15212568c68cc1cef2dec4e74150b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 11, cognitive 13): execute has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2763ff2e22b9df418edcf000c72b00b69232a784f2ca6ef3e97c6d7fc457c741"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedBlockCalculationCells (cyclomatic 11, cognitive 13): selectedBlockCalculationCells has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f19f35cf96165fac74a200594d566ba946af9ed3c17389ef6b63b2b143be4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDocumentAtomically (cyclomatic 11, cognitive 13): loadDocumentAtomically has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0898ae7efb1f9ea4a0f4036eee7dd5eac527e6eca6a6db1390c16071025f7fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populateExternalImagesFromDevServer (cyclomatic 11, cognitive 13): populateExternalImagesFromDevServer has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"928ce461af1d6f3f0f3e9053fb9ad74d2ab1f361aa432587ca5c7318ec661fe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCharPropertiesAtCursor (cyclomatic 11, cognitive 13): getCharPropertiesAtCursor has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a86c2d2aff5b0ca48d7d1c382a0c5cb08de91bd9d26f49f3ece0ebd0d9f4d1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRadioButtonClick (cyclomatic 11, cognitive 13): handleRadioButtonClick has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1787bfd314927cdcebb3091a00c100d968a28558f498e67e0715977616080f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onRunCompare (cyclomatic 11, cognitive 13): onRunCompare has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"116dd5046d1c1916c54970e5d6cf2a1e3cf71375d89f65bf9a9179720b11ddaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onCompareWithCurrent (cyclomatic 11, cognitive 13): onCompareWithCurrent has cyclomatic complexity 11 and cognitive complexity 13; 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":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbb85013dc461609d5457e6916e0268762e510b228682f4d92bc76181b0de8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectFormatCandidates (cyclomatic 11, cognitive 13): selectFormatCandidates has cyclomatic complexity 11 and cognitive complexity 13; 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":"scripts/font_metric_coverage_pilot_selector.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc0c8dc8e3c45d4e5f7f4f0fbb85252c4f893c340b093e307ddb8cbb15f3423"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register (cyclomatic 11, cognitive 12): register has cyclomatic complexity 11 and cognitive complexity 12; 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":"rhwp-studio/src/core/host-canvas-fonts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1608a125043dd42b938cacdddd3c5124aca4fcf4cf34b68a3c399b8749391313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyCaptureHandler (cyclomatic 11, cognitive 12): keyCaptureHandler has cyclomatic complexity 11 and cognitive complexity 12; 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":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fe6c15b6e3af211d626e52c5608cd34ac1ec95ffcb8fa4912f38731062da89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPlaceholder (cyclomatic 11, cognitive 12): renderPlaceholder has cyclomatic complexity 11 and cognitive complexity 12; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c61705b9e3a53fe8d88d13781c097be303b41b266f2ea6546cc32c321f8ba2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawLineArrows (cyclomatic 11, cognitive 12): drawLineArrows has cyclomatic complexity 11 and cognitive complexity 12; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c75747279563b40d78d1ee91aad0ff4923b12b81f6bc08e58cf7f7554ca6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayJournal (cyclomatic 11, cognitive 12): replayJournal has cyclomatic complexity 11 and cognitive complexity 12; 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":"scripts/font_metric_coverage_checkpoint_runner.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d17382b0bc9d36a2dac2ec0ff2b445da5e82665951c8a299ddf6295e658465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamDecisionUsage (cyclomatic 11, cognitive 12): streamDecisionUsage has cyclomatic complexity 11 and cognitive complexity 12; 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2023c04271b050bedb6a3db79ba5e90643452c4a8f7d6b71f53a593e4885673f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #tableMoveTarget (cyclomatic 11, cognitive 11): #tableMoveTarget has cyclomatic complexity 11 and cognitive complexity 11; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cb47d7ba089d3f1a374efd103c5c124eff7a4691c22da76f90105b0601ed61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/e2e/ai-providers.test.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9123b5a0fac7fd4a3da3dcc06e6e8e2b49e1405136e79eabbcc5a44cbdb18fef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/e2e/merged-cell-row-boundary-drag.test.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0fd13b42c6ae5c8333b2792c4b0ce6707830fc398f8c126368df77638aa8b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df2b6e06f56466d9013c2e70011332ad917895043d72cd050e5d716573cb6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDocumentFontPreferences (cyclomatic 11, cognitive 11): applyDocumentFontPreferences has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/core/document-font-preferences.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"502f6c8143f90d8d069343dabaf496c0e8279030dbde11283c1242f2c933e79b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateCellSelection (cyclomatic 11, cognitive 11): updateCellSelection has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3762ed8f957a371aa7766c361d20754ca98f737df3e3ce9a5f7bfe5e4849ca76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emfToPngBlob (cyclomatic 11, cognitive 11): emfToPngBlob has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"097f39fe7a0a9fbb933a3a2082174b39f2fd6ec3d287cd4fc40aa780a4e49a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCaret (cyclomatic 11, cognitive 11): getCaret has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a38c076bcc3eaa21ce2414523ab618fbca78fbc2d13a6e674b5ea2ab39321e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendImageEffects (cyclomatic 11, cognitive 11): appendImageEffects has cyclomatic complexity 11 and cognitive complexity 11; 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":"rhwp-studio/src/ui/picture-props-apply-model.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c98a538dd60ad91354eca330fc670b248a1c4fd1f2c15059a4f2c36e82420a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBackendDecision (cyclomatic 11, cognitive 11): validateBackendDecision has cyclomatic complexity 11 and cognitive complexity 11; 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e327d4c22ede7231da0393924df10eb55c0a8d63911392f7468eb9c55c130b8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotDiagnostics (cyclomatic 11, cognitive 11): snapshotDiagnostics has cyclomatic complexity 11 and cognitive complexity 11; 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":"scripts/kerning_r4e_runtime_parity.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d31ea4cba325fc994dcc83c1bcc3936969d1dae67092c1b89a2d998cc260158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CreatePageImage (cyclomatic 11, cognitive 10): CreatePageImage has cyclomatic complexity 11 and cognitive complexity 10; 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c86cbf867f43661e45793c4617cff2c23858f5f766012023e778c1da0d7cae8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 11, cognitive 10): load has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-desk/ui/js/viewer.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"62002e65e385396a8bb572b4274795d532455cbe0fbcd2d276b7f6d5acd14ae4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-shared/forms/action-runtime.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd5dc171a8c1a96e85799cd4ca054f6a2ae3a3e5fb063936ec954b64ebf57b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/e2e/ai-panel.test.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"515b9ef6fd75f788138cd1576867666ca0819a0766260961842a5b29a7b4371a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/e2e/dialog-theme.test.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3609f3e21770c9f028ea2d40f9f9119d2c2737f386a4d334c46c8bc54f7465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/e2e/renderer-baseline.mjs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d6156511a6f1ea43586a4234e3668dac975f753cf8fe40410f7a4f2c58c6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRulerLayout (cyclomatic 11, cognitive 10): readRulerLayout has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/e2e/responsive.test.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fe722a6cef829657399606f6f0fd20506173af5620290cac7161d23af94d03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/e2e/tac-inline-table.test.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95e4e46f2363bea15904a3406d91e67a871f3c017bfd0b512ed326e098b22ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyGeminiError (cyclomatic 11, cognitive 10): classifyGeminiError has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/ai/provider/gemini.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6610b11b26a4e9788ff23a0615360e6f219e267404ddb054eeda8ab379a715a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeDocumentFonts (cyclomatic 11, cognitive 10): analyzeDocumentFonts has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/core/document-font-status.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cc017a7a2bb4f9f28d9e18de4feb786ad58d452e6f01f4e2294e875e1c8c79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectDocumentByteKind (cyclomatic 11, cognitive 10): detectDocumentByteKind has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/core/document-signature.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cccc0845fb2cac88ebdcf70cd7700a2289fc56356a1a8570138e72d2661cfda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRendererLocalFontCandidates (cyclomatic 11, cognitive 10): resolveRendererLocalFontCandidates has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a05b30ecf7fd4a96fb3427006103e4a4a2402c61f86258b11089e54c4497746"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef66ee029c93afcdcfb0caaf4c9b8c954d80d8fd0256e3d1cc9c90385368d05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLegacy (cyclomatic 11, cognitive 10): handleLegacy has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/embed/runtime.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae90f47a0eefd5faeec11d3609a40507fe9e9066ba9d44c44ca03ec0ae1ac86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveToCellNext (cyclomatic 11, cognitive 10): moveToCellNext has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb72aa85c0b20e02e276dcb52b9cccd04de1578b2b909959f7aab4c808d846b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectAllInCell (cyclomatic 11, cognitive 10): selectAllInCell has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"b161aba67ed04f5a4beca2d0d9aacdf3df7045671b3d048b2c20149b778d694a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveHorizontalInFn (cyclomatic 11, cognitive 10): moveHorizontalInFn has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"266750a8f508687c429bf6b3ddfbd8c7de51f8326107624fc81146dc0718b9fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isWordChar (cyclomatic 11, cognitive 10): isWordChar has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7ae801db389bac28cad62984fe80a7c15fe606dcf55350eb2c9140d14fb471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isShapeBorderClickByRef (cyclomatic 11, cognitive 10): isShapeBorderClickByRef has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb10a13c8d55182e321fc6da894150ba80369cd1bfca33853a52d516e2ee1282"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/main.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce15eaf4b2528c6a10799e083f90558709ce72b381968ff9bc4b6fd2247054"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushNow (cyclomatic 11, cognitive 10): flushNow has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/recovery/autosave-manager.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58baaab3c66160e6f54877c9a60c8e4b39bb7a9fa4d1d32bec1e8ff99164fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateLangFields (cyclomatic 11, cognitive 10): updateLangFields has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51b22e1bc24e186266bc9f6e2d35fde7fe0e0736932452028a86adcc0ab94fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populate (cyclomatic 11, cognitive 10): populate has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"74da762a3a2e2af0835678b08db3ccb8ef5092ef831ef7f593577abba7c01052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isValid (cyclomatic 11, cognitive 10): isValid has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7c39a60680918502cf658514990401f5c756b7796079e54f0553e64457a35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLine (cyclomatic 11, cognitive 10): renderLine has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b6f5bd4ba30e3c2ad017da816241102d4a196e8cba198548b930ec21c1d18f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectImagePrefetchDataUrls (cyclomatic 11, cognitive 10): collectImagePrefetchDataUrls has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/view/image-prefetch-signature.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda0dd029b8ab69f536818bc4833dd768691cb214667701399b317da85939700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCanvasKitRenderModeRequest (cyclomatic 11, cognitive 10): resolveCanvasKitRenderModeRequest has cyclomatic complexity 11 and cognitive complexity 10; 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":"rhwp-studio/src/view/render-backend.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d93f73e3407e7868d67254f75a60422257acc7148daca3d9833100ee81d63d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFullCoverageManifest (cyclomatic 11, cognitive 10): buildFullCoverageManifest has cyclomatic complexity 11 and cognitive complexity 10; 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":"scripts/font_metric_coverage_full_manifest.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dca8ebee488a6374ecb59e0d8a485478e152f0000d33e655883a1228de69088"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; 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":"mydocs/working/assets/issue7001/inventory.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a9b60f55766bf13b422b0e3836876377797bcedaf96a76613c75f48568132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 11, cognitive 9): record has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-shared/pdf/import-session.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7e5d1431e238793383e0eddeddc6dc0b02c6aebc395882eec4832c2d39b4b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/e2e/hml-open.check.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7c9fdf61013195993e566598a3a9d7a303a6ea7fc18f838257adaa292dca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function issue3794Step (cyclomatic 11, cognitive 9): issue3794Step has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/e2e/probe-flow-input-latency-issue3794.mjs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b240485304c6a08e378aa2385a32cbf845e33cb1b9f6b2eda042ff5a9b05f9b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 11, cognitive 9): tick has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"861cf98b926587a43e255de8dd98d97457ff281f1b1dcf36d4a888203f4b6dd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareClickHerePointerBoundaryExit (cyclomatic 11, cognitive 9): prepareClickHerePointerBoundaryExit has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5417}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da12a6c8f5bd3e2468bb398e685780f60825ce986b1b58bce6d73f6a0aa5358"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePreview (cyclomatic 11, cognitive 9): updatePreview has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e440f58ce57fd1ddab83c670e84190b06c47bfac95836d91b5ccaace281b4a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConfirm (cyclomatic 11, cognitive 9): onConfirm has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/src/ui/goto-dialog.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"213e6f8fde88c2a5f74a4b870c34cf31b6ce61407cb9dbe24dd6784e0e6f38da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adjustFont (cyclomatic 11, cognitive 9): adjustFont has cyclomatic complexity 11 and cognitive complexity 9; 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9ac8a9e6504213fc8aff111d410f63ed0d1a38071ca8418cdf5124af4f3e99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDurationMeasurement (cyclomatic 11, cognitive 9): collectDurationMeasurement has cyclomatic complexity 11 and cognitive complexity 9; 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":"scripts/collect-nextest-target-durations.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fb2aeee37aafd5157cae9090fe2166a7a96782f0748bc0d098b15fbb037975"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/canvaskit-renderer.ts: 6146 lines of code: rhwp-studio/src/view/canvaskit-renderer.ts has 6146 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0377846b4417b92d986bbabb1f9a0d55320ed087ab21d594e6361789d1c6c1"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler.ts: 6138 lines of code: rhwp-studio/src/engine/input-handler.ts has 6138 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ed7c209f407f001de04a464a7242085da29eea29c0988846e94a5eb7c2d7a2"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/wasm-bridge.ts: 3706 lines of code: rhwp-studio/src/core/wasm-bridge.ts has 3706 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f10f3014d55d3faac8f34eaa9b940afc97f4a42c5cd0a4870b0400ee8d60e6"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/hwpctrl-ocx/src/index.mjs: 3516 lines of code: npm/hwpctrl-ocx/src/index.mjs has 3516 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c517bf14534d927a6eb250fc0364cb9e003bb12e250dc32464dc67bd16a3c7"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/command.ts: 2950 lines of code: rhwp-studio/src/engine/command.ts has 2950 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3199be2fadfd31cff562e8d4cae94b5ea3da398bfaed2e76310e95a41b94081a"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/compare/diff-engine.ts: 2907 lines of code: rhwp-studio/src/compare/diff-engine.ts has 2907 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ab8a52f60603c248a209ab1ba25d307df804af86acd9eb253dbb974596c8f9"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/cursor.ts: 2460 lines of code: rhwp-studio/src/engine/cursor.ts has 2460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/cursor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46a4f5474b34443ff449c908d0a37615d015be1c7f6f53c6f36fceab7db5cf8"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/picture-props-dialog.ts: 2421 lines of code: rhwp-studio/src/ui/picture-props-dialog.ts has 2421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97025d9f0b0d161e58c6bcc7ac2ecac7f1659bd1faef0029ceafbaed0b33a826"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler-keyboard.ts: 2331 lines of code: rhwp-studio/src/engine/input-handler-keyboard.ts has 2331 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584cf4a236fb5014c4998c7ff49d67bfef99c38f2efb75c2b54d74c692d402d"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/canvas-view.ts: 2318 lines of code: rhwp-studio/src/view/canvas-view.ts has 2318 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf72b6e9e85c2d8eea50044f4e7291f18cde5e2a5a95b78317e960e287fb997c"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/main.ts: 2229 lines of code: rhwp-studio/src/main.ts has 2229 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5164855eb967fadd7b8e78f0eac184340c05883ca0bfd3b6200db650b59c473c"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ai/tools/write-tools.ts: 2080 lines of code: rhwp-studio/src/ai/tools/write-tools.ts has 2080 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/tools/write-tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb17a9656ec693df5c5ceb1b76669b9ac45f33101c55fc3196626369345dd1a2"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler-mouse.ts: 2043 lines of code: rhwp-studio/src/engine/input-handler-mouse.ts has 2043 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b04732fcf64f49bc6b5f647e0e88587a1a062676a172b5d89ab269f2b1ed0a7"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/page-renderer.ts: 1550 lines of code: rhwp-studio/src/view/page-renderer.ts has 1550 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0dbed7c894dc98611571510b63a2399b54e477a062847690e672e413c81a6"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/table-cell-props-dialog.ts: 1421 lines of code: rhwp-studio/src/ui/table-cell-props-dialog.ts has 1421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-cell-props-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08364d1812c2dfc9af671645ee9cf4f797c62e4a2fae734242a9159f1d3093b"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/local-fonts.ts: 1270 lines of code: rhwp-studio/src/core/local-fonts.ts has 1270 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce6197de5d204bec28dcdfa60f773eecca9c6c34962baf284b3348599af471e"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-vscode/src/webview/viewer.ts: 1243 lines of code: rhwp-vscode/src/webview/viewer.ts has 1243 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/webview/viewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7149cacc5e1f3469c802d8e316d68b1d83a293e271198e9ec1a42141e6d535"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/static-svg-path-layers.ts: 1229 lines of code: rhwp-studio/src/view/static-svg-path-layers.ts has 1229 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/static-svg-path-layers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe79dc087303febd97f68c5382412295369b23d6def34ad847905be5e3d476d"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler-picture.ts: 1208 lines of code: rhwp-studio/src/engine/input-handler-picture.ts has 1208 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-picture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"653599978e56313f85826475bfb7ece45c665409d34e80d7654b87c7c4bc7194"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/table.ts: 1120 lines of code: rhwp-studio/src/command/commands/table.ts has 1120 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4746745d8a232b747dbd291ce94f84d97e538c0c2c3c31aff753ec35e23403"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/cell-border-bg-dialog.ts: 1040 lines of code: rhwp-studio/src/ui/cell-border-bg-dialog.ts has 1040 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df75d66785584b1e324506621f2f3fdc9b0b7923e3dd398fdaa47f86bbfdd10"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/char-shape-dialog.ts: 1022 lines of code: rhwp-studio/src/ui/char-shape-dialog.ts has 1022 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a2eca801947291e590c9e504e19701fc3b756d2dd2081e281a670a193159d8"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-desk/ui/js/main.js: 964 lines of code: rhwp-desk/ui/js/main.js has 964 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34781575ea8cf596aa277e2108f8d81e153802fcb66360243edc522426b4907"}},{"ruleId":"R3","level":"warning","message":{"text":"gym/tools/from_e2e.mjs: 928 lines of code: gym/tools/from_e2e.mjs has 928 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/from_e2e.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e394c5894b1e44e8cbf3cc939c4e883c8125de68f8b07c3d4b500316168aa0"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler-text.ts: 872 lines of code: rhwp-studio/src/engine/input-handler-text.ts has 872 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedbbb8407b872cdd3253d3c2bc3eb62324eca45507c7c63fed67bb07af97081"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/toolbar.ts: 870 lines of code: rhwp-studio/src/ui/toolbar.ts has 870 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a9392f8a119f9fe4e7e4da8678c076b688b98db1bedbbf75cb8c8eb4b6adb8"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/input-handler-table.ts: 863 lines of code: rhwp-studio/src/engine/input-handler-table.ts has 863 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b359a1f6cdc2ed9fee0f1aa9bd211c7ba7be294ef55ada46df7ed8bf762a32"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/file.ts: 856 lines of code: rhwp-studio/src/command/commands/file.ts has 856 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ede82641fc84c08e1d30880515af52df213c7411e340e72b045d4c92b48baf"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/para-shape-dialog.ts: 852 lines of code: rhwp-studio/src/ui/para-shape-dialog.ts has 852 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e804deb867e9a7446367164dbad02b6db2e5fdee014241d0fb66990c9d88f1c"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/document-agent/controller.ts: 837 lines of code: rhwp-studio/src/document-agent/controller.ts has 837 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/document-agent/controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b418b8f13fe61b4079a2eff320ffe5e1e5983e4e929166837f7a88d8dc9a83"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/insert.ts: 825 lines of code: rhwp-studio/src/command/commands/insert.ts has 825 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbfc7e4002bad16b0099441b4f88c011ae9b72d24968ce9af84c182d026a607"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/ruler.ts: 806 lines of code: rhwp-studio/src/view/ruler.ts has 806 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/ruler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae3e75105f46862f4e6058ac308a0fe6eda8fe51417ec46d49c9d7d10b842fd"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/endnote-shape-dialog.ts: 756 lines of code: rhwp-studio/src/ui/endnote-shape-dialog.ts has 756 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/endnote-shape-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d8235d430ac942c4402babf54ede355becfe514e20c696b2ffb4e3db1bd79e"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/equation-editor-dialog.ts: 702 lines of code: rhwp-studio/src/ui/equation-editor-dialog.ts has 702 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fdea1e92498e670b86032dc851c9c95b4d6a30897e43353f0dd8ec18f06b37"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/virtual-scroll.ts: 678 lines of code: rhwp-studio/src/view/virtual-scroll.ts has 678 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/virtual-scroll.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1874d39abef47d9c9594763cf714375ae50e15695819e39de75b82a96234407e"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-vscode/src/hwp-editor-provider.ts: 626 lines of code: rhwp-vscode/src/hwp-editor-provider.ts has 626 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-vscode/src/hwp-editor-provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970f53e07702412f8fbad15b1506643d1c5ff9d024d498e97f09d08c52e0a6e"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/page.ts: 625 lines of code: rhwp-studio/src/command/commands/page.ts has 625 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca0d1a82f3e39fd29aa4ec3efb52483d3d8c9b47280df59c7a238cc2cb9d30a"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/para-shape-tab-builders.ts: 624 lines of code: rhwp-studio/src/ui/para-shape-tab-builders.ts has 624 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/para-shape-tab-builders.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6f750da1e73a74897256467be1b880c6cb08bce53b9a308cdf9bca1da2b527"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/canvaskit/css-color.ts: 616 lines of code: rhwp-studio/src/view/canvaskit/css-color.ts has 616 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/css-color.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"390d75ee5b159b6eeec64bb6c16fed8e3569f7c9321f8172fcee4cff180f9aac"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/glyph-outline-payload-status.ts: 602 lines of code: rhwp-studio/src/view/glyph-outline-payload-status.ts has 602 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/glyph-outline-payload-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95be39f3512e0a77d0b75c6fd403fdc6fc1da5df42f5ca6cfe8cfc0b93f6dab"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/page-border-dialog.ts: 597 lines of code: rhwp-studio/src/ui/page-border-dialog.ts has 597 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/page-border-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d14bddc4cc605d984eee5b2f3ad01a8c48dd09224d6b1532d63da5ec54b59f"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/dev/page-scroll-probe.ts: 583 lines of code: rhwp-studio/src/dev/page-scroll-probe.ts has 583 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/dev/page-scroll-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf566826ad61448c561f25360fbbed11b09478161f807fb58649ced2b4c028b2"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/picture-props-apply-model.ts: 579 lines of code: rhwp-studio/src/ui/picture-props-apply-model.ts has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-apply-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2aef8ae81322bda3f0ecf45bd324eaeca5a58480e4439073c59ad4296517c"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts: 572 lines of code: rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts has 572 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit/glyph-run-fonts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bb1d813e55600441d16f541799a922db7ab74bb65e3bc922857b20d02f7ae4"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-firefox/content-script.js: 560 lines of code: rhwp-firefox/content-script.js has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/content-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221fc4c529dd975ecd80937ee8dbcf4092e35ab2921fbfa0c16a199b93bf30ed"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ai/ui/ai-panel.ts: 545 lines of code: rhwp-studio/src/ai/ui/ai-panel.ts has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/ui/ai-panel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd710e6a0b46c7c39fbdd96f221767b005f4d72cbfd5922f850dfd60936dff"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-chrome/content-script.js: 542 lines of code: rhwp-chrome/content-script.js has 542 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-chrome/content-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"313986588250316e33bed9795fa25688acf1e42162438769d74c9af306d1c810"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-safari/src/content-script.js: 530 lines of code: rhwp-safari/src/content-script.js has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/content-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3377e4d30395a54193d742922e91ac8f3ab93af8224976d6c4ae0550511b7bad"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/font-substitution.ts: 523 lines of code: rhwp-studio/src/core/font-substitution.ts has 523 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/font-substitution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2a4bb12fcc4ac59f2712d44deaf2f771aea5ce97378c27f16a2d5fde0f0201"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/compare-dialog.ts: 518 lines of code: rhwp-studio/src/ui/compare-dialog.ts has 518 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef92bc7f0cc412acce2f86f31d1237fe92c7f15beeab8ace6cc5f4d4eb1609b"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/user-settings.ts: 512 lines of code: rhwp-studio/src/core/user-settings.ts has 512 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/user-settings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f7e19be608367522c27bc6aade7f4527f15a8b8b39bcba338d27127d3f1bb8"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/find-dialog.ts: 507 lines of code: rhwp-studio/src/ui/find-dialog.ts has 507 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/find-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf8c930f48e1c2e58b2481c66d42ca28b076525158df2b32def50b04a5668d3"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/editor/index.js: 498 lines of code: npm/editor/index.js has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/editor/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec1927ecce9050073d948941f34ee5a8aa0f77a18b3269080be071c57bd3e2f"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/subsecond-runtime.ts: 496 lines of code: rhwp-studio/src/core/subsecond-runtime.ts has 496 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/subsecond-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7981fcbcd8f6a4fd4e9c0ac5586f6347bfd57e69cf6161db22e3e1582a5d97"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/compare-result-window.ts: 493 lines of code: rhwp-studio/src/ui/compare-result-window.ts has 493 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/compare-result-window.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"609fde8295b0329102455e111c8fed303f463e8592ad68faae349b18dcb22f23"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/history-dialog.ts: 492 lines of code: rhwp-studio/src/ui/history-dialog.ts has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/history-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf50384cb3acb6b069e90b240dda5e04ad7e1f5fe33812bb9d0c7c2157804e1"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/format.ts: 490 lines of code: rhwp-studio/src/command/commands/format.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21316c004ef5a5b8009a7ff36f3523bd838620338316f60482b22ddcc9f95c1a"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-safari/src/background.js: 473 lines of code: rhwp-safari/src/background.js has 473 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-safari/src/background.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5074d7f7413c64481c095e14d83aa584ef3e6a0014b66df11a5f7dadcaf0eae7"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/view/renderer-session.ts: 446 lines of code: rhwp-studio/src/view/renderer-session.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/renderer-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986558d7db17d15ba33f4ba106d18f0f9cc9ab139484b56adc2a0fdedfa4c11a"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/command/commands/view.ts: 430 lines of code: rhwp-studio/src/command/commands/view.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb31345ed8be2952b1b2515a752e05006a4b664521cf39ffa00897fe446708"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/core/font-loader.ts: 426 lines of code: rhwp-studio/src/core/font-loader.ts has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/font-loader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6143327df0fd3d18c93abc31251c085a50ac745d24c3116126a6f2c64531839"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/chart-data-dialog.ts: 425 lines of code: rhwp-studio/src/ui/chart-data-dialog.ts has 425 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/chart-data-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed6907eb2838755264728b7f55c5a1b51deea1e5b610a1e12cc2192777f0a6f"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/equation-props-dialog.ts: 421 lines of code: rhwp-studio/src/ui/equation-props-dialog.ts has 421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/equation-props-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524a76bcd45ef33fa6c689723b74b1b564eef06e6faa2726ccb1f521ee072377"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/table-create-dialog.ts: 416 lines of code: rhwp-studio/src/ui/table-create-dialog.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/table-create-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c23b1e4e9e787fc479268af2444162aa52026ee479b9c8807edf7c3c304e2d"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/plugin/host.ts: 412 lines of code: rhwp-studio/src/plugin/host.ts has 412 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b523e543ffff96ceae24b4b23587142fd19bf06c02b65a07d8023226b2f655e"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/engine/table-object-renderer.ts: 411 lines of code: rhwp-studio/src/engine/table-object-renderer.ts has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/table-object-renderer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fd3d891d1f1bae87d355eafcdae9804e0ad163fde9fc66dba9b8bdc74a8f64"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/options-dialog.ts: 408 lines of code: rhwp-studio/src/ui/options-dialog.ts has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/options-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47ce5d64e949e4956e4785bf47f2b103206db192012d2476d4b264d0f6d7f84"}},{"ruleId":"R3","level":"warning","message":{"text":"rhwp-studio/src/ui/numbering-dialog.ts: 403 lines of code: rhwp-studio/src/ui/numbering-dialog.ts has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/numbering-dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d6ebbc355b371e0cf15884751653fa8184ae30199489dfb64be9be6b6ccc55"}},{"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":"rhwp-desk/ui/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5c91ae747a2da1fff38396ebed9b2444e88269b52e601d0e547f5634da6b41"}},{"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":"rhwp-firefox/content-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a7b03f947656eacbff01754a1ab688254d4487e0a8ff9d69e9b3d9cfa0478"}},{"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":"rhwp-safari/src/content-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e105c52ba8d96f9cd8554393244de5ed480d77f632e98ba0435cbf04787e3f30"}},{"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":"rhwp-desk/ui/js/cards.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed2463b27dc82e5b051aa3681a941ed5ce4fc1df9b9ce9941bf8b7247fb4de"}},{"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":"rhwp-desk/ui/js/palette.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e162c586dce3302e2fab3535e2e075487f0970dd0c7a414816377afa58f8341"}},{"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":"rhwp-desk/ui/js/agent.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3d219c97dcc82f2e24085606c29ac3638383601ee9ccc7396f24d7f413029"}},{"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":"rhwp-studio/src/ui/validation-modal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37e51200f6f61b4060d1daa20439a8395777e46aa2aa2048e0f705ae379e0d5"}},{"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":"rhwp-safari/src/options.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5db5328c6c3defec3a3399a1631e70bf846865acb9e2f1fd53876f662e33c0c"}},{"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":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9cdd02447013775bd67ceb4356ae46a069dba64ac077899d86828cc03396e3"}},{"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":"mydocs/pr/assets/semanticist21_20261105/validation-r5/api/claim-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e031eacb868b588f6fd7e8acd7fda40000aedd86ae2568bca292ba5af748681"}},{"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":"mydocs/working/assets/issue6042-stage5-correction/summarize.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d23785a8c1cc21b1c931c1747891496f59cba70f77979c87040a11f19fd20"}},{"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":"rhwp-chrome/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bcb4bd7b797802f97287bc466a2e414d28fed33c854332b3e4bc2bf4853926"}},{"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":"rhwp-firefox/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"479b6ad4549f57deadf470fe5c67683a459fce3af6b27d49796dd5b49f53bf63"}},{"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":"rhwp-firefox/dev-tools-inject.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1e4151a88f7a410b27b61067bbac40d5796d4ba625f05d3079f2225316928"}},{"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":"mydocs/pr/assets/pr8187/browser-api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4189971c9de0f667d2718fb7cf9393ee1aec946d7f64b1c022d95ee9f601953e"}},{"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":"rhwp-desk/ui/js/viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2073dc87300ba2a25e2e460d23493eb1b4e7aa7f967e7dac7f2076df5e59815c"}},{"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":"rhwp-desk/ui/js/ontology.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb566db8b3e3dbd5f120815f2439c8f9f1c134b1fd672ff5ef65f4fd9070bcb"}},{"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":"mydocs/working/assets/issue6042/check-retained.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4917e68a6d668a77c0fcf4c46bc8ab5848684d4c3a0c9f8b840db0fe9fcd505"}},{"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":"mydocs/working/assets/issue7001/inventory.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6815a8b7f13c053bcf1003b9c1d80962768b547777981882d749b7856ef90ba"}},{"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":"mydocs/tech/investigations/issue-3587/probes/template-contract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02454650d5c1eb86b9e208a121cb6f833c36d7266ec0c58389417e650690a0bb"}},{"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":"rhwp-shared/security/filename-sanitizer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53927e5bffc2403fda43f463d62b8d2f4842a65105ac1e4faa607d77daab317"}},{"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":"mydocs/tech/investigations/issue-3587/probes/import-wasm-contract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe3b18bec31502d8cf8ba7a596a78f28369876339270ca87e7ee3afc7faa6f4"}},{"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":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0205eb0ad9d3160e3fca8549865095494193eda1edc1e7dcc6876ab3e93e9e9"}},{"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":"mydocs/pr/assets/semanticist21-20261005/browser-review.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a8cbeac62219516a921377bad4a77a1987e24b705003cc4eb42dc9c1ab8b43"}},{"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":"mydocs/report/issue8168_topandbottom_tac_picture/make_unverified_inputs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"639cdb7eb680569c837485d9b30d20b17d668f383378b8e87a9746e10c400610"}},{"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":"rhwp-desk/ui/js/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f3db959c9f63857d2e030e4849e904e6f95f3be1d226d9d67085953b19a0d0"}},{"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":"mydocs/pr/assets/semanticist21-20261005/combobox-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1e35ac2c44bfac24d62c4743483627517e1c7bc61f688830d4683510c60e08"}},{"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":"mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f02a17bce1076e03ab916f0c8cd6557780ec7a9801e507b3e6c773e6d0ab62"}},{"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":"mydocs/working/assets/issue6042-stage5-expanded/compare-visuals.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f69593c853b36844b05c9288b44e915f457f18d47ae28ea0760059fe34e0712"}},{"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":"mydocs/report/issue8282_hwpx_reopen_tac_picture_square/make_inputs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16a1dd06ff7345ed23a4c5c2753844d8e88ea6852fab49c994c09abdc20f83b"}},{"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":"rhwp-shared/security/constants.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3c0d6ead61635208f45f42e4841f8b8e5df595f3b94ba5f350d998d9fba8e6"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa78980c0f21a1d727eb910dd19fce83341f6d9fcce33a3d520ee8e9460334a"}},{"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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369a6ac5b133f0f79c1a8a6cd7a20175fe662d8b18106e968c8c2076bf18598"}},{"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":"mydocs/pr/assets/pr8296-maintainer-20261101/canvaskit-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55bd64a805e4a4c97b6e1ec97c8236a7fef0d61fb9b706e98f06118fb73fc87"}},{"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":"rhwp-shared/security/security-log.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b420fa923de2ca62a000a45c5ad2463f524fac1710aaa9335d38fd7a205783"}},{"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":"mydocs/pr/assets/issue8174/v2-s06/probes/browser-audit.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba7e431a524741de02e4060a8291c328472a2a741d6d397f90ffdba68858ab"}},{"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":"mydocs/pr/assets/pr8300-maintainer-20261101/browser-review.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0f985149d976de1ed32af96021f33fc7b9da3c8318adab7d79fa2a1abeb5a5"}},{"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":"rhwp-shared/security/sender-validator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78552b511f446f52f7ae0738008edbfdd2e26d5405d90b3a2c22e85259ff2d0a"}},{"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":"mydocs/tech/investigations/issue-3587/probes/import-plan-recipe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ad5e2ce5619ed6bb35f0572961bdac7653e2540c981be26b68f2e41e9e5817"}},{"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":"rhwp-desk/ui/js/icons.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cfe80722fde9b9f34b7def1ad7fcf392d091c3c98a5827d25a5625b331ffb4"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/performance.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"541a6a6968220e8e2fb965cd44eb6bbf9f9e1068158abf39eb1112dc72cc23ee"}},{"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":"mydocs/pr/assets/hyunmyungjanelee-20261106/wasm-image-roundtrip.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb6815906723d18152313c40372d86591b616755f93354cc0b08d30dd4fbc83"}},{"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":"mydocs/pr/assets/pr8309-latestbase-20261102/reproduce.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7f50fc692770295775adb99ebf185cc56f028d01b78cdb30aea3c88538c52b"}},{"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":"mydocs/pr/assets/pr8309-maintainer-20261102/reproduce.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcdd82e846d4c740a4bc8365ebe5064683e2106b3de5c66fa1f310def0e544b"}},{"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":"mydocs/report/issue8271_hwpx_reopen_tac_picture_float/make_inputs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d43d2fe14df44b885b76afd32140b9c442c364cef008155a1c880cbdd5162"}},{"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":"mydocs/pr/assets/semanticist21-20261005/query-geometry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e7465279a5a87aa2bc00423405c3cca56889bd21c635bad477eda828294965"}},{"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":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c1fcdac7b125d0f12e4a4e535fb4fee43d8bbb91befee70fe5e204db0506d0"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-svg.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c7939be3a48d6fa2115a634061c62511e1092305c3d60aaca46dabfe3ec7f"}},{"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":"mydocs/pr/assets/semanticist21-20261005/kerning-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"455d806815809299cded7ec40a08a4c3d1e0e3c1dcdf347d27fcfaf88a3d03fb"}},{"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":"rhwp-firefox/background.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1ec3e4a2f3d47bbbd3e19fd4f5ea1a5adc72d4f954af6ea4cec91658b79268"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-open-races.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d494bf2f2541c5f1b71bdd794d0e50ce14543f9a70b8572df49620b37ab480c4"}},{"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":"mydocs/pr/assets/non_draft_20260914_studio-review.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af2536a34eab79afab228626f88591823f59aeba248547c509ce482bf3d38c0"}},{"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":"mydocs/pr/assets/semanticist21-20261005/outline-runtime.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf7808fc132cad39c008449e8b4954dd9b57b154e56450319bd11345cf8c53f"}},{"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":"mydocs/pr/assets/pr_7487/reproduce-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c953dff477057cacad42a6061bbdebc60a0666e4a835e59965f2c0d284cb2ad"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-matrix.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac2328bbe637942decc63cfdcffe9f31b131e1d2bbc8f159e38a535cd13186e"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec0d8e09354325733bf97fc46ea3d0b66ed218989da7c71aba327f12b445bca"}},{"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":"mydocs/pr/assets/issue8174/v2-s06/probes/studio-audit.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c854ffa2370e9eca9a43caaa7efd5d654b9724a4fd7ae344ec73322410b46f1"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-production.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5edd99b34220e39add668206c7c043ce9fb834c1955e23435116601f8b3e041"}},{"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":"rhwp-safari/HWP Viewer/Shared (App)/Resources/Script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf14f9bc3d37a0540e08e6eed1c08827c9818f2ef183a3fff210adc3ff60d2"}},{"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":"rhwp-studio/cdp_screenshot.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62780b5899d33e04b74d77cfdb7eedd633e3d786a8c35eac0475bc066af4c8"}},{"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":"mydocs/pr/assets/pr7142_browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a035b20c36a4897ba8868bdc193443d8d1e2dd7d7458447b804df49f46292b92"}},{"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":"mydocs/pr/assets/issue8174/v2-s06/probes/jpeg-browser.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb43fd429a25e3958931938fccee7a2c516b18032b3e8f3f87295c4d20e157d7"}},{"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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-distribution.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69b3bbd23a33ee8b06b37dadfd8cfb90a8c9df86c58c2a8272975d4f4577551"}},{"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":"mydocs/pr/assets/pr7142_build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98bf5531842a9e83c75e97fa9fddf5d3b2f986946acf2d871da26ced4151425"}},{"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":"mydocs/pr/assets/non_draft_20260914_studio-server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98905d27cfc6929e9ab2936ca8b809ab654592c8bac3aa28b8746ceeb0e9d636"}},{"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":"mydocs/pr/assets/pr7142_server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ee07c751e60b30c39e0be83bf81da207ee33cecd4a8378efd69a7647b66212"}},{"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":"rhwp-shared/sw/document-filename.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c71aafe83fdd3911295298d083f3551c8b26f80f63b14a6c19db69cb27dda19"}},{"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":"rhwp-vscode/src/webview/canvaskit-wasm-url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d923cf8d3377643dfb011cb7ec0baaeae11d4b1b1eceba7c0f7a12fd240420f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~183 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"mydocs/tech/investigations/issue-8403/validation/browser-verify.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bb6c35b38c00ce2ff0b56d01b9efc1321e9169fca07195446681e2223f0cd6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~104 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"mydocs/tech/investigations/issue-3587/probes/template-contract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab043be79eac7237eb009ed91138db63070cc956bcd90b8c99baeb966687384"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~99 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"rhwp-shared/security/filename-sanitizer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca11223e98773a7520703ad2cdb8f8443dad11452db5d2a2b70e0f8ca54f6dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"mydocs/tech/investigations/issue-3587/probes/import-wasm-contract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258895072bc1cd7460fb23adce10e200a4a2473271b8a9f63013cc7ae0e8288b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"rhwp-shared/security/constants.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d058240d6eadf54d6ce4f4c6a3a641da05ec08ebf6e5ef4e350b20ee673537f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"rhwp-shared/security/security-log.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac4c1aef2b265085de7c330bb2fca81876ec2614007fe72673eade9686a1c3e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"rhwp-shared/security/sender-validator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac27b3c4b10113e4457541b403fbb602e0fa1e2393e954c26b2e89b7e0604e26"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"mydocs/tech/investigations/issue-3587/probes/import-plan-recipe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd94a60342c1f5a5024a0bb6a7b1a25894b13a86c4a049d28a63c4664c40026"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (472 application, 113 tooling, 709 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":"rhwp-shared/sw/document-filename.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0659fba8782c8fcd1a4294a26031228469a74fba5c27e5a959f5dcf66dcb984d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_STATE_TTL_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/sw/download-observer-state.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c401ee379a4a898a17601195aa743d0a91e4e7486e4c96c4fce0db46d48b4c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isTerminalDelta\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/sw/download-observer-state.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"acec9ce61991db9f7fd8471b78740205d1845193383fd6ac4494a591a367a28f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PBKDF2_ITERATIONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ai/settings/key-store.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e300de68ed4137ae8c7c3f31f06709872e0487dc6590c9ebdbdfa27c8fd6b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027collectMarkupCommandIds\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/automation/menu-dom.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5231647832604d2a16533b27575e143efc0522064a716477305b418b08f58eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AutomationErrorCode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/automation/types.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1f84f10b9a763677af3bb92f4696594fc8dc699dc06dba3cb36e3693505336"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027imagePixelSize\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/office-clipboard-images.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"73810adf089f61d8fb4105aee01910a98dd3acf16de7da095245069bbda0717b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isPluginError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/plugin/types.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87f5e49c8675547e7b69279a7a029d0741cb66e6924fb29894c126b3e684e07"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027localStorageWidthStore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/side-panel-host.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ff3a83b4979f662f559fe33a0990701058088c4b0a426e07cd7ca947381010"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ZOOM_INPUT_QUIET_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/zoom-input-settle.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"680edc564929d20dab4924582d7341149d7ad7c3d9001c8b7b371b61c325e8cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arg\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/from_e2e.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eef4e84d0e33041dc25ef8be25d6dd984063b4802c196d0d21addfba6f07ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cancelPassword\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-open-races.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48a710f72b9d1e8ac0d2ddef684cb66f7265d9313ec79e8c7a2ff00cf85cfb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027text\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-open-races.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0464b2fe784ba7153277dba7e8b2df9eda08b1a85ec56a9793d6533d285c86e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027restart\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-races.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"09898490bc84334f25b9c23c82c6b89fff625d8e960f21da0b2cc5943df042f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027restore\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-races.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6667bddeec30de5f949e4dd3a16e59bd6fc603ebdd2412360f5396498bb81b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cancelPassword\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-races.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4eff0cf49854298c6f1444880126bfa880bdb5e5aec6753e5709db2c17a3d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027text\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-recovery-races.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"92319234bc83f2b459e4946e4cf754b6816054edc60335c1f4ed123c7607277e"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#fieldViewOption\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21bef517952f78732e7caca3d9f0a55779a77e6c10f14d5684af0eb073d594"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#selectObject\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d5f5bd4b02b909812fa5882e709aec9144c765ff8dbbb90477d3fdd1ddee22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arg\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/e2e/probe-image-repaint-issue3315.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac45ca4b76f47d6955dd177794f5f555038bc1d7bb4eb825cbcb736349df45ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027stub\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/page.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cff03350ea19f90b94ccb35db147a3fc26cfe4ac0f7c5ac6fe899651d00c7f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inTableOrCellSelection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d2af53c74be722a861ba979c4068b02bdac4906ff005afe58af350ea8a9b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027stub\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/table.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eec56c0181ab1620f5b0db1783c7e8f56b12e83d5c13ed8e38bfc7e921b8327"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PX_TO_MM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/command/commands/view.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf8ebc3d67983547c002888fc919663f9f649f79d0c200e23ae788432917399"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027selectTableObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de5f2ad73d2e5d3c4629a109f79a5ed50c9669ce9fedbe97c3f15a647963a61"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027findSingleCellResizeNeighbor\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c55ec0f0f24152c864851d60ec264e2ac97ee84ac1ec2fde4f00360c9e2597d"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027commandPalette\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"711062f13f7f56f610536c675cafd2c11987a20dcb90883da44b0e2b122001e9"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027cellSelectionDragState\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7189f1268e21f6f46bc95451566a01d5ee1504eacd2530c068bc2e74eefaf468"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027cellSelectionDragCandidate\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a86b2ef2898d3900c9b7a75b91cca190d3b2f615d9799b8393db75ce40ce9"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027protectedCellHitCache\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"33373595e2c2b4811b880935a391ee1f04f218c5de5bdcb5c47c5d683dea565a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027resizeDragState\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f01faed06080a3123fedc48f82d3c1d0d34ba42ee98d93cfbe02e1d821a6a2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027isMoveDragging\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"572ccdf54e2a45cad2c4df06a90556d1812d62f2c79d6169effb846b1352cb81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027moveDragState\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bca57003c4120b8fc468f10f2d8dbdb5372ccb92a7736759c3da50e8d9c5e5"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027imagePlacementMode\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb5855a6cfc7bdc1f0917d69b7a4f4ca0ef448278c392047d1bdffd260fd027"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027imagePlacementData\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8337799ac7d2ac3093412b93e33f0f3f4468768d7ef663efc1f4445aa8fb6890"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027imagePlacementOverlay\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7d1be244410a61d5a70449d2baeda2c2d04afef6c7c003fbe156f68e4ed613"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027textboxPlacementMode\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"95da85bda076459bdc165012d6ea3ebd4abe43c7d51acf9705a43e9164312b3e"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027connectorDrawingMode\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8610d5af0412e246be971fdae1904a8906149293baf476a5472b0e19f94a5542"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027connectorType\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af5e31628f7a64b89ff94085af444c0916e40cd6266bfa158762365e48b196"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027connectorStartRef\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d564d65e717d40e82cfcdd319b18b96d383f424c105dbb164a1ce1964ea60221"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027connectorOverlay\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d77a3d8f63e832d6258ecb79cff21a6f3d82545c1f3bffa1bc3a4035a81a41"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027polygonDrawingMode\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"12417a0e913ca0a823b730e4d813ffb62f704d7bc561dd09596cb4c34d8eb0ed"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027polygonMousePos\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bc4dcb3326fc5221ebf5c0a8cc8a6d77c11ebdfabbbb213f355dd55c8977c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027isPictureResizeDragging\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ab590eb72895ba687cf7ecb3d58e058eff6711664b3ee2858a906328084dac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027isPictureRotateDragging\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1c876dde20234e3adb6e9d7a57358f1ab4ee57969c79ded7e443608ef0bc3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027isLineEndpointDragging\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b02c4b4cbdf626868658e3064d803b9ea7dec30d3c8f2773adc8ab772f0ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027lineEndpointState\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5749aef0591785092fd4d3809601372fe7840f9c3e0d61731105305933de0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_compositionOutsideField\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c335c95039a2d486708888f83bda14e2c9b7e1c68ccbdf74cd79271db24f3a"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosComposing\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d596f9b64489e754eb1b33056e7df696077192831f8f2ded98032df0eba4cf5"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosAnchor\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7efc4731e289713af4316425d995a1010bd6320300d249ec262b59050cbb941"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosBeforePageIndex\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f68e33fab704ad706b9c91364dc9be995bba6e8e11b39cbac9f9976fc96a13"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosLength\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e1824ca1d5a96ff41fba1a2b4324395708183f1562fa05954c245a93f59fb7"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosPrevText\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fb177c9f719a052c368989da7b17c756eb523933a9622b9898ec02f50df300"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_iosRequiresFullRefresh\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62d4c8c6d010f3946514ccde784ef3d4233093f2f0c6c4a7b5498a0ae78242"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027applyHighlightPenToSelection\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"54967ad28828eca09d5328ffb43fc7a654af1481bcdbc071910f9754535ba711"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027polygonAddPoint\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"44784003a3f5fa56cb58a57514185571c077d467044176182ae868391dcb1ef9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027finishPolygonDrawing\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad72a29ace3847358d00afbf16d31916f0a59bdae4aa7e750b64aa5b3cb0154"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027showTextboxPlacementOverlay\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c3d345c0e68e20fb263048450464c6565a0927cff083c70ff6c2164e958a5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027finishTextboxPlacement\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b2358ae665efdbca70e545665ff74b0ca5c6ec07ff7accf2b729e49b113fa5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027startTextSelectionDrag\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c78e4f1f9f520476b81791aa5f52c27efed2bc94ae07f23e9a156d478194d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027updateTextSelectionDragPointer\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6490b587e8fe4b271946f0905c52582aaa372d3a190af3760b4eb32f36ae241a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027stopTextSelectionDrag\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6436588ae571ac71c7b54dcf33755f7db14030054e50389246f2fc1c74306a72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027isNestedTableBorderClick\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8be2af6402e8648936f870d7d44940ae0286fce03b4808c5fecdd3f9c41152"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027findTableByOuterClick\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c977f608e3fad8f5a75c1ec4435c9e6aa9b9139eab5eb5f85bd23960d5ecd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027getTableObjectContextMenuItems\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e105e1122b8d370d597dff02d039eeac0f1f8a84c7668171593d97ab1876b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027getPictureObjectContextMenuItems\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbc96bb4f5d4585810f526198ff13089d7f599cfe2a49a8bb99d99ca631985b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027getTableContextMenuItems\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b818718bbc59a44f6541025363bb7425b529515a895dfae8e416390c5900768d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027getDefaultContextMenuItems\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51241fe04adce6f91bfcc07530902bab077037620bf06844445519e142b56f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027beginHeaderFooterSelectionComposition\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d4962dfef1ec3b4a25a4a480ce8c20c1c1f62a59a8fe4666b9334fac80fc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027finishHeaderFooterSelectionComposition\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"950b6e83d11e46ae915492c5adbe0e1804b415869ffe964b43b1fecd71a9a069"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027consumeRawTextMutationBeforeCursor\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d776264b5bc4eb3351c1128e9350bbb6457d2841624837b67e4da35b73238b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027afterTextInputEdit\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":3749}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e02711950f5851ef3e0780457e078588169c42d5ea9c4f0061932156f996ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027updateCaretNoScroll\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4025}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ab0f3f9473e404354800a8349a20aa08e02e6089e3ba1e119868d1bafee7c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027enterTextboxEditing\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":5000}}}],"partialFingerprints":{"codehealthFindingId/v1":"1543a2ef089a3a260e546b5aa9f8244eaa4e5d5bbdd377bf50c809a7586f7be5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027hwp16ToMm\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e537e038a3847a80e5c5db68b6751ee8a99e7289d635c215d06f60a589d7c635"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mmToHwp16\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/cell-border-bg-dialog.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a55e104346caac483cea98cbb19dd512147b4188963b481963e99633b240550"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027fillImageCheck\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/picture-props-dialog.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b538e2e169067439f1a3a6d6708d4988e94b843a6bcaa65145818bf37c657f54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027LS_TYPE_LABELS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/style-dialog.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"247b6f24ad041c893f5ce7fac778ebbb337d3e11c9e52260078f9d107f3b414c"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027charfxIcon\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/toolbar.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13e4fb50e4a66d2dac50c4168d1c3b6d5f1a770c452e7428133f92c65d7a722"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027glyphRunVariantReplayable\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3b5e817716fcc6c905645cd3ca9662666a2303ad4646444e858998f613f31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isReviewReferencePath\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf38cf6b00a42833f726ce7eac71ca453f24f47828e237983b775fe3bc5ed309"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isReviewReferencePath\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-impact-policy.cjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d5f45f833f9eafb85fcd9b71f6415ee75abe09780862cc6ce5b204ee8ed9a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc12053838f8d3eeec6bae18b85acdb4b20f568c734f32951995edf89c29f9a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027parseMetricEntries\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_rule_ledger.mjs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfbdcdedc28a32dae53842c1b6e63d7b0d64090fb68504f00966ca22438ca9"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ajv\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/frontend-dependency-compat.test.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc956eb2a2252e8262ffae2f116a18fb727b98abcaab6336911115022cc2c3c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027brace-expansion\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/frontend-dependency-compat.test.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"387ab2bf84a1e3143706c66380bd472d394a5a78d1f885494840da8b695f9f07"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027pixelmatch\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/working/assets/issue6042-stage5-expanded/compare-visuals.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d03e2bd2c7a85965c8eac4474c6d79c5402367c5162c4257bcb99a769ab63"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027pngjs\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/working/assets/issue6042-stage5-expanded/compare-visuals.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b09d35413d83381530b84c5310bd2bef162575a6567757d133faac642c38d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027puppeteer-core\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/pr/assets/chrisryugj_20261031/edit-wasm.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39f55d416b4602576aa50ca2fe4605eaeb0dccb967957868cbbadf6a1e877d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027puppeteer\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-firefox/e2e/download-save.test.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef2c7fb29c9fb75dc7133455826b147318ff8df9ae301296ec7bb05066cb507"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027pixelmatch\u0027 in production deps: Only test files import it (first: rhwp-studio/e2e/helpers.mjs:14) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/package.json"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0004fbfb9105fd66831563f0516417c4f13fd4b84028dc4f7a41de3ac8a1ce"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027pngjs\u0027 in production deps: Only test files import it (first: rhwp-studio/e2e/helpers.mjs:18) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/package.json"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0105640b70c5c1817dbb1be9c2f08092646ea1abde3aa281dad7dce873de35e"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.jsdelivr.net/npm/chart.js@4.4.7/dist/chart.umd.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. 21 such include(s) across the repository\u0027s markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mydocs/metrics/2026-07-04-r1/dashboard.html"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a755f2f16aa70709383c72c96fcae3e72dffd09cb8fcb7262ab1da857231cb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: vendor/npm/ajv/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/npm/ajv/package.json"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef044ef004d8d329722203da7d89a608f01c52503ea9c7ba6923344c087d8e03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(determinant) || determinant === 0\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/view/canvaskit-renderer.ts, rhwp-studio/src/view/canvaskit/raster-stroke.ts. 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":6192}}}],"partialFingerprints":{"codehealthFindingId/v1":"548ebfead5913347e1b572c2c66722d6b3c47c482ebc600b5c54a61b98b0d468"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(info.pageCount) || info.pageCount \u003C 1\u0060 appears character-identically in 3 files \u2014 mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs, scripts/export-wasm-for-sweep.mjs, scripts/export-wasm-png-for-sweep.mjs. 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":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3427c0318aaa7a0e8d7843447c9bab4afafb8dff482d13cb64ccebfc22293d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(declaredSize) || declaredSize \u003C= 0 || !Number.isSafeInteger(maxBytes) || maxBytes \u003C= 0 || declaredSize \u003E maxBytes\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/thumbnail-decompression.js, rhwp-firefox/sw/thumbnail-decompression.js, rhwp-shared/sw/thumbnail-decompression.js. 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":"rhwp-chrome/sw/thumbnail-decompression.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eca854fbc40ba4d9e8dd88bb33bf7f0d6293ad21d05a964be1142c5f6417fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!allowed.has(option) || value === undefined\u0060 appears character-identically in 6 files \u2014 scripts/font_metric_coverage_checkpoint_finalizer.mjs, scripts/font_metric_coverage_checkpoint_runner.mjs, scripts/font_metric_coverage_full_manifest.mjs, scripts/font_typesetting_risk_evidence.mjs. 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca692d04e2ffb2ad93f16244e042831d430b8f054b5a3c27105af0faeed8b8f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fi.inField || fi.fieldType !== \u0027clickhere\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-text.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7bf8aa886d321539307c35cc90e66d25793c8c47378d3ad288bd85072f9d79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!filename || typeof filename !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-safari/src/background.js, rhwp-shared/security/filename-sanitizer.js. 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":"rhwp-safari/src/background.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd72c48aafd7939b449c8977dffd66639d5c38025b0ed94154218881bc7425de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!host.includes(\u0027.\u0027) \u0026\u0026 !host.includes(\u0027:\u0027)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"96718b5a32ff0eee10299afd8f6e38cc589ee62b038d752d54c6bd32a2dc1fe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!key.startsWith(\u0027--\u0027) || !(key.slice(2) in options)\u0060 appears character-identically in 2 files \u2014 scripts/kerning_q1_baseline.mjs, scripts/kerning_q2_fixture_baseline.mjs. 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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a929cd562794487db958fb38aa6f338ce8d95dd82c9a861c458d5231132381c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name || !Number.isFinite(seconds) || seconds \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/refresh-nextest-target-duration-policy.mjs, scripts/select-nextest-archive-targets.mjs. 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":"scripts/refresh-nextest-target-duration-policy.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fadaf7a20be8ffc342e805188585f92b99a57488854d7e28699476c83f636f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!option?.startsWith(\u0027--\u0027) || value === undefined\u0060 appears character-identically in 3 files \u2014 scripts/font_rank1_runtime_boundary.mjs, scripts/font_rank7_runtime_boundary.mjs, scripts/font_rank8_trace_baseline.mjs. 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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2636dad5ceb6f49883e7f1ee60b07b141def8ed4b6d8156d106172cf0c540ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!owner || !repo || marker !== \u0027blob\u0027 || !ref || pathParts.length === 0\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/document-url-resolver.js, rhwp-firefox/sw/document-url-resolver.js, rhwp-shared/sw/document-url-resolver.js. 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":"rhwp-chrome/sw/document-url-resolver.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b5102230b56e009a38e9ba8bc1bc6f454e661ea559898904dddafd1aca8165"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!previousState || isDownloadStateExpired(previousState, now, options.stateTtlMs)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-observer-state.js, rhwp-firefox/sw/download-observer-state.js, rhwp-shared/sw/download-observer-state.js. 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":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"54794033b9ab2bb44976b244f31b9aec6ed8a4ab4cc424c74c604099948e24c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!senderUrl || !runtimeApi?.runtime?.getURL\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d019b67115e92649fdadca07f35e05dfdca191c1774a7d78b33e438c59afcd1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!state || state.generation !== generation\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/core/metafile-font-session.ts, rhwp-studio/src/core/native-pua-font-session.ts. 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483c799294baf11ea26154e8323db0f4c2d7615f94e09712baff676b201ba32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tree.type || !tree.bbox || !result.svg.includes(\u0027\u003Csvg\u0027)\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs, scripts/export-wasm-for-sweep.mjs. 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":"mydocs/pr/assets/semanticist21-20261005/pr7504/registered-font-replay.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f612cab5da02714a3e2bdf2be04b0f981187c524e2d5c0806eaf7b20a4bdb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!urlString || typeof urlString !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-safari/src/background.js, rhwp-shared/security/url-validator.js. 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":"rhwp-safari/src/background.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c976000ac433f21a5191adfcc1d7966024e04d712099e04099b339d98ebd68d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 rhwp-studio/src/core/text-v2-normalizer.ts, scripts/font_metric_coverage_checkpoint_finalizer.mjs, scripts/font_rule_registry.mjs. 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":"rhwp-studio/src/core/text-v2-normalizer.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"58964a0f3ad76802c0382d06ce5aa5ffc6faec11c5f4598c4ff199b69d220d99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(codePoint \u003E= 0x1100 \u0026\u0026 codePoint \u003C= 0x11ff) || (codePoint \u003E= 0xa960 \u0026\u0026 codePoint \u003C= 0xa97f) || (codePoint \u003E= 0xd7b0 \u0026\u0026 codePoint \u003C= 0xd7ff)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/view/canvaskit-renderer.ts, rhwp-studio/src/view/canvaskit/nominal-text-replay.ts. 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":"rhwp-studio/src/view/canvaskit-renderer.ts"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7247dd515e08a74ceaec874d19d3a95c9c581600474ad0d0e929f999338801d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(inCell || inTextBox) \u0026\u0026 hit.parentParaIndex !== undefined\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"200ef572b4a928966e018654a89ca1a78aafe24a70385f3bb6248a6858c0497b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(nearLeft \u0026\u0026 inVertRange) || (nearRight \u0026\u0026 inVertRange) || (nearTop \u0026\u0026 inHorzRange) || (nearBottom \u0026\u0026 inHorzRange)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler.ts, rhwp-studio/src/engine/table-border-hit.ts. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ec771009fb0c7911383f3f893dc487484f301e623fcfb940943ab93f217fce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(result as any).error || \u0027\uC0BD\uC785 \uC704\uCE58 \uB610\uB294 \uC774\uBBF8\uC9C0 \uC815\uBCF4\uB97C \uD655\uC778\uD560 \uC218 \uC5C6\uC2B5\uB2C8\uB2E4.\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5454e871fc721760012f3be2deae554ac0998161ec549d245cf2a28c5537ce0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(byte) \u0026\u0026 byte \u003E= 0 \u0026\u0026 byte \u003C= 255\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/core/layer-resource-store.ts, rhwp-studio/src/view/canvaskit-renderer.ts. 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":"rhwp-studio/src/core/layer-resource-store.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"523f91d94e3f492eaebd9b899ad05ed982446cbbd88114b37dfdcafcda5e61e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 2 files \u2014 scripts/oracle_profile_contract.mjs, scripts/verify-trusted-postmerge-ci-reuse.mjs. 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":"scripts/oracle_profile_contract.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04b991d15cbae84d8b02af2121b210669200113c8c7049b5903355d598682d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 6 files \u2014 scripts/font_metric_coverage_checkpoint_finalizer.mjs, scripts/font_metric_coverage_checkpoint_runner.mjs, scripts/font_metric_coverage_contract.mjs, scripts/font_metric_coverage_full_manifest.mjs. 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7287df66980be67c907e229ea05a2ceb9562a7f7f3198d7896eca909dcb456"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a === 0 || a === 10 || a === 127 || (a === 100 \u0026\u0026 b \u003E= 64 \u0026\u0026 b \u003C= 127) || (a === 169 \u0026\u0026 b === 254) || (a === 172 \u0026\u0026 b \u003E= 16 \u0026\u0026 b \u003C= 31) || (\u2026\u0060 appears character-identically in 4 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js, rhwp-safari/src/background.js, rhwp-shared/security/url-validator.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b0a6245341cd9b131a09ad2942e92051e171e2a7d8853d0accba38bd3874fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activeCard === card \u0026\u0026 activeAnchor === anchor\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js, rhwp-safari/src/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb678818256e111a31b5f17ac14a211fd6c127a142d1bf44df89a7e03a9b480"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arguments_[0] === \u0027--print\u0027 || arguments_[0] === \u0027--cargo-test\u0027\u0060 appears character-identically in 2 files \u2014 scripts/run-adapter-diff.mjs, scripts/run-prop-roundtrip.mjs. 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":"scripts/run-adapter-diff.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d39c13c6df9a33b52225f1642531b097ed037dbb00834367ae717bf888fbbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compSize !== uncompSize || uncompSize \u003E data.length - dataStart\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffed1779f7bbd503f98c160c3ab6109f2b743f0e031837acf89a5620ad3c6fbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctrl.secIdx === undefined || ctrl.paraIdx === undefined || ctrl.controlIdx === undefined\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-connector.ts, rhwp-studio/src/engine/input-handler-picture.ts. 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":"rhwp-studio/src/engine/input-handler-connector.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6490bf9df415a0998254b00e2a7cd4dea0c1dbf2ce72a098b9fc9b3025dacc30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.length \u003E= 2 \u0026\u0026 data[0] === 0x42 \u0026\u0026 data[1] === 0x4D\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ccdbc484bd7531b3f0bb11600594d5ab37321e34e24c186c3d7ff19f285982"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.length \u003E= 3 \u0026\u0026 data[0] === 0x47 \u0026\u0026 data[1] === 0x49 \u0026\u0026 data[2] === 0x46\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a97615511a483c7e92f3a7bf457168c2bd3c2bbb848fecb6dea83a90ef06718"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.length \u003E= 4 \u0026\u0026 data[0] === 0x50 \u0026\u0026 data[1] === 0x4B\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js, rhwp-safari/src/background.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"517059a7b4ec839b91f3b4913d4fb527a679e61feb9bb42aa7314d17e22598d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.length \u003E= 8 \u0026\u0026 data[0] === 0x89 \u0026\u0026 data[1] === 0x50 \u0026\u0026 data[2] === 0x4E \u0026\u0026 data[3] === 0x47\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d53ea97e64f4cedbcf2ace064a8078269f348c1b54a6396859390f8f62ec853"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dataStart \u003E data.length || compSize \u003E data.length - dataStart\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb9e96c9fda0570bcfc3bed2472a6d5fb1724144bcfc7a007a6b912ae0c4fc9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[0] !== 0xD0 || data[1] !== 0xCF || data[2] !== 0x11 || data[3] !== 0xE0\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeb08115aaa06493140d64b55149cf0de47ef61f7568054a135b9305b47c318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[i] === 0x50 \u0026\u0026 data[i\u002B1] === 0x4B \u0026\u0026 data[i\u002B2] === 0x05 \u0026\u0026 data[i\u002B3] === 0x06\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js, rhwp-safari/src/background.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2da2f9f22d153b602fb3e7dcfede07c0a71b6bd11282f23f830c08165e3df8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[offset] !== 0x50 || data[offset\u002B1] !== 0x4B || data[offset\u002B2] !== 0x01 || data[offset\u002B3] !== 0x02\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863b4845530717026fd5bff4d993fdad2866e83754322985fbe3e08cbc41c47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delta.filename?.current || isTerminalDelta(delta)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/download-interceptor.js, rhwp-firefox/sw/download-interceptor.js. 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":"rhwp-chrome/sw/download-interceptor.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f0f927958936532c179d8bd483ab672bb0fdd8bfd5b3254f667b1c554d2b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delta?.filename?.current || delta?.finalUrl?.current || delta?.state?.current === \u0027complete\u0027\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-observer-state.js, rhwp-firefox/sw/download-observer-state.js, rhwp-shared/sw/download-observer-state.js. 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":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7de8e0ba2f45c7c7394d8cedc3163fa97d4a1340253eb3f4360834175f9649"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delta?.state?.current === \u0027complete\u0027 || delta?.state?.current === \u0027interrupted\u0027 || Boolean(delta?.error)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-observer-state.js, rhwp-firefox/sw/download-observer-state.js, rhwp-shared/sw/download-observer-state.js. 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":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"af599a847e367ea6d94687270250c86cfcb582a18db0a2fe1d06d317691ec39d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.documentElement.getAttribute(\u0027data-hwp-extension-version\u0027) || \u0027unknown\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/dev-tools-inject.js, rhwp-firefox/dev-tools-inject.js. 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ec8da8422ec27ce1603c03d367a049c6e59469ca7f797b5b49fc0a0a9881ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.head || document.documentElement\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f9a9f2773b1b7a374a18544ebe8f0f34334ade79c13147ffb160ddf0940c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060effects.documentPaginationPending || effects.flowChanged || effects.paginationCompleted\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/command.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/command.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c74eef618f756511dd33f002e6d3c32bcf18835e783bc1b42bfe5af6eed82d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element === mainCanvas || (element instanceof HTMLElement \u0026\u0026 element.dataset.rhwpOverlayPage === page)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/view/canvas-view.ts, rhwp-studio/src/view/page-renderer.ts. 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f04c24ede89af6b2508f4e52b570b12ec7af94419c210d696d7c2a368bcc0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.exitCode !== 0 \u0026\u0026 entry.exitCode !== 3\u0060 appears character-identically in 2 files \u2014 rhwp-desk/ui/js/batch.js, rhwp-desk/ui/js/main.js. 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":"rhwp-desk/ui/js/batch.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba88d5c7cf5a1b703104c0ec7a5ddda1eda1827080dbe45af51f2defd747769"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() \u0026\u0026 entry.name.endsWith(\u0027.rs\u0027)\u0060 appears character-identically in 2 files \u2014 scripts/rust-test-suite-manifest.mjs, scripts/rust-unit-test-tiers.mjs. 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":"scripts/rust-test-suite-manifest.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"763f892e5d30fa3929988ae21dbb90b5e2e4ea29c57bd5ecc691cf5f1bfde9ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.name === resolvedName \u0026\u0026 entry.bold === bold \u0026\u0026 entry.italic === false\u0060 appears character-identically in 2 files \u2014 scripts/font_metric_lineage.mjs, scripts/font_rule_ledger.mjs. 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7d06e45de5189ef8204326942083b3612cc87849f908ff478a8c6518c30efa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.name === resolvedName \u0026\u0026 entry.bold === bold \u0026\u0026 entry.italic === italic\u0060 appears character-identically in 2 files \u2014 scripts/font_metric_lineage.mjs, scripts/font_rule_ledger.mjs. 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f790bc4b256c6ef13940dcea80cebdb5ed2f5e3d5adceb2d727c163ac15c81ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envelope?.tool !== \u0027rhwp-q-text-layout\u0027 || !Array.isArray(envelope.runs)\u0060 appears character-identically in 2 files \u2014 scripts/font_rank7_runtime_boundary.mjs, scripts/font_rank8_trace_baseline.mjs. 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":"scripts/font_rank7_runtime_boundary.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d53108c87c579fe0144e7ef8a72edf84ec9d1f7b25d3a4744717c9c689384b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof DOMException \u0026\u0026 error.name === \u0027AbortError\u0027\u0060 appears character-identically in 3 files \u2014 rhwp-studio/src/ai/provider/claude.ts, rhwp-studio/src/ai/provider/http.ts, rhwp-studio/src/command/file-system-access.ts. 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":"rhwp-studio/src/ai/provider/claude.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"056701a1ea6c540b7588f7a0d1c742eb3ed2711483eaa734d29ca5f21a8b4108"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060exact !== undefined || boldOnly !== undefined\u0060 appears character-identically in 2 files \u2014 scripts/font_metric_lineage.mjs, scripts/font_rule_ledger.mjs. 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":"scripts/font_metric_lineage.mjs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"899c60dc0cd1e2cd6268a6623a2738f7fd8b49d954a6532497edb2070648bf82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing?.allowDownloadUrl || item.allowDownloadUrl\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1202d4158c83f23892ebcc3eddfe2a2c56ae8f86881fdb802023f5ea44ec72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fatSect === 0xFFFFFFFE || fatSect === 0xFFFFFFFF\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6863cf1ed3369dfc274b63c64992588fcc44e74ea757344e27480fa73add57bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fi.inField \u0026\u0026 fi.fieldType === \u0027clickhere\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-text.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107db888e0daa54fe7e28852d3062c6ff1c18e98ea0bcdcf13aaa13a9e1c744"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fi.inField \u0026\u0026 fi.startCharIdx !== undefined \u0026\u0026 fi.endCharIdx !== undefined\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-keyboard.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ec1cc4b792192a2ed43a396571db68806a9bb306b9c60d420578c6275129c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.name.split(\u0027.\u0027).pop()?.toLowerCase() || \u0027png\u0027\u0060 appears character-identically in 3 files \u2014 rhwp-studio/src/command/commands/insert.ts, rhwp-studio/src/engine/input-handler-picture.ts, rhwp-studio/src/main.ts. 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001cd8b0e13ea8a93fb7defb160e80ba85e03d6a33a53ee8dcb9a7d908e5f99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file?.previous_filename || file?.previousPath || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 scripts/ci-impact-classifier.cjs, scripts/ci-impact-policy.cjs. 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8d353706c59aa64c7dc413acdc7c0488109455f687922fe2696082ac2083a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file?.status || file?.changeType || \u0027modified\u0027\u0060 appears character-identically in 2 files \u2014 scripts/ci-impact-classifier.cjs, scripts/ci-impact-policy.cjs. 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7bd3160f0afabc962eab1b970452d6fd8105c574b5365ae500d66ac553dfb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filename.startsWith(\u0027samples/\u0027) \u0026\u0026 ( filename.endsWith(\u0027.pdf\u0027) || filename.endsWith(\u0027.png\u0027) )\u0060 appears character-identically in 2 files \u2014 scripts/ci-impact-classifier.cjs, scripts/ci-impact-policy.cjs. 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b565c5115b854a33d4f701eac2d962c72345e9702bcb14c243c43d8ea615445"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060finalUrl !== url \u0026\u0026 HWP_EXTENSION_RE.test(finalUrl)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-interceptor-common.js, rhwp-firefox/sw/download-interceptor-common.js, rhwp-shared/sw/download-interceptor-common.js. 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a15acf348c546a04830acf40fb2bd0d38fea850c6eae2ef7dee5238b1a6f7cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(outputPath) \u0026\u0026 fs.lstatSync(outputPath).isSymbolicLink()\u0060 appears character-identically in 3 files \u2014 scripts/font_rank1_runtime_boundary.mjs, scripts/font_rank7_runtime_boundary.mjs, scripts/font_rank8_trace_baseline.mjs. 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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2022f1068f1334a8918b6ec5f4e2f6287f766adc824728595497db96284d78e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host === \u0027localhost\u0027 || host === \u00270\u0027 || host === \u00270.0.0.0\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fa6080d33525ed7ffecf77d063261adcee45c66abb3fa8c930f659785fed11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C cdEntries \u0026\u0026 offset \u002B 46 \u003C data.length\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d6f37e65a360b3263aa47b63af244ef19a7d7715d169f2d153433388e92031"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060img.naturalWidth \u003C= 0 || img.naturalHeight \u003C= 0\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/command/commands/insert.ts, rhwp-studio/src/engine/input-handler-picture.ts. 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7872b0b7e042c62579f670a736d66a9d8a5c16530c03e48136c54bc5c0fd4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index === -1 || index === args.length - 1\u0060 appears character-identically in 5 files \u2014 scripts/font_metric_coverage_contract.mjs, scripts/font_rule_candidates.mjs, scripts/font_rule_ledger.mjs, scripts/font_rule_ledger_evidence.mjs. 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":"scripts/font_metric_coverage_contract.mjs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fceea3c208067547d9c27b25fbfc0af93bd8010350256dc6d2f9fbea270bd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.attrs[\u0027data-hwp-date\u0027] \u0026\u0026 isNaN(Date.parse(info.attrs[\u0027data-hwp-date\u0027]))\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/dev-tools-inject.js, rhwp-firefox/dev-tools-inject.js. 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"519a94aab47eb42605bd1785b682b254b2557f19897ffe34b5391aff65c717bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.attrs[\u0027data-hwp-pages\u0027] \u0026\u0026 isNaN(Number(info.attrs[\u0027data-hwp-pages\u0027]))\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/dev-tools-inject.js, rhwp-firefox/dev-tools-inject.js. 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9fd98255057420b988d896b7f06e49204d14368098ac05a1257676fc1deafc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.attrs[\u0027data-hwp-size\u0027] \u0026\u0026 isNaN(Number(info.attrs[\u0027data-hwp-size\u0027]))\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/dev-tools-inject.js, rhwp-firefox/dev-tools-inject.js. 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":"rhwp-chrome/dev-tools-inject.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b833ae040fa8ac3b95a7bf95de1b2ccacbc1dbe4dff8314560560377d516eec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060info.menuItemId === MENU_ID \u0026\u0026 info.linkUrl\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/context-menus.js, rhwp-firefox/sw/context-menus.js. 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":"rhwp-chrome/sw/context-menus.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5cc64a35dfed92b1ceba9840f7b4a888c871a968c8391e941c260f8640f2b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isSampleReviewReferencePath(filename) || isPdfReviewReferencePath(filename)\u0060 appears character-identically in 2 files \u2014 scripts/ci-impact-classifier.cjs, scripts/ci-impact-policy.cjs. 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":"scripts/ci-impact-classifier.cjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ae0855059445accdc3947876b6c6db557d102ed9323a09cf0267f1f0dd8c3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.filename || localHwpFileUrlFilename(item.url)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/download-interceptor.js, rhwp-firefox/sw/download-interceptor.js. 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":"rhwp-chrome/sw/download-interceptor.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5f1ffd09eb265d415faaa904ebb6f06af2c7b17e3d4edbb632ed7d2d86effd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.kind === \u0027text\u0027 || item.severity !== \u0027modified\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/ui/compare-dialog.ts, rhwp-studio/src/ui/history-dialog.ts. 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd814980300131204cab58c531b9156467bfa2c2b4ec29f104f4ede0da5975d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.state === \u0027complete\u0027 \u0026\u0026 startMs === null \u0026\u0026 endMs === null\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-observer-state.js, rhwp-firefox/sw/download-observer-state.js, rhwp-shared/sw/download-observer-state.js. 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":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"335dd8a55c52e187b8b0207d9661c6cbb297b16a3c9e2a7fe63cc873ce58babe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k === \u0027txt\u0027 || k === \u0027sig\u0027 || k === \u0027csha\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/ui/compare-dialog.ts, rhwp-studio/src/ui/history-dialog.ts. 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":"rhwp-studio/src/ui/compare-dialog.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8de8abe6b3c5dcc25299478c4392ddda80c1f34e33d66b26a6cfbfca94c215"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key === \u0027ArrowLeft\u0027 || key === \u0027ArrowRight\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/table-resize-updates.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc095d2f91cd604eeb08b3990919071dbd4f686a34af0578cdaa7c01c15a5b67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key === \u0027ArrowRight\u0027 || key === \u0027ArrowDown\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/table-resize-updates.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836297d2dec198e51ab7813e28fee22a0fffb27fd37f40cb6f263b6372dce30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.startsWith(\u0027border\u0027) || [\u0027fillType\u0027, \u0027fillColor\u0027, \u0027patternColor\u0027, \u0027patternType\u0027].includes(key)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/ui/char-shape-dialog.ts, rhwp-studio/src/ui/para-shape-dialog.ts. 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":"rhwp-studio/src/ui/char-shape-dialog.ts"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"737b54bbb4d0d810d7e63d80ce7b8e8bfa03c3425de35d87f3e5e2bc761615ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker \u003E= 0xc0 \u0026\u0026 marker \u003C= 0xcf \u0026\u0026 marker !== 0xc4 \u0026\u0026 marker !== 0xc8 \u0026\u0026 marker !== 0xcc\u0060 appears character-identically in 2 files \u2014 npm/hwpctrl-ocx/src/index.mjs, rhwp-studio/src/engine/office-clipboard-images.ts. 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":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3759}}}],"partialFingerprints":{"codehealthFindingId/v1":"521bebc4724ea8189bd0300169fca918827c9d614b885dad87160fa4483a802a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060new URL(url).pathname.split(\u0027/\u0027).pop() || \u0027\u0027\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-interceptor-common.js, rhwp-firefox/sw/download-interceptor-common.js, rhwp-shared/sw/download-interceptor-common.js. 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9990d0470256102f64bb70e0561faf2781e1e55f3f42c6f99deba38297222a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.kind === \u0027clipRect\u0027 || node.kind === \u0027clipPath\u0027\u0060 appears character-identically in 4 files \u2014 rhwp-studio/src/core/host-font-requests.ts, rhwp-studio/src/core/text-v2-normalizer.ts, rhwp-studio/src/engine/input-handler.ts, rhwp-studio/src/view/canvaskit-renderer.ts. 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":"rhwp-studio/src/core/host-font-requests.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9983bc397daaf16ee624d69c5c07121fc283886d0400bdf22a27e9f55524781"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060operation.type === \u0027augment-evidence\u0027 || operation.type === \u0027retire-rule\u0027\u0060 appears character-identically in 2 files \u2014 scripts/font_rule_mutation_rehearsal.mjs, scripts/font_rule_registry_v2.mjs. 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":"scripts/font_rule_mutation_rehearsal.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"293c2c5f58b34bcde4018132f7b44ec8f620611b4e74236e2eea07055c94f7d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageX \u003C b.x - tolerance || pageX \u003E b.x \u002B b.w \u002B tolerance\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/table-resize-renderer.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f110a0741c1dc22e9219b86ccac8307eb73a2faa541ea51b6ef088eddb5d0883"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageX \u003E= bbox.x - tolerance \u0026\u0026 pageX \u003C= bbox.x \u002B bbox.width \u002B tolerance\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler.ts, rhwp-studio/src/engine/table-border-hit.ts. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d6f8c5dd385b214047de102631a3d9b5db46701de59202849f4653f158a4d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageY \u003C b.y - tolerance || pageY \u003E b.y \u002B b.h \u002B tolerance\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-table.ts, rhwp-studio/src/engine/table-resize-renderer.ts. 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":"rhwp-studio/src/engine/input-handler-table.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71ce9ebb82b83e8f37cfdc7a211ad071961bc6e487cf9ca80e8e98c5db24378"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageY \u003E= bbox.y - tolerance \u0026\u0026 pageY \u003C= bbox.y \u002B bbox.height \u002B tolerance\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler.ts, rhwp-studio/src/engine/table-border-hit.ts. 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":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"07acbf0fa301e10cbd5a3fc17db5caf2bc61376021d51b8ff022887d6ab71153"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseInt(this.fontSizeInput.value, 10) || 10\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/ui/equation-editor-dialog.ts, rhwp-studio/src/ui/equation-props-dialog.ts. 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":"rhwp-studio/src/ui/equation-editor-dialog.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9d7f5c5275e01f97b4cc6106c7e0b01212e68d538877c9d0e0a8d808091bc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.pathname === normalized || parsed.pathname.endsWith(normalized)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51faf7db05f2db9db34affa7fd65c691e9eded8a4db88cd542946651c3f0eee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027https:\u0027 \u0026\u0026 !(allowHttp \u0026\u0026 parsed.protocol === \u0027http:\u0027)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdca751685b1f9ca183c0e23883a55c739178f659316e4cbff3e3233d3c1ee4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027https:\u0027 \u0026\u0026 parsed.protocol !== \u0027http:\u0027\u0060 appears character-identically in 5 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js, rhwp-safari/src/background.js, rhwp-safari/src/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f583e2fd2d8cab6885c97bb575c93f90cdfee46de90a291679a94768cc36977"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol === \u0027https:\u0027 || parsed.protocol === \u0027http:\u0027\u0060 appears character-identically in 5 files \u2014 rhwp-chrome/content-script.js, rhwp-chrome/sw/fetch-security.js, rhwp-firefox/content-script.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f413a7a33c5d43354f0a9859e86c3b9fdd33f3a067345b1c07720e879f33fda3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pathParts.length \u003E 0 \u0026\u0026 hasDocumentPath(pathParts.join(\u0027/\u0027))\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js, rhwp-safari/src/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e11db908907ee57e4cb9f220f66b3782e7540fd638b7a4fa62b0e42a2f3e0e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pathname.includes(\u0027?\u0027) || pathname.includes(\u0027#\u0027)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/document-url-resolver.js, rhwp-firefox/sw/document-url-resolver.js, rhwp-shared/sw/document-url-resolver.js. 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":"rhwp-chrome/sw/document-url-resolver.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf74012459d2c978275ec1cc0812becfc98a7690fc02bb68761d03f428f189f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pkgHash===publicHash \u0026\u0026 served.includes(pkgHash)\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs, mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs. 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"375aeb8c99da477c15323e136f22473350e6aec6cf951e76c27078160637c97f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos.parentParaIndex !== undefined \u0026\u0026 pos.controlIndex !== undefined\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/plugin/host.ts, rhwp-studio/src/plugin/selection-text.ts. 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":"rhwp-studio/src/plugin/host.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"da80c446776ebea50170b9a96a5fe49de36dc1856afa96df46ad3de88570423f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos.parentParaIndex === undefined || pos.controlIndex === undefined || pos.cellIndex === undefined\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/command/commands/format.ts, rhwp-studio/src/command/commands/table.ts. 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":"rhwp-studio/src/command/commands/format.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fa19598684583387baafe1b88dd2fcff4e16c20d482a646dd2ca50c2f0beaf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefetchActive \u003C PREFETCH_CONCURRENCY \u0026\u0026 prefetchQueue.length \u003E 0\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b73652afa4f55526d8b51725e25d7bfa9a7fbbd7264d3f96fe44b646ef3fc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.argv[1] \u0026\u0026 path.resolve(process.argv[1]) === SCRIPT_PATH\u0060 appears character-identically in 15 files \u2014 scripts/font_metric_coverage_checkpoint_finalizer.mjs, scripts/font_metric_coverage_checkpoint_runner.mjs, scripts/font_metric_coverage_full_manifest.mjs, scripts/font_metric_coverage_pilot_selector.mjs. 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":"scripts/font_metric_coverage_checkpoint_finalizer.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32900bc7dde5f8901180420968c4e156b67d6258324b453bc87f0a094a858b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060projection.id === \u0027canvaskit-sfnt\u0027 \u0026\u0026 rule.conditions?.profile === \u0027canvaskit-sfnt\u0027\u0060 appears character-identically in 2 files \u2014 scripts/font_rule_registry.mjs, scripts/font_rule_registry_v2.mjs. 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":"scripts/font_rule_registry.mjs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87d0b5bc1b00bf8f35f6900d9b827979178515557b76088164d98a078514810"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.status()===200 \u0026\u0026 new URL(r.url()).pathname.endsWith(\u0027rhwp_bg.wasm\u0027)\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs, mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs. 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"41230e7e5d94a76c68cb68851a91253fd0f9da7cb83c6256e8b1abd87ac6ff43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.startsWith(\u0027\u0022\u0027) \u0026\u0026 raw.endsWith(\u0027\u0022\u0027)\u0060 appears character-identically in 4 files \u2014 rhwp-studio/src/compare/diff-engine.ts, rhwp-studio/src/ui/compare-dialog.ts, rhwp-studio/src/ui/compare-result-window.ts, rhwp-studio/src/ui/history-dialog.ts. 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":"rhwp-studio/src/compare/diff-engine.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cd43a18c62c7e159c0a5bc19605e9fd980a95be37bcc7052e98491bc39c5f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.type === \u0027shape\u0027 || ref.type === \u0027line\u0027 || ref.type === \u0027group\u0027 || ref.type === \u0027ole\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/command/commands/insert.ts, rhwp-studio/src/engine/input-handler-picture.ts. 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":"rhwp-studio/src/command/commands/insert.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdc47b57bc93fe03935b4dc5bb9f6b501c88e0448aa99b93d5203e9bf08294c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requireDocumentPath \u0026\u0026 !isDocumentPath(parsed.pathname)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef98868474e43cfbaac4009591127d98308c7e37b7e476ad5b37ef4e3ae27a23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060safety \u003C 10000 \u0026\u0026 bytesRead \u003C streamSize\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"016f56c7d35609a1d771a125d331de764b782467c1e1f733bf0a752162e27069"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature === 0x00010000 || signature === 0x74727565\u0060 appears character-identically in 3 files \u2014 rhwp-studio/src/core/declared-font-environment.ts, rhwp-studio/src/core/local-fonts.ts, scripts/visual-sweep-font-environment.mjs. 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":"rhwp-studio/src/core/declared-font-environment.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f987605346feeaee289026e698379d9aff0fff2628049b30daa85cde660d8a4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spacer\u0026\u0026table\u0026\u0026bottom(spacer)\u003C=table.bbox.y\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs, mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs. 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59d6dc4f8a53eb00fccbc20d300ac1eace33a7f4efd6956ef85f6741be47293"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state \u0026\u0026 !state.handledAt \u0026\u0026 shouldRecheckDownload(delta)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/download-interceptor.js, rhwp-firefox/sw/download-interceptor.js. 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":"rhwp-chrome/sw/download-interceptor.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca95f3047403b640d0376ea666c8c0580a70879dd0bb7a42e1cb823c425dd256"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state \u0026\u0026 isDownloadStateExpired(state, now, DEFAULT_STATE_TTL_MS)\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/download-interceptor.js, rhwp-firefox/sw/download-interceptor.js. 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":"rhwp-chrome/sw/download-interceptor.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a51f76e2b122caa8ccb8d94af18c2d6e1058ee21e0ee893f3e87c11e192558e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === 301 || status === 302 || status === 303 || status === 307 || status === 308\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/fetch-security.js, rhwp-firefox/sw/fetch-security.js. 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":"rhwp-chrome/sw/fetch-security.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"826f8cf13c151920c96177cf6162ae9b3937a31eb3730fd6039c4bf3600558ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060streamSize \u003C miniStreamCutoff \u0026\u0026 miniStreamData\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b886be87b6a4ab475a30fef08f065d8804cabf64a1ed20667676ca9836167e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060streamSize === 0 || streamSize \u003E maxBytes\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js, rhwp-safari/src/background.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1e9f900576ba4b5a0476c43b3f83db4fe80f2373cfebdd1b6883b7a7396642"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target !== null \u0026\u0026 matchChartRef(this.wasm.listCharts(), target) !== null\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-mouse.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-mouse.ts"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9b4430a2c30bada811448bffb34e7087c1e84d4e069c69f19f058e5a8e4d5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.cursor.isInHeaderFooter() \u0026\u0026 this.getNonEmptyHeaderFooterSelection()\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-keyboard.ts, rhwp-studio/src/engine/input-handler-text.ts. 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"90618007a072098bfc0391567dc0766cf6b23c7a5bd6973d5557877269b035b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.cursor.isInHeaderFooter() || this.cursor.isInFootnote()\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-text.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a88569c5499160254c6f9224afe840df7d1e4f29eb79c100512c5d8955d795e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.el \u0026\u0026 !this.el.contains(e.target as Node)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/ui/context-menu.ts, rhwp-studio/src/ui/local-context-menu.ts. 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":"rhwp-studio/src/ui/context-menu.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e829d2bfb249165c602926a5b04f92e209c53dd27f319861f23134fd28eebb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.wasm.exportControlHtml(ref.sec, ref.ppi, ref.ci, cellPathJson) || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/engine/input-handler-keyboard.ts, rhwp-studio/src/engine/input-handler.ts. 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":"rhwp-studio/src/engine/input-handler-keyboard.ts"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e10f0f08cfd975d5b316d61ec0ac604d9ef1d955e2c628bf0e5549a038c47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060title || anchor.href.split(\u0027/\u0027).pop().split(\u0027?\u0027)[0]\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a861e33fc0e1fba1b68a58028aad74d0262512ba15d9d5c1a6aff83572f3a60a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060title\u0026\u0026spacer\u0026\u0026bottom(title)\u003C=spacer.bbox.y\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs, mydocs/pr/assets/pr7518_p39_wrapper_flow_20261005/capture-cdp.mjs. 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":"mydocs/pr/assets/pr7518_p22_spacing_20261004/capture-cdp.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a05a38c0fe844afff7cd97e7d4ba586f11ff72b24a620d3cb156ad04bea148"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof anchor.matches === \u0027function\u0027 \u0026\u0026 !anchor.matches(\u0027:hover\u0027)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/content-script.js, rhwp-firefox/content-script.js, rhwp-safari/src/content-script.js. 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":"rhwp-chrome/content-script.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8105843765cf9c4ce9c3868ba695d614d0f6f2c71cf599249c65760416ea8191"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof command.replacement !== \u0027string\u0027 || Array.from(command.replacement).length \u003E 4000\u0060 appears character-identically in 2 files \u2014 npm/editor/document-agent-contract.js, rhwp-studio/src/document-agent/contract.ts. 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":"npm/editor/document-agent-contract.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d29aa9b9cf9e8b79aa5aa8fae123d1bc86b9f894dc11cf071c9acf23bcec34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry === \u0027string\u0027 \u0026\u0026 entry.length \u003E 0\u0060 appears character-identically in 2 files \u2014 scripts/font_typesetting_risk_rank.mjs, scripts/oracle_profile_contract.mjs. 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":"scripts/font_typesetting_risk_rank.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbd45ead8cec2668bcbe0e948e7934d3d6ad040950e33786a6336c6b5f246aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof missing !== \u0027string\u0027 || missing === remaining\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/core/metafile-font-session.ts, scripts/visual-sweep-font-registration.mjs. 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":"rhwp-studio/src/core/metafile-font-session.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"31406e7a4002dc16c1419fd556adab43238934884e0f8b5d0771e9d4e7f38a2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof url !== \u0027string\u0027 || !url.startsWith(\u0027file:\u0027)\u0060 appears character-identically in 3 files \u2014 rhwp-chrome/sw/download-interceptor-common.js, rhwp-firefox/sw/download-interceptor-common.js, rhwp-shared/sw/download-interceptor-common.js. 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":"rhwp-chrome/sw/download-interceptor-common.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"415c2fa328fc7ae7cb91a3d2367ea36afdfe38d92cadabad8565c9fafc4462d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 npm/editor/document-agent-contract.js, rhwp-studio/src/document-agent/contract.ts. 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":"npm/editor/document-agent-contract.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fd71a09c0ebe489afee317936e5716bb7dccc01bb226b754c871e43da7d184"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !SHA256.test(value)\u0060 appears character-identically in 2 files \u2014 npm/editor/document-agent-contract.js, rhwp-studio/src/document-agent/contract.ts. 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":"npm/editor/document-agent-contract.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ec5cd9e80b684e23429c144cdc8950fa744ac8512f49ced630d93a82c626f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.length === 0\u0060 appears character-identically in 6 files \u2014 rhwp-chrome/sw/download-observer-state.js, rhwp-firefox/sw/download-observer-state.js, rhwp-shared/sw/download-observer-state.js, rhwp-studio/src/embed/rpc-router.ts. 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":"rhwp-chrome/sw/download-observer-state.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60ab07294f1a7cf672a7c1e7d0d80820ea41afa6e37d9b90f77993c627712dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.length === 0 || value.length \u003E 2048\u0060 appears character-identically in 2 files \u2014 scripts/font_rule_registry.mjs, scripts/font_rule_registry_v2.mjs. 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":"scripts/font_rule_registry.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bcffb407b593b830d7d13d75987180961763dc0a6ca2f700516bc176866523"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/view/canvas-view.ts, rhwp-studio/src/view/zoom-anchor.ts. 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":"rhwp-studio/src/view/canvas-view.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bf19bf3fbf5e7f33f23898463a738f7c04e28f0b6cb20441909d9da793c84a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null\u0060 appears character-identically in 4 files \u2014 rhwp-studio/src/core/export-content-loss.ts, rhwp-studio/src/core/font-decision-trace.ts, rhwp-studio/src/embed/protocol.ts, rhwp-studio/src/embed/rpc-router.ts. 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":"rhwp-studio/src/core/export-content-loss.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d6f60164fdec93071962df6537cbd44b4bedfbb2b6122357e45896be30aa37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 value.length \u003E 0\u0060 appears character-identically in 3 files \u2014 scripts/font_decision_trace_contract.mjs, scripts/font_metric_coverage_contract.mjs, scripts/font_rule_ledger.mjs. 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8434699452b344f646146ffc1774b8227edacd8be6eece50b5ff0a7bacb85a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uncompSize === 0 || uncompSize \u003E maxBytes\u0060 appears character-identically in 2 files \u2014 rhwp-chrome/sw/thumbnail-extractor.js, rhwp-firefox/sw/thumbnail-extractor.js. 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":"rhwp-chrome/sw/thumbnail-extractor.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6839007925c3ef64435b59a0dc67f95c4fb256fa2d0cea176f1182ebbad93f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 12 files \u2014 scripts/font_decision_trace_contract.mjs, scripts/font_metric_coverage_contract.mjs, scripts/font_rank1_runtime_boundary.mjs, scripts/font_rank8_trace_baseline.mjs. 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":"scripts/font_decision_trace_contract.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d125032e9a02b79cbb34601a23b5c38e9017db7fc2cfefe4bfe0935f84e18983"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 rhwp-studio/src/view/flow-image-clip.ts, scripts/font_metric_lineage.mjs. 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":"rhwp-studio/src/view/flow-image-clip.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0cdc49f8d62190e02656df1358c8ba70cba67a0c28e47ad17ddff2274bf8c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 4 files \u2014 gym/tools/from_e2e.mjs, rhwp-studio/src/core/font-rule-runtime.ts, scripts/font_metric_lineage.mjs, scripts/rust-test-suite-manifest.mjs. 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":"gym/tools/from_e2e.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61883fb9daf8f84fef0464d82b6f57eefdc06b32f75b7166902589824583094"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.type !== \u0027textRun\u0027 || typeof value.text !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 scripts/kerning_q1_baseline.mjs, scripts/kerning_q2_fixture_baseline.mjs. 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":"scripts/kerning_q1_baseline.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c0513b6a2acf77047d58b18125cb97a02fbdef62a9c4ad5c38aefc698575d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value?.schemaVersion !== 1 || value?.kind !== kind || value?.issue !== 4967\u0060 appears character-identically in 2 files \u2014 scripts/font_rank1_runtime_boundary.mjs, scripts/font_rank7_runtime_boundary.mjs. 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":"scripts/font_rank1_runtime_boundary.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e6effa339729f1ded8cd20de0fdf8b2414069ed9358056076f1b2ecfc37d48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.__renderBackend\u0026\u0026window.__wasm.pageCount\u003E0\u0060 appears character-identically in 4 files \u2014 mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs, mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-forms.mjs, mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-matrix.mjs, mydocs/pr/assets/issue8174/v2-s06/probes/studio-audit.mjs. 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":"mydocs/pr/assets/issue8174/v2-s04/reproduce/browser-direct-matrix.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc83bb7f518854ef4d7aa09124c29f51ec14cd1398df52d137a238181867f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022hmtx\u0022 not in font or \u0022cmap\u0022 not in font\u0060 appears character-identically in 2 files \u2014 scripts/font_rank1_qualification.py, scripts/font_rank7_qualification.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":"scripts/font_rank1_qualification.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9419af39081af4b256be87713007780659aabb8d45cc3f702bf5542b51252f7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027breakNonLatinWord=\u0022KEEP_WORD\u0022\u0027 in base and \u0027condense=\u00220\u0022\u0027 in base\u0060 appears character-identically in 5 files \u2014 mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py, mydocs/tech/investigations/issue-7418/probes/make_condense_cell_fixture.py, mydocs/tech/investigations/issue-7418/probes/make_condense_fixture.py, mydocs/tech/investigations/issue-7418/probes/make_condense_letter_spacing_fixture.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":"mydocs/tech/investigations/issue-7418/probes/make_condense_bullet_fixture.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b10ea30a1e65191e96f508386e0362df1c7f061349cc87233f9e02c4df407"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(candidate / \u0022samples\u0022).is_dir() and ( (candidate / \u0022.git\u0022).exists() or (candidate / \u0022Cargo.toml\u0022).is_file() )\u0060 appears character-identically in 3 files \u2014 tools/oracle_public/coverage_report.py, tools/oracle_public/oracle_resolver.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e4e5de4ee114c268f4fd6e0f9cd126813a2b818bec25f0548063006451943f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Path(bin_path).is_file() or shutil.which(bin_path)\u0060 appears character-identically in 8 files \u2014 tools/chief/service_loop.py, tools/dar/conformance.py, tools/dar/transaction.py, tools/fde/triage.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":"tools/chief/service_loop.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd61a3c491635a07955c577cbb84a0843ec2aa3a016d5a6aab2aff326d9b5b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_ORACLE_SUFFIX_RE.match(rest) or _ALT_SUFFIX_RE.match(rest)\u0060 appears character-identically in 3 files \u2014 tools/oracle_public/coverage_report.py, tools/oracle_public/oracle_resolver.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bd51b6d34d239059e7fdf18d6c275a10d432ae62484f5c8863bdd39e6d4edb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.bin or os.environ.get(\u0022RHWP_BIN\u0022) or shutil.which(\u0022rhwp\u0022)\u0060 appears character-identically in 7 files \u2014 tools/chief/service_loop.py, tools/dar/conformance.py, tools/fde/triage.py, tools/regression_loop/gate.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":"tools/chief/service_loop.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"baef737562b0f641889203bea743d23d2fcbc4dc81c77f6b25bace029463c929"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.sample and len(files) \u003E args.sample\u0060 appears character-identically in 2 files \u2014 tools/build_page_oracle.py, tools/verify_pi_page_vs_hangul.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":"tools/build_page_oracle.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7802b48657f7162144472ac4d70b06786beb38e03ca864ef90772d688dc97d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060blob.endswith(b\u0022\\n\u0022) or blob.endswith(b\u0022\\r\u0022)\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5068c454e5a772107873765d80ee25c996105970ee4290e3f55afd726b5bb65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060blob.get(\u0022kind\u0022) == \u0022workCapsule\u0022 or \u0022receipt\u0022 in blob\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/lineage_chain/envelopes.py, tools/llm_verifier/third_party_replay/envelopes.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":"tools/llm_verifier/lineage_chain/envelopes.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"79932b573fd80eef834dec25b6ee7f2bb3bafad869819e68497e0fc289dbaf5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code in cmap and font.getGlyphID(cmap[code]) != 0\u0060 appears character-identically in 3 files \u2014 scripts/extract_verified_math_alphabet_metrics.py, scripts/extract_verified_math_symbol_metrics.py, scripts/extract_verified_symbol_slot_metrics.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":"scripts/extract_verified_math_alphabet_metrics.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5de72b6b8f7984ca8b6d41400f5ee3174d5d0622b438a5dbd094d107b7a4d6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dest.exists() and dest.read_bytes() != body\u0060 appears character-identically in 3 files \u2014 pdf/issue7966/generate.py, pdf/issue7966/generate_close_stroke.py, pdf/issue7966/generate_text_paint_order.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":"pdf/issue7966/generate.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6f989770a88fdaa3bdf980908f730ed12efb4dfc661a4de2f1d3c09c438c6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edit_subs is None or len(edit_subs) \u003C MIN_EDIT_SUBCOMMANDS\u0060 appears character-identically in 2 files \u2014 tools/skill_router/audit_skill_commands.py, tools/skill_router/gate_new_skill.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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eac7c90ad3e87c47ee2aa89d12b746b5ce80331d29e0ef0df094a8bee3fe863"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry[\u0022codepoint\u0022] == codepoint and entry[\u0022status\u0022] == \u0022observed\u0022\u0060 appears character-identically in 2 files \u2014 scripts/oracle_stage3_profile.py, scripts/oracle_stage4_profile.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":"scripts/oracle_stage3_profile.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a0f093af3f25ff132466c651d0133e50246d4744aafb0cc7b4ac78d36e9cfb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry[\u0022queueRank\u0022] == rank and entry[\u0022documentFace\u0022] == face\u0060 appears character-identically in 2 files \u2014 scripts/oracle_stage3_profile.py, scripts/oracle_stage4_profile.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":"scripts/oracle_stage3_profile.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31ef55468ad5283928994e0f64ef2619e8297e9c3bda3420f0a954ccdf337c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060font.get(\u0022face\u0022) == TARGET_FACE and font.get(\u0022present\u0022) is True\u0060 appears character-identically in 2 files \u2014 scripts/font_rank1_qualification.py, scripts/font_rank7_qualification.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":"scripts/font_rank1_qualification.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"31637ff6fe6778e6893ce996e4a819f29d19fa58cdc84bee2f6b6c89194acfda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(c, dict) and isinstance(c.get(\u0022name\u0022), str)\u0060 appears character-identically in 2 files \u2014 tools/chief/service_loop.py, tools/strategist/engagement.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":"tools/chief/service_loop.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"01efe494730fb9375e998b2d9f572f83e138c7036733d8d6aa6091a2e71c59a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(entry, str) and entry.strip()\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e89d9df8e807732e0e1c2ed3871351f9d5741c2aae4a89cd1d8f7b9964a3cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(exc, subprocess.TimeoutExpired) or isinstance(exc, TimeoutError)\u0060 appears character-identically in 4 files \u2014 gym/tools/differential.py, gym/tools/fuzz_corpus.py, gym/tools/release_diff.py, gym/tools/release_gate.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":"gym/tools/differential.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a59bcf0fa8e533935d2c3f751d15ad24d9f4c586baa94e0b6a0cf2b6f433388"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(kind, str) and kind in EXCEPTION_KINDS\u0060 appears character-identically in 2 files \u2014 gym/certify.py, gym/report.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":"gym/certify.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb000698f976241fbfaf73b6a0cf660f690907996ff94c57ce9a9e5e49884709"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, (int, float)) and isinstance(right, (int, float))\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"098fe8d7d0d2fdaa1826d8bc4838deebca848ab69880289bc98bd52b91331803"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, bool) and isinstance(right, bool) and left is right\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9cd1d475864a2988bbf2dbf4d0a3548fa664466a2e0a8f949dc5686cbb51b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, bool) or isinstance(right, bool)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a0d07fc35619a8dc19eb746de94bb4ca9b007bc23e1030090fdd6e381fbd86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, dict) and isinstance(right, dict)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"986165313f1d6bd48e33b229916956cc0f42eba3ae750645bc2ddbddd379af37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, float) and isinstance(right, float)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2215f5cff6afa9e9c7e8195df20ecc80d5d362fb738ebb45616db25f5f6e12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, list) and isinstance(right, list)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa5a5e316955407032127a820b8c47229b7477e3e63e99dcb0335812e02ef46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, str) and isinstance(right, str)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ef96cc71cfb4003f1fd9f95eb5506f3e4a232fb6fdbdb28b9c7380b5ad7e39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(left, tuple) and isinstance(right, tuple)\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7237058c57afa43ea76571a76eba301a9f2eb397b1cca01750563ea4fede777e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(obj, dict) and \u0022pageCount\u0022 in obj\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d136ae39946f6cbab5554bf73ce62dc852934db8acf8d030e48d0de95ddb1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(raw, bool) or not isinstance(raw, (int, float))\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/repeat_eval/generate_corpus.py, tools/oracle_public/issue_draft.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":"tools/llm_verifier/repeat_eval/generate_corpus.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f46c3fc7191536d26f602e1110c6c48fcaef676fb6d9939909b9a0a7f49e43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(raw, dict) and \u0022skills\u0022 in raw\u0060 appears character-identically in 3 files \u2014 tools/skill_router/check_catalog_sync.py, tools/skill_router/gate_new_skill.py, tools/skill_router/route.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":"tools/skill_router/check_catalog_sync.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2922f3717273c9c1fcb2a4a94b0359beb4e753fd9d8326150b8a6c624a5f5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(row, dict) and row.get(\u0022font\u0022) == TARGET_FACE\u0060 appears character-identically in 3 files \u2014 scripts/font_rank1_qualification.py, scripts/font_rank7_qualification.py, scripts/font_rank8_qualification.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":"scripts/font_rank1_qualification.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd66437790b4be6d9505015e161064b23ccc7b76c639fc1ff8746873a849de1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 gym/tools/competitive_bench.py, tools/schema-validator/schema_validator.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":"gym/tools/competitive_bench.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d472d79731e95e0b2ca51c04e21cd6801b3d6d9e69a69403239f238b91291"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (str, int, bool)) or value is None\u0060 appears character-identically in 2 files \u2014 scripts/font_oracle_inventory.py, scripts/font_rank8_metric_hypothesis.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":"scripts/font_oracle_inventory.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27b8c1d15c3da63813e4ce1913e5f00ddd96f874951ceb318bdaaacc4b68d15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, dict) and not isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 gym/certify.py, gym/report.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":"gym/certify.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"34be5bf0d0bfacbd86e706893d07ee6ae2572be897662dfcd7261745d5a4432a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, float) and value.is_integer()\u0060 appears character-identically in 2 files \u2014 gym/report.py, tools/oracle_public/issue_draft.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":"gym/report.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e31c6405faff9864981878175af2ead1d2cca67d83a2e72e31543176b7523"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, int) and not isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/abstain/envelopes.py, tools/schema-validator/schema_validator.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":"tools/llm_verifier/abstain/envelopes.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64ec2dcf49136a1691c73f2d9cdf000d07f139dd5a73a5b0c15fc141aa0e911"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, int) and value in (0, 1)\u0060 appears character-identically in 6 files \u2014 tools/llm_verifier/abstain/schema.py, tools/llm_verifier/lineage_chain/schema.py, tools/llm_verifier/oracle_vs_self/schema.py, tools/llm_verifier/shadow_agree/schema.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":"tools/llm_verifier/abstain/schema.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c96c2e6318d40d3161d1759e428bf394091f4fa11802025c2f17dae0323f860"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and ABSOLUTE_PATH.match(value)\u0060 appears character-identically in 6 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.py, scripts/oracle_stage3_profile.py, scripts/oracle_stage4_contract.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc3cff8a9e665893c57b277e00b7fa6989068ee81a3c1f31f53deafb4c24a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and SHA256.fullmatch(value) is not None\u0060 appears character-identically in 2 files \u2014 scripts/oracle_stage4_contract.py, scripts/oracle_stage4_reproduction_compare.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":"scripts/oracle_stage4_contract.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"856c84d6b7fb3d0ac068dae9529838d42915245cc8ebc9fbaaffae1b3f094473"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.get(\u0022id\u0022) or item.get(\u0022skill\u0022) or item.get(\u0022name\u0022)\u0060 appears character-identically in 3 files \u2014 tools/skill_router/check_catalog_sync.py, tools/skill_router/gate_new_skill.py, tools/skill_router/route.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":"tools/skill_router/check_catalog_sync.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34b6b2c3c7efc712a6763dd766f62be7384bcb6543237ef1f86982644e0842"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.get(\u0022pdf\u0022) or item.get(\u0022reference\u0022) or item.get(\u0022oracle\u0022)\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbdbdabd10c64f3d4b52b411b137a30bdf75fe49fbb263c79e1b89ba7c649b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key in data and not isinstance(data[key], int)\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/coverage_report.py, tools/oracle_public/oracle_resolver.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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ee2faf91591f4f6dc1f0d66c333762ea9b5e12d80c983339463d6da20e0417"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key not in start or cur_page \u003C start[key]\u0060 appears character-identically in 3 files \u2014 tools/gate_3798_page_end_spill.py, tools/task2287/delta_staircase.py, tools/verify_pi_page_vs_hangul.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":"tools/gate_3798_page_end_spill.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ea150c9f83c324d755c495f3c0870e8581096cc49cd3b732caeb56240f4945"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(chunk) \u003E= shard_rows or index \u002B 1 == target\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/lineage_chain/generate_corpus.py, tools/llm_verifier/third_party_replay/generate_corpus.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":"tools/llm_verifier/lineage_chain/generate_corpus.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740ad667e808a9373bd34d85fc3ae437af91e29cb0fa2430ea673d5104cb9e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 3 and value[0].isalpha() and value[1] == \u0022:\u0022 and value[2] in \u0022\\\\/\u0022\u0060 appears character-identically in 2 files \u2014 scripts/font_rank1_metric_hypothesis.py, scripts/font_rank8_metric_hypothesis.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":"scripts/font_rank1_metric_hypothesis.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"982ab7da13498472e874358e246f3be3a92f3c815e98181bef99120650c26ffc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.st_size \u003C= 0 or metadata.st_size \u003E maximum_bytes\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5904d1d2894c733ae32e79bbc23fd692796f0c20580fcad19e6fc1c535a11342"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060names[0] != \u0022mimetype\u0022 or len(names) != len(set(names))\u0060 appears character-identically in 2 files \u2014 scripts/generate_kerning_pair_fixture.py, scripts/generate_oracle_typesetting_fixture.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":"scripts/generate_kerning_pair_fixture.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f153368db53077b2495296c83bf99e2fe1773e454bb5c7d4af4a2ba01a3084a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(answer, dict) or not answer\u0060 appears character-identically in 2 files \u2014 gym/tools/authority_ledger.py, gym/tools/pack_health.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":"gym/tools/authority_ledger.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e451507022f19c220e580799f521480f2d2dd1010947d13f1e2e6986884c8dbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(bin_path, str) or not bin_path.strip()\u0060 appears character-identically in 2 files \u2014 gym/certify.py, gym/report.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":"gym/certify.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db422733611511ee94f161addb29460cd05844c37140fb9117cf0124aea3c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(commands, list) or not commands\u0060 appears character-identically in 2 files \u2014 gym/core/schema.py, gym/tools/pack_health.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":"gym/core/schema.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef4345af148c8cae81dfea0e703b80099f7852b6b5d8617b34a2bba428a592e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(conf, (int, float)) or not 0.0 \u003C= float(conf) \u003C= 1.0\u0060 appears character-identically in 2 files \u2014 tools/strategist/sws_audit.py, tools/strategist/track_record.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":"tools/strategist/sws_audit.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e1bbf973716589c71c7120af488d1e4f8ca258ff6b7a540ea178176ba6403"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(documents, list) or not 1 \u003C= len(documents) \u003C= MAX_DOCUMENTS\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a33c0986b182794ade5852a67de391194ee4c729a8907f8f3267392e02e91b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(index, int) or isinstance(index, bool) or not 0 \u003C= index \u003C len(documents)\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe94d519240a207670784a9ba1dffd0ff3a84be2d64666d11867e6db9c12da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(path, str) or not path.strip()\u0060 appears character-identically in 2 files \u2014 gym/certify.py, gym/report.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":"gym/certify.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"54855134df740b3c5a94bc1f740c721abc585617df285f4c57e4ec0e55b26cc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(raw, str) or not raw.strip()\u0060 appears character-identically in 2 files \u2014 gym/tools/authority_ledger.py, gym/tools/competitive_bench.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":"gym/tools/authority_ledger.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6fc5d93fdc2ea7a6129e17b452202b735fa27229cc47deeddb118f278bb7b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(run_id, int) or isinstance(run_id, bool) or run_id \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/workflow_promotion_evidence.py, scripts/workflow_promotion_preflight.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":"scripts/workflow_promotion_evidence.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8271448a25092addb58bf00c155934c831b6a1bd1945587683a36b85ef7c65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(shapes[key], int) or shapes[key] \u003C 0\u0060 appears character-identically in 2 files \u2014 gym/tools/fuzz_corpus.py, gym/tools/robustness.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":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ba4ae623fd1dbb7476d05fe0d9714e6823d4ce57fc385be9493f8133ec3d67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(source, str) or not ABSOLUTE_PATH.match(source)\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a194d35a90b68d69edcf10d6c55e4c1c7cae1108b6ee508e5859f9a09f7318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(text, str) or not text.strip()\u0060 appears character-identically in 2 files \u2014 gym/core/runner.py, gym/tools/pack_health.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":"gym/core/runner.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f4c7d8c6c05561412d0e1e2c23bfc3d2f3fc8b8dc09b5bb61dfd03c70ab82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(usage, list) or len(usage) \u003E MAX_ROWS_PER_DOCUMENT\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f42d5987de1b3c4db0e145cf4ba8e940cb855c5a991af6e259d2ef8ffadf68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, int) or isinstance(value, bool) or value \u003C 0\u0060 appears character-identically in 3 files \u2014 gym/tools/discriminate.py, scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"gym/tools/discriminate.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea988da178b850797aeff93a6e8c3c4b04b52cb96afc81b841afb11c845dd5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or len(value) != 64\u0060 appears character-identically in 2 files \u2014 gym/tools/differential.py, gym/tools/release_diff.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":"gym/tools/differential.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bdbe78f7ed2cb407ca4d67c7e95b84a16b6c0d6987f7eee147bde6ca38fd3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(final_px) or final_px \u003C 0\u0060 appears character-identically in 2 files \u2014 scripts/font_rank8_metric_hypothesis.py, scripts/font_rank8_private_qualification.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":"scripts/font_rank8_metric_hypothesis.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c6c31cb89aacc8f4d5f021b6ebae1d2e3333951c76b2676538f82d52e65aed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number != number or number in (float(\u0022inf\u0022), float(\u0022-inf\u0022))\u0060 appears character-identically in 2 files \u2014 gym/tools/leaderboard.py, gym/tools/oracle_probe.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":"gym/tools/leaderboard.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e3752bcc0b1b466f503cab244874f3a1f790b819ff3dceb81d3b4535c051ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opt.startswith(\u0022--\u0022) and opt not in (\u0022--help\u0022,)\u0060 appears character-identically in 2 files \u2014 gym/certify.py, gym/report.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":"gym/certify.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d55d774c1567c9bc38570e9e61ba18cce1f685c0835777b5039eb3cd58c5b6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.returncode \u003C 0 or p.returncode \u003E= 0xC0000000\u0060 appears character-identically in 2 files \u2014 tools/regression_loop/gate.py, tools/regression_loop/promote.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":"tools/regression_loop/gate.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff802711d2793ccc72ab5d9fbb9ae3ffc335b7d86c68f3ad18cd56ac8f174cf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path or (HERE / \u0022fixtures\u0022 / \u0022axis_closed_set.tsv\u0022)\u0060 appears character-identically in 3 files \u2014 tools/llm_verifier/abstain/corpus_io.py, tools/llm_verifier/oracle_vs_self/corpus_io.py, tools/llm_verifier/untrusted_sandbox/corpus_io.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":"tools/llm_verifier/abstain/corpus_io.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd294fcd1d9e7714bc1b6b0fe31f58eb194d050b7d1e40f4aeb02c1e5ac12e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_dir() and not path.name.startswith(\u0022.\u0022)\u0060 appears character-identically in 2 files \u2014 tools/skill_router/audit_skill_commands.py, tools/skill_router/gate_new_skill.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":"tools/skill_router/audit_skill_commands.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de351c85a711c730703baef22665a598452f1779de80e5a7342dc368154259c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.name in deferred_names or path.relative_to(samples_dir).as_posix() in excluded\u0060 appears character-identically in 3 files \u2014 tools/oracle_public/coverage_report.py, tools/oracle_public/oracle_resolver.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"873417ab72f8e1093ebbdd134041fb8d111657fda7f7d9f7912f0b03551e0e56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.parent.is_symlink() or not path.parent.is_dir()\u0060 appears character-identically in 2 files \u2014 scripts/font_kerning_cohort.py, scripts/font_rank8_qualification.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":"scripts/font_kerning_cohort.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a011fc04e99fa98645b39c29ba61df55148614c3f8050bec9f43c5b61ef4015"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.get(\u0022path\u0022) or payload.get(\u0022skillPath\u0022) or payload.get(\u0022skill\u0022)\u0060 appears character-identically in 2 files \u2014 tools/skill_router/gate_new_skill.py, tools/skill_router/route.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":"tools/skill_router/gate_new_skill.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a3663b467994277f7b060d5d62b746bb9593919dfbc79decd3ed92de115cdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ranking.get(\u0022schemaVersion\u0022) != 1 or ranking.get(\u0022kind\u0022) != \u0022font-typesetting-risk-public-ranking\u0022 or ranking.get(\u0022issue\u0022) != 4962 or not is\u2026\u0060 appears character-identically in 3 files \u2014 scripts/font_rank1_qualification.py, scripts/font_rank7_qualification.py, scripts/font_rank8_qualification.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":"scripts/font_rank1_qualification.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb704f96dd988eb43fe6c4404e3852a52525762c1cb635507e9be335cefa6d2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.get(\u0022pairs\u0022) or raw.get(\u0022matches\u0022) or raw.get(\u0022items\u0022) or []\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb088204b19f8c1c7b4b1d1d8de230fd39233387f7b6b072dc644269bcda30db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.get(\u0022control_name\u0022) or record.get(\u0022control_id\u0022) or \u0022-\u0022\u0060 appears character-identically in 2 files \u2014 tools/hwp5_inventory/model.py, tools/hwp5_inventory/render.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":"tools/hwp5_inventory/model.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd53801d2479b105881134c47617c8a7777c7595f56bb880de6044327829369"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060report_path.parent and not report_path.parent.exists()\u0060 appears character-identically in 2 files \u2014 tools/agent-toolkit/workflows/archive_search.py, tools/agent-toolkit/workflows/distribution_verify.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":"tools/agent-toolkit/workflows/archive_search.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c57c18afd1502bec3265433d00f4e554860cb57272682babb2f6c78559d2f01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.is_file() and root.suffix.lower() in DOC_SUFFIXES\u0060 appears character-identically in 2 files \u2014 tools/oracle_public/page_smoke.py, tools/page_roundtrip/harness.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":"tools/oracle_public/page_smoke.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45dcfa83450953a1b33d61f0119d13900db7aff81a05664494209b1509a6770"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root_name not in roots or parent != sample.rel_parent\u0060 appears character-identically in 3 files \u2014 tools/oracle_public/coverage_report.py, tools/oracle_public/oracle_resolver.py, tools/oracle_public/sweep_runner.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":"tools/oracle_public/coverage_report.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ff6d5adc4b80e10fbf9dd1f3eadd4621d67e7676033d350012d77f1793ccf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rule.get(\u0022status\u0022) == \u0022active\u0022 and rule.get(\u0022sourceFace\u0022) == TARGET_FACE\u0060 appears character-identically in 2 files \u2014 scripts/font_rank7_qualification.py, scripts/font_rank8_qualification.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":"scripts/font_rank7_qualification.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0b082a41e117f72c285493c4a30e10325f9298d585622959ec02a4fb3a8602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shutil.which(\u0022rhwp\u0022) or shutil.which(\u0022rhwp.exe\u0022)\u0060 appears character-identically in 5 files \u2014 tools/agent_onboarding/rhwp_doctor.py, tools/layout_anomaly_batch_report.py, tools/oracle_public/page_smoke.py, tools/oracle_public/sweep_runner.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":"tools/agent_onboarding/rhwp_doctor.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf37f10fdd5da4b9d9142a3a2dd58b0b181b25525314185ddce51faa9b5435a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stripped.startswith(\u00220x\u0022) or stripped.startswith(\u00220X\u0022)\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/lineage_chain/hexutil.py, tools/llm_verifier/third_party_replay/hexutil.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":"tools/llm_verifier/lineage_chain/hexutil.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12be343e0947ec2b36e024ba7adcaaa68821939e954409ed5eebf858cc8e2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subprocess.run([\u0022git\u0022, \u0022rev-parse\u0022, \u0022--short\u0022, \u0022HEAD\u0022], capture_output=True, text=True, timeout=10).stdout.strip() or \u0022?\u0022\u0060 appears character-identically in 2 files \u2014 tools/object_visual_regression.py, tools/verify_pi_page_vs_hangul.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":"tools/object_visual_regression.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"119d42ce7609a43d3452286bd328d178bba9a5926807a8990ee6435a8db14fcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unified.startswith(\u0022/\u0022) or unified.startswith(\u0022//\u0022)\u0060 appears character-identically in 2 files \u2014 gym/tools/build_baseline.py, gym/tools/discriminate.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":"gym/tools/build_baseline.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3399f0d47544bf11619374bb8f4d4b20bc6e20c1a703cb38efd6070c18bb4c2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unified.startswith(\u0022//\u0022) or unified.startswith(\u0022\\\\\\\\\u0022)\u0060 appears character-identically in 2 files \u2014 gym/tools/build_baseline.py, gym/tools/discriminate.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":"gym/tools/build_baseline.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a90bd672e15d7b1d6da876d1cc23947661269ab3fcc213b7e9abb026ef2754"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 gym/tools/oracle_probe.py, tools/llm_verifier/abstain/envelopes.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":"gym/tools/oracle_probe.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e36bf03107d74c0f0b01a26952410cc6c356bdcd097fb9007cfcba1f56430"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ch.is_whitespace() \u0026\u0026 !ch.is_control() \u0026\u0026 ch.general_category() != GeneralCategory::Format \u0026\u0026 ch != \u0027\\u{fffc}\u0027\u0060 appears character-identically in 2 files \u2014 src/renderer/emphasis.rs, src/renderer/text_ink.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":"src/renderer/emphasis.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a41e7ee98ddf98cf700a7c708473beceeab4a8d9b8a0610d493cffd03a6db6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!char_style.bold \u0026\u0026 font_size \u003C meaningful_empty_para_min_font - 0.1\u0060 appears character-identically in 3 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/paragraph_layout.rs, src/renderer/typeset.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":"src/renderer/height_measurer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f5aadebf72227d8b581136cba4a2744493df2949e027fe2cccec740e0a85c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!cm.treat_as_char \u0026\u0026 matches!(cm.text_wrap, crate::model::shape::TextWrap::Square)\u0060 appears character-identically in 3 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/controls/host_wrap.rs, src/renderer/typeset/controls/wrap_match.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"50544295475b33d8796ca0bfa7af75fc923ba3c5cdab63ec60d633abafc618a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!common.treat_as_char \u0026\u0026 common.text_wrap == TextWrap::Square\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement/picture_anchor.rs, src/renderer/layout.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":"src/renderer/float_placement/picture_anchor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053e5c84832a6d2a38adca87f7c7dd029ba80471d1856310675c32d04071f48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!common.treat_as_char \u0026\u0026 matches!(common.text_wrap, crate::model::shape::TextWrap::Square)\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/line_breaking.rs, src/renderer/typeset.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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"195b3c233ce019cd9b49c2f0adad8a9238aa5d338837d127da21b8c76fbe0e85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!eligible(image) || !width_points.is_finite() || width_points \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 src/renderer/image_resolver/print_alpha_2024.rs, src/renderer/image_resolver/print_picture_resample.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":"src/renderer/image_resolver/print_alpha_2024.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2fc60197a2c472072a840d7f8502b0119411c607c7ee2bd265be7ec5ff1fb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!flushed || !submitted || context.is_device_lost()\u0060 appears character-identically in 2 files \u2014 src/native_host/gpu_d3d.rs, src/native_host/gpu_metal.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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"605f08b63bd9a262cfe211a2e5eff0136f34081c3eefd7657d94c10443545792"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_continuation \u0026\u0026 cursor_row == 0 \u0026\u0026 start_cut.is_empty()\u0060 appears character-identically in 3 files \u2014 src/renderer/typeset/table/continuation/fragment/budget.rs, src/renderer/typeset/table/continuation/fragment/emit.rs, src/renderer/typeset/table/continuation/fragment/scan.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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae294b0fc26f156c7ad858b18d255a93f46d9032fe0eeff503a884de26cceba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_continuation \u0026\u0026 start_cut.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/table/continuation/fragment/budget.rs, src/renderer/typeset/table/continuation/fragment/scan.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":"src/renderer/typeset/table/continuation/fragment/budget.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f357992af883171a92613e3236385ed02ae70022cbcab21c1cc6aeb7ddf271ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_synthetic_line_seg(seg) \u0026\u0026 hwpunit_to_px(seg.line_height, self.dpi) \u002B 0.5 \u003C ft.total_height\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/table/block/whole_fit.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":"src/renderer/typeset.rs"},"region":{"startLine":4367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1351ab4f3d737c54cc5a50b0ed450d6a61b4a8a509d3eed26a9655ee877a48e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!keep_style \u0026\u0026 !recolor_cell_text_black(doc.document_mut(), sec, para, ctrl, cell_idx)\u0060 appears character-identically in 2 files \u2014 src/cli/commands/edit/cells.rs, src/cli/protocol/plan/execution.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":"src/cli/commands/edit/cells.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcab15e6230be771f7d9764bbb34bf45be8cba87c7f83522e398726071c7a9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!matches!(common.text_wrap, TextWrap::TopAndBottom) || common.treat_as_char\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/typeset.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":5288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549dc13e7aa59f3cbbce18ff4616e5638cdc7ac6066937f9f2e397f4560b0e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!matches!(run.direction, TextDirection::Ltr) || !matches!(run.shape_key.direction, TextDirection::Ltr)\u0060 appears character-identically in 2 files \u2014 src/paint/text_v2.rs, src/renderer/layer_renderer.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":"src/paint/text_v2.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"03760f03fc218e08af23d0e980ecc9c334c30e895df80cca7c6dfa12ab104bee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!orig_path.exists() || !saved_path.exists()\u0060 appears character-identically in 2 files \u2014 src/serializer/cfb_writer/tests.rs, src/wasm_api/tests.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":"src/serializer/cfb_writer/tests.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2e81322240c15fc4041e317d335db84ae7293c0a01133694dc2155a534a6c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!other.starts_with(\u0022--\u0022) \u0026\u0026 capsule.is_none()\u0060 appears character-identically in 3 files \u2014 src/cli/protocol/capsule/signing.rs, src/cli/protocol/exchange/disclosure.rs, src/cli/protocol/trust/anchor.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":"src/cli/protocol/capsule/signing.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f016d886b0f0fb73e35ffc4ecd2dd5082e75401ddec18a7a12c3bfd6f728de9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!other.starts_with(\u0022--\u0022) \u0026\u0026 dir.is_none()\u0060 appears character-identically in 3 files \u2014 src/cli/protocol/capsule/audit.rs, src/cli/protocol/harness.rs, src/cli/protocol/trust/governance.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":"src/cli/protocol/capsule/audit.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0067556bdceecb1aa4f2000c40ba56eb89d21bd9d33a08dc6e8382368f3500"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!other.starts_with(\u0022--\u0022) \u0026\u0026 head.is_none()\u0060 appears character-identically in 2 files \u2014 src/cli/protocol/capsule/lineage.rs, src/cli/protocol/exchange/bundle.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":"src/cli/protocol/capsule/lineage.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"57adb2a58f45d17962c9153065a1bcd213a2b0217c9399f59175f038092bd585"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!other.starts_with(\u0022--\u0022) \u0026\u0026 plan_path.is_none()\u0060 appears character-identically in 2 files \u2014 src/cli/protocol/capsule/replay.rs, src/cli/protocol/plan/mod.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":"src/cli/protocol/capsule/replay.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"93039b95fa80acadc7a3e7b27d33413d19b8fd30229d0abd70a95e241944b78a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para.controls.is_empty() || para.column_type != ColumnBreakType::None || para.stored_text_partition_is_dirty() || para.cell_format_vpos_dir\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement.rs, src/renderer/render_normalization/stored_word_tail.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":"src/renderer/float_placement.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"556698132d80f744a23d80c4423b35cc4d82edc01a883fe9d6b675d738aa3f07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para.stored_text_partition_is_dirty() \u0026\u0026 !para.cell_format_vpos_dirty\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/stored_lines_runs.inc.rs, src/renderer/layout/table_layout/stored_first_line_restart.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":"src/renderer/composer/stored_lines_runs.inc.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a902d8ce28b27349d00f59913fd57e9a839c51b050890bb96c0ae9e09ab77f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para.stored_text_partition_is_dirty() \u0026\u0026 !para.cell_format_vpos_dirty \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/stored_first_line_restart.rs, src/renderer/layout/table_layout/stored_plain_row_frame.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":"src/renderer/layout/table_layout/stored_first_line_restart.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"446abb0d84e0f1c303b3efab0302fc6b6426c23bb0fcbac1f060f6c05e3d2a2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para.text.trim().is_empty() || !para.controls.is_empty()\u0060 appears character-identically in 4 files \u2014 src/document_core/commands/html_import.rs, src/document_core/commands/table_ops.rs, src/renderer/height_measurer.rs, src/renderer/layout/table_layout.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":"src/document_core/commands/html_import.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d2b71295dd80ce74d93d607d93e8990b02667ad459a438429e509228d687ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para_has_visible_text(para) \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 4 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/paragraph/split_entry.rs, src/renderer/typeset/paragraph/whole_fit.rs, src/renderer/typeset/section/stored_reset.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5e562aecc7fefeae36c14aa505709a94a234b516da0f3f43b06f76d95fa2e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!para_has_visible_text(prev_para) \u0026\u0026 para_has_visible_text_or_equation(prev_para)\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/notes/endnotes/paragraph.rs, src/renderer/typeset/notes/endnotes/prepare.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":"src/renderer/typeset/notes/endnotes/paragraph.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf40605a1a4c5f71d62d49899ed443005c7e6a13f3586ec367bc3fa46491bac6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!paragraph.controls.is_empty() || paragraph.line_segs.is_empty()\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/document/tac_cache_repair.rs, src/renderer/layout.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":"src/document_core/commands/document/tac_cache_repair.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fa1d26723c3e2a2ba386852b461bffacaec84ff5419b77c2359c65de03ea34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!paragraph.stored_text_partition_is_dirty() \u0026\u0026 !paragraph.cell_format_vpos_dirty\u0060 appears character-identically in 3 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/typeset/table/block/entry.rs, src/renderer/typeset/table/continuation/fragment/budget.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440eb19a227cf70542acbf2328a28b0121c29844c04a2f7d70f1809bb6087f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed_seg(prev_first) || !parsed_seg(prev_last) || !parsed_seg(curr_first)\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4a71445ac3bbe32d2daccd07ef0b49127b4037b61803e2874c968040618bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pic.common.treat_as_char \u0026\u0026 matches!( pic.common.text_wrap, crate::model::shape::TextWrap::TopAndBottom )\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/object_ops/picture.rs, src/parser/hwp3/mod.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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b406c5f92e9aee448c7efd61c749d5b1ef01dc34bc10f29451bc202cb5dd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pic.common.treat_as_char \u0026\u0026 matches!(pic.common.text_wrap, TextWrap::TopAndBottom) \u0026\u0026 matches!(pic.common.vert_rel_to, VertRelTo::Para)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/section/controls.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":"src/renderer/layout.rs"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc29d806d4d399348d371b4bbf61b6acdc1f225ab0082be0a7997d5e8d7d5a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!print || !crate::paint::device_image::eligible(image)\u0060 appears character-identically in 2 files \u2014 src/renderer/skia/image_coverage.rs, src/renderer/web_canvas/image_coverage.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":"src/renderer/skia/image_coverage.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"759571ff953321b4d0ed5d421216059ae3ede5645eb8132595da11f25bd8c472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!root.has_tag_name(\u0022svg\u0022) || root.has_attribute(\u0022transform\u0022) || root.has_attribute(\u0022opacity\u0022) || root.has_attribute(\u0022style\u0022)\u0060 appears character-identically in 2 files \u2014 src/paint/metafile_masks.rs, src/paint/metafile_print/masks.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":"src/paint/metafile_masks.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aaf9ad9b0523a5a36562d2d62ee542831ebb08b9f33bc2c275b2ea4c625a94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!s.common().treat_as_char \u0026\u0026 matches!(s.common().text_wrap, TextWrap::TopAndBottom) \u0026\u0026 matches!(s.common().vert_rel_to, VertRelTo::Para)\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/controls/shape_flow.rs, src/renderer/typeset/section/controls.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":"src/renderer/typeset/controls/shape_flow.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a485bfd912e38e45d7aab969fb79db7dab1c7de76f85563b580e3c64feb1d22a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.profile.get().session_edited() \u0026\u0026 !self.profile.get().hwp3_layout()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/paragraph_layout.rs, src/renderer/layout/table_layout.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":"src/renderer/layout/paragraph_layout.rs"},"region":{"startLine":6398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c305f7e79eedb2eb783c3cd5f96f186b73dd7d62b8fb24744db013c42db3cab8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.round2_error.is_empty() || self.round2_diff_count.is_none()\u0060 appears character-identically in 2 files \u2014 src/diagnostics/hwp5_roundtrip_batch.rs, src/diagnostics/hwpx_roundtrip_batch.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":"src/diagnostics/hwp5_roundtrip_batch.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe79c435bc3518aa35bc8bfa6fc672de0f45c03fb29ee8ac51f760eb6a1c9d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!st.profile.session_edited() \u0026\u0026 (st.profile.hwp5_container() || st.profile.hwpx_stored_layout())\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/notes/endnotes/measure.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":"src/renderer/typeset.rs"},"region":{"startLine":3603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e7edb4e23830ce9636964529bef2df9f70c7f6dce0a12cfd58d17b4ea2dc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!start_cut.is_empty() || !end_cut.is_empty()\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/rendering.rs, src/renderer/pagination/tests.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":"src/document_core/queries/rendering.rs"},"region":{"startLine":7793}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6567d5c55af516ac87a4a9da5b3a8469897957cdc4e3d75ef9fe8949be82e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!start_cut.is_empty() || end_cut.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/stored_intra_paragraph_frame.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":21112}}}],"partialFingerprints":{"codehealthFindingId/v1":"88543fcae36e214ec553bcaa8c403ba20e5b75c0762a6cc396b40b71bfe4eac6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!t.common.treat_as_char \u0026\u0026 matches!(t.common.text_wrap, TextWrap::Square) \u0026\u0026 matches!(t.common.vert_rel_to, VertRelTo::Para)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/controls/empty_float.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":"src/renderer/layout.rs"},"region":{"startLine":15166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f35b4920868d95417a15294a7f4c1c9ff598f4c6aaea7450bb8ba789ce94d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!t.common.treat_as_char \u0026\u0026 matches!(t.common.text_wrap, crate::model::shape::TextWrap::TopAndBottom)\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/line_breaking.rs, src/renderer/composer/reflow_helpers.inc.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":"src/renderer/composer/line_breaking.rs"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19de66e482d27e1763010bca11cd38cdcb66981f593e13c537b050c478dfcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!table.common.treat_as_char \u0026\u0026 matches!( table.common.text_wrap, crate::model::shape::TextWrap::Square )\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1961a74754cd43421fa1b27f55d0c47562739fc4b9fcad9271b3bde976ce1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!table.common.treat_as_char \u0026\u0026 matches!(table.common.text_wrap, TextWrap::Square) \u0026\u0026 matches!(table.common.vert_rel_to, VertRelTo::Para)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/controls/empty_float.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":"src/renderer/layout.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6f8ff2902b768bdcb76a9fdaa17e4a7de5149642d15031d829dfd2e42788cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!trimmed.starts_with(\u0027[\u0027) || !trimmed.ends_with(\u0027]\u0027)\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/table_ops.rs, src/document_core/queries/cursor_nav.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":"src/document_core/commands/table_ops.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"08caa1a8e64b75eb66c06d51a6b12a41d7eb65db1d5daee21dc86ae219d40f03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!valid_rect(region.bbox) || region.span_indices.len() \u003E 20000\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d123f4a051d006415e2cd5f900545719bb4d3a6c568e0c61b4c269def16182"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!valid_rect(s.bbox) || !s.font_size.is_finite() || s.font_size \u003C= 0.0 || s.rotation_degrees != 0.0 || s.wmode != 0 || s.mirrored\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab43f49f91defe5e57d7f1e4dbc99cf5a5108d99bc1ea838f63ef58c934eaee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!alignment \u0026\u0026 !first_indent) || size_change\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c674a34e03bda43116c75a2649cb442f7d4fe6b64e9d7977dd8ca843cf2151b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(a_edge.at - b_edge.at).abs() \u003C= EPS \u0026\u0026 a_edge.from \u003C= b_edge.to \u002B EPS \u0026\u0026 b_edge.from \u003C= a_edge.to \u002B EPS\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c5b7a801ff6c5f089b838b11d141b0579433248c5ac79c5d4da1099bc005f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(anchor_cs \u003E 0 || anchor_sw \u003E 0) \u0026\u0026 !band_full_width\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/controls/host_wrap.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabacdaeb2f35fec661e325de7fd7e37f7119d051798312eae852284d98f4b92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(b.x - xs[col]).abs() \u003E 0.5 || (b.y - ys[r]).abs() \u003E 0.5 || (b.width - (xs[col \u002B cs] - xs[col])).abs() \u003E 0.5 || (b.height - (ys[r \u002B rs] - ys\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2df7d37b7f1f633186587ef69242544b803febb2fa382e1cbc90a55cc4ceae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(bounds.x - xs[0]).abs() \u003E 0.5 || (bounds.y - ys[0]).abs() \u003E 0.5 || (bounds.width - (xs[cols] - xs[0])).abs() \u003E 0.5 || (bounds.height - (ys[\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"263adcf31bc192f498599b391bfc51819993240bce4058494542b225f716355a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(line.left - previous.left).abs() \u003C= tol || (line.right - previous.right).abs() \u003C= tol || ((line.left \u002B line.right) - (previous.left \u002B previ\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0569d49cc2db94aad0738435ae84a815a8c8d51c39936be81229159736e5a75a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(marker \u003E= 0xC0 \u0026\u0026 marker \u003C= 0xCF) \u0026\u0026 marker != 0xC4 \u0026\u0026 marker != 0xC8 \u0026\u0026 marker != 0xCC\u0060 appears character-identically in 2 files \u2014 src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc306dd859ee2d9ef84c738d2b59ad3dd863976db52f77c54ef125b1ef54de6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(page_size.width_mm - 210.0).abs() \u003E f32::EPSILON || (page_size.height_mm - 297.0).abs() \u003E f32::EPSILON\u0060 appears character-identically in 2 files \u2014 src/document_core/builders/exam_paper.rs, src/scaffold/builder.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":"src/document_core/builders/exam_paper.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c32e6de3fadf9061de8503f7bb0285c01833f7e23d52b4bc4ef2935ab7b2d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(para.column_type == ColumnBreakType::Page || para.column_type == ColumnBreakType::Section) \u0026\u0026 !reconsider_synthetic_break\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/entry.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c7125f32e681890590dcf1ab49f1d40a288ef54a2daa0934418eeaa230853e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(profile.hwp5_stored_pagination_layout() || profile.hwpx_stored_layout()) \u0026\u0026 !profile.session_edited()\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/rendering.rs, src/renderer/render_normalization/stored_nested_text_frames.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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f10842e370fa1be57fe977919590a7b1db11b73271ba709ab8480b1982554"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(rows == 1 || cols == 1) \u0026\u0026 cells.len() \u003C 2\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f58ee0d928154629ade47b43a8bf086c11e3aa29ffa3726bd86c78a38762cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.profile.get().hwp5_stored_pagination_layout() || self.profile.get().hwpx_stored_layout()) \u0026\u0026 !self.profile.get().session_edited()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/layout/table_layout/deferred_flow_units.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":"src/renderer/layout.rs"},"region":{"startLine":8232}}}],"partialFingerprints":{"codehealthFindingId/v1":"870b991fb3444a7075b1e9fda944fa0bc8878483d9d701cbffd3e9b035d809a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(st.profile.hwpx_stored_layout() || st.profile.hwp5_stored_pagination_layout()) \u0026\u0026 !st.profile.session_edited()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/paragraph.rs, src/renderer/typeset/paragraph/flow.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":"src/renderer/typeset/paragraph.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83f5c70c9cb244eb9d32b69882f02cecd283a6565786f7402b199800775fdfb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(w == 0. \u0026\u0026 h \u003E 0.) || (h == 0. \u0026\u0026 w \u003E 0.)\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/lowering.rs, tools/pdf-ir-poc/src/lowering.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":"src/parser/pdf/lowering.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d301dde5d71386fa08339f38414da292f43c409a19859ca2568057334b4ba2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(x == a \u0026\u0026 y != b) || (y == b \u0026\u0026 x != a)\u0060 appears character-identically in 2 files \u2014 src/model/pdf_stroke.rs, src/parser/pdf/path_paint.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":"src/model/pdf_stroke.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d81d01aa7454475506ffba14d51379562f4df02a6ba264054f1ccbb2a21f7a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.paragraph == b.paragraph \u0026\u0026 a_prefix == b_prefix \u0026\u0026 a_leaf.control == b_leaf.control \u0026\u0026 a_leaf.cell == b_leaf.cell\u0060 appears character-identically in 2 files \u2014 src/document_core/native_interaction.rs, src/native_host/accessibility.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":"src/document_core/native_interaction.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e05bf78aa6c55be0614569713d7741d517b3f992cd1def6216b797a6d11bb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.x \u003C b.x \u002B b.width \u0026\u0026 b.x \u003C a.x \u002B a.width \u0026\u0026 a.y \u003C b.y \u002B b.height \u0026\u0026 b.y \u003C a.y \u002B a.height\u0060 appears character-identically in 4 files \u2014 src/parser/pdf/table_detection.rs, src/parser/pdf/table_hierarchy.rs, tools/pdf-ir-poc/src/table_detection.rs, tools/pdf-ir-poc/src/table_hierarchy.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c5b158dbfcf27caabb666763fbc504ba8697812fa353b259e71ee3cecaa2c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchor_sw \u003E 0 \u0026\u0026 (anchor_sw - col_w_hu).abs() \u003C 3000\u0060 appears character-identically in 3 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/controls/host_wrap.rs, src/renderer/typeset/section/post_flow.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa675f4f325dcc1bc18646272c0a52c4bde5067abdcb755dab8dcf65cdb2b19b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.x \u003C bounds.x \u002B bounds.width \u0026\u0026 bounds.x \u003C b.x \u002B b.width \u0026\u0026 b.y \u003C bounds.y \u002B bounds.height \u0026\u0026 bounds.y \u003C b.y \u002B b.height\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa5735130878369f12150497acf965cd180d9caece021553bf0fe54d3cc4e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.x \u003E a.x \u002B EPS \u0026\u0026 b.y \u003E a.y \u002B EPS \u0026\u0026 b.x \u002B b.width \u003C a.x \u002B a.width - EPS \u0026\u0026 b.y \u002B b.height \u003C a.y \u002B a.height - EPS\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_hierarchy.rs, tools/pdf-ir-poc/src/table_hierarchy.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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"113efd00578813b48278a5b24bbafa711805e44c4f7900843044d31bca732d18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.x \u003E= a.x \u0026\u0026 b.y \u003E= a.y \u0026\u0026 b.x \u002B b.width \u003C= a.x \u002B a.width \u0026\u0026 b.y \u002B b.height \u003C= a.y \u002B a.height\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_hierarchy.rs, tools/pdf-ir-poc/src/table_hierarchy.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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e7ffae9c4501f0230c1f5e6d6a72010cfaf41aab4c233096f25d0ff9a536cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060baked_watermark || preserve_color_watermark\u0060 appears character-identically in 2 files \u2014 src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"018bcc43569654b410e199371fde703b3577b34e721b66d2e1fde6a63bce16a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.x \u003E= clip.x \u0026\u0026 bounds.y \u003E= clip.y \u0026\u0026 bounds.x \u002B bounds.width \u003C= clip.x \u002B clip.width \u0026\u0026 bounds.y \u002B bounds.height \u003C= clip.y \u002B clip.heig\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/lowering.rs, src/parser/pdf/structured_lowering/native_borders.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":"src/parser/pdf/lowering.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6990faf8e988a121a27daf94bfdc359b1ff3c9f6ec9eda1392c9a6bd5fc39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bridge_missing_count \u003E= 2 \u0026\u0026 para.controls.is_empty() \u0026\u0026 para_has_visible_text(para) \u0026\u0026 curr_first_vpos \u003C= 1500 \u0026\u0026 prev_end_vpos \u003E body_heig\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/boundary.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec14ad63c0c824323f1d0e7d218ccdbf13b3ba076f09afc77bc50eb3fda89385"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.row as usize == zone.end_row as usize \u0026\u0026 c.col as usize == zone.end_col as usize\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/border_rendering.rs, src/renderer/layout/table_layout.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":"src/renderer/layout/border_rendering.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"64824134a7278082fcce5d95a71d636fdcd09c77c490604ce766eaf1cfa3a826"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cache.entries.len() \u003E= CACHE_ENTRIES || cache.bytes \u002B png.len() \u003E CACHE_BYTES\u0060 appears character-identically in 2 files \u2014 src/renderer/bitmap_raster.rs, src/renderer/bitmap_raster/cropped_window.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/bitmap_raster.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a2b1a18894887832b39da1a6796bcf1c971ca5ce1de39ad7fdf08c2453ae47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060caption_base_overhead \u003E 0.0 \u0026\u0026 !caption_is_top\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/table/block/prepare.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9c3dac20038ce5b75b5ca3a0bee989f6225ee826b5229526dc186c92592122"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cd.column_count.max(1) \u003C= 1 \u0026\u0026 cd.spacing \u003C= 283\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/section/columns.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":"src/renderer/layout.rs"},"region":{"startLine":6839}}}],"partialFingerprints":{"codehealthFindingId/v1":"702782c0f0f20e69e5c1728c20fbde06c2ff5f7c26ec879b939b0248600e57af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row != 0 || cell.col != 0 || cell.row_span != 1 || cell.col_span != 1\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset.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":"src/renderer/layout.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89493584c29b875bdd5046717cf69b0183a92566a469491c3b4b4f08cdc3a73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row as usize != last_row || cell.row_span != 1\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/table_row_frame.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":"src/renderer/height_measurer.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42ae242ee32b1dd48a723f0ad50d6497bb0c9236c35c01c353e25fd7a6e0aeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row as usize \u003C= row \u0026\u0026 row \u003C cell.row as usize \u002B cell.row_span as usize\u0060 appears character-identically in 3 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/stored_terminal_row_frame.rs, src/renderer/typeset/table/continuation/fragment/emit.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":13570}}}],"partialFingerprints":{"codehealthFindingId/v1":"157329390d10920303da156df378a0009565e128b37b78fe1bc0dccf2bee43e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row_span != 1 || cell.height \u003E= 0x8000_0000\u0060 appears character-identically in 3 files \u2014 src/model/table.rs, src/renderer/float_placement/stored_row_grid.rs, src/renderer/typeset/stored_table_frame.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":"src/model/table.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847142f4b2ccef27a15431a7cb79d32ed3c775433dce98b2a18e33eba063c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row_span == 1 \u0026\u0026 (cell.row as usize) \u003C row_count\u0060 appears character-identically in 4 files \u2014 src/renderer/float_placement/stored_square_top_band.rs, src/renderer/height_measurer.rs, src/renderer/layout/table_layout.rs, src/renderer/pagination/engine.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":"src/renderer/float_placement/stored_square_top_band.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4948e9c08b3d36a0c4f6c91d0cb75a9679ddbb597806bd6a3b1f6b943968873c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.row_span \u003E 1 \u0026\u0026 usize::from(cell.row) \u003C= row \u0026\u0026 row \u003C usize::from(cell.row) \u002B usize::from(cell.row_span)\u0060 appears character-identically in 4 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/stored_body_closed_frame.rs, src/renderer/layout/table_layout/stored_inline_closing_frame.rs, src/renderer/layout/table_layout/stored_ordinary_row_frame.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2762651a523b41dfed50ee5f4334db79f49b1fb11966585af017453723c860e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.text_direction != 0 || cell.line_wrap != 0\u0060 appears character-identically in 2 files \u2014 src/renderer/render_normalization/stored_text_metrics.rs, src/renderer/render_normalization/stored_word_tail.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":"src/renderer/render_normalization/stored_text_metrics.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97844b801580316cae84994c9735bc4f19a7f6c356bf665b05e2d15c15a14b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch.is_ascii_alphanumeric() || (style.fixed_glyph_advances \u0026\u0026 ch.is_ascii_graphic())\u0060 appears character-identically in 2 files \u2014 src/renderer/skia/text_replay.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6391f37e7526d6f4082e0d615237b0d8a4079035d37a2c48f156b63aaa0f2c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char_offset == 0 \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/clipboard.rs, src/document_core/commands/object_ops/table.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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"def95fba4f10efba61b90b447ef2d611ff3fa2a7f7160abc81bff5245f643798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char_offset \u003E 0 \u0026\u0026 !para.text.is_empty()\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/clipboard.rs, src/document_core/commands/object_ops/table.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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bce687e4a9484e8056ea99a34b6a8b4ea048ccc0339948e5c557a9118e2cee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chart.is_combo() || chart.has_secondary_axis\u0060 appears character-identically in 2 files \u2014 crates/rhwp-ooxml-chart/src/renderer.rs, crates/rhwp-ooxml-chart/src/renderer/cartesian_layout.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/rhwp-ooxml-chart/src/renderer.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236e85e16b147da1db04be6f615241728f89f10eba9f0dcec80ac825c511d40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060common.treat_as_char || !matches!(common.text_wrap, TextWrap::TopAndBottom)\u0060 appears character-identically in 3 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/table_layout.rs, src/renderer/typeset/state/transition.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":"src/renderer/height_measurer.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b7c6b36e3a75ec397808b2d5d0f3397358037d47b2d82e1514b5062f3355f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060crate::renderer::para_has_no_stored_line_segs(para) \u0026\u0026 !para.text.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement/reflow_block_lines.rs, src/renderer/layout/table_layout/reflow_block_frames.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":"src/renderer/float_placement/reflow_block_lines.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"848cf488bedca87d7a9d9d0656af28f03935f44350defc9af9d420a731db8cea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cumulative \u002B content_h \u003E avail_for_lines \u0026\u0026 li \u003E cursor_line\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/paragraph/scan.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcacbb62165aae5886940f95c16079fc9482e6bdd17fd9e04cd01c558fc2b9be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor == scalar_end \u0026\u0026 width.is_finite()\u0060 appears character-identically in 2 files \u2014 src/renderer/shaping_context.rs, src/renderer/shaping_paragraph.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":"src/renderer/shaping_context.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620526a9e02e043d75029101f8b33c8493adbd3817068aea78899fff6c5d41c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor_line == 0 \u0026\u0026 end_line \u003E= line_count\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/paragraph/placement.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd01635b8b5bee39e39f94412bd3c61d0de77154fdeaa5b6410010b0bbfd1ef0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cut.start_row == 0 \u0026\u0026 cut.end_row == 1 \u0026\u0026 !cut.is_block_split \u0026\u0026 !cut.start_cut_is_block\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/stored_nested_outer_frame.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26248}}}],"partialFingerprints":{"codehealthFindingId/v1":"66549c09ba289792b2883a6e41d849abb6cd1dbc0d5bfc632f58aa3c460ae3d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.starts_with(b\u0022GIF87a\u0022) || data.starts_with(b\u0022GIF89a\u0022)\u0060 appears character-identically in 3 files \u2014 src/renderer/image_resolver.rs, src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/image_resolver.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfbab991d92483d46b8bdeab0c62fe7408b3c25bbce2de97ca19dbb816f2514"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delta \u003C= 0 || (delta - expected).abs() \u003E 1\u0060 appears character-identically in 2 files \u2014 src/renderer/inline_flow/stored_host.rs, src/renderer/layout.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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2759670577881c61498be7c00781fd8f3db2cb61210113821515fa2df0ed185"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060digest.algorithm == crate::paint::RESOURCE_KEY_ALGORITHM \u0026\u0026 digest.value == actual\u0060 appears character-identically in 2 files \u2014 src/renderer/layer_renderer.rs, src/renderer/skia/renderer.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":"src/renderer/layer_renderer.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4b64783330744c2094e60c1e3b224c6ddbc41a3d150a4f3cccfc281f32df3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edge.from \u003C start - join_extent(start) - EPS || edge.to \u003E end \u002B join_extent(end) \u002B EPS\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fc06292f462bf3cddcaa3cc8b4dc35bcd047ea7b4133a60a1bacb3648bed8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060effective_border == 1 || effective_border == 2\u0060 appears character-identically in 3 files \u2014 src/renderer/skia/text_replay.rs, src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed765ff3ed9f48494153128833f6dbcee2cde91aacfd4daa10692e673e4b684a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060effective_border == 2 || effective_border == 4\u0060 appears character-identically in 3 files \u2014 src/renderer/skia/text_replay.rs, src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e911a55f1348f7aa295e08fbcd12bfb80db83c8e484e4d80a62df75eabce0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060effective_border == 3 || effective_border == 4\u0060 appears character-identically in 3 files \u2014 src/renderer/skia/text_replay.rs, src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/skia/text_replay.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"92515a6a3df02ffd1710ee12eeb4e7c23d5e9a2745ba072b3886a81af6758263"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end_row \u003E= row_count \u0026\u0026 split_end_limit == 0.0\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/table/continuation/fragment/emit.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cdbfb95cafca7292974b5b9e58f13e00d68a753cf9ca522e5e3a1454f8135d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060equation.font_name.eq_ignore_ascii_case(\u0022HYhwpEQ\u0022) || equation.font_name.eq_ignore_ascii_case(\u0022HancomEQN\u0022)\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/layout.rs, src/renderer/equation/layout/legacy.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":"src/renderer/equation/layout.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9658dbc4b0e58c2c9b5d223ca94306a121158791edd1b5147cbc852376843f4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected_cs_hu \u003E 0 \u0026\u0026 (para_cs - expected_cs_hu).abs() \u003C 200 \u0026\u0026 para_sw \u003E 0 \u0026\u0026 para_cs \u002B para_sw \u003C= body_w \u002B 200\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/controls/wrap_match.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":"src/renderer/typeset.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d40b0b1d4a7865a8eac2e3666834e29fd6721bed224bc16451ba801eefcb321"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext.eq_ignore_ascii_case(\u0022hwp\u0022) || ext.eq_ignore_ascii_case(\u0022hwpx\u0022)\u0060 appears character-identically in 2 files \u2014 src/diagnostics/layout_anomaly.rs, src/diagnostics/render_geom_diff.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":"src/diagnostics/layout_anomaly.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6cfc7456bbd9f578fd4acbccbc3062f99b193982539614c666be7d733dc780"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060face.contains(\u0022KoPub\uB3CB\uC6C0\uCCB4\u0022) || face.contains(\u0022KoPub\uBC14\uD0D5\uCCB4\u0022) || face.to_lowercase().contains(\u0022kopub dotum\u0022) || face.to_lowercase().contains(\u0022kopub\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/stored_cell_reflow.inc.rs, src/renderer/typeset/paragraph.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":"src/renderer/composer/stored_cell_reflow.inc.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b76fa740bc1c899216db80861287bef2e297baa8e2a4d0033cbfcaf0b8b4ee5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060family.is_empty() || family.len() \u003E 256 || family.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 src/renderer/hft_outline.rs, src/renderer/pua_glyph.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":"src/renderer/hft_outline.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f20b40720199f403e3bc63507ee65c8acb88edde5f4219357e0037ec711ce57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.field_type == FieldType::Memo || field.command.starts_with(\u0022MEMO/\u0022)\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/memo_query.rs, src/model/paragraph.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":"src/document_core/queries/memo_query.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"964b289baeb182eab22e3adb0a403cfe8e8ac9b9f55765e4b1578cafc2b10641"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.field_type == crate::model::control::FieldType::Memo || field.command.starts_with(\u0022MEMO/\u0022)\u0060 appears character-identically in 2 files \u2014 src/parser/body_text.rs, src/serializer/body_text.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":"src/parser/body_text.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc4a6093b4bb5f4ef37c7ad19c333d4701e1065d4e5723e96cecc3c2448c381"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flow_index == 0 \u0026\u0026 item.paragraph.controls.is_empty()\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/structured_lowering.rs, tools/pdf-ir-poc/src/structured_lowering.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b6d64ae8eb93b59da6e47fb900ce1def7f3967686f7cbbc6121176687b6bb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fmt.computed_host_lines.is_none() \u0026\u0026 fmt.line_heights.len() == para.line_segs.len()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/controls/tac_flow.rs, src/renderer/typeset/table/block/entry.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":"src/renderer/typeset/controls/tac_flow.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5612a4b40c62309977c7eec79a54651c9d898ebcdcfe208687f3e00e1042d8ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060form.common.attr == 0 \u0026\u0026 form.common.instance_id == 0\u0060 appears character-identically in 2 files \u2014 src/model/identity.rs, src/serializer/form_identity.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":"src/model/identity.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194f4c4f0461fb4c686a0b9b9ee5fb223be94ce917a77cd77147c6f6d1bf406"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ft.strict_following_plain_text_fit \u0026\u0026 is_last_placed\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/table/block.rs, src/renderer/typeset/table/block/entry.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":"src/renderer/typeset/table/block.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb5f02df3e440fb9965e387b67f5d167fa3c77525d3f2355cdd33f6b70b29d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_cjk \u0026\u0026 (lb.width - estimate_text_width(text, fi, false)).abs() \u003E 0.01\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/canvas_render.rs, src/renderer/equation/svg_render.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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"de80af0e6a0b07b4c53abc9c11494d0911f1daa692730a833351ae844918a69b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C chars.len() \u0026\u0026 chars[i].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 src/agent/dsel/lex.rs, src/document_core/queries/structure.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":"src/agent/dsel/lex.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bef6d3226fe82bac5ac20e3d72f07bd1300f4c75dba749be800eb060ab7c40e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E 0 \u0026\u0026 j \u003E 0 \u0026\u0026 oracle_signatures[i - 1] == generated_signatures[j - 1]\u0060 appears character-identically in 5 files \u2014 src/diagnostics/hwp5_cell_header_probe.rs, src/diagnostics/hwp5_contract_probe.rs, src/diagnostics/hwp5_inventory_diff.rs, src/diagnostics/hwp5_mel_personnel_probe.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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1936bd615721594951c56c9aef2e94f628073b04c5514355dc220c80ab8026df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inner.x \u003E= outer.x - EPS \u0026\u0026 inner.y \u003E= outer.y - EPS \u0026\u0026 inner.x \u002B inner.width \u003C= outer.x \u002B outer.width \u002B EPS \u0026\u0026 inner.y \u002B inner.height \u003C= ou\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0458ec9d34732f3441a1dcaec0d63a279b921777395f0357bcef8694fdd68c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_continuation \u0026\u0026 mt.repeat_header \u0026\u0026 mt.has_header_cells \u0026\u0026 row_count \u003E 1\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/table/continuation/fragment/budget.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa122115f58194d8e4bf54602c86696b3d80bad6073f8cfa265a193283dedbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_rotate || (text_direction == 1 \u0026\u0026 !is_cjk_char(ch))\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/layout/table_cell_content.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4817}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3b3f9b0537831f378c4990816650d0ad89677948f08ee7635228d7b27ea237"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_rotate || (text_direction == 1 \u0026\u0026 !is_cjk_char(ci.ch))\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/layout/table_cell_content.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"248147d3899982598a91374da08de1582a6d2a357124fdd6f294bdfecc4c9909"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_synthetic_line_seg(line) || line.line_height \u003C= 0\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/section/stored_reset.rs, src/renderer/typeset/table/continuation/fragment/coanchored_origin.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":"src/renderer/typeset/section/stored_reset.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d2ef12e96c31d696f53012c7c53992e49bdfd6c4216d0a2ef978339567d77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003E 0 \u0026\u0026 (i == 0 || dp[i * cols \u002B j - 1] \u003E= dp[(i - 1) * cols \u002B j])\u0060 appears character-identically in 5 files \u2014 src/diagnostics/hwp5_cell_header_probe.rs, src/diagnostics/hwp5_contract_probe.rs, src/diagnostics/hwp5_inventory_diff.rs, src/diagnostics/hwp5_mel_personnel_probe.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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ad735d88d088555085a7f4fd85d483969b21ef5c921712aede1e3dd9a8c70f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jump_to \u002B 0.5 \u003E= zone.top \u0026\u0026 jump_to \u003C zone.bottom\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/state/transition.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":"src/renderer/layout.rs"},"region":{"startLine":9917}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabb317648f618fad07a1cc7fb5f13e18edf5d7d179ff4e320c0d04a82345df2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ladder_end \u003E 0.0 \u0026\u0026 nested_h \u003C= ladder_end \u0026\u0026 prev_end.is_finite() \u0026\u0026 gap_before \u003E= nested_h * 0.85\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/table_layout.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":"src/renderer/height_measurer.rs"},"region":{"startLine":3722}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d226c4f142d93691647c3ead7908e0a527f485afa2211e011c32524f301aaad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left == 0 \u0026\u0026 top == 0 \u0026\u0026 i64::from(right) == i64::from(width) \u0026\u0026 i64::from(bottom) == i64::from(height)\u0060 appears character-identically in 2 files \u2014 src/renderer/image_resolver/print_alpha_2024.rs, src/renderer/image_resolver/print_codec.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":"src/renderer/image_resolver/print_alpha_2024.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c83a0f8b5ecfc3dfe85d7c28a6a1452a2eba512988ab45aa7a353da3ab6957"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.is_finite() \u0026\u0026 right.is_finite() \u0026\u0026 (left - right).abs() \u003C= 1.0e-9 * left.abs().max(right.abs()).max(1.0)\u0060 appears character-identically in 3 files \u2014 src/paint/shaping_glyph.rs, src/renderer/shaping_composition.rs, src/renderer/shaping_vertical.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":"src/paint/shaping_glyph.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4c4d20527d323f6c4767934f7cd7af451a6e08920ca3842b33630d8b4ba079"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length \u003E MAX_REQUEST_BYTES || (length != 0 \u0026\u0026 pointer.is_null())\u0060 appears character-identically in 3 files \u2014 bindings/Native/src/gpu_d3d.rs, bindings/Native/src/gpu_gl.rs, bindings/Native/src/gpu_metal.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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb620a3fe41e8cc9362ea83aa9e4a764c76d2aaecac8c5771813801a187b2644"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line_seg.vertical_pos == 0 \u0026\u0026 expected \u003E 0\u0060 appears character-identically in 2 files \u2014 src/parser/hwp3/mod.rs, src/parser/hwpx/note_line_positions.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":"src/parser/hwp3/mod.rs"},"region":{"startLine":5131}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bf20f4d2b6c23569d0247a4f49f5baa69b8f9abf15834899b558d7407ffb41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!( table.layout_page_break(), crate::model::table::TablePageBreak::RowBreak ) \u0026\u0026 (table.col_count \u003C= 2 || table.row_count \u003E 5) \u0026\u0026 !bl\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/row_block_cut.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":23864}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057896abbd971dfae01af2d44b094a5d31c738e815e80884e83390e6eb87c47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(control, Control::Table(_)) || crate::renderer::composer::control_is_width_neutral_marker(control)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/stored_body_closed_frame.rs, src/renderer/typeset/controls/tac_reconcile.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":"src/renderer/layout/table_layout/stored_body_closed_frame.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2045068cd25449f052512dba6de1af7c551bfc00b65ec2e8ffd4a770943556a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(ctrl, Control::Equation(_)) \u0026\u0026 is_treat_as_char_object_control(ctrl)\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/cursor_rect.rs, src/document_core/queries/doc_tree_nav.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":"src/document_core/queries/cursor_rect.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92debe3ed3c0b0b064621c1d1ec803c8387e04bd73f62716599146345bc007f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matrix.b() != 0.0 || matrix.c() != 0.0 || matrix.a() \u003C= 0.0 || matrix.d() \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 src/renderer/web_canvas/cubic_reduction.rs, src/renderer/web_canvas/print_image_sampling.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":"src/renderer/web_canvas/cubic_reduction.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380ff9adfee8005dc595b0cc271157f951cdcd0897c3349a3965a5e51212122"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matrix.has_perspective() || matrix.skew_x() != 0.0 || matrix.skew_y() != 0.0 || matrix.scale_x() \u003C= 0.0 || matrix.scale_y() \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 src/renderer/skia/anisotropic_image.rs, src/renderer/skia/print_image_sampling.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":"src/renderer/skia/anisotropic_image.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1f7eb74b28d84b5b228c21f961e4192ca866b9fc720846351e1be0202fbfae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060measured.para_index == para_index \u0026\u0026 measured.control_index == control_index\u0060 appears character-identically in 2 files \u2014 src/renderer/inline_flow/stored_host.rs, src/renderer/typeset/notes/endnotes/flow_table.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":"src/renderer/inline_flow/stored_host.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbda1a5100c03735ba58008e85f4bb3e03df2c2837c77c1a7a8694648f4455e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060measured.para_index == paragraph_index \u0026\u0026 measured.control_index == control_index\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/rendering.rs, src/renderer/typeset/table/continuation/job.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":"src/document_core/queries/rendering.rs"},"region":{"startLine":5253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9a1362fc09bd3cc7f289f428ff45eea1fe79226cee4b3853459cc1eb57cd93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060measured.row == usize::from(cell.row) \u0026\u0026 measured.col == usize::from(cell.col)\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer/reflow_cell_frames.rs, src/renderer/layout/table_layout/reflow_block_frames.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":"src/renderer/height_measurer/reflow_cell_frames.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b64a45a3df5cf976f919742a04d22946374352a0da266b94926036adc74729d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060measured.total_height.is_finite() \u0026\u0026 measured.total_height \u003E 0.0\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/rendering.rs, src/renderer/composer/inline_box_rows.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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caf5ddfacdf2564348252225a1303a91894c076d8a4ac290eee79e4dd6c7ed2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.starts_with(\u0022Contents/section\u0022) \u0026\u0026 name.ends_with(\u0022.xml\u0022)\u0060 appears character-identically in 2 files \u2014 src/diagnostics/hwp5_contract_analyze.rs, tools/pdf-ir-poc/src/hwpx_compatibility.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":"src/diagnostics/hwp5_contract_analyze.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a70f4ebcb17dc3498f0d3fa7c9679ec64b7931583a9cb1b2951ba49f18d879"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060natural_top \u002B 0.5 \u003E= zone.top \u0026\u0026 natural_top \u003C zone.bottom\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/state/transition.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":"src/renderer/layout.rs"},"region":{"startLine":13876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7383d93964692bcdb12859aa4b8d5e17bdf509fd24b76fdfe05a60b16abc1219"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060needs_rotation || (!is_cjk_char(ch) \u0026\u0026 !ch.is_ascii_alphanumeric())\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/layout/table_cell_content.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c960520c81b54644fcb394580d67c961c04ffc7da700452dfc1eebf18d5f6b0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060needs_rotation || (!is_cjk_char(ci.ch) \u0026\u0026 !ci.ch.is_ascii_alphanumeric())\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/layout/table_cell_content.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":4914}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4050f7baa51896574de6af7de06505362de9bfa4cf5917f182fc7963876193"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nested.row_count == 1 \u0026\u0026 nested.col_count == 1\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/typeset/table/scan/runner/row_step.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":26145}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c99b61d190c558a8ed1f0f4a059ec4350b871ef1e49fed92ca3cfa9f9af8a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next.stored_text_partition_is_dirty() || next.cell_format_vpos_dirty\u0060 appears character-identically in 3 files \u2014 src/renderer/float_placement.rs, src/renderer/layout/table_host_flow.rs, src/renderer/typeset/table/continuation/fragment/stored_frame_budget.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":"src/renderer/float_placement.rs"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a69862d6eb6ff4666d01eba74ace6d70c2c007ffdb76a56208c8b5d70141a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number \u003E 0 \u0026\u0026 number \u003C= RasterRenderOptions::default().max_dimension as u32\u0060 appears character-identically in 2 files \u2014 src/cli/outputs/kitty.rs, src/cli/outputs/sixel.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":"src/cli/outputs/kitty.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59c2ac9fb9de43a4e63da3055ce73e1eaaeeb2d73139ee2116db84f99c663e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060occurrence == 0 \u0026\u0026 total \u003E 1 \u0026\u0026 !key.contains(\u0027[\u0027)\u0060 appears character-identically in 3 files \u2014 src/cli/commands/edit/fields.rs, src/cli/protocol/plan/execution.rs, src/mcp_serve.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":"src/cli/commands/edit/fields.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da9de543ad342836527c39200da1679f15758aa8c2ee889c6c7ce3f9363e6d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offset == position || offset == position \u002B 1\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/cursor_nav.rs, src/document_core/queries/cursor_rect.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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13891074e5e2f9c551f469d766e66d221abf0a2f56c7855a888116b682d17b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060oracle.is_empty() || generated.is_empty()\u0060 appears character-identically in 4 files \u2014 src/diagnostics/hwp5_cell_header_probe.rs, src/diagnostics/hwp5_contract_probe.rs, src/diagnostics/hwp5_mel_personnel_probe.rs, src/diagnostics/hwp5_table_probe.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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab9137399ee10c13a77eaafb7ecdcaee735b12fbcc95b5c104d4df523b43e09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other.horizontal != edge.horizontal \u0026\u0026 (other.at - at).abs() \u003C= EPS \u0026\u0026 edge.at \u003E= other.from - EPS \u0026\u0026 edge.at \u003C= other.to \u002B EPS\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"53462726f38b67164becc0a224c5d53f97db45d4cfeb7239389ec36eb6a6e4ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outline.paths.is_empty() || outline.paths.len() \u003E 4096\u0060 appears character-identically in 2 files \u2014 src/renderer/layer_renderer.rs, src/renderer/skia/glyph_replay.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":"src/renderer/layer_renderer.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea02b47da550fd10ec505277369b55145b490fad2b834c8106031868c4e1d21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060overlaps(aa, bb) \u0026\u0026 !strict(aa, bb) \u0026\u0026 !strict(bb, aa)\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_hierarchy.rs, tools/pdf-ir-poc/src/table_hierarchy.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":"src/parser/pdf/table_hierarchy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de3e51152b1849894fe4bd9656c81bf50f861899216619004f85e6a415609f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.line_segs.is_empty() \u0026\u0026 p.controls.is_empty() \u0026\u0026 para_has_visible_text(p)\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/boundary.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eaed1384912ee907d84a5c19d9947f4c72559b37a3a93824a997a659fe5cc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page.profile.hwp5_stored_pagination_layout() || page.profile.hwpx_stored_layout()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/controls/stored_tac.rs, src/renderer/typeset/paragraph/whole_fit.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":"src/renderer/typeset/controls/stored_tac.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"881e6d60ae6e7a4fa286eb5d569ccd472185467935713e442112373a1536c972"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page.profile.hwpx_stored_layout() || page.profile.hwp5_stored_pagination_layout()\u0060 appears character-identically in 3 files \u2014 src/renderer/typeset/controls.rs, src/renderer/typeset/paragraph/scan.rs, src/renderer/typeset/paragraph/whole_fit.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":"src/renderer/typeset/controls.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33876da7b4c6fa047c06348101eccfccb7ad4e6ba1735600b67de9d3920b9ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pair[1].is_first_line_of_page() || pair[1].is_first_line_of_column() || pair[1].vertical_pos \u003C pair[0].vertical_pos\u0060 appears character-identically in 3 files \u2014 src/renderer/composer/stored_marker_frames.rs, src/renderer/composer/stored_row_fragments.rs, src/renderer/composer/stored_word_tail.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":"src/renderer/composer/stored_marker_frames.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a08bd89fb0852d40f90d6b18eac914b8721ba4ffd0e00458b6077220e4411de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pair[1].vertical_pos \u003C pair[0].vertical_pos || pair[1].text_start \u003C pair[0].text_start\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement/picture_anchor.rs, src/renderer/typeset/table/block/whole_fit.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":"src/renderer/float_placement/picture_anchor.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"629648efadade930c71f8b7f9a52e298f5f0198d6a96581875b08941b62c0c82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.line_segs.is_empty() \u0026\u0026 para.controls.is_empty() \u0026\u0026 para_has_visible_text(para) \u0026\u0026 para_sb_hu \u003E= 500 \u0026\u0026 bridge_missing_count == 1 \u0026\u0026 pr\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/boundary.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fd789853eac121db77d0f78dbf5aa7c0fcdd6133e1aeafeded6c875d613fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.stored_text_partition_is_dirty() || crate::renderer::para_has_no_stored_line_segs(para)\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/composition.inc.rs, src/renderer/typeset/paragraph/format.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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f36668e973910cd52ae7d61cc1dad74a97ed30acdc994146fd2f99779c2969"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.stored_text_partition_is_dirty() || para.cell_format_vpos_dirty\u0060 appears character-identically in 7 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/empty_line_flow.rs, src/renderer/layout/table_layout/nested_empty_line_flow.rs, src/renderer/layout/table_layout/stored_body_closed_frame.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c92d9dd6c4074d322c032a8ce8cdd1a98017060ebe935ac3079a26747e0f60b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.stored_text_partition_is_dirty() || para.cell_format_vpos_dirty || !para.controls.is_empty() || para.line_segs.is_empty()\u0060 appears character-identically in 2 files \u2014 src/model/table.rs, src/renderer/float_placement/stored_header_frame.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":"src/model/table.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3506f23740a2d0d24456ca0956d90bcdbac544b720e5c6fa7951c58ca0a6be4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.stored_text_partition_is_dirty() || para.cell_format_vpos_dirty || crate::renderer::para_has_no_stored_line_segs(para)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/stored_text_frame_owner.rs, src/renderer/table_row_frame.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":"src/renderer/layout/table_layout/stored_text_frame_owner.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a59b5318d8ca2dc7ea1898c59633611b8392698cc2a9c962d1e1ef5fcc86e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.stored_text_partition_is_dirty() || para.cell_format_vpos_dirty || para.line_segs.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement.rs, src/renderer/typeset/paragraph/content.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":"src/renderer/float_placement.rs"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7d55b8aa07d6af63e1a63ddcd0c9148ccb0e038c5d5c2ca4246505a4726961"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.text.is_empty() \u0026\u0026 para.char_offsets.is_empty()\u0060 appears character-identically in 3 files \u2014 src/document_core/commands/object_ops/picture.rs, src/renderer/composer/inline_control_projection.inc.rs, src/renderer/layout.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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b17ccde474e1b5389919c8ed7f837623f783aa2942f64905db391fd75c0586"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.text.is_empty() \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 7 files \u2014 src/document_core/commands/clipboard.rs, src/document_core/commands/document.rs, src/document_core/commands/object_ops/table.rs, src/document_core/queries/hwpctrl_sets.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":"src/document_core/commands/clipboard.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a25269abf6652abf92bd4dc02c1395da5f6f5113ee818e754147fe73199ad79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.text.trim().is_empty() \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 3 files \u2014 mydocs/tech/investigations/issue-836/probes/diag_836.rs, src/renderer/layout/table_layout.rs, src/renderer/typeset/section/columns.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":"mydocs/tech/investigations/issue-836/probes/diag_836.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d49429c37adfa73097d7535b4c9ba5cb60af787876bd3dafb70a5e526907c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para_has_non_whitespace_text(para) || is_textless_coanchored_host\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset.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":"src/renderer/layout.rs"},"region":{"startLine":15153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f666a3acf49be4b9062590ade79636f54357258206280b1c69bbf4ac5a72ddb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para_sb_hu \u003E= 500 \u0026\u0026 prev_end_vpos \u003E high_threshold \u0026\u0026 curr_first_vpos \u003C 1500\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/boundary.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd04709eab6b24ddbde68a3e41ab6b386c5286c63bf5d9a624f6fc12b3455d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paragraph.stored_text_partition_is_dirty() || paragraph.cell_format_vpos_dirty\u0060 appears character-identically in 4 files \u2014 src/renderer/layout/table_layout/stored_empty_frame_restart.rs, src/renderer/layout/table_layout/stored_nested_source_cut.rs, src/renderer/render_normalization/stored_text_metrics.rs, src/renderer/table_row_frame.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":"src/renderer/layout/table_layout/stored_empty_frame_restart.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"850cece09f649323f025e41b884020a8effc914ca253c384750ad2e7d8d89b50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paragraph.stored_text_partition_is_dirty() || paragraph.cell_format_vpos_dirty || paragraph.line_segs.is_empty()\u0060 appears character-identically in 3 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/declared_first_frame.rs, src/renderer/layout/table_layout/stored_inline_row_frame.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":12526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8dacaf00604b3436220244df85928593d9c9ead3a9a8c187c851e7404ed25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paragraph.text.trim().is_empty() \u0026\u0026 paragraph.controls.is_empty() \u0026\u0026 paragraph.line_segs.len() \u003C= 1\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/table_layout.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":"src/renderer/height_measurer.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dda4ced898fe70ff8b34af4e6207239008c93c87b6636a554115a402aaadff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paragraphs.is_empty() || start_para \u003E= paragraphs.len()\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/text_editing.rs, src/renderer/composer/line_breaking.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":"src/document_core/commands/text_editing.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"877cc9ece07d6e102877eeb3923de235f0ee3693fadfcee1249cf0ab161a4c90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.fill_color.is_some() || path.dash_pattern.is_some() || path.matrix.is_some()\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/lowering.rs, tools/pdf-ir-poc/src/lowering.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":"src/parser/pdf/lowering.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c288e0439c1a606461183a0ada1c96914b11f7d57ce998b3895f0115c31ea160"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.color_format == ColorGlyphFormat::ColrV0 \u0026\u0026 payload.has_colrv0_resolved_layer_contract()\u0060 appears character-identically in 2 files \u2014 src/paint/paint_bounds.rs, src/renderer/skia/glyph_replay.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":"src/paint/paint_bounds.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb3fcd30783d06895d1c803a7cead30f62ed3526748666ea7e011587f15fe62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pic.shape_attr.rotation_angle.rem_euclid(360) != 0 \u0026\u0026 pic.shape_attr.current_width \u003E 0 \u0026\u0026 pic.shape_attr.current_height \u003E 0\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/object_ops/picture.rs, src/document_core/commands/object_ops/table.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":"src/document_core/commands/object_ops/picture.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"52224bd2bb67566816d263ac5a33200a5e95f1a63507198f479fefa523fa1eb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060picture.common.treat_as_char \u0026\u0026 picture.caption.is_none()\u0060 appears character-identically in 4 files \u2014 src/renderer/composer/inline_box_rows.rs, src/renderer/composer/inline_picture_metrics.rs, src/renderer/float_placement/stored_row_picture_frame.rs, src/renderer/layout/paragraph_layout.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":"src/renderer/composer/inline_box_rows.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3055c04d89e7f06bf66563a5944e505ac0af148d1d30aa453a59a58f771aab72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060placements.is_empty() || placements.len() \u003E self.config.max_pages\u0060 appears character-identically in 3 files \u2014 src/native_host/gpu_d3d.rs, src/native_host/gpu_gl.rs, src/native_host/gpu_metal.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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0958216fab46bb734028a5016d29e7b2aac491fa38bbccbf1325d3d15cf682"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pre_emit_tail_before_non_tac_object_advance \u0026\u0026 non_tac_object_height.is_some() \u0026\u0026 !endnote_has_text_or_equation\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/notes/endnotes/emit.rs, src/renderer/typeset/notes/endnotes/paragraph.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":"src/renderer/typeset/notes/endnotes/emit.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6ce1e1ee7a8cb61f6681bc0d4d53e74e43990ec706ef950121dbec0d792ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pre_nodes.is_empty() \u0026\u0026 after_nodes.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/parser.rs, src/renderer/equation/parser_fractions.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":"src/renderer/equation/parser.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8024ac04e1f5e67606759ed13e7e3e722ad83badb757010bfb4bf27ff7ed906"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preserve_color_watermark || (!matches!(img.effect, crate::model::image::ImageEffect::RealPic) \u0026\u0026 img.is_watermark())\u0060 appears character-identically in 2 files \u2014 src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8b13f78f53565c624bce9e77948eeb39ad673ef9f93118b7fcc4e761912d4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preserve_color_watermark || (is_watermark_image \u0026\u0026 !baked_watermark)\u0060 appears character-identically in 2 files \u2014 src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg.rs"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df249b203df17251db0c975fb73c51c654c865093b474b97352c917d92a8832"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prev_first.vertical_pos == 0 \u0026\u0026 prev_last.vertical_pos == 0 \u0026\u0026 curr_first.vertical_pos == 0 \u0026\u0026 prev_last.column_start == curr_first.column_s\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c15b7e8c315622c1a134d6192c40216e41a20560d3ca51b4d39aa2c4835a72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous.is_none() \u0026\u0026 line.vertical_pos != 0\u0060 appears character-identically in 3 files \u2014 src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/stored_shared_cell_frame.rs, src/renderer/layout/table_layout/stored_span_row_owner.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":"src/renderer/layout/table_layout.rs"},"region":{"startLine":19527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d0ac9d7ef34273935ef70761b457c91ae1ef7a165ff5a53f3aba8cb6a7fa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060probe_object_bottom \u003E 0.0 \u0026\u0026 prev_extent \u002B probe_object_bottom \u003C= first_vpos \u002B 0.5\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/table_layout.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":"src/renderer/height_measurer.rs"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a15c06d9ca1f91cbba9e40cd911a8c96bdc697d1e3ddfb8e0b80ad90fea03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile().hwp5_stored_pagination_layout() || profile().hwpx_stored_layout()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/table.rs, src/renderer/typeset/table/host_spacing.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":"src/renderer/typeset/table.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1db802f3a85c261e43b47e211c91c46ad4d6ee4084df33fce9a2fbdfa77cb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.hwp5_stored_pagination_layout() || profile.hwpx_stored_layout()\u0060 appears character-identically in 12 files \u2014 src/renderer/composer/composition.inc.rs, src/renderer/float_placement.rs, src/renderer/float_placement/stored_header_frame.rs, src/renderer/layout.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":"src/renderer/composer/composition.inc.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7e335b53e7fc2743ca58d63e267ee0388e90cf17934047294811a3afd830d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.hwpx_stored_layout() \u0026\u0026 !profile.hwp5_origin_hwpx()\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/rendering.rs, src/renderer/layout/table_layout.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":"src/document_core/queries/rendering.rs"},"region":{"startLine":6450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04fa5c244138417f7a262d04051631d2f07f0a3aed3b4498952df8e50dc79b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.drawing.text_box.is_none() \u0026\u0026 r.drawing.fill.solid.is_some()\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/structured_lowering.rs, tools/pdf-ir-poc/src/structured_lowering.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d6bb8257d2cdb912af27561e3070c71a2d8261ef38b2c53e2d585bc52f082"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.snapshots.is_empty() || request.snapshots.len() \u003E 8\u0060 appears character-identically in 2 files \u2014 bindings/Native/src/gpu_d3d.rs, bindings/Native/src/gpu_metal.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":"bindings/Native/src/gpu_d3d.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fac659f4d20053b52ba4b6c7c5a070fcf9050a6470c425ae5e6f306873e29f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060required \u003C= avail_for_rows || (required.is_finite() \u0026\u0026 avail_for_rows.is_finite() \u0026\u0026 required - avail_for_rows \u003C= roundoff)\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/table/scan/runner/block_step.rs, src/renderer/typeset/table/scan/runner/row_step.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":"src/renderer/typeset/table/scan/runner/block_step.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31ed513f2cb0ffa4c96948b5611c977b448e8eff034935416f5335e609f452f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rotation != 0 || visible_box != media_box\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/extract.rs, tools/pdf-ir-poc/src/lib.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":"src/parser/pdf/extract.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af2decda58cc1bc8f4a9ab1a79db108954afb7687186796038f2584b8e9a0a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.line_height != source.line_height || row.line_spacing != source.line_spacing\u0060 appears character-identically in 2 files \u2014 src/renderer/composer/stored_marker_frames.rs, src/renderer/typeset/controls/square_host_frame.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":"src/renderer/composer/stored_marker_frames.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7517904a49fc557eeac0da1b3f617b08e2e7b7a25420209bdb46789c36323b96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_count \u003C 2 || table.row_count as usize != row_count || table.common.height == 0\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/table_row_frame.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":"src/renderer/height_measurer.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"029eff8d2180d7d25fd7f07154c6c4ec14f82462530cdc9749c8fa7572b068ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rs == 0 || cs == 0 || r \u003E= rows || c \u003E= cols || rs \u003E rows - r || cs \u003E cols - c\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_topology.rs, tools/pdf-ir-poc/src/table_topology.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":"src/parser/pdf/table_topology.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff5daa78c9c52d9c3abcf1109a7f2277c4359ab28d6110228498a8b521894af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rule_h == horizontal \u0026\u0026 (rule_at - at).abs() \u003C= 0.5 \u0026\u0026 b - a \u003E 0.5\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/structured_lowering.rs, tools/pdf-ir-poc/src/structured_lowering.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f8f0eda4232a77353e24f83779b53b99f71e10cb1180475e60946c66fc005f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.display_text.is_some() || run.char_overlap.is_some()\u0060 appears character-identically in 2 files \u2014 src/renderer/cell_grid.rs, src/renderer/composer/supplemental_clusters.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":"src/renderer/cell_grid.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd28231f4dbf0c0e2054c4c1d2263595329091446e3adc75dae3eef7b1e7303"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.is_para_end || run.is_line_break_end\u0060 appears character-identically in 7 files \u2014 src/paint/builder.rs, src/paint/paint_bounds.rs, src/renderer/canvaskit_policy.rs, src/renderer/glyph_fit.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":"src/paint/builder.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb22ca99d01e95b2df0bb55776562f70527955f4d41183720511a2e7b3ca1351"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.style.shadow_type == 2 \u0026\u0026 !run.is_vertical\u0060 appears character-identically in 2 files \u2014 src/paint/metafile_fonts.rs, src/paint/text_shadow.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":"src/paint/metafile_fonts.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"557c67963337853d28892f06ab9eea104405d8c94b00960d607bb3ddef8fcacb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_idx == line.runs.len() - 1 \u0026\u0026 !next_line_starts_at_run_end\u0060 appears character-identically in 2 files \u2014 src/cli/queries/diagnostics.rs, src/renderer/typeset.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":"src/cli/queries/diagnostics.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c63c131bdf1b6852afd6655c408b2ff49479cacb2c30766400a560ff61b35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scratch.width == target.width \u0026\u0026 scratch.height == target.height\u0060 appears character-identically in 2 files \u2014 src/native_host/gpu_d3d.rs, src/native_host/gpu_metal.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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d600d4ff760545172d65108dc547d7e8fd82a84029fb93aeebc50fbe232414"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seg.line_height \u003E seg.text_height \u0026\u0026 seg.text_height \u003E 0\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/document.rs, src/document_core/commands/section_ops.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":"src/document_core/commands/document.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e186cc988298994f9cc09757a33cb7dd22af11dbd95fdf61c0731b97475466f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.at_end() || (self.document_terms \u0026\u0026 self.pos \u003E= self.term_limit)\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/parser_attached_scripts.rs, src/renderer/equation/parser_left_scripts.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":"src/renderer/equation/parser_attached_scripts.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956f5441b744df9d29a69856c5e99c39f89641040bb3b34d58e5a71a72f09e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.brightness != 0 \u0026\u0026 self.contrast != 0\u0060 appears character-identically in 2 files \u2014 src/model/image.rs, src/renderer/render_tree.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":"src/model/image.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2525c729f337dc99192a9145fff08b91ce7ad6ca01129b8651a0d6e91d7728"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.current_type() == TokenType::Command \u0026\u0026 Self::cmd_eq(self.current_value(), \u0022OVER\u0022)\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/parser.rs, src/renderer/equation/parser_fractions.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":"src/renderer/equation/parser.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"da141dc110a4866595b447fbffbeb857267548fea7aed470810b90eda698d610"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.current_type() == TokenType::Command \u0026\u0026 Self::cmd_eq(self.current_value(), \u0022RIGHT\u0022)\u0060 appears character-identically in 2 files \u2014 src/renderer/equation/parser.rs, src/renderer/equation/parser_fractions.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":"src/renderer/equation/parser.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5416d72678a92fca808d1d3af6e75a5b88e225d3527e5efa0048b3334535563d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.current_type() == TokenType::Whitespace \u0026\u0026 self.current_value() == \u0022#\u0022\u0060 appears character-identically in 3 files \u2014 src/renderer/equation/parser_alignment.rs, src/renderer/equation/parser_fractions.rs, src/renderer/equation/parser_structures.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":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0496c6b4f73c00f5cc5077a2fe7ac9390ef9ff2668fe2155b394991edc8d38c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.current_type() == TokenType::Whitespace \u0026\u0026 self.current_value() == \u0022\u0026\u0022\u0060 appears character-identically in 3 files \u2014 src/renderer/equation/parser_alignment.rs, src/renderer/equation/parser_fractions.rs, src/renderer/equation/parser_structures.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":"src/renderer/equation/parser_alignment.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1f36c686e2d3dce1029cf6187d5d72ed3a38c99bd3d32ed152585373aca276"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.hancom_math_face || self.hancom_eqn\u0060 appears character-identically in 5 files \u2014 src/renderer/equation/layout.rs, src/renderer/equation/layout/fraction_geometry.rs, src/renderer/equation/layout/matrix_row_frame.rs, src/renderer/equation/layout/script_geometry.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":"src/renderer/equation/layout.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00109b4676e40b3ec675ec983982cb1f3176d65ed86dd31e2efaff95bcce7ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.profile.get().hwp5_container() || self.profile.get().hwpx_container()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/section/columns.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":"src/renderer/layout.rs"},"region":{"startLine":6903}}}],"partialFingerprints":{"codehealthFindingId/v1":"992877faddd6452714e324478f98f87f30569a70d525e395fe302838f3082387"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.profile.get().hwp5_stored_pagination_layout() \u0026\u0026 !self.profile.get().session_edited()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/table/block/prepare.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":"src/renderer/layout.rs"},"region":{"startLine":16046}}}],"partialFingerprints":{"codehealthFindingId/v1":"39042c88680c68f94c650bc60086794b0221b787c124a8fff6efb4c58cfc22c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.profile.get().hwp5_stored_pagination_layout() || self.profile.get().hwpx_stored_layout()\u0060 appears character-identically in 5 files \u2014 src/renderer/layout.rs, src/renderer/layout/table_layout.rs, src/renderer/layout/table_layout/row_physical_band.rs, src/renderer/typeset/section/controls.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":"src/renderer/layout.rs"},"region":{"startLine":11024}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8a18d9679293f8bffa6133777118a9c563a948229ac6ee86e4feb5ecff1c22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.profile.get().hwpx_stored_layout() \u0026\u0026 !self.profile.get().session_edited()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/layout/table_layout.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":"src/renderer/layout.rs"},"region":{"startLine":10245}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaa59c5e43aa57c3c6cf0c536b2f92478754fd200918dbdca98b7ff8129caac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.profile.get().hwpx_stored_layout() || self.profile.get().hwp5_stored_pagination_layout()\u0060 appears character-identically in 3 files \u2014 src/renderer/layout.rs, src/renderer/layout/picture_footnote.rs, src/renderer/layout/table_layout.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":"src/renderer/layout.rs"},"region":{"startLine":8109}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e2386812aa60c24b15856cb9be2b525d12f35e569a71f56830e443bf86c328"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.show_paragraph_marks || self.show_control_codes\u0060 appears character-identically in 3 files \u2014 src/renderer/html.rs, src/renderer/svg.rs, src/renderer/web_canvas.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/html.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7651d6c38e32e9ea68c84773bee761e8f472b2c764133b35eb86f86b741173"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.strict == Some(true) \u0026\u0026 (self.overflow_count.unwrap_or(0) \u003E 0 || self.overlap_count.unwrap_or(0) \u003E 0)\u0060 appears character-identically in 2 files \u2014 tools/llm_verifier/process_steps/src/envelope.rs, tools/llm_verifier/verdict_protocol/src/judgment.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":"tools/llm_verifier/process_steps/src/envelope.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179badd28a800348907eb8e8ed96c6f1dd350682642d2810f866340adf5eb36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seq \u003C= up_to \u0026\u0026 up_to \u003C log.line_hashes.len()\u0060 appears character-identically in 2 files \u2014 src/cli/protocol/exchange/bundle.rs, src/cli/protocol/trust/anchor.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":"src/cli/protocol/exchange/bundle.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c97c07e3b4cb3996811c6f696870ba5fa287dbbbebe51c8078facc61067d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shape.separator_length != 0 || shape.separator_line_type != 0 || shape.separator_line_width != 0\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/object_ops/footnote_shape.rs, src/document_core/commands/object_ops/shape.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":"src/document_core/commands/object_ops/footnote_shape.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b993f5c4b250fed94a3b0dc7c2a4005d09c3eae7cee5d9e239375a4423dc149"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.len() \u003C= offset || target.len() \u003C offset\u0060 appears character-identically in 2 files \u2014 src/diagnostics/hwp5_cell_header_probe.rs, src/diagnostics/hwp5_mel_personnel_probe.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":"src/diagnostics/hwp5_cell_header_probe.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefd5ab1165df93613b2b05ea6f2ff0e34f88eae64503b1e0ebef8eb5a556dcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span \u003E 1 \u0026\u0026 r \u002B span \u003C= row_count \u0026\u0026 cell.height \u003C 0x80000000\u0060 appears character-identically in 2 files \u2014 src/renderer/height_measurer.rs, src/renderer/layout/table_layout.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":"src/renderer/height_measurer.rs"},"region":{"startLine":4915}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41f698f60c3150c2523bc224efcc4d0c706a226dd4027e32109b6377e00602c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span.font_name == \u0022Unknown\u0022 || span.font_name.is_empty()\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/lowering.rs, tools/pdf-ir-poc/src/lowering.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":"src/parser/pdf/lowering.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"359dbc3cf6593d7d632051b631f4010ae5b12b261f018d008813c51a978045e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060split \u003E 0 \u0026\u0026 split \u003C fmt.line_heights.len()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/notes/endnotes/fit.rs, src/renderer/typeset/notes/endnotes/paragraph/initial_fit.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":"src/renderer/typeset/notes/endnotes/fit.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d192e6b87283c330139e3f11a462780c610bc01487b4b774b3b8b84becd5e9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.col_count != 1 || st.current_items.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/table/deferred_float_flow.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":"src/renderer/typeset.rs"},"region":{"startLine":6581}}}],"partialFingerprints":{"codehealthFindingId/v1":"77083dc514f65a06c0685e0539c1ac003612e12294193389bf790faed8e7e52f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.current_endnote_flow \u0026\u0026 st.current_start_height \u003C -0.5\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/notes/endnotes/measure.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":"src/renderer/typeset.rs"},"region":{"startLine":3597}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f197d6c7b7c45ba502cc6ec216a7e3d5d1a9deaaabf5e7c4418e73fec0084ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.profile.hwp5_stored_pagination_layout() || (st.profile.hwpx_stored_layout() \u0026\u0026 !st.profile.session_edited())\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/notes/footnotes/body.rs, src/renderer/typeset/table/footnotes.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":"src/renderer/typeset/notes/footnotes/body.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b66eb95800cdcccc97d998e45c2560b663dd8d50749cfca68a493ba392c411"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.profile.hwp5_stored_pagination_layout() || st.profile.hwpx_stored_layout()\u0060 appears character-identically in 14 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/controls.rs, src/renderer/typeset/notes/footnotes/measure.rs, src/renderer/typeset/paragraph.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":"src/renderer/typeset.rs"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e20dcfd045f5a6bd08d935f3f7c785af3edb156c894f1c3290d9e230b88cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.profile.hwpx_stored_layout() \u0026\u0026 !st.profile.hwp5_origin_hwpx() \u0026\u0026 !st.profile.session_edited()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset/table/block/prepare.rs, src/renderer/typeset/table/block/whole_fit.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":"src/renderer/typeset/table/block/prepare.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb4f5995fc98c470461f760ba072e9f2b0a3bfedd702a337d59b71dc2ac5cf1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060st.profile.hwpx_stored_layout() || st.profile.hwp5_stored_pagination_layout()\u0060 appears character-identically in 9 files \u2014 src/renderer/typeset/paragraph/content.rs, src/renderer/typeset/paragraph/flow.rs, src/renderer/typeset/paragraph/stored_lines.rs, src/renderer/typeset/section/flow.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":"src/renderer/typeset/paragraph/content.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4d14e8e163f9b7cf161b723b79c40f70e79f337ea6f6e5ad0826e2cb77dac7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start_char_offset \u003E start_len || end_char_offset \u003E end_len\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/header_footer_ops.rs, src/document_core/queries/cursor_rect.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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3c480b3e44a9e1b28d2acdb54c596f32d26e01258d2764f67044fd0aa2f6e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start_hf_para_idx \u003E= paragraphs.len() || end_hf_para_idx \u003E= paragraphs.len()\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/header_footer_ops.rs, src/document_core/queries/cursor_rect.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":"src/document_core/commands/header_footer_ops.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c27d9f083fb2a4bbe1ea7c039798e0c0afefd022deaa1f393b0d9511e5c7b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style.fill_color.is_some() || style.pattern.is_some() || has_gradient\u0060 appears character-identically in 2 files \u2014 src/paint/parallel_shadow.rs, src/paint/replay_order.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":"src/paint/parallel_shadow.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58491e98c235eede371245bc9c1527b0a391a79402e565ffe099254b09def9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style.start_arrow == ArrowStyle::None \u0026\u0026 style.end_arrow == ArrowStyle::None\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/shape_layout.rs, src/renderer/layout/shape_layout/path_stroke_arrows.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":"src/renderer/layout/shape_layout.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb35bed0844f95e354c49f9960357e7d1ab43040d846e03f5449bde1358b24ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060styles.hwp3_variant \u0026\u0026 self.endnote_para_source_for(para_index).is_none()\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/layout/paragraph_layout.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":"src/renderer/layout.rs"},"region":{"startLine":15411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4084a5d14478cfa2c257f5f0047383e548462946c51f894fb52b596213388c15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.common.treat_as_char \u0026\u0026 matches!( t.common.text_wrap, crate::model::shape::TextWrap::TopAndBottom )\u0060 appears character-identically in 2 files \u2014 src/renderer/layout.rs, src/renderer/typeset/section/columns.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":"src/renderer/layout.rs"},"region":{"startLine":7115}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dd34e57dd2b6225fb12000707535826f866fd3900fe6c403994f04919876b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060table.row_count == 1 \u0026\u0026 table.col_count == 1\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement.rs, src/renderer/layout/table_layout.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":"src/renderer/float_placement.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f4efee71ad0809d4fb3390243f36645b6f9bcfae1f069039d5babe4cea1247"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060table_heading_reset || empty_bridge_heading_reset || real_heading_or_bridge_reset\u0060 appears character-identically in 2 files \u2014 src/renderer/pagination/engine.rs, src/renderer/typeset/section/boundary.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":"src/renderer/pagination/engine.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29903ec4f089b6396fa713b789a000c324c61c694c1650ad200df5dbb290e07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.device_generation == 0 || target.width \u003C= 0 || target.height \u003C= 0 || target.width \u003E self.max_dimension || target.height \u003E self.max_di\u2026\u0060 appears character-identically in 2 files \u2014 src/native_host/gpu_d3d.rs, src/native_host/gpu_metal.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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e8c620cdbdcec6e9d287748e19568039cdcb7862b813c5a1b0d7c633a859b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_line \u003E= 0 \u0026\u0026 (target_line as usize) \u003C line_info.line_count\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/cursor_nav.rs, src/document_core/queries/cursor_rect.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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f621bc4cf0b5ad1fd25c1beecb29cbcf0e1e34bbf0a457665e0e3c334e3d05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_page.is_some() || page_count == 1\u0060 appears character-identically in 2 files \u2014 src/cli/outputs/kitty.rs, src/cli/outputs/sixel.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":"src/cli/outputs/kitty.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b3fdca8be4ad288f13aec9a14bacb3f6e38a23f351d5a8f5cf98e91cc2fb61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_row \u003E= 0 \u0026\u0026 (target_row as u16) \u003C table.row_count\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/cursor_nav.rs, src/document_core/queries/cursor_rect.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":"src/document_core/queries/cursor_nav.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d467f7626cd2785da1fee3deab70ec27613b86652dbba93c01b52d92700d8292"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060texture.is_null() || stamp.device_generation != self.generation\u0060 appears character-identically in 2 files \u2014 src/native_host/gpu_d3d.rs, src/native_host/gpu_metal.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":"src/native_host/gpu_d3d.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"141cab45731a2ded54d20d698867f03e63cf6336182068155d34980aad1eeaaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tn.section_index == Some(sec) \u0026\u0026 tn.para_index == Some(ppi) \u0026\u0026 tn.control_index == Some(ci)\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/object_ops/table.rs, src/document_core/commands/table_ops.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":"src/document_core/commands/object_ops/table.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2feff939b034c416206f1a6fce4f9c18192c7609f5b2b0363f3cd1dd11998231"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tpi \u003E 0 \u0026\u0026 first_ls.segment_width != first_sw \u0026\u0026 first_ls.vertical_pos \u003C max_vpos_end\u0060 appears character-identically in 2 files \u2014 src/document_core/queries/doc_tree_nav.rs, src/renderer/layout/shape_layout.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":"src/document_core/queries/doc_tree_nav.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b937f7a78127a40c1c76f252f638b28e486c5fd5d8b7f5ed9d42facb3918be85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trailer_len \u003C MIN_TRAILER_LEN || trailer_len \u003E n\u0060 appears character-identically in 2 files \u2014 src/agent_seal.rs, src/security_trailer.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":"src/agent_seal.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57737beab94daed7d05886047da78098e7ba95005b12cf59682899e14fdbc48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.trim().is_empty() \u0026\u0026 para.controls.is_empty()\u0060 appears character-identically in 2 files \u2014 src/renderer/typeset.rs, src/renderer/typeset/paragraph/empty.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":"src/renderer/typeset.rs"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9f3eab83a724cdde21a173b1b42123b79006b57b365a4494eedca258d260a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unit.hard_break_before || unit.stored_frame_break_before || unit.page_frame_reset_before\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/row_physical_band.rs, src/renderer/layout/table_layout/stored_mixed_opening_frame.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":"src/renderer/layout/table_layout/row_physical_band.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3d24607dfba8ca72ba80dccc217c9e7a5911f15e29ba910dfa752756844a1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060use_glyph \u0026\u0026 (left == \u0022(\u0022 || left == \u0022)\u0022)\u0060 appears character-identically in 3 files \u2014 src/renderer/equation/canvas_render.rs, src/renderer/equation/svg_render.rs, src/renderer/skia/equation_conv.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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6784bde69095b490e182f5973f94dc8b1aad9534905db52c4b826af7b5feb268"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060use_glyph \u0026\u0026 (right == \u0022(\u0022 || right == \u0022)\u0022)\u0060 appears character-identically in 3 files \u2014 src/renderer/equation/canvas_render.rs, src/renderer/equation/svg_render.rs, src/renderer/skia/equation_conv.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":"src/renderer/equation/canvas_render.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b61aed10eb46318ee3281f436f5e20c1050e28cc693f31aca6f4524a59d199c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usize::from(cell.row) \u003C end \u0026\u0026 usize::from(cell.row) \u002B usize::from(cell.row_span) \u003E end\u0060 appears character-identically in 2 files \u2014 src/renderer/float_placement.rs, src/renderer/typeset/table/continuation/fragment/budget.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":"src/renderer/float_placement.rs"},"region":{"startLine":5949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5df37025f4abfd8894d0815fdf884dda52974f87b94bffd06aa3c83d757d7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usize::from(cell.row) \u003C= row \u0026\u0026 row \u003C usize::from(cell.row) \u002B usize::from(cell.row_span)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/stored_plain_row_frame.rs, src/renderer/typeset/table/continuation/fragment/stored_frame_budget.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":"src/renderer/layout/table_layout/stored_plain_row_frame.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8526fe4e6cfe60572fb1fa0af41630c61d8d34681b0ba444d9bb071de463fd1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usize::from(cell.row) == row \u0026\u0026 cell.row_span == 1 \u0026\u0026 self.stored_plain_text_cell_frame(table, cell)\u0060 appears character-identically in 2 files \u2014 src/renderer/layout/table_layout/stored_ordinary_row_frame.rs, src/renderer/layout/table_layout/stored_plain_row_frame.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":"src/renderer/layout/table_layout/stored_ordinary_row_frame.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b141f89ef2cbc5819774aafb41fff089d6981708583e8daed3c29fc7beaa00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.at \u003E= h.from - EPS \u0026\u0026 v.at \u003C= h.to \u002B EPS \u0026\u0026 h.at \u003E= v.from - EPS \u0026\u0026 h.at \u003C= v.to \u002B EPS\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db16d079a19f1ef5d200d1827c05f3ceb7f7846ba2bba97d81cd0ab07264ff5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060valid_rect(outer) \u0026\u0026 valid_rect(inner) \u0026\u0026 inner.x \u003E= outer.x - 0.5 \u0026\u0026 inner.y \u003E= outer.y - 0.5 \u0026\u0026 inner.x \u002B inner.width \u003C= outer.x \u002B outer.w\u2026\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/recognition.rs, tools/pdf-ir-poc/src/recognition.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":"src/parser/pdf/recognition.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"996fbe374780e093d8d32fbb024a6e07030e49106a172a93bb80e80fb7b5dc27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_empty() || value.starts_with(\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 src/cli/batch/mod.rs, src/cli/commands/batch_fill.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":"src/cli/batch/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ef6152b5dc32d681ad1326ca137eb0e4ba1da9577ca2418209e05882b12ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_finite() \u0026\u0026 value.abs() \u003C= f64::from(f32::MAX)\u0060 appears character-identically in 2 files \u2014 src/paint/paint_op.rs, src/renderer/skia/glyph_replay.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":"src/paint/paint_op.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c8ff362267fa4c3bcb2fcfc841831e9141320c5a450edf550a3e0c01a0ee4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width == 0 || height == 0 || u64::from(width).checked_mul(u64::from(height))\u0060 appears character-identically in 2 files \u2014 src/paint/metafile_masks.rs, src/paint/metafile_print/masks.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":"src/paint/metafile_masks.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49add9f853b3d6aaf44d9308ef727c6faa6d88175e0569f678f71c0a0377284"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width == 0 || height == 0 || width \u003E CANVASKIT_MAX_IMAGE_DIMENSION || height \u003E CANVASKIT_MAX_IMAGE_DIMENSION || pixels \u003E CANVASKIT_MAX_IMAGE\u2026\u0060 appears character-identically in 2 files \u2014 src/renderer/image_resolver.rs, src/renderer/skia/image_conv.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":"src/renderer/image_resolver.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d8efb255cfe569520dcfabe9a3e1e62ef813e07147f3f1519e934eca3ee7ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x - prev - width \u003E span.font_size * 0.2 \u0026\u0026 !text.ends_with(char::is_whitespace) \u0026\u0026 !ch.is_whitespace()\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/structured_lowering.rs, tools/pdf-ir-poc/src/structured_lowering.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":"src/parser/pdf/structured_lowering.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d24bdf37076a72b5974089b063015c06eaf7fa6e568be193113658a5f1fe62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060xs.len() \u003C 2 || ys.len() \u003C 2 || (!allow_linear \u0026\u0026 (xs.len() \u003C 3 || ys.len() \u003C 3))\u0060 appears character-identically in 2 files \u2014 src/parser/pdf/table_detection.rs, tools/pdf-ir-poc/src/table_detection.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":"src/parser/pdf/table_detection.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ebfa4cad54b8b33cfb8a846bdbddb1b282760a80699802549eb5594298cd9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060xx\u003E=0\u0026\u0026yy\u003E=0\u0026\u0026xx\u003Cfull.width\u0026\u0026yy\u003Cfull.height\u0060 appears character-identically in 2 files \u2014 mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs, mydocs/pr/assets/seo_rii_20261030/consumer_probe.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":"mydocs/pr/assets/issue_536_seo_rii_20261021/consumer_probe.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"882babf6e08f3512c611a11fae8cece60b2b321c257306157e790c3a12196f69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060z.start_row \u003C= cell.row \u0026\u0026 cell.row \u003C= z.end_row \u0026\u0026 z.start_col \u003C= cell.col \u0026\u0026 cell.col \u003C= z.end_col \u0026\u0026 bf_has_diagonal(z.border_fill_id)\u0060 appears character-identically in 2 files \u2014 src/document_core/commands/document.rs, src/renderer/composer/reflow_helpers.inc.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":"src/document_core/commands/document.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea924f5d7e5210983dfceb0335387cc0f376cde54d7b5466e9d1e1f7612f1314"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets \u003CNullable\u003Eenable\u003C/Nullable\u003E for it: a file is enabled only by its own \u0060#nullable enable\u0060, by a Unity \u0060csc.rsp\u0060 with \u0060-nullable:enable\u0060 for its assembly, or as a file-based app (\u0060#:\u0060 directives) whose \u0060#:property Nullable\u0060 does not turn it off. NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060text\u0060 (in \u0060ensure_qt_accessibility_factory\u0060) returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/Native/examples/native_accessibility.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d690f7bd610d636e7a74aa6246d23d314783604a38dfa4cf064ffc2e5e9a7fbf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060truncate_head\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/runner.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbdbe206c58fb37e52ef27200a8fdc8437b4d67ded5ac8ff5b239c36d75b44f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060find_bin\u0060 swallows every exception into \u0060return \u0027rhwp\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/runner.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce4959d1bc4e534aa8a5161146b13cf0b2c369418a3f6819b991079c14d2df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decode_cli_stdout\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/core/runner.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"42213f0790d574f154a7dd8c5ad7f68b76122d5e477223e0de1daeb92953fd7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060truncate_head\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadc63009c014fab396d7d69138f8fc4cf00c74918a5b3c83dae83cd8dea05e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_timeout\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc13a39e8bac5f6aa2a15aee0076a52d44ca2c7f8261f0e074bd98fbe189ea0a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_limit\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b807090b284232c4f6476f9ecc515c2e29303dd9dc27a3c178174eee745c91c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060select_pairs\u0060 returns \u0060[]\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/differential.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d9ab47a9f0210340d8d647c07c38bf6cf2241efe81b58dd42331f2ac09cc12"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_limit\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7ea2c0f9c6e079f3dbbff42b463936b2a68e37de8bbffdc5654725149988ad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_timeout\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecaa615960728b4bb963f78d14a20e123985605c785fa02657089abb365c8f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_workers\u0060 returns \u00601\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36776f4ed9330f3820dd8b231f3e0bcb81a95f5c6a4e8b4325f00bbc090ff47"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_mutants_per_sample_hint\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/fuzz_corpus.py"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b309ebf226ee8b34919be551f53f525d0084ebe81adbcc5c9c3a76caf849898"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060truncate_head\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_diff.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"779245a33791e9354c0deae3035b24aae33ff9e1ce44e8b919437fece8eb8d1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_timeout\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/release_diff.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c932ec63f98ae66e0d732ab6ccd76b981508547b13e83a34aecbfe1262e88"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_limit\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/robustness.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d03e849919fac475fbfcdb24b5b47a3e78142d8bcd1ea224676d20e320b6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalize_timeout\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/robustness.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b62d0f71d404f352e8751e68be313c90d5106651f97b61bf32705edfc75048"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060truncate_head\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gym/tools/trajectory.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2e1b217f3bca2f5991a1d70d9331ebf5eadaa235a2c5d20bad09092bde884b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060provenance_map\u0060 returns \u0060{}\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/gen_agent_codex.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d1fbb2f61cdbb2777ba7a7accd8d45629cd4f56c47fb76b0b1962f65b6dc58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060hangul_version\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hangul_rotation_oracle/oracle.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"227632d8687032bfc6daf8a94ad223c6b0b03a15a5871b16fce879c741d220d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060hwpx_lastsaveby\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwp_generator_probe.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6d222a74654d30facc416898cfef757b29866169042eeb00852b85377a81f9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060hwp5_generator\u0060 returns \u0060\u0027(olefile \uBBF8\uC124\uCE58)\u0027\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwp_generator_probe.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784afffd0d772b61a100f04f5fd1a0ccd4dd929fd641570bfa3b0f3d32da332"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060stored_oracle_status\u0060 returns \u0060\u0027INVALID_ORACLE\u0027\u0060 when \u0060(OSError, json.JSONDecodeError, AttributeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwpctrl_compat/run_gate.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cbde1b27b435d84aff996b157d4552fdc7427a4a2f3042851e6e50a29ade2c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060validate_rhwp_output\u0060 returns \u0060\u0027INVALID_OUTPUT\u0027\u0060 when \u0060(OSError, json.JSONDecodeError, AttributeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/hwpctrl_compat/run_gate.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a2e5d301480db7f113bf96fc5878d0b25ebd861b21bba2385e1f84eb835a26"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060git_head\u0060 swallows every exception into \u0060return \u0027?\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/object_visual_regression.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48709fd5d0921295cfa04aae4a295efbfeefd60aeb69ab1b0660fd119945995"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060pick_oracles\u0060 returns \u0060[]\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle_page_count/regenerate.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30aada62a677842da556bd0a3ccb35acc8e764fa05e05fdce30f355113ef58f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_git\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/scale_ladder_real.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d393c879a8b40bf114c77041ea5bb2f0b60bf75ff68dc408fe2e0c2b6f857e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060git_head\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_hangul_pages.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd02df7b06e192cf653b9a71b59da10b879028c3a865e690dc8cb1d878f62e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060git_head\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_pi_page_roundtrip.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a42438772ce9ef979635e5f7c18927a92f9f9d8d29ce680b58670eab154b60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060git_head\u0060 swallows every exception into \u0060return \u0027?\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/verify_pi_page_vs_hangul.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b3b8a9472817ba64e353638ddc9c78109fa2c270e9fa8d5370f3e32e4d18e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_field_info_at_by_path\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022inField\u0022:false}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/queries/field_query.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bbf5ca414aaefef0a5ea22030cd90fff2290e48307297811733ae6caa1d04a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolved_len\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/mod.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2f701585d75ef2325186af9dd56c6445913efb96aeeb0e6aadcd4e7276e003"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_external_image_references\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":4526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d220ac15c791f1ec531537f375385142611dea16406e8506d38133fef6aac0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_external_image_basenames\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":4547}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ebc5a389d589060fcf1299b1913257662e9683e4465fa6780b4417c2b1850f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_field_info_at_by_path_api\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022inField\u0022:false}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":6513}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaa36e9da83b4effa0779578118a5639e25e42d2433b61ebd7ccf1fc2ec9b5a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rename_field_api\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022ok\u0022:false,\u0022renamed\u0022:0}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/wasm_api.rs"},"region":{"startLine":7180}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e25709c8aaadf2a0a08f817e98c1a2f4428c8c39737fe0dc8825aec0864811"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_css_dimension_pt\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc78c480dcb743b4e2bdba7cbb25596fcd88f1c3465b9e4831d678355547241"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_single_dimension_pt\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document_core/helpers.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c81614f0787f1d6c3e2d4e0dbfa92552cd8efa80290463619055687f3e89e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_picture_transparency_attr\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/section.rs"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"55951ee6a5c1c17331a5bf3d72a678a1d5677f5eaa33f77ccaa56779a9d4dc1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_u8\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb6351343c1578858b59a2e96d7a84a9a05dc0135558cbe2e44763f697040bb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_i8\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e89fe07a752ca963a71256f573f98415fdee4a125645517ef1ef8c32e0c7b7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_u16\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"79feea33d85e109bb450182ee549a09e6f918b4fc5b096c8b18177729efb405e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_i16\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68fb6380ab18af4395b77b2747d3e624fd0073d993e2d24ba3721d3a313e243"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_u32\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b180ebd56b589a1553783adfd568f8335ff166bce2a6c61506775e9370554ce0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_i32\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/hwpx/utils.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6bbf73b6695ce0e14490ecd8e6697b7482df373768e1968cf455d3ac435f7c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060env_font_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/font_paths.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be64b6360d0a82cd62b58901684d3260deb6ea2bc1ccfd5c364207746dfab6b4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060svg_text_font_usage\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/renderer/svg_fragment.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbc417f7477dfcf14c32f2a815bfc80a49a113de8381e4a38784c1b241d23fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060convert_cmyk_buffer\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/color/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f57a13f76814b965d91878f4ad64f735adff8dd79c442d1ee79a77d1467c592"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060convert_gray_buffer\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/color/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dc8e68d829a108f8f5665804b11f8fe0591f4d780fcbffa75fca5fadb03645"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_widget_spans\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/document.rs"},"region":{"startLine":9873}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae94a841fb9bb4451a0aacaf0c4412f2638bb85752ad5b09d40f5b20594cddf2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060running_head_foot_line_bboxes\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/document.rs"},"region":{"startLine":23125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e25bbc5b4a8eeaa5bbdd8458ecbc36240bb43e18aefd89f1b0afc0ffda3b22"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_images_filtered\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/document.rs"},"region":{"startLine":23640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7fcb0ff9e6af0151ab3c17907b5f13f3426ae5eed01c6b8b323503680a9e33"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060take\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/extractors/warnings.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15d1dec3a302cbe6caf7e8559ebdc71bf958ee4390d2d09cf36ee0ea723bfdd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_inline_image_invocations\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/form_xobject_finder.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"87257abf918b3eea9177238d0dd1fb86b53c2a9f200de90164ca7224761bae9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_form_xobject_invocations\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/form_xobject_finder.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"733008a029464fe1430773ac0ece1eb14d9eb759f18bca62a7226a50c08e722b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rasterize_form_and_inline_regions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/form_xobject_finder.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c09865b4deec5b223f21c1a399c6d21a7c11d59f0895aab2fb2c0218a551793"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_music_regions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/music_region_finder.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e751f6fc915addbf2afbab83e32046289ed8035fb5230014e01286c66a0fa2c6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rasterize_music_regions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/music_region_finder.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eec6642e312b3f8ac039949333ae21dcea3a490909eefc90ab018df48af72b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_horizontal_rules\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/pdf_to_ir.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04647893b54f82c85a37419b3fc4654dbe1b02992a65e403e761fbcdc782e81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_page_images\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/converters/pdf_to_ir.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"785386b03d8074b494a66a29489effc1ad21bcec924ebc8b861c3b6bafa29660"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cbom_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/crypto/cbom.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc539f796bc07eabf2999845c7a843ea37478dbc806c4d01b9f42473ce6015"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_article_threads\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/rhwp-pdf-import-backend/src/structure/article_threads.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed55944a9a4c4087b3abec4ecea3c3a3c43082998d49621adbd2d7b14d09722"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getParaText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/e2e/helpers.mjs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"a122269579d77efcbe4a0c0db39f9d5c22d0b15cab561332818cd6eb8d086b0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060IsEmpty\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"78202ec5937f941b88881fb78889ba451291482078f31edd6c36535064ac37cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060PageCount\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b6559be9f3456b0f5e46631aa4a06b8ed945049584fe44c5af07c4fe07df60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060#fields\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f005a807c968918201cc98e332832c5209ced8d845ea5131044b5f7acb3a66ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060#fieldValue\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/hwpctrl-ocx/src/index.mjs"},"region":{"startLine":3669}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c24a5bad8a546d1fc7d9adb4632746ed393d8d609868569518fca88215d5d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060probeLocal\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-desk/ui/js/main.js"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb83196c629b2a5c8f3f146413dca71355751997c523e264fdfd6d7f8901d78"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getSecurityEvents\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-shared/security/security-log.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"803af3c8c13b12fbe2d53914f3b47356c6e455a33b6bb947a8b99c8d34982798"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getStorageKind\u0060 swallows every exception into \u0060return \u0027none\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/local-fonts.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"f562eb38a8f3b81278284aedaf82dd8a8caaafb602100f28a5c76eafa406b7f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060documentFontPreferences\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/document-font-preferences.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"526809901fd4fafaf0ce361ad72fa3f8733b4d66c4bf1cdac74ac6220a7c80ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060navigateLink\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/link-navigation.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d830ce38641ae8a8ab610005409096e6bc32692b961f149dd09a77582b8f1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getControlTextPositions\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd967acb05451efb5dc36dee5ac053d5ba2aabcda93f278597d211b55cf89f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getBookmarks\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/wasm-bridge.ts"},"region":{"startLine":4138}}}],"partialFingerprints":{"codehealthFindingId/v1":"482e8caf41af40f8ba7a4fbc6936e05d427b50b65eff09044b45c6e4d1e04991"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060heapSuffix\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/core/subsecond-runtime.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e66850c333135a7e9f60996f573e711900ebcbbd43c536a9ffa4ebac06edc8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getFlowImagePaintOps\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/view/page-renderer.ts"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe83a0b6aa493373dc9254f997cf3c75d251cb73bf35dd5c6c8b0214c69a0ec3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060overwrittenTextAt\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"64345ea638619d96fef413b0197ceb00f34d8e19e5983a518a46c059b43f12e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTextAt\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler-text.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e128eca2874bdca9c0557b7f405771009e9a7b3d6bc1c2de37eafe99bf0023b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060measureGuideTextWidth\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4019}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad39f68c0dbb4e9b1b5bee17ee36e2c84b13fa02b219cd83995b1cb10148e312"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bodyTableRectsInRange\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":4326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7984ee8b3bec3afd04d2a10d58decbbe7cfa31a0131af328f2b0c2935232f937"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getCurrentStyleId\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/engine/input-handler.ts"},"region":{"startLine":6293}}}],"partialFingerprints":{"codehealthFindingId/v1":"142fe902eeccfd2df33562fbaa222499f507b50627b9c33e6c350ccb7c5302e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getRecentChars\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rhwp-studio/src/ui/symbols-dialog.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a2045a09cfe0b58645a279c6f23844c0966cafb21ed21a2afb11b3f746558"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060observedRssBytes\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/font_metric_coverage_supervisor.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61504c603c1eaa431edd220262c8bd1bcbcc455c5bebb6c39656e317eb1514c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gitHead\u0060 swallows every exception into \u0060return \u0027\uD655\uC778 \uBD88\uAC00\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/survey_korea_downloads_font_jsdelivr.mjs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"747d4e49fca714bf5cfac0f26489e65897ab6002d2e306d25286d31f16dfd03d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060svg.starts_with(\u0022\u003Csvg\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060svg.starts_with(\u0022\u003Csvg\u0022)\u0060 also satisfies \u0060svg.contains(\u0022\u003Csvg\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":"tests/issue_1949_giant_cell_render_perf.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"235e9f73ddd22fac4429ecbd88235a0a9eb7b39ce1240bf26b9c6bfda7567863"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_bug_hunter_skill_contract.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f8546c82223e6209dbd948e2b7009950819a98eb4334ae882a29613ed9bec6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uB2E4\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uB2E4\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_chief_skill_contract.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea41a2b9f2890965511e9000c11d34db1601c9201b83b33fbaf9d872de4f9113"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022\uC790\uAE30 \uC9C1\uB82C\uD654\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022\uC790\uAE30 \uC9C1\uB82C\uD654\u0022)\u0060 also satisfies \u0060text.contains(\u0022\uC790\uAE30\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":"tests/cases/agent_cli_save_contract.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"136f580cda899910669f780761f7c4f0cf6be9b5c5e811798283570b372b41d7"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022\uC790\uAE30 round\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022\uC790\uAE30 round\u0022)\u0060 also satisfies \u0060text.contains(\u0022\uC790\uAE30\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":"tests/cases/agent_cli_save_contract.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac111b2a54f26b3fdc0750bb9d9cbbc8a784af2b26a16f7bdc608f23869d9b9"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060dict.contains(\u0022\u00A72-2\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060dict.contains(\u0022\u00A72-2\u0022)\u0060 also satisfies \u0060dict.contains(\u00222-2\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":"tests/cases/agent_codex_skill_contract.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d50d080c7a6f1426cefbf8704c533bf27b27d9f1840f41996db3068c534bf87"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5318\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5318\u0022)\u0060 also satisfies \u0060text.contains(\u00225318\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":"tests/cases/agent_codex_skill_contract.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad762b5ef58a3a872708f17a53e18b20d3cad8f9513eea426b03b9185e3abc"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5322\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5322\u0022)\u0060 also satisfies \u0060text.contains(\u00225322\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":"tests/cases/agent_contributor_skill_contract.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5618d43059b86dc0f929f463fe50450bb97bf1aafdd1b56094cf344c8df36342"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022export-text \uBB34\uC81C\uD55C\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022export-text \uBB34\uC81C\uD55C\u0022)\u0060 also satisfies \u0060text.contains(\u0022\uBB34\uC81C\uD55C\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":"tests/cases/agent_doc_triage_anti_dump.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3218dcb70bd771bbb77f0187f63fb665c6bd2039d847681d2057725687ff87"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC5C6\uC74C\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC5C6\uC74C\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_doc_triage_intent_matrix.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"346b821275a1e5c816b74b0ab6066484116366fa3aa199078656d56d3f3e2654"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_doc_triage_skill_contract.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbfb07af3fa7bb92d13f5106cc2182187972717e920916b17a62ff41b988517"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_fde_skill_contract.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f2908d2cb317c5bc720a04d18a9d45b55c1daa1263f87dbddffb09f8abf410"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_fidelity_compare_skill_contract.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ca2850e6400d2e32aeba7bcf035fcd22d854f8b0d91c43467bb9d6eba90d8a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_form_fill_skill_contract.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"93be369cf9047934b811033f5ef773acb8eeebd78ea73346d34669c928b8c761"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5339\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5339\u0022)\u0060 also satisfies \u0060text.contains(\u00225339\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":"tests/cases/agent_handoff_skill_contract.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd34fe4588d8df5ca9d647973c47f934e6de4f0d266813950f756a756ccb42d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_knowledge_map_skill_contract.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1223dbc546f9e2c538bd8fe0849d5b1be016a1eaef45f7d3ca244f25699ddf07"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5295\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5295\u0022)\u0060 also satisfies \u0060text.contains(\u00225295\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":"tests/cases/agent_provenance_skill_contract.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4540d3767d3cbbcae05b71039e7e5f7aabc6bfffa74e940235b4d66d9dccd0"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_recipes_skill_contract.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4c7b9df64b3bdb02e4f982f693d3a6b738f00a4f4155d67f5e3ea77f65a92e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022findings[].raw\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022findings[].raw\u0022)\u0060 also satisfies \u0060text.contains(\u0022raw\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":"tests/cases/agent_security_sweep_no_raw.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d158c013bb6392dfb434a0ce105d872e932ac3f9b09e2d3b12a29328c9c6376f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5335\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5335\u0022)\u0060 also satisfies \u0060text.contains(\u00225335\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":"tests/cases/agent_strategist_skill_contract.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"476100f5537818610357da512bb8c0b281e5a15d50c26f528ce58d5c9f667e21"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022gym \uC774 \uC544\uB2C8\uACE0\u0022)\u0060 also satisfies \u0060text.contains(\u0022gym\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":"tests/cases/agent_visual_regression_skill_contract.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e978bc0ba3af24c8be496aaaba81661c6ba67aed4186bc14e61dcbf24bb21eea"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022#5308\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022#5308\u0022)\u0060 also satisfies \u0060text.contains(\u00225308\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":"tests/cases/agent_work_receipt_skill_contract.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6132dc236c6e1d16a9c656b3ce3603765e3099b9379d891e7f13672aac141b9"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060summary.contains(\u0022overlap: 0\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060summary.contains(\u0022text-overlap: 0\u0022)\u0060 also satisfies \u0060summary.contains(\u0022overlap: 0\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cases/issue_6299_same_vpos_seg_is_one_row.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4220fcab6034888349af995d5b2f205ae51b9e9717d48d42a01151cbe0ece3ac"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060css_lower.contains(\u0022text-decoration: line-through\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060css_lower.contains(\u0022text-decoration: line-through\u0022)\u0060 also satisfies \u0060css_lower.contains(\u0022line-through\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":"src/document_core/commands/html_import/inline_content.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f19f16217a479fa9f9f9c89b5b28f4486308e1cc9df20f681f393a9298003"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060d.contains(\u0022connection\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060d.contains(\u0022connection\u0022)\u0060 also satisfies \u0060d.contains(\u0022connect\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":"rhwp-desk/src/planner.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12e5c2fd6ce5aecf1a26fabefb363bd63be74a9269a9f137ff39c3b1d361b1f"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-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"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":49,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}